What is an algorithm?
  • Patterns and trends used to solve a problem
  • A set of step-by-step instructions to resolve a problem
  • A programming language
What are algorithms used for?
  • To plan out the solution to a problem
  • As a platform to program a solution
  • To test a solution to a problem
Which of these is NOT an algorithm?
  • Following recipe instructions
  • Working out how an engine works
  • Tying your shoelaces
  • Making a cup of coffee
When can an algorithm be used?
  • Only with computers
  • For programming
  • To design a solution to any problem
What is decomposition?
  • Searches the computer's memory for data
  • Repeats a program
  • Getting small part of a problem and adding them together
  • Breaking down a complex problem
What is abstraction?
  • Removal of certain details, keeping relevant the information
  • Stores data in a program for retrieval
  • Freedom from representing art
  • Detects errors while program is running
If it is AFTER 7am, what do you need to do?
cs-2 sb-1-Algorithmsimg_no 3.jpg
  • Take the bus
  • Take the subway
  • Check the time
  • Leave home
What should be considered when designing an algorithm?
  • If there is more than one way to solve the problem
  • If the correct hardware is being used
  • If the correct software is being used
You are at the yellow arrow, pointing in the direction indicated. How would you move to fill in the 2 black squares?
cs-2 sb-1-Algorithmsimg_no 4.jpg
  • Straight, Turn right, Straight x 1, Fill Square, Straight x 2, Turn left, Straight x 1, Fill Square
  • Straight x 2, Turn right, Straight x 1, Fill Square, Straight x 2, Turn left, Straight x 1, Fill Square
  • Straight x 2, Turn right, Straight x 1, Fill Square, Straight x 2, Turn right, Straight x 1, Fill Square
  • Straight x 2, Turn right, Straight x 1, Fill Square, Straight x 2, Turn left, Straight x 2, Fill Square
How can an algorithm be represented?
  • As a flowchart only
  • As pseudocode only
  • As a flowchart or pseudocode
What is a flowchart?
  • A diagram that represents a set of instructions
  • A high-level language that has specific syntax
  • A way of describing a set of instructions that doesn’t use specific syntax
What is the correct symbol for a process instruction in a flowchart?
  • A rectangle
  • A parallelogram
  • A square
What is the correct symbol for an input in a flowchart?
  • A parallelogram
  • A rectangle
  • A square
What links each instruction in a flowchart?
  • A line
  • A double line
  • An arrow
What is the correct symbol for a decision in a flowchart?
  • A rectangle
  • A diamond
  • A square
What is the correct symbol for an output in a flowchart?
  • A parallelogram
  • A rectangle
  • A diamond
Algorithms are 1 of the 4 techniques of Computational Thinking
  • True
  • False
You are at the yellow arrow, pointing in the direction indicated. How would you move to fill in the 2 black squares?
cs-2 sb-1-Algorithmsimg_no 98.jpg
  • Straight, Turn right, Straight x 1, Fill Square, Straight x 2, Turn left, Straight x 1, Fill Square
  • Straight x 2, Turn right, Straight x 1, Fill Square, Straight x 2, Turn left, Straight x 1, Fill Square
  • Straight x 2, Turn right, Straight x 1, Fill Square, Straight x 2, Turn right, Straight x 1, Fill Square
  • Straight x 2, Turn right, Straight x 1, Fill Square, Straight x 2, Turn left, Straight x 2, Fill Square
Algorithms are infinite
  • True
  • False
Algorithms are
  • Coding language for computers
  • a series of steps and instructions
  • programming robots
What is finite?
  • it has an ending
  • it is precise
  • lasts forever
What is precise?
  • it is exact
  • it lasts forever
  • it has mistakes
an algorithm can be used for problem solving
  • true
  • false
Programming is
cs-2 sb-1-Algorithmsimg_no 99.jpg
  • To plan daily the week activity
  • To give instructions to a computer to be executed.
  • To give recommendations to a computer to be executed.
