Data Structure (IT-303) - Important Questions

Define data structure and describe its classification with a diagram.

Define algorithmic complexity and explain time complexity and space complexity.

Sort the array [22, 7, 2, 9, 8, 15, 13, 3, 11] using quick sort taking the first element as pivot. Show the steps of partitioning at each stage.

Illustrate the steps in the construction of a heap by inserting the keys 12, 33, 67, 8, 7, 80, 5, 23 one at a time into an initially empty binary heap.

Compare the working of binary search and linear search with example.

Discuss the common collision resolution strategies used in closed hashing.

Write the algorithm for evaluating a postfix expression using a stack and apply it to evaluate the postfix expression 2 8 4 - 5 * + 7 7 / +, showing stack contents at each step.

Convert the given infix expression to postfix and prefix form: (A+B)*C-(D/E+F). Show step-by-step conversion using stack.

Describe stack ADT in detail. Give an algorithm for push and pop operations on stack using a linked list.

Define the properties of circular queue and explain how to check full and empty conditions.

Explain and implement a singly linked list with an example.

What is a doubly linked list? Explain creation, traversal, insertion and deletion of a node in a doubly linked list with algorithms.

Construct a binary search tree by inserting the keys 30, 40, 24, 58, 48, 26, 11, 13 one by one into an initially empty tree and find its in-order, pre-order and post-order traversals.

Simulate insertion of the keys 3, 1, 4, 6, 2, 8, 9 into an initially empty AVL tree, showing rotations to maintain balance at each step.

Explain the working of Dijkstra's algorithm with the help of an example graph.

Find the minimum spanning tree of a given graph using Prim's algorithm. Show all steps.