Data Structures and Algorithms — Winter 2023

Differentiate Stack and Queue by working principle, pointers, and structure.

Explain Bubble sort with an example.

Explain all asymptotic notations used in algorithm analysis.

03 What will be the updated AVL tree after the insertion of 70?

Explain the Breadth First Search (BFS) traversal method with an example.

Write a program to perform insert and delete operations in a doubly linked list.

Convert the following infix expression into a postfix operation. Infix expression: ( A + B * ( C - D ) ) / E

Explain in brief: Recurrence Relations with example.

Discuss the advantages and disadvantages of a linked list over an array.

Briefly explain multiplying large integer problem with a suitable example.

Why do we need to solve the recurrence relation?

Apply a quick sort algorithm to sort the following data. Justify the steps. 42,29,74,11,65,58

Explain the backtracking concept and apply the same to the 8-queen problem.1

What is the Principle of Optimality? Explain its use in Dynamic Programming Method.

Explain the preorder traversal techniques of the binary tree with a suitable example.

Explain the concept of a circular queue. Compare circular queue with a simple queue.

List out the general characteristics of Greedy Algorithms.

Define the following terminologies with respect to tree:

Degree of a node

Level of a tree

Height of the node

Define spanning tree and MST. How Krushkal’s algorithm is different from Prim’s algorithm.

Describe the Depth-First-Search (DFS) algorithm briefly using an appropriate example.

Create a binary search tree for the following data: 50, 25, 75, 22, 40, 60, 80, 90, 15, 30. And then, write c function to find the minimum node in the above created tree.

How to solve knapsack problem using dynamic programming?

Consider the following undirected weighted graph. Find minimum spanning tree for the same using Kruskal’s algorithm.

Solve Making change problem using dynamic technique. D1=1, d2=3, d3=5, d4=6. Calculate for making change of Rs. 8.