For Your Reference - https://chatgpt.

com/share/6735d8a9-0298-800e-9a84-36f951caac21

Repeated Questions

1. Definitions and Basic Concepts:

o What is pointer to pointer? (Repeated in April 2022, April 2023, and October 2022)

o What is data structure? (Repeated in April 2022 and October 2023)

o What is sorting? State the techniques of sorting. (Repeated in April 2022 and
October 2023)

o What is non-primitive data structure? (Repeated in April 2022 and October 2023)

o What is searching? (Repeated in April 2022 and October 2023)

o What is polynomial? How is it represented/different from structure? (Repeated in

April 2023, October 2022, and October 2023)

2. Specific Data Structures:

o Applications of stack (Repeated in April 2022 and October 2023)

o What is stack? Explain different operations used in stack. (Repeated in April 2022,
October 2022, and October 2023)

o What is balance factor? How is it calculated? (Repeated in April 2023 and October
2022)

o Differentiate array and structure. (Repeated in April 2023, October 2022, and
October 2023)

3. Tree and Graph Structures:

o Construct Binary Search Tree (with different data values in each exam but same
type of question). (Repeated in April 2022, April 2023, October 2022, and October
2023)

o Convert an infix expression to postfix/prefix. (Repeated across multiple papers with

slight variations in expressions)

4. Algorithms and Sorting:

o Explain insertion sort technique with an example. (Repeated in April 2022, April
2023, and October 2022)

o Selection sort (or similar sorting algorithms like quick sort or merge sort) appears
frequently but with variations in data values for sorting.

5. Linked List Operations:

o Write a function to create and display singly or doubly linked list. (Singly linked list
creation in April 2022, April 2023, and October 2023)

o Write a function to delete the first node in a singly linked list. (Repeated in April
2023 and October 2022)
 6. Definitions Related to Graphs and Trees:

o Define terms like Directed Graph, Parent Node, Subtree, Degree of Vertex, Leaf
Node, etc. (Definitions related to graphs and trees appear repeatedly across different
papers)

Repeated Programming Questions

1. Linked List Operations:

o Create and Display Linked List: Questions often ask to write a function to create and
display a singly or doubly linked list.

 Appears in April 2022, April 2023, and October 2023.

o Delete Node in Linked List: Specifically, deleting the first node from a singly linked
list.

 Appears in April 2023 and October 2022.

o Reversing Linked List or String Using Stack:

 Reverse a string using stack in October 2022.

 Traverse and display a linked list in reverse in October 2023.

2. Stack Operations and Applications:

o Convert Infix to Postfix/Prefix Expression: Writing an algorithm or code to convert

infix expressions to postfix or prefix.

 Repeated with slight variations across April 2022, October 2022, and
October 2023.

3. Sorting Algorithms:

o Insertion Sort: Implementing the insertion sort algorithm on given data.

 Appears in April 2022, April 2023, and October 2022.

o Selection Sort and Other Sorting Variants (e.g., Quick Sort, Merge Sort): Often
asked with different data inputs to apply the specified sorting algorithm.

 Appears across multiple papers, like April 2023 and October 2023.

4. Tree and Graph Traversals:

o Binary Tree Traversal Functions (Inorder, Preorder, Postorder): Writing recursive

functions to perform various tree traversals.

 Appears in April 2023 (Inorder traversal), October 2022 (all three traversals),
and October 2023 (Preorder traversal).
 o Graph Traversals (BFS and DFS): Implementing functions for graph traversals using
either breadth-first search (BFS) or depth-first search (DFS).

 DFS traversal in April 2022.

 BFS traversal in October 2023.

5. Queue Operations:

o Insert Element in Circular or Static Queue: Write a function to insert an element into
a circular queue or queue implemented as an array.

 Appears in April 2023 and October 2022.

o Double-Ended Queue (Dequeue): Questions about implementing or explaining

operations in a double-ended queue (Dequeue).

 Appears in April 2022, April 2023, and October 2023.

6. Miscellaneous Data Structure Programs:

o Binary Search: Writing a function to search for an element in an array using binary
search.

 Appears in April 2023.

o Polynomial Evaluation and Representation: Writing a program for polynomial

evaluation or representation.

 Polynomial evaluation in October 2022.