T-Level DBS RCE 4 - Revision No 4

What is an algorithm?

• A) A hardware component in a computer

• B) A step-by-step procedure for solving a problem

• C) A programming language

• D) A type of software application

Which characteristic of an algorithm ensures that it completes after a finite number of steps?

• A) Input

• B) Output

• C) Finiteness

• D) Definiteness

What is the primary purpose of using sorting algorithms?

• A) To search for an element in a dataset

• B) To arrange data in a specific order

• C) To calculate mathematical operations

• D) To manage memory usage

Which of the following is an example of a searching algorithm?

• A) Bubble Sort

• B) Merge Sort

• C) Binary Search

• D) Quick Sort

Which sorting algorithm has an average-case time complexity of O(n log n)?

• A) Bubble Sort

• B) Insertion Sort

• C) Merge Sort

• D) Selection Sort

What is the primary use of a hashing algorithm?

• A) To encrypt data

• B) To compress data

• C) To search data quickly

• D) To sort data

Which of the following is a characteristic of a good algorithm?

• A) To encrypt data

• B) To compress data

• C) To search data quickly

• D) To sort data

What does the "big O" notation describe in algorithms?

• The memory usage

• The input size

• The running time complexity

• The output format

Which algorithmic approach involves breaking a problem down into smaller subproblems?

• Greedy algorithm

• Dynamic programming

• Brute force

• Backtracking

What type of algorithm uses a priority queue?

• Depth-first search

• Breadth-first search

• Dijkstra's algorithm

• Bubble sort