Algorithms Quiz

What is pseudocode?

• Pseudocode is a physical device used for coding

• Pseudocode is a type of code used in video games

• Pseudocode is a high-level description of a computer program or algorithm.

• Pseudocode is a programming language

Explain the concept of flowchart in algorithm design.

• Flowchart is a type of computer virus.

• Flowchart is a type of graph used in mathematics.

• Flowchart is a type of musical notation.

• Flowchart in algorithm design is a visual representation of the steps involved in solving a problem, showing the sequence of actions and decisions to be made.

Compare and contrast bubble sort and quicksort algorithms.

• Bubble sort is more efficient than quicksort

• Bubble sort and quicksort are not sorting algorithms

• Bubble sort and quicksort have the same time complexity

• Bubble sort is less efficient than quicksort in terms of time complexity. Bubble sort has a worst-case time complexity of O(n^2), while quicksort has an average-case time complexity of O(n log n).

Describe the binary search algorithm.

• Binary search is a linear search algorithm that compares each element of the array with the target value

• Binary search is a divide and conquer algorithm that finds the position of a target value within a sorted array. It compares the target value to the middle element of the array and eliminates half of the remaining elements each time based on the comparison.

• Binary search is a recursive algorithm that always starts searching from the beginning of the array

• Binary search is an algorithm that only works on unsorted arrays

What is the purpose of algorithm complexity analysis?

• To calculate the number of bugs in the code

• To determine the color of the algorithm

• To confuse programmers

• To understand how the runtime or space requirements of an algorithm scale with input size.

How do you calculate the time complexity of an algorithm?

• Checking the author's reputation

• Counting the total lines of code

• Analyzing the number of operations based on input size and expressing growth rate in Big O notation.

• Measuring the physical size of the algorithm

Create a trace table for the selection sort algorithm with the input array [5, 2, 9, 3, 7].

• [5, 2, 3, 7, 9]

• [5, 2, 9, 7, 3]

• [2, 3, 5, 7, 9]

• [2, 5, 3, 7, 9]

Discuss the advantages and disadvantages of insertion sort.

• Stable

• Time complexity of O(n log n)

• Advantages: Efficient for small datasets, simple implementation, uses little additional memory. Disadvantages: Not suitable for large datasets, time complexity of O(n^2), not stable.

• Suitable for large datasets

Explain the concept of space complexity in algorithms.

• Space complexity measures the physical size of the input data

• Space complexity in algorithms refers to the amount of memory space required by an algorithm to solve a problem as a function of the input size. It is a measure of how efficiently memory is used by the algorithm.

• Space complexity is the number of lines of code in an algorithm

• Space complexity refers to the time taken by an algorithm to solve a problem

Trace the execution of the linear search algorithm on the array [10, 20, 30, 40, 50] to find the element 30.

• The element 30 is not present in the array.

• The element 30 is found at index 4.

• The element 30 is found at index 3.

• The element 30 is found at index 2.