SE(COMP):210242: Fundamentals of Data Structures

Sample questions for all units

1. Define and explain the following terms : (i ) Data (ii ) Data structure (iii ) Flowchart.
2. Define algorithms and explain its characteristics.
3. Explain the divide and conquer strategy with suitable example. Comment on its time
complexity.
4. Explain the Asymptotic notation Big O, Omega and Theta with suitable example.
5. Explain static and dynamic data structures with examples.
6. Differentiate between linear and non-linear data structure with example.
7. Explain the Greedy strategy with suitable example. Comment on its time complexity.
8. Define and explain ADT(Abstract Data Type).
9. State Analysis of programming constructs - Linear, Quadratic, Cubic, Logarithmic
10. Define and explain the following terms : (a) Linear data structure
(b) Non-linear data structure
(c) Time complexity
(d) Space complexity

Unit 2:
1. Define & explain the term- i) Sequential Organization. ii) Ordered List
2. Explain polynomial representation using arrays with suitable example
3. Derive address calculation formula for a one-dimensional array with one example.
4. Explain two-dimensional arrays with row and column-major implementation. Explain
address calculation in both cases with examples.
5. What is the sparse matrix? Explain with a suitable example.
6. Explain the fast Transpose of a sparse matrix with a suitable example, Discuss the time
complexity of fast transpose.
7. Write pseudo Python code to perform simple transpose of a sparse matrix. Discuss its time
complexity.
8. Write pseudo Python code to perform polynomial multiplication using an array.
9. Write pseudo Python code for reversing a string and state its time complexity.
1 0. Write pseudo Python code that counts the number of times a given int/data occurs in an
array.
Unit 3:
1. Explain Linear search and binary search with examples. State its time complexity and
compare linear and binary search(time and space complexity.
2. Write an algorithm for searching an element using binary search. Discuss the time
complexity of algorithm in best case and worst case.
3. Write an algorithm for Fibonacci search and find out its time complexity.
4. Explain merge sort algorithm using divide and conquer strategy with an example. State its
time complexity and space complexity.
5. Explain the algorithm of Quick sort with suitable example. Discuss its time complexity and
space complexity.
6. Write short note on stability of sorting. Compare bubble, insertion and selection sort with
one example and discuss time complexity.
7. What is heap ? Explain heap sort with suitable example. State its complexity.
8. Compare Heap sort and Quick sort with one example and discuss time complexity.
9. Explain insertion sort algorithm and sort the given list using insertion sort :
1) List : 7, 4, 10, 6, 3, 12, 1, 8, 2, 15, 9, 5 2
2) List : 55, 85, 45, 11, 34, 05, 89, 99, 67
Discuss its time complexity and space complexity.
10.Explain quick sort and Sort the following numbers using quick sort : State its time
complexity and space complexity.
1) List : 39, 09, 81, 45, 90, 27, 72, 18
2) List : 25, 82, 17, 23, 38, 7, 64, 86, 21
3)List : 15, 08, 20, -4, 16, 02, 01, 12, 21, -2 11.
11.Explain Merge sort. Sort following example using Merge Sort :
1) List : 18, 13, 12, 22, 15, 24, 10, 16, 19, 14, 30.
2) List : 55, 85, 45, 11, 34, 05, 89, 99, 67 Discuss its time and space complexity.
12. Explain shell sort. Sort given list using shell sort. 08, 03, 02, 11, 05, 14, 00, 02, 09, 04, 20.
13.Write pseudo Python code for Bubble sort.
14. Write pseudo Python code to perform shell sort. State its complexity.

Unit 4:
1. Compare Singly, Doubly and Circular Linked List.
2. Explain Generalized Linked List with a suitable example.
3. Explain polynomial representation using linked list with an example.
4. Represent the following using GLL : (p, q(r, s(u, v), w) (x, y))
5. Represent the following polynomial by using-generalized linked list : (a, b (c, d (e, g,), h)
(f))
6. Write a pseudo-C++ code to reverse e singly linked list
7. Write pseudo-C++ code to represent singly linked list as an ADT.
8. Write pseudo-C++ code to represent doubly linked list as an ADT.
9. Write pseudo C++ code to represent a circular linked list as an ADT.
10. Write pseudo C++ code for polynomial addition using singly linked list.
11. Write a pseudo C++ code to delete an intermediate node from singly linked list.
12. Write an algorithm to perform the following operations on a singly linked list : 1. Reverse
2. Sort
13. Write pseudo-C++ code to delete a node from a doubly linked list.

Unit 5:
1. What is stack ? Write an ADT for stack.
2. What is recursion ? Explain use of stack for recursion.
3. Explain (algo.) evaluation of postfix expression using stack with example.
4. Write algorithm to convert infix expression to postfix expression.
5. Define Backtracking & Explain use of backtracking in 4-Queen’s problem.
6. Give pseudo C++ code to implement the foll. operations on linked stack : (i ) Create (ii )
Push data 7. Explain the stepwise conversion using stack for the given infix expression to the
postfix expression : A * B + C * D.
8. Explain the stepwise conversion using stack for the given infix expression to the
postfix expression : A * (B + C) * D.
9. Explain process of conversion of an infix expression to postfix expression using stack :
A * (B – C)/E ^ F + G.
10.Explain the stepwise conversion using stack for the given infix expression to the
postfix expression : ((a/(b-c+d))*(e-a)*c
11.Convert the following prefix into postfix *+a – bc / - de + - fgh
Unit 6:
1. Write pseudo-C++ code to implement a simple queue using Array, OR Write pseudo-C++
code to perform insert and delete operation on linear queue.
2. Write pseudo C++ code to implement Queue using the Linked list.
3. Explain Dequeue with the insert and delete operations performed on it.
4. What is a Priority queue ? Describe the operations on the priority queue and explain its
applications. OR Explain the priority queue. Write ADT for priority queue and state its
applications
5. Write pseudo-C++ code to implement circular queue using an array.
6. Explain the circular queue using a linked list. Write pseudo C code for enqueue operation.
7. Explain linear queues and circular queues with suitable examples. Give the advantages of a
circular queue over linear queue.
8. Explain the priority queue. Give pseudo-C++ code for array implementation of the priority
queue.
9. Explain the application of the queue in detail.