Data Structures — Winter 2022

Convert following infix expression into postfix expression using stack. (A-B)/C*D^(E/F)^(G+H)

Differentiate primitive and non-primitive data structures

Define time complexity? Explain worst case and best case complexity with examples.

Create AVL tree for following Data and write pre-order traversal of the constructed tree.

What is Sparse matrix? Write efficient vector representation of following Sparse matrix.100

What is the worst case complexity of binary search? Write an algorithm for binary search.

Create Binary Search Tree for following Data and write pre-order traversal, in- order traversal and post-order traversal of the constructed tree.

Write algorithm to delete from circular queue and mention the advantage of circular queue over simple queue?

Write c program for bubble sort.

Write algorithm to insert into simple queue and mention the limitation of simple queue?

Find the minimum spanning tree of following graph using Kruskal’s method. OR1

Write c program for selection sort.

Find the minimum spanning tree of the following graph using prim’s method.

Explain DFS and BFS with appropriate example.

What is priority queue? Is simple queue is anyhow priority queue? Explain your answer.

Write Cprogram to find the Fibonacci sequence of n terms using recursion.

What is linked list? States the advantages of linked list over array. Also list various types of the linked list.

Write recursive solution for tower of Hanoi. How many moves require for transferring three discs?

Explain Dijkstra’s shortest path algorithm with appropriate example

Define following terms 1) Balance factor 2) Hash function 3) Cyclic graph

Sort following data using merge sort.

Define hash collision? Explain collision various resolution techniques.

Define following terms 1) Hash table 2) Graph 3) Complete binary tree

Sort following data using quick sort.

What is file? Explain various types of file organization.2