Data structure MCQ test | MCQ test and answers on Data structure

Q: Which data structure stores the elements in LIFO (last in first out) principle?

Stack. In a stack, the last element inserted inside is the first one to be removed.

Q: Which data structure stores the elements in FIFO (first in first out) principle?

Queue. A queue is a data structure in which the first element entered from one end is the first one to be removed from the other end.

Q: In which data structure, the data elements are connected through a series of nodes, and, each node contains the data item and address to the next node?

Linked list. A linked list is a series of connected nodes. Each node stores the data and the address of the next node.

Q: Which type of data structure has the last element connected to the first element?

Circular Queue. A Circular Queue is a DS where the last element of the queue is connected to the first element of the queue forming a circle.

Q: Breadth-first search and Depth-first search traversal techniques are applicable on

Graphs. BFS and DFS are techniques, used to traverse graphs.

Q: Pre-order, In-order, and Post-order traversal techniques are applicable on

Tree. Pre-order, In-order, and Post-order are tree traversal techniques.

A format for storing data in a structured manner is called Data structure. The data structure is broadly classified into linear and Non-linear data structure.

This article comprises multiple choice questions and answers on Data structure. This self-evaluation test has 11 multiple-choice questions on Data structure, intended to prepare a person for technical interviews and the campus selection process.

MCQ questions and answers on Data structure

Topic- Data structure

The test consists of 11 questions.

No negative marking for this test.

No Time limit

The pass percentage is 70%

The correct answer with a description will be displayed after the answer has been marked.

Submit the test to calculate your score once you are done with all the questions.

Complexity Level- Easy

Q1: Which data structure stores the elements in LIFO (last in first out) principle?

Queue

Stack

Linked list

Array

Q2: Which data structure stores the elements in FIFO (first in first out) principle?

Select the correct answer:

Queue

Stack

Array

Tree

Q3: In which data structure, the data elements are connected through a series of nodes, and, each node contains the data item and address to the next node?

Linked List

Queue

Stack

Tree

Q5: Which type of data structure has the last element connected to the first element?

Queue

Graph

Tree

Circular Queue

Q6: Which of the following statements is true for the AVL tree?

An AVL tree is a data structure that allows for two-way data access such that each node in the list points to the next node in the list and also points back to its previous node.

AVL tree compares two adjacent elements and swaps them until they are sorted.

The AVL tree compares the heights of the left and right subtrees and ensures that the difference is less than one.

Q7: In a singly linked list, the transversal is possible in both directions, forward and backward

True

False

Q8: Breadth-first search and Depth-first search traversal techniques are applicable on _______

Tree

Graph

Circular Linked-list

Q9: Pre-order, In-order, and Post-order traversal techniques are applicable on _______

Tree

Graph

Linked-list

Q 10: The enqueue operation on a queue will __________

Remove an element from the front end of the queue.

Add an element to the rear end of the queue.

Check if the queue is empty.

Q11: In a binary tree, each parent has a maximum of ______

One child

Two child

Unlimited child

Quantitative aptitude - practice tests

A series of aptitude practice tests comprising multiple-choice questions (MCQ) on varied aptitude topics that evaluate the quantitative ability.

FIRST NAME:
LAST NAME:
CITY:
BACKGROUND:
INTERESTED IN:
FEEDBACK: