Q1. Which data structure is used for function call management?
- A. Queue
- B. Stack ✓
- C. Tree
- D. Graph
Explanation: Call stack uses LIFO stack semantics.
Topic: Stacks
Data Structures MCQs
Sample multiple-choice questions for Data Structures (C-CAT Section B). Answers and short explanations are shown for study. The complete practice bank stays inside the app.
Sample questions
Q2. Maximum nodes in a binary tree of height h (root height 0) is:
- A. 2^h
- B. 2^(h+1) - 1 ✓
- C. 2h + 1
- D. h^2
Explanation: Full binary tree: 2^(h+1) - 1 nodes.
Topic: Trees
Related notes
- Introduction to Data Structures; Arrays — Static Data Structure
- Problem Solving, Abstraction and Algorithm Correctness
- Linked Lists
- Complexity, Asymptotic Bounds and Recurrences
- Stack; Stack Applications
- Arrays, Dynamic Arrays and Searching
- Queue; Circular Queue
- Stacks, Expression Processing and Call Frames
- Priority Queue and Deque; Trees — Introduction; Binary Tree
- Queues, Circular Queues, Deques and Priority Queues
- Binary Search Tree (BST); Tree Traversals; AVL Trees
- Singly, Doubly and Circular Linked Lists
- Heap and Heap Sort; Graph — Introduction; Graph Representations
- Recursion, Activation Records and Backtracking Foundations
- Graph Traversals; Shortest Path Algorithms; Minimum Spanning Tree
- Trees, Binary Trees, Traversals and Heaps
- Hashing and Hash Tables; Sorting Algorithms
- Binary Search Trees, Deletion and AVL Balancing
- Searching Algorithms; Algorithm Complexity Analysis
- Elementary Sorting: Bubble, Selection and Insertion
- Efficient Sorting: Merge, Quick and Heap Sort
- Hash Functions, Collisions, Probing and Deletion
- Graph Representation, BFS, DFS and Connectivity
- Shortest Paths, Minimum Spanning Trees and Union-Find
- Algorithm Design: Greedy, Dynamic Programming and Search
Practice more Data Structures
Continue in the practice app for larger sets and timed modes.