Free AMCAT Basic Data Structures Questions and Answers 1

Question 1

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

Accepted Answer

O(1)

Answer

O(n)

Answer

O(log n)

Answer

O(n^2)

Question 2

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

Accepted Answer

Stack

Answer

Queue

Answer

Array

Answer

Linked List

Question 3

In a standard queue, where are new elements added?

Accepted Answer

At the rear

Answer

At the front

Answer

In the middle

Answer

At any position

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

Elements can only be integers.

Answer

It is not possible to implement.

Answer

Accessing elements is very slow.

Question 5

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

Accepted Answer

Pop

Answer

Push

Answer

Enqueue

Answer

Dequeue

Question 6

A circular queue is an improvement over a linear queue because it:

Accepted Answer

Utilizes the empty space in the array more efficiently.

Answer

Can store more elements in total.

Answer

Allows faster access to elements.

Answer

Is easier to implement.

Question 7

If the elements 'A', 'B', 'C', and 'D' are placed in a stack in that order, what will be the order of elements when they are popped?

Accepted Answer

D, C, B, A

Answer

A, B, C, D

Answer

A, C, B, D

Answer

B, C, D, A