When developing algorithms, the given instructions must be
cs-2 sb-1-Algorithmsimg_no 100.jpg
  • Truly specific
  • General
  • Approximated
  • Ramdon
What is a sequence
  • Putting and executing instructions in order.
  • A pattern of numbers.
  • Instructions which a computer follows.
  • A line of code
Which is the easiest set of instructions to follow?
  • Draw a house.
  • Draw a house with 4 windows, a door, chimney and a path.
  • Draw a house with windows and a drive.
  • Draw a square, with 4 squares inside.
If an algorithm is complicated it is easy to follow?
  • TRUE
  • FALSE
Why is this not a sequence? Start carPut in keyTurn keyDrive away
  • There are spelling mistakes
  • The instructions are in the correct order
  • The instructions are in the wrong order
  • It is a sequence
An organized set of rules or steps to perform an action, is also known as...
  • Scratch
  • Software
  • Algorithm
  • Block
StartPut your hand on the doorknobTurn the doorknob to the side until it unlocks the doorPush or pull  the door to open itEnd..................................................What would be an appropiate title for this algorithm?
  • How to push a door
  • Steps to stand infront of a door
  • Steps to touch a doorknob
  • How to open a door
An Algorithm, should be easy to follow (clear). That means it should be...
  • Doable
  • Understandable
  • Finite
  • Precise
An Algorithm, should have a beginning and an end. That means it should be...
  • Doable
  • Understandable
  • Finite
  • Precise
Choose the option that better completes the statement."Algorithms are useful to help us...
  • write a tv show without pen and paper
  • perform any activity.
  • understand how to build a rocket in a full moon in mars when you are a unicorn
  • digest our food
A cooking recipe is a clear example of an Algorithm.
  • True
  • False
What is an Algorithm?
  • A chart showing the flow of a series of events
  • Step-by-step instructions used to solve a problem
  • A decision arrived at by following instructions
  • A computer program that follows a chart
Programming languages give computers instructions
  • True
  • False
What algorithm do we use when we're building a wardrobe?
  • A set of directions
  • A recipe
  • A list of instructions
What algorithm do we use when we're making a cake?
  • A set of directions
  • A recipe
  • A list of instructions
When you write an algorithm the order of the instructions is very important.
  • True
  • False
What should be considered when designing an algorithm?
  • If the correct hardware is being used
  • If the correct software is being used
  • If there is more than one way of solving the problem
When can algorithms be used?
  • Only with computers
  • Only when programming
  • Only with flowcharts
  • Any time to design solutions to problems
An algorithm ...
  • ... illustrates some steps, in no particular order, and following no logical reasoning
  • ... illustrates a series steps in a particular order, following logical reasoning
  • ... illustrates some random shapes in a flowchart but in a set order
  • ... illustrates series of decisions needed to bake a cake
What is the correct definition of an algorithm?
  • An algorithm is a step by step instructions to solve a problem.
  • An algorithm is a process of baking bread.
  • An algorithm is a software used to compute numbers.
  • An algorithm is the process of breaking problems.
An Algorithm has 4 main characteristics. It should be....
  • Doable, Creative, finite and precise
  • Doable, Understandable, finite and precise
  • Amazing, Understandable, finite and precise
  • Doable, Understandable, Infinite and precise
Any user should be able to perform an Algorithm without any problems, that means it should be....
  • Doable
  • Understandable
  • Infinite
  • Precise
If an Algorithm is performed correctly should always give same result, that means it should be....
  • Doable
  • Understandable
  • Finite
  • Precise
Algorithms have ________ main characteristics.
  • 3
  • 6
  • 4
  • 5
Decomposition is a term used to define...
  • The process of assigning value to a variable.
  • The process of taking out unnecessary details from problems.
  • The process of breaking down problems into smaller problems.
  • The process of coding a problem.
Abstraction is.....
  • The process of drawing abstract pictures.
  • The process of assigning values to variables.
  • The process of breaking down problems.
  • The process of removing unnecessary details from a problem.
What is Problem Solving?
  • The process that computer follow when solving problems that require a computer solution
  • The process that programmers follow when solving problems that require a computer solution
