Quiz on Algorithms and Data Structures

What is the formal definition of an algorithm?

• A finite set of instructions to accomplish a task

• An infinite loop of instructions

• A collection of data types

• A sequence of random steps

Which of the following is NOT a criterion for algorithms?

• Effectiveness

• Randomness

• Output

• Input

What does the term 'recursion' refer to in algorithms?

• A method of sorting data

• A function that calls itself

• A type of data structure

• A way to analyze algorithms

In the context of algorithms, what does 'time complexity' refer to?

• The time taken to compile the code

• The time taken for an algorithm to run

• The number of lines of code

• The amount of memory used

Which of the following is a characteristic of a max heap?

• The largest element is at the root

• It is a linear data structure

• The smallest element is at the root

• Elements are stored in random order

What is the worst-case time complexity of the bubble sort algorithm?

• O(n)

• O(log n)

• O(n log n)

• O(n^2)

Which algorithm is used to find the smallest element in an unsorted array?

• Bubble Sort

• Insertion Sort

• Selection Sort

• Merge Sort

What is the purpose of the 'Adjust' algorithm in heaps?

• To balance the tree

• To insert a new element

• To delete the maximum element

• To sort the heap

In which method are comments indicated by '//'?

• Natural language

• Flowchart

• Recursive algorithms

• Pseudo-code

What is the average-case analysis in algorithm performance?

• The average running time over all inputs

• The slowest possible run time

• The time taken for the worst input

• The fastest possible run time