Subject question bank

Data Structure Questions for Exams

Prepare for semester exams using important questions, numericals, viva questions and unit-wise questions.

Your university

Open Data Structure for your university, course and semester

U1 Introduction to Data Structure U2 Array and Linked Lists U3 Searching and Sorting U4 Graphs and Trees U5 Stacks and Queues
U

Unit-wise questions

Unit 1

Introduction to Data Structure

Open unit →
  1. Data Structure, its need and its types
  2. Primitive and Non-Primitive Data Structure
  3. What is Data Types? Built-in and Derived Types with Examples
  4. What is an Algorithm? Explain its Criteria and Characteristics.
  5. Understand Efficiency of Algorithm with the help of Examples
  6. Space and Time Complexity of An Algorithm
  7. How to Determine the Complexity of an Algorithm with Example
  8. Asymptotic Notations: Big Oh, Big Theta and Big Omega Notation
Unit 2

Array and Linked Lists

Open unit →
  1. Array: Definition, Types, Explanation, and Examples
  2. One Dimensional and Multidimensional Array with Example
  3. Row major order in Data Structure with Example
  4. Column Major Order: Definition, Formula, Examples, Benefits
  5. Index formula derivation for 1-D, 2-D, 3-D and n-D Array
  6. Matrix Multiplication Algorithm and Program
  7. Addressing Formula of the (i,j)th Element of an m*n Matrix in Column-Major Order
  8. Consider the linear arrays AAA[5:50],BBB[-5:10] and CCC[1:8] a. Find the number of elements in each array.
Unit 3

Searching and Sorting

Open unit →
  1. Searching in Data Structure and Its types
  2. Linear search in Data structure with Algorithm and Program
  3. Binary Search Algorithm in Data Structure with Explanation
  4. Binary search tree in data structure
  5. Binary search tree operations with Program
  6. Hashing in data structure with its types
  7. Advantage and Disadvantage of Hashing over other Searching Techniques
  8. Collision in Hashing and Collision Resolution Technique
Unit 4

Graphs and Trees

Open unit →
  1. Graph and types of graph in Data Structure
  2. Graph representation in data structure
  3. Graph Traversal Technique in Data Structure
  4. Breadth First Search (BFS) Traversal in Data Structure
  5. Depth First Search(DFS) Traversal in Data Structure
  6. Difference between BFS and DFS Graph Traversal
  7. Spanning tree and Minimum Spanning tree with example
  8. Prim’s Algorithm Explanation with Example
Unit 5

Stacks and Queues

Open unit →
  1. Stack in Data Structure with its Application and Example
  2. Implement Stack using Singly linked list
  3. Push and Pop Operation in Stack: Algorithm and Program
  4. Stack Implementation using Array Program
  5. Infix, Prefix and Postfix Expression with example
  6. Algorithm to evaluate an infix expression
  7. Algorithm to evaluate a postfix expression
  8. Algorithm to evaluate a prefix expression