What is the missing part of this Algorithm: Input - Process - ?
  • Sequence
  • Output
  • Abstract
  • Iteration
When doing a flow chart, rectangles represent
  • Inputs
  • Conditions
  • Actions
  • Start and end point
What' s a sensor?
cs-2 sb-1-Algorithmsimg_no 442.jpg
  • It' s a component that receives information from the environment
  • It' s a component that sends information to the environment
  • It' s a truly sensitive component
  • It' s a component able to feel your emotions.
Programming is
cs-2 sb-1-Algorithmsimg_no 443.jpg
  • To plan daily the week activity
  • To give instructions to a computer to be executed.
  • To give recommendations to a computer to be executed.
When developing algorithms, the given instructions must be
cs-2 sb-1-Algorithmsimg_no 444.jpg
  • Truly specific
  • General
  • Approximated
  • Ramdon
We commonly use a flow chart previously to
cs-2 sb-1-Algorithmsimg_no 445.jpg
  • Better comprehend the program process
  • To have a whole vision about how the program will run
  • To draw a scheme about the program befor writing the code
  • All answers are correct
The components we connect to the board can be either
  • digital or analogue
  • analogue or catalogue
  • catalogue or digital
  • just digital
A buzzer (zumbador) is a ____________ component
cs-2 sb-1-Algorithmsimg_no 446.jpg
  • Digital
  • Analogue
Furthermore, when selecting components to develop the programming, we must choose both sensors and actuators. True or false
  • False
  • True
Sensors are
  • Like human brain
  • Like human limbs
  • Like human sensors
Actuators are
  • Like human senses
  • Like human brain
  • Like human limbs
Digital components respond to binary code (0-1)
  • False
  • True
Light sensor is a good example for __________ component
  • digital
  • analogue
  • mixed
A light sensor shows less resistance according to the received light intensity. Thus the higher light intensity, the lower LDR resistance will be
  • True
  • False
  • Not always
  • It depends on the light intensity value
Analogue components read values oscillate from
  • 100-1123
  • 100-1023
  • 0-800
  • 0-1023
Bitbloq LDR component (light sensor) can read values from
  • 10-810
  • 10-800
  • 0-800
  • 0-1023
If it is AFTER 7am, what do you need to do?
cs-2 sb-1-Algorithmsimg_no 544.jpg
  • Take the bus
  • Take the subway
  • Check the time
  • Leave home
You are at the yellow arrow, pointing in the direction indicated. How would you move to fill in the 2 black squares?
cs-2 sb-1-Algorithmsimg_no 545.jpg
  • Straight, Turn right, Straight x 1, Fill Square, Straight x 2, Turn left, Straight x 1, Fill Square
  • Straight x 2, Turn right, Straight x 1, Fill Square, Straight x 2, Turn left, Straight x 1, Fill Square
  • Straight x 2, Turn right, Straight x 1, Fill Square, Straight x 2, Turn right, Straight x 1, Fill Square
  • Straight x 2, Turn right, Straight x 1, Fill Square, Straight x 2, Turn left, Straight x 2, Fill Square
Which flowchart symbol represents a decision?
  • Circle
  • Triangle
  • Diamond
  • Rectangle
Which flowchart symbol represents an input or output?
  • Square
  • Rectangle
  • Pentagon
  • Diamond
What symbol is used to represent the direction of the flow?
  • A Line
  • An Arrow
  • A square
What are the 2 main ways an algorithm can be represented?
  • Hardware and Software
  • Flowcharts and Pseudocode
  • Charts and Diagrams
What is sequencing?
  • Small steps making up larger tasks
  • When a task is repeated until there is a required outcome
  • A question is asked and one of two courses of action happen
  • The order in which tasks are to be carried out
What is selection?
  • Small steps making up larger tasks
  • When a task is repeated until there is a required outcome
  • A question is asked and one of two courses of action happen
  • The order in which tasks are to be carried out
