BTEC COMPUTING – UNIT 1 SECTION B - FLOWCHARTS

Slides:



Advertisements
Similar presentations
Towers of Hanoi Move n (4) disks from pole A to pole C such that a disk is never put on a smaller disk A BC ABC.
Advertisements

CSE Lecture 3 – Algorithms I
Analysis of Algorithms
Character and String definitions, algorithms, library functions Characters and Strings.
Sorting and Searching Algorithms Week 11 DSA. Recap etc. Arrays are lists of data 1-D, 2-D etc. Lists associated with searching and sorting Other structures.
C++ for Engineers and Scientists Third Edition
A452 – Programming project – Mark Scheme
PYTHON PROGRAMMING Week 10 – Wednesday. TERMS – CHAPTER 1 Write down definitions for these terms:  Computation  Computability  Computing  Artificial.
Chapter 7: Arrays. In this chapter, you will learn about: One-dimensional arrays Array initialization Declaring and processing two-dimensional arrays.
Chapter Complexity of Algorithms –Time Complexity –Understanding the complexity of Algorithms 1.
Part 2. Searching Arrays Looking for a specific element in an array E.g., whether a certain score (85) is in a list of scores Linear search Binary search.
CS212: DATA STRUCTURES Lecture 10:Hashing 1. Outline 2  Map Abstract Data type  Map Abstract Data type methods  What is hash  Hash tables  Bucket.
Course Web Page Most information about the course (including the syllabus) will be posted on the course wiki:
Information and Computer Sciences University of Hawaii, Manoa
Lecture 12. Searching Algorithms and its analysis 1.
Chapter 3 Sec 3.3 With Question/Answer Animations 1.
Algorithm Evaluation. What’s an algorithm? a clearly specified set of simple instructions to be followed to solve a problem a way of doing something What.
Chapter 11 Arrays Continued
DATA STRUCTURE Presented By: Mahmoud Rafeek Alfarra Using C# MINISTRY OF EDUCATION & HIGHER EDUCATION COLLEGE OF SCIENCE AND TECHNOLOGY KHANYOUNIS- PALESTINE.
DATA STRUCTURE & ALGORITHMS (BCS 1223) CHAPTER 8 : SEARCHING.
Examples using Arrays. Summing Squares Problem: To compute the sum of the squares of N numbers N is given N values are also given These should be read.
Data Structure Introduction.
Sha Tin Methodist College F.4 Computer Studies Pascal Programming.
1 Algorithms CS 202 Epp section ??? Aaron Bloomfield.
Algorithms Java Methods A & AB Object-Oriented Programming and Data Structures Maria Litvin ● Gary Litvin Copyright © 2006 by Maria Litvin, Gary Litvin,
Chapter 5 Ranking with Indexes 1. 2 More Indexing Techniques n Indexing techniques:  Inverted files - best choice for most applications  Suffix trees.
ALGORITHMS.
Chapter 9 Sorting. The efficiency of data handling can often be increased if the data are sorted according to some criteria of order. The first step is.
Higher Computing Science 2016 Prelim Revision. Topics to revise Computational Constructs parameter passing (value and reference, formal and actual) sub-programs/routines,
Lecture 2 What is a computational problem? What is an instance of a problem? What is an algorithm? How to guarantee that an algorithm is correct? What.
Sorting and Searching Bubble Sort Linear Search Binary Search.
Chapter 15 Running Time Analysis. Topics Orders of Magnitude and Big-Oh Notation Running Time Analysis of Algorithms –Counting Statements –Evaluating.
CS 1428 Final Exam Review. Exam Format 200 Total Points – 60 Points Writing Programs – 45 Points Tracing Algorithms and determining results – 20 Points.
Exam practice. Exam 1  Describe how a Boolean expression can control the operation of a loop  Describe the difference between a while loop and for loop.
Programming revision Revision tip: Focus on the things you find difficult first.
7 - Programming 7J, K, L, M, N, O – Handling Data.
Sorts, CompareTo Method and Strings
Sort & Search Algorithms
“<Fill in your definition here.>”
Growth of Functions & Algorithms
Applied Discrete Mathematics Week 2: Functions and Sequences
COP 3503 FALL 2012 Shayan Javed Lecture 15
Towers of Hanoi Move n (4) disks from pole A to pole C
CS 1428 Exam I Review.
Arrays … The Sequel Applications and Extensions
Searching CSCE 121 J. Michael Moore.
CSS161: Fundamentals of Computing
Java for Beginners University Greenwich Computing At School DASCO
Algorithms Chapter 3 With Question/Answer Animations
Algorithm design and Analysis
Advanced Sorting Methods: Shellsort
Starter 15//2 = 7 (Quotient or Floor) (Modulus) 22%3 =1
كلية المجتمع الخرج البرمجة - المستوى الثاني
Chapter 8 Arrays Objectives
Teaching Computing to GCSE
CS 1428 Final Exam Review.
Principles of Computing – UFCFA3-30-1
CS 1428 Final Exam Review.
Lecture 5 Algorithm Analysis
Java for Beginners University Greenwich Computing At School DASCO
Chapter 8 Arrays Objectives
Revision of C++.
Question 1a) What is printed by the following Java program? int s;
Principles of Computing – UFCFA3-30-1
Program: Mini Phone Book 2/11/2016
WJEC GCSE Computer Science
Algorithms.
CS 1428 Exam I Review.
COMPUTING.
Presentation transcript:

