Question 1

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

Accepted Answer

Stack. A Stack is a linear data structure where the last element added is the first one to be removed. This principle is commonly used in function calls and undo mechanisms in software. It supports two primary operations known as push and pop.

Question 2

In a database, which data structure is primarily used to speed up data retrieval operations through indexing?

Accepted Answer

B-Tree. B-Trees are balanced tree data structures that maintain sorted data and allow for efficient searches and insertions. They are the standard structure for implementing indexes in most relational database management systems. Their design minimizes disk I/O operations by keeping the tree height low.

Question 3

Which of the following is a non-linear data structure used to represent hierarchical relationships?

Accepted Answer

Tree. A Tree consists of nodes connected by edges, starting from a single root node. It is ideal for representing folder structures in operating systems or organizational charts. Binary trees are a specific type where each node has at most two children.

Question 4

Which data structure follows the FIFO (First-In-First-Out) principle?

Accepted Answer

Queue. In a Queue, the element that is added first is the one that gets processed or removed first. This is similar to a real-world waiting line at a ticket counter. It is widely used in CPU scheduling and asynchronous data transfer.

Question 5

What is the primary advantage of using a Linked List over a standard Array?

Accepted Answer

Dynamic memory allocation. Linked Lists allow for the size of the data structure to grow or shrink during runtime without moving existing elements. Unlike arrays, elements in a linked list are not stored in contiguous memory locations. Each node contains a data field and a reference to the next node.

Data Structures — Set 1