Unit Test II

Which of the following is NOT an attribute of algorithms?

• Correctness

• Ambiguity

• Finiteness

• Efficiency

What is the time complexity of linear search?

• O(log n)

• O(n²)

• O(1)

• O(n)

Which sorting algorithm is the fastest for large datasets?

• Selection Sort

• Bubble Sort

• Merge Sort

• Insertion Sort

What is the primary disadvantage of Bubble Sort?

• Only works with sorted arrays

• Complex implementation

• Requires additional memory

• Inefficient for large datasets

Which of the following is a stable sorting algorithm?

• Heap Sort

• Selection Sort

• Merge Sort

• Quick Sort

In a 2D array, the address of A[i][j] is calculated using:

• Base + (i + j) × size

• Base + (j x num_rows + i) × size

• Base + (i x num_cols + j) × size

• Base + (i x j) × size

Which type of memory allocation is used for arrays?

• Dynamic Memory Allocation

• Static Memory Allocation

• None of the above

• Both DMA and SMA

What is a sparse matrix?

• A matrix with many zero elements

• A matrix with all elements equal

• A matrix with random elements

• A matrix with no zero elements

Which of the following is NOT a data structure?

• Queue

• Array

• Algorithm

• Stack

In hashing, what is a collision?

• Two elements having the same key

• Two elements having the same value

• When data is lost

• None of the above