What is Iteration?
  • Small steps making up larger tasks
  • When a task is repeated until there is a required outcome
  • A question is asked and one of two courses of action happen
  • The order in which tasks are to be carried out
Which of the following best describes pseudo code?
  • A diagram that shows the flow of a program.
  • The code used to solve a problem with all of the correct syntax.
  • A written design of a program without worrying about the syntax.
An algorithm asks a user to enter their age, the system reads this and then outputs a 'Thank You' message.This is an example of which of the algorithm constructs?
  • Decision (Selection)
  • Loop (Iteration)
  • Order (Sequence)
An Algorithm asks the user to enter their gender (M or F) and prints out a different comment depending on what they entered.This is an example of which of the algorithm constructs?
  • Decision (Selection)
  • Loop (Iteration)
  • Order (Sequence)
What are the three basic constructs that make up algorithms?
  • Iteration, Composition, and Looping
  • CPU, ALU, and Control Unit
  • Flowcharts, code and pseudo code
  • Sequence, Decision, and Repetition
It is important to be _______ when creating an algorithm.
cs-2 sb-1-Algorithmsimg_no 596.jpg
  • precise
  • musical
  • kind
What is an algorithm?
cs-2 sb-1-Algorithmsimg_no 594.jpg
  • A pattern
  • A set of step-by-step instructions
  • A song
To make a computer work, algorithms have to be turned into ____.
  • stories
  • sentences
  • pictures
  • code
Adil wrote code to control a toy robot. Adil was ___________ the computer to move round the room.
cs-2 sb-1-Algorithmsimg_no 595.jpg
  • Programming
  • Shaping
  • Colouring
  • Drawing
From the start position if I code the following where will I land? FORWARD -FORWARD-TURN LEFT-FORWARD
cs-2 sb-1-Algorithmsimg_no 597.jpg
  • Treasure chest
  • Parrot
  • Flag
  • Hat
Identify the correct definition for 'algorithm'
  • A problem
  • A solution to a problem
  • The steps that are taken to solve a problem
  • The words to enter when typing
What does a searching algorithm do?
  • Search through a set of data
  • Save a set of data
  • Help to organise data
Identify the search algorithm 
  • Random search 
  • Binary search 
  • Denary search 
  • Next Item search 
 Identify the description of a linear search 
  • Put the elements in order, check each item in turn 
  • Put the elements in order, compare to the middle value, split the list in order and repeat 
  • Elements do not need to be in order, check each item in turn 
  • Elements do not need to be in order, compare to the middle value, split the list in order and repeat 
 Identify the description of a binary search 
  • Put the elements in order, check each item in turn 
  • Put the elements in order, compare to the middle value, split the list in order and repeat 
  • Elements do not need to be in order, check each item in turn 
  • Elements do not need to be in order, compare to the middle value, split the list in order and repeat 
What is a binary search?
  • Each item is checked in order
  • The list is split into 2 and compared
  • The first 2 values are compared and moved
  • Nothing happens
Which of the following are sorting algorithms?
  • Binary, linear
  • Numerical, phonetic
  • Bubble, merge
  • File, alphabetical
Which of the following is not a sorting algorithm?
  • Bubble
  • Insertion
  • Binary
  • Merge
Which sorting algorithm splits a list of items into individual lists?
  • Merge
  • Bubble
  • Binary
  • None of them do
What is a Merge Sort?
  • An algorithm to search unordered data
  • An algorithm to search ordered data
  • A method of sorting data by dividing a list into two sub-lists and then repeating the process until all elements are in order.
  • A method of sorting data by inserting each element into the correct order.
Describe a disadvantage of a linear search algorithm
  • Data does not need to be in order.
  • Performs well over large ordered lists.
  • Can only work on an ordered list.  If unordered must use a linear search.
  • Slow with large data sets.
Describe an advantage of a linear search algorithm
  • Data does not need to be in order.
  • Performs well over large ordered lists.
  • Can only work on an ordered list.  If unordered must use a linear search.
  • Slow with large data sets.
