BITM Data Structure and Algorithms

Define computational complexity.

Why doubly linked list needs more memory?

List any two applications of queue.

What is excessive recursion?

What is the basic difference between tree and graph?

Write two major operations of stack.

Mention the worst case while creating BST.

Define hash collision.

Why do we need to sort the data?

Define weighted graph.

Why do we need ADT? Justify.

Convert the infix expression \((X+Y)*Z\) into postfix expression.

Write a function to traverse a binary tree in Postorder.

Write an algorithm or function to pop an element from a stack.

Write recursive function to find the GCD of two positive integers.

How do you traverse a graph? Illustrate any one.

Explain different cases of deleting a node from a binary tree.

Using quick sort, arrange the data 2, 1, 6, 10, 9, 4, 8, 7, 5 in ascending order.

Write an algorithm or function to add a node at the end of doubly linked list.

Find the shortest paths from vertex A to other vertices of the below graph using Dijkstra's algorithm:

List the advantages of circular queue over linear queue. Insert 39, 55, 10, 29, 19, 15 into a Hash table of size 10 using division function. Use linear probing technique to resolve hash collision(if necessary).

Why do we need to balance BST? Support your statement with an example. Create a B-tree of order 5 from the given data: 7, 6, 1, 2, 11, 4, 8, 13, 10, 5, 19, 9, 18, 24.