FREE AMCAT Basic Data Structures Questions and Answers

Question 1

What is the time complexity to access an element in an array by its index?

Accepted Answer

O(1)

Answer

Arrays provide direct, random access to elements using their index. The memory location is calculated directly from the base address and the index, which is a constant-time operation regardless of the array's size.

Question 2

Which data structure follows the Last-In, First-Out (LIFO) principle?

Accepted Answer

Stack

Answer

A stack operates like a pile of plates. The last item added (pushed) is the first one to be removed (popped), which defines the LIFO principle.

Question 3

In a standard queue, where are new elements added?

Accepted Answer

At the rear

Answer

A queue follows the First-In, First-Out (FIFO) principle. New elements are enqueued at the rear (or tail) and existing elements are dequeued from the front (or head).

Question 4

What is a potential issue with implementing a queue using a simple, fixed-size array?

Accepted Answer

The queue has a fixed size and can become full.

Answer

When a queue is implemented with a standard array, it has a predefined, fixed capacity. If the number of elements to be enqueued exceeds this capacity, an overflow condition occurs, and no more elements can be added.

Question 5

The operation of removing an element from a stack is called:

Accepted Answer

Pop

Answer

'Push' is the term for adding an element to a stack. 'Pop' is the term for removing the topmost element from the stack, following the LIFO principle.

(AMCAT) Aspiring Minds Computer Adaptive Test Practice Test

(AMCAT) Aspiring Minds Computer Adaptive Test Practice Test

FREE AMCAT Basic Data Structures Questions and Answers