DATA STRUCTURE ASSIGNMENT
ATTEMPT ANY 15 QUESTIONS
1. What is Performance Analysis? Explain components of Space Complexity.
2. Explain Time Complexity with their components and examples.
3. Discuss in detail about Algorithm Specification.
4. Explain Best, Average and Worst operation counts for various algorithms.
5. a) What do you mean by Asymptotic Notation?
b) Explain Big Oh Notation. With example
6. a) Explain Omega Notation. With example
b) Explain Theta Notation. With example
7. Explain Abstract Data Type and Abstract Class in Linear List
8. Explain how can we represent Linear list Array
9. a) Explain Linear Data structure with examples
b) Explain Non Linear Data structure with examples
10. What are the various performance measurement for an array list?
LINKED LIST, STACKS AND QUEUES
1. What is linked list? Write and explain the algorithm for create and traverse operations in
single linked list with example.
2. What are the draw backs of single linked list? Write and explain the algorithm for search
and modify operations in doubly linked list with example.
3. a). Explain the advantages of linked list over arrays.
4. b). Write algorithm for insert and delete a node from doubly linked list.
5. a). Explain the circular linked list in detail.
6. b). What is the draw backs of single linked list? Explain how to implement insert and
traverse operations in circular linked list.
7. What is linked list? Write and explain the algorithm for crate, insertion and traverse
operations in doubly linked list with example.
8. What is stack? Explain any two applications of stack with examples.
9. What is stack? Write algorithm for operations of stack with examples.
10. What are the limitations of queue? Explain the algorithms for various operations of
circular queue.
11. Give brief description about the priority queues.
12. a). What are the applications of queue?
13. b). How to store stack using linked list? Explain with example.
Data structures Page 1
TREES, MULTIWAY TREES
1. a) What is a binary search tree? How do you insert an element into a binary search tree?
b) What is traversing? Write recursive procedure for in order traversal in a binary tree.
2. a). Explain how to delete an element from the binary search tree.
b). Write recursive algorithm for pre order traversal.
3. a). Discuss threaded binary trees.
b). Explain height balance tree.
4. Discuss about Heaps and heaps as priority Queues.
5. Write insertion, deletion and searching operations on AVL trees.
6. Discuss B-Trees with insert and delete operations.
7. Explain B+ - Tree and Prefix B+ - Trees. With differences.
8. Explain about 2-4 trees with various operations.
9. Explain B* - Trees and Bit – Trees. With example
10. Explain Deletion in Binary tree by merging and copying
Data structures Page 2
SORTING AND SEARCHING
1. Explain how to sort the elements by using insertion sort and derive time complexity for
the same.
2. Write a Routine for sorting elements using quick sort method. Explain the working
of the routing with an example.
3. Explain how to sort the elements by using selection sort and derive the time complexity
for the same.
4. Discuss the Algorithm of merge sort with an example. Derive its time complexity.
5. Write and explain Bubble sorting Algorithm and also find its time complexity.
6. Write and explain Radix sort algorithm with an example.
7. What is searching? Explain Binary search algorithm with example and also find its time
complexity.
8. What is searching? Explain Linear search algorithm with example and also find its time
complexity.
9. Define Searching. Differentiate the time complexities of Linear and Binary search with
examples. [12 M]
10. Write a procedure for sorting a given list of elements using Quick sort method. Show the
division of the list in the quick sort for a list of 10 numbers.
GRAPHS AND GRAPH ALGORITHMS
1. Explain DFS algorithm with example.
2. Explain BFS algorithm with example.
3. Discuss how to represent graph storage using Adjacency matrix.
4. What is minimum –cost spanning tree? Discuss Prim’s algorithm with example.
5. What is minimum –cost spanning tree? Discuss Kruskal’s algorithm with example.
6. Explain Dijkstra’s algorithm with an example.
7. Discuss Floyd’s algorithm.
8. With an example discuss Warshall’s algorithm.
9. Define graph. Explain various operations on graphs.
10. Explain any algorithm for all pairs shortest path problem.
Data structures Page 3
