UNIT-1: Introduction to Linear Data Structures:
| Q. no | Question Description |
|---|---|
| 1 | Define Data structure? Elaborate different types of data structures with suitable examples. |
| 2 | What is meant by ADT? Explain it with an example? List different types of operations performed on ADT? |
| 3 | Discuss different types of Asymptotic Notations with suitable examples. |
| 4 | Define time and space complexity of an algorithm with an example. |
| 5 | Perform selection sort on the following list of elements 40, 80, 35, 90, 45, 50, 70, 15, 12, 9, 1, 14. |
| 6 | After two passes of a sorting algorithm, the array becomes: 3, 47, 66, 32, 56, 92. Identify the algorithm. |
| 7 | Write recursive and non-recursive algorithm to search an element using binary search. |
| 8 | Develop a C program to implement List ADT using arrays. |
| 9 | Perform Bubble sort and write pseudocode. |
| 10 | Arrange elements using Insertion Sort. |
| 11 | What is binary search? Differentiate between linear and binary search. |
Comments
Post a Comment