DSA SIMP Questions -23SCHEME
BY TIE REVIEW TEAM
Protip: If time is a constraint, study only 3+1 Questions per module
Average time to be spent per module- 120Mins
Module-1
1. Define Data Strcutures!? Illustrate the different types of DS with a neat diagram,
Summarize the primitive operations that can be performed on data structures
2. Explain Traversing, inserting, deleting, searching, and sorting operations with a
programming example
3. Explain (i)Array of structures (ii) SR Structures with examples
4. Summarize DMA functions with appropriate syntax and examples, also differentiate
between Dynamically allocated arrays and multidimensional arrays
5. Construct an algorithm to transpose a sparse matrix, express the given matrix in
triplets and find its transpose
Module-2
6. Define Stack, summarise the implementation of various operations of Stack(push,
pop, display etc), also check for overflow and underflow conditions
7. Outline the algorithm for Infix to Postfix, Apply the same algorithm to convert the
following infix expression to an equivalent postfix expression- (A+B*C)*((D+E-F)/J)
8. Define recursion, explain the recursive function for implementing Tower of Hanoi
9. Define the steps to evaluate a postfix expression with an example
10. Define queue, enlist the different types of queues, and illustrate a C function to
perform insertion and deletion operations in a Circular queue
11. Write a short note on different types of queues - 20M
Module-3
12. Define linked lists, List out their classification, and Demonstrate a C function to
BY TIE REVIEW TEAM
Protip: If time is a constraint, study only 3+1 Questions per module
Average time to be spent per module- 120Mins
Module-1
1. Define Data Strcutures!? Illustrate the different types of DS with a neat diagram,
Summarize the primitive operations that can be performed on data structures
2. Explain Traversing, inserting, deleting, searching, and sorting operations with a
programming example
3. Explain (i)Array of structures (ii) SR Structures with examples
4. Summarize DMA functions with appropriate syntax and examples, also differentiate
between Dynamically allocated arrays and multidimensional arrays
5. Construct an algorithm to transpose a sparse matrix, express the given matrix in
triplets and find its transpose
Module-2
6. Define Stack, summarise the implementation of various operations of Stack(push,
pop, display etc), also check for overflow and underflow conditions
7. Outline the algorithm for Infix to Postfix, Apply the same algorithm to convert the
following infix expression to an equivalent postfix expression- (A+B*C)*((D+E-F)/J)
8. Define recursion, explain the recursive function for implementing Tower of Hanoi
9. Define the steps to evaluate a postfix expression with an example
10. Define queue, enlist the different types of queues, and illustrate a C function to
perform insertion and deletion operations in a Circular queue
11. Write a short note on different types of queues - 20M
Module-3
12. Define linked lists, List out their classification, and Demonstrate a C function to
