SECTION A — Short Theory Description
Section A contains simple, direct data-structure questions such as time complexity, Big-O notation, stack/queue operations, postfix evaluation, stability of sorting, heap properties, tree height, graph vs tree, and digraphs. Each answer should be written in a short paragraph explaining the term clearly and simply.
Extra sample questions:
Explain the meaning of an algorithm in a short paragraph.
Describe stack overflow and underflow in 4–5 lines.
Explain what a circular queue is in simple words.
SECTION B — Medium Descriptive Paragraph
Section B includes descriptive questions like types of linked lists, recursion, Tower of Hanoi, tree traversals, heap sort, and BFS. Each answer should be written in one connected paragraph explaining the idea, steps, or working of the concept.
Extra sample questions:
Describe the working of insertion sort in a descriptive paragraph.
Explain binary search with an example.
Describe how dynamic memory allocation works in C.
SECTION C — Long Description Paragraph
Section C contains long, analytical questions like polynomial linked list representation, sparse matrix, postfix evaluation algorithm, matrix multiplication, BST construction & deletion, threaded binary trees, minimum spanning tree, topological sort, quick sort, and merge sort. Each answer must be written as one complete descriptive paragraph, explaining the concept thoroughly.
Extra sample questions:
Explain how AVL trees maintain balance in one detailed paragraph.
Describe Dijkstra’s shortest path algorithm in a descriptive paragraph.
Explain hashing with collision handling in a long paragraph.
