Data Structure (CS-303) - Important Questions

Define data structure and explain the classification / various types of data structures in detail with suitable examples.

Write an algorithm for insert and delete operations in a circular linked list.

Describe the memory representation of a singly linked list. Write an algorithm to insert a node at a specific position in a linked list.

Explain the stack-based algorithm to convert an infix expression to postfix notation with a suitable example.

Differentiate between stack and queue with respect to operations, implementation and applications.

What is recursion? Explain the concept of recursion in detail with a suitable example.

Define stack as an ADT. Explain its array and linked list implementation with push and pop operations.

Explain in-order, pre-order and post-order traversal of a binary search tree with an example.

Write a C program to insert and delete elements in a binary search tree.

What are AVL trees? Explain the four types of rotations - LL, RR, LR and RL - used to balance an AVL tree with examples.

Explain Kruskal's algorithm for minimum spanning tree with the help of an example graph showing step-by-step selection of edges.

Describe the Depth First Search (DFS) algorithm for graph traversal with an example and its time complexity.

Sort the following list of numbers in ascending order using Quick Sort showing partition steps: 55, 72, 12, 45, 88, 38, 27, 33, 91, 80.

Apply binary search to search for key 36 in a given sorted array, showing the steps of low, high and mid at each stage.

Write short notes on any two of the following: (i) Hashing and Indexing (ii) Merge sort (iii) Sequential search.