Describe a disadvantage of a binary search algorithm
  • Data does not need to be in order.
  • Performs well over large ordered lists.
  • Can only work on an ordered list.  If unordered must use a linear search.
  • Slow with large data sets.
Which sorting algorithm is described by moving through a list repeatedly, swapping elements that are in the wrong order?
  • Merge
  • Bubble
  • Insertion
  • None of the above
Which type of search algorithm is this?
cs-2 sb-1-Algorithmsimg_no 664.jpg
  • Binary
  • Linear
Which type of search algorithm is this?
cs-2 sb-1-Algorithmsimg_no 665.jpg
  • Binary
  • Linear
Which type of sort algorithm is this?
cs-2 sb-1-Algorithmsimg_no 666.jpg
  • Bubble
  • Merge
  • Insertion
The following list is to be sorted using a bubble sort:12  6  8  1  3What will the list look like after the first iteration through the list?
  • 6  8  1  3  12
  • 6 12  1  8   3
  • 1  3  6  8  12
  • 6  8  1  12  3
A binary search is to be performed on the list:3  5  9  10  23How many comparisons would it take to find number 9?
  • 0-1
  • 2-3
  • 4-5
  • I can't find the number 9
What is pseudocode?
  • Simplified programming language, that is not a specific language
  • Complicated programming language
  • Simple programming language, which is linked to a specific language
  • A type of cheese
What flowchart symbol does this represent?
cs-2 sb-1-Algorithmsimg_no 695.jpg
  • Input/Output
  • Start/End
  • Decision
  • Process
What is this symbol?
cs-2 sb-1-Algorithmsimg_no 696.jpg
  • Decision
  • Input/Output
  • Start/End
  • Process
What does this pseudocode do?print "Hello"
  • Nothing
  • Prints the word "Hello" to the output
  • hello is print in pseudocode
  • The code won't work
Abstraction is the representation of real world problems in a computer
  • True
  • False
A linear search is when a list is split into 2 and compared?
  • True
  • False
Bubble sort takes the first two values of a list, and swaps them if wrong?
  • True
  • False
Merge Sort is?
  • When a list is kept as one and compared
  • List is split into 2 and merged together
  • List is split into 2 and kept seperate
  • Nothing
An Insertion sort builds the final list two items at a time 
  • True
  • False
What does this shape represent in flowchart?
cs-2 sb-1-Algorithmsimg_no 697.jpg
  • Start/Stop
  • Decision
  • Process
  • Input/Output
The process carried out in computer systems is represented by _______________ in flowchart.
  • Rectangle
  • parallelogram 
  • Square
  • Diamond
Computers can solve any problem that can be computationally solved.
  • TRUE
  • FALSE
Identify the search algorithm
  • Random search
  • Binary search
  • Denary search
  • Next Item search
Identify the description of a linear search
  • Put the elements in order, check each item in turn
  • Put the elements in order, compare to the middle value, split the list in order and repeat
  • Elements do not need to be in order, check each item in turn
  • Elements do not need to be in order, compare to the middle value, split the list in order and repeat
Identify the description of a binary search
  • Put the elements in order, check each item in turn
  • Put the elements in order, compare to the middle value, split the list in order and repeat
  • Elements do not need to be in order, check each item in turn
  • Elements do not need to be in order, compare to the middle value, split the list in order and repeat
Define the term computational thinking
  • Using a computer
  • Developing an algorithm to solve a problem
  • Making a computer use artificial intelligence
  • Google is computational thinking
Which of the following is not a component of computational thinking?
  • Abstraction
  • Typing
  • Decomposition
  • Algorithmic thinking
Define the term abstraction within computational thinking
  • Adding together numbers
  • Taking a real world problem and designing a computer program that exactly replicates every part of that problem in the computer
  • Performing multiple calculations on a list of variables
  • Representing real world problems in a computer program, using symbols and removing unnecessary elements
Identify which statement describes algorithmic thinking
  • Thinking like a computer
  • Writing binary numbers
  • Identifying the steps involved in solving a problem
  • Identifying what problems need to be solved
