Arrays and Linked Lists - Exam Prep Problem Set

Arrays and Linked Lists - Implementations in Python - Problem Set

Q. In a queue, which operation is performed to remove an element?

Solution

The operation to remove an element from a queue is called Dequeue, following the FIFO (First In, First Out) principle.

Correct Answer: D — Dequeue

Q. In a stack, which operation is used to remove the top element?

Solution

The operation used to remove the top element from a stack is called 'Pop'.

Correct Answer: D — Pop

Q. What is the time complexity of accessing an element in an array by index?

Solution

Accessing an element in an array by index is O(1) because it requires a constant amount of time regardless of the size of the array.

Correct Answer: C — O(1)

Q. Which of the following is NOT a type of sorting algorithm?

Solution

Stack Sort is not a recognized sorting algorithm; the others are well-known sorting techniques.

Correct Answer: D — Stack Sort

Showing 1 to 4 of 4 (1 Pages)