DS unit-wise important questions

DATA STRUCTURES WITH C++

UNIT-I

4m questions(short type):

1) Define data structure

2) What is an ADT

3) Define algorithm, steps and characteristics

4) Define 1-D, 2-D and n-D arrays

5) Pros and cons of arrays

6) Briefly write about Stack ADT

7) Write how to convert infix to postfix expression

15m questions(essay):

1) Explain various types of data structures

2) Explain in detail analysis of algorithms

3) Algorithm design tools(pseudocode & flowchart)

4) Explain about string manipulation using arrays

5) Define stack. Explain different operations performed on stack

6) Describe in brief applications of stack

7) Pseudocode notations

UNIT-II

Short type:

1) Write in brief about recursion and its advantages

2) Write an algorithm on fibonacci series and factorial of given number

3) Iteration vs recursion

4) Define queue, circular queue and deque

5) Define Queue ADT

6) Define linked list, DLL and CLL

7) Advantages and disadvantages of linked list

8) Advantages of DLL over SLL

9) Write about header node in detail

10) New and delete operator in dynamic memory management

Essay type:

1) Variants of recursion (or) various types of recursion

2) Discuss recursive algorithm for tower of Hanoi's problem

3) What is queue. Discuss different operations on queue

4) Define linked list. Discuss different operations on linked list

5) Define DLL. Discuss different operations on doubly linked list

6) Define Circular linked list(CLL) and its types

UNIT-III

Short type:

1) Define tree, binary tree and complete binary tree

2) Define graph with example

3) All terms in trees and graphs

4) Define spanning tree and minimum spanning tree

5) Define hashing with example

6) Describe binary tree ADT and its properties

7) Define graph ADT

Essay type:

1) Representation of trees (array implementation & linked implementation)

2) Explain in detail tree traversal techniques

3) Applications of binary trees

4) Representation of graphs

5) Graph traversal techniques(DFS & BFS)

6) Spanning tree techniques(prims & kruskals)

7) Hash functions

8) Collision resolution strategies

UNIT-IV

Short type:

1) Define searching. List out various searching techniques

2) Difference between linear search & binary search

3) Define sorting. What is the need for sorting

4) Write the time complexities of various sorting algorithms

Essay type:

1) What is searching? Explain in brief various types of searching

2) All sorting techniques with definition, explaination, example and program

• Bubble sort
• Insertion sort
• Selection sort
• Quick sort
• Merge sort
• Heap sort