AMCAT Data Structures and Algorithms

Question 1

Which data structure operates on a Last In, First Out (LIFO) principle?

Accepted Answer

Stack

Answer

Queue

Answer

Linked List

Answer

Tree

Question 2

What is the worst-case time complexity of Binary Search?

Accepted Answer

O(log n)

Answer

O(1)

Answer

O(n)

Answer

O(n log n)

Question 3

Which traversal of a Binary Search Tree visits nodes in sorted ascending order?

Accepted Answer

In-order

Answer

Pre-order

Answer

Post-order

Answer

Level-order

Question 4

What is the maximum number of nodes in a binary tree of height h?

Accepted Answer

2^(h+1) − 1

Answer

2h

Answer

2h − 1

Answer

2^h − 1

Question 5

Which data structure is best suited for implementing a priority queue?

Accepted Answer

Heap

Answer

Array

Answer

Linked List

Answer

Stack

Question 6

In a singly linked list, what does the last node's 'next' pointer point to?

Accepted Answer

NULL

Answer

The first node

Answer

Itself

Answer

The previous node