ICC Data Structures and Algorithms 2

Question 1

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

Accepted Answer

Stack

Answer

A stack follows LIFO, meaning the last element added is the first one removed.

Question 2

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

Accepted Answer

O(1)

Answer

Array elements are stored in contiguous memory, so index-based access is O(1) (constant time).

Question 3

In a singly linked list, each node contains:

Accepted Answer

Data and a pointer to the next node

Answer

A singly linked list node stores data and a single pointer to the next node in the sequence.

Question 4

Which operation removes and returns the front element of a queue?

Accepted Answer

Dequeue

Answer

Dequeue removes and returns the element at the front of the queue, following FIFO order.

Question 5

What is the worst-case time complexity of searching for an element in an unsorted array?

Accepted Answer

O(n)

Answer

In the worst case, you must examine every element before finding the target or confirming its absence.

(ICC) International Code Council Practice Test