A linear search is to be performed on the list above.How many comparisons would it take to find the number 1?
cs-2 sb-1-Algorithmsimg_no 698.jpg
  • 1
  • 2
  • 3
  • 4
A binary search is to be performed on the list above.How many comparisons would it take to find the number 9?
cs-2 sb-1-Algorithmsimg_no 699.jpg
  • 0-1
  • 2-3
  • 4-5
  • It can't find the number 9
A binary search is to be performed on the list above.How many comparisons would it take to the find the number 101?
cs-2 sb-1-Algorithmsimg_no 700.jpg
  • 0-1
  • 1-2
  • 3-4
  • 4-5
Identify the search performed by the above algorithm
cs-2 sb-1-Algorithmsimg_no 701.jpg
  • Linear
  • Binary
  • Both linear and binary
  • Neither, it does not work
Which sorting algorithm is described by: moving through a list repeatedly, swapping elements that are in the wrong order.
  • Merge
  • Bubble
  • Insertion
  • None of the above
Which sorting algorithm is described by: split a list into individual lists, then combine these, two lists at a time.
  • Merge
  • Bubble
  • Insertion
  • None of the above
Which sorting algorithm is described by: take each item in turn, compare it to the items in the sorted list and place it in the ordered position in the sorted list.
  • Merge
  • Bubble
  • Insertion
  • None of the above
What is the first action in an insertion sort?
  • Make a new list
  • Mark the first item as the ordered list
  • Compare the first and second elements
  • Put the first element in the correct place
The two lists above are to be merged, which element first goes into the new merged list
cs-2 sb-1-Algorithmsimg_no 707.jpg
  • 0
  • 1
  • 2
  • 3
Which sorting algorithm needs to go through the list repeatedly?
  • Merge
  • Bubble
  • Insertion
  • None of them do
Which sorting algorithm splits a list of items into individual lists.
  • Merge
  • Bubble
  • Insertion
  • None of them do
Which sorting algorithm takes an item from the list, and puts it in the correct place in a sorted list?
  • Merge
  • Bubble
  • Insertion
  • None of them do
Identify the purpose of the above flowchart symbol
cs-2 sb-1-Algorithmsimg_no 708.jpg
  • Input/Output
  • Output
  • Start/Stop
  • Decision
Identify the purpose of the above flowchart symbol
cs-2 sb-1-Algorithmsimg_no 709.jpg
  • Process
  • Input/Output
  • Sub-process
  • Decision
Identify the purpose of the above flowchart symbol
cs-2 sb-1-Algorithmsimg_no 710.jpg
  • Process
  • Input/Output
  • Sub-process
  • Decision
How many arrows should come out of a decision symbol in a flowchart?
  • 0
  • 1
  • 2
  • 3
What is an Algorithm
  • A program
  • Step by step instructions to achieve a given task
  • It is a computer language
  • It is computer hardware
An instruction or a command in a flowchart is called
  • An Input
  • An Output
  • A Process
A logical step-by-step process for solving a problem is called
  • Algorithms
  • Coding
  • Binary Numbers
  • Hexadecimal
Which option is a searching algorithm
  • Bubble
  • Linear
  • Merge
A diagram that represents a set of instructions is called:
  • Computers
  • Shapes
  • Pseudocode
  • Flow Chart
Which option is a SEARCHING algorithm?
  • Quick
  • Binary
  • Bubble
  • Insertion
This diagram is which algorithm
cs-2 sb-1-Algorithmsimg_no 889.jpg
  • Bubble
  • Linear
  • Merge
  • Quick sort
Would you class the Bubble Sorting algorithm, fast or slow for a large Array of data?
  • Fast
  • Slow
Binary search only works on....
  • An UNSORTED Array
  • A SORTED array
Why do we need algorithms?
  • To tell the mouse and keyboard what to do
  • To achieve a given task
  • To use computational thinking
  • None of these reasons!
0:0:1



Answered

Not Answered

Not Visited
Correct : 0
Incorrect : 0