AMCAT Basic Data Structures 2

Question 1

Which operation on a singly linked list has O(n) time complexity in the worst case?

Accepted Answer

Accessing an element by index

Answer

Inserting at the head

Answer

Deleting the head node

Answer

Checking if the list is empty

Question 2

What is the maximum number of elements that can be stored in a 2D array declared as int a[4][5]?

Accepted Answer

20

Answer

9

Answer

25

Answer

16

Question 3

In a doubly linked list, each node contains:

Accepted Answer

Data and two pointers (next and previous)

Answer

Only data and one pointer

Answer

Only two pointers

Answer

Data and a key-value pair

Question 4

Which data structure uses a LIFO (Last In, First Out) access pattern?

Accepted Answer

Stack

Answer

Queue

Answer

Deque

Answer

Priority Queue

Question 5

What is the time complexity for inserting an element at the beginning of a dynamic array (ArrayList)?

Accepted Answer

O(n)

Answer

O(1)

Answer

O(log n)

Answer

O(n²)

Question 6

Which of the following is NOT a linear data structure?

Accepted Answer

Binary Tree

Answer

Array

Answer

Linked List

Answer

Queue

Question 7

In a circular linked list, the last node's next pointer points to:

Accepted Answer

The head node

Answer

NULL

Answer

Itself

Answer

The second node