Quiz on Algorithms and Pseudocode

What is an algorithm?

• A coding language used to create software

• A series of steps to solve a problem or perform an action

• A visual diagram that represents data

• A type of loop in programming

Which of the following best defines pseudocode?

• A high-level programming language

• A diagram that represents inputs and outputs

• A simplified, non-language-specific way of writing algorithms

• A graphical tool used to debug code

In a flowchart, what does a “process” symbol represent?

• An action that takes place

• A decision point

• An input or output

• A connection to another flowchart

Which of these is an example of a decision structure in pseudocode?

• FOR x = 1 TO 10

• IF Age is equal to 15 THEN Clap

• cost = miles * 0.3

• PRINT “Hello World”

In a binary search, what must be true about the list being searched?

• It must be unordered

• It must be sorted

• It must contain only positive numbers

• It must have an even number of items

What is a dry run in debugging?

• Running a program to see if it crashes

• Manually stepping through an algorithm with sample data

• Using test cases to check a program's output

• Repeating a program to confirm performance speed

Which of the following best describes a trace table?

• A record of every user input in a program

• A table used to track variable values to check accuracy

• A list of possible outputs for a given algorithm

• A method to sort data in an algorithm

If a program asks for two numbers and an operation symbol (like +, -, *, or /) and outputs a calculation, what kind of operation is this?

• Conditional operation

• Looping operation

• Arithmetic operation

• Logical operation

What is the primary difference between linear search and binary search?

• Linear search checks each element sequentially, while binary search divides the array into halves.

• Linear search requires a sorted array, while binary search does not.

• Binary search is slower than linear search for large datasets.

• Linear search uses a divide and conquer approach, while binary search does not.

Which statement is true about linear search and binary search?

• Linear search requires the list to be sorted; binary search does not

• Linear search compares each item in the list; binary search repeatedly divides the list

• Binary search can only be used on lists of numbers

• Linear search is faster than binary search in all cases