BTEC COMPUTING – UNIT 1 SECTION B - FLOWCHARTS SECTION A – COMPUTATIONAL THINKING DECOMPOSITION – PATTERN RECOGNITION – ABSTRACTION – ALGORITHM DESIGN - SECTION C – PROGRAMMING PARADIGMS SECTION C – PROGRAMMING PARADIGMS What is a Variable? What is a Constant? Pseudocode: Lists [arrays] Mathematical Operators Comparison Operators + == - >  * <  / <> or != MOD >= DIV <= ^   Creating A List names = [“Bob”, “Alex”, “Chris”] Getting An Item From A List names[1] this would output Alex Looping Through A List for i in name: output names[i] Length Of A List Output (len(names) Using A Loop To Count The Value Of Items In A List scores = [5, 12, 5, 7, 8] total = 0 for i in scores: total = total + i Data Types: String Integer Float/Real Boolean Casting: Changing the variable from one data type to another. str(3) or int(“3”) Pseudocode: String Handling Length Of A String Getting A Sub String (Part Of The String) Change String To Upper Case Change String To Lower Case Pseudocode: Functions[returns a value] Parameters (values sent for function to use) Name of function Pseudocode: Iteration For Loop [you know how many times you want to loop for i = 1 to 100: output (i) While Loop [based on a condition] count = 0 while count < 100: output(count) count = count + 1 function triple (number) return number*3 end function Pseudocode: Files Call the Function by using its name and send any parameters in brackets. E.g.: y=triple(7) Opening A File myFile = open(“computing.txt”) Reading From A File myFile = openRead(“computing.txt”)   while NOT myFile.endOfFile() print(myFile.readLine()) endwhile myFile.close() Writing To A File myFile = openWrite(“sample.txt”) myFile.writeLine(“Hello World”) Pseudocode: Selection Pseudocode: Basic if entry == "a" then print("You selected A") elseif entry=="b" then print("You selected B")   else print("Unrecognised selection") endif name = input (“What is your name”) output (name)   or joining a string and variable together output (“your name is:” + name)

What is input validation? BTEC COMPUTING – UNIT 1 SECTION C – PROGRAMMING PARADIGMS Quick Sort Bubble Sort Insertion Sort How it operates Advantages Disadvantages How it operates Advantages Disadvantages How it operates Advantages Disadvantages SECTION C – VALIDATION Binary Search Linear Search What is input validation? How it operates Advantages Disadvantages How it operates Advantages Disadvantages Validation technique Used for SECTION C – STACKS AND QUEUES Post Check Actions