Computer Science Medium

Data Structures

Practice Data Structures MCQs as part of Computer Science.

21 MCQs
Medium difficulty

Questions in this Topic

Which data structure follows the Last In First Out (LIFO) principle?
Medium
Which data structure follows the First In First Out (FIFO) principle?
Medium
An array stores elements:
Easy
A data structure consisting of nodes connected by edges, with no cycles, is called a:
Medium
What is a linked list made up of?
Medium
Which data structure uses key-value pairs for storage?
Medium
What is the time complexity of accessing an element in an array by index?
Hard
A binary tree is a tree in which each node has at most:
Medium
Which operation adds an element to the top of a stack?
Easy
Which operation removes the top element from a stack?
Easy
Which operation adds an element to the rear of a queue?
Easy
What happens when you try to pop an element from an empty stack?
Medium
What is the topmost node of a tree called?
Easy
In a tree, a node that has no children is called a:
Easy
Which traversal of a Binary Search Tree (BST) visits the nodes in sorted (ascending) or...
Hard
In which type of linked list does each node store pointers to both the previous and the...
Medium
What is the time complexity of inserting a new node at the beginning of a singly linked...
Medium
Which data structure does a program use internally to manage function calls and return ...
Medium
In a min-heap, the root node always contains:
Hard
A graph is made up of:
Medium
In a hash table, what is a collision?
Medium
Topic Info
SubjectComputer Science
TopicData Structures
Total MCQs21
DifficultyMedium
Start Practice