DS imp

Data Structures Using C Important Questions

I Unit – I

1. 1
   Define Data Structure. Explain its types.
2. 2
   Explain Sparse Matrices in detail.
3. 3
   Explain the concept of Representation of Arrays.
4. 4
   Define Stack. Explain various stack operations with an example program.
5. 5
   Define infix and postfix notations. Explain the concept of evaluating postfix expressions.
6. 6
   Explain the following concepts:

   A) Checking Correctness of Well-Formed Parentheses (Nested)

   B) Reversing a String with a Stack

II Unit – II

1. 1
   What is Queue? Explain its operations using an example program.
2. 2
   Explain the concept of Circular Queue with an example program.
3. 3
   Explain the concept of Linked List and insertion, deletion of nodes.
4. 4
   Explain operations for Circularly Linked Lists.
5. 5
   Define Doubly Linked List. Write steps on how to insert and delete nodes in a doubly linked list.
6. 6
   What is Hash Function? Explain its types.
7. 7
   Explain Overflow Handling using different techniques.

III Unit – III

1. 1
   Explain tree representations.
2. 2
   Define Binary Tree and its ADT operations.
3. 3
   Explain Binary Tree Traversals.
4. 4
   Define Heaps. Explain insert and delete operations of Heap.
5. 5
   Define Binary Search Tree (BST). Explain:

   a) Searching an element

   b) Insertion into a BST

   c) Deletion from a BST
6. 6
   What is AVL Tree? Explain its operations.
7. 7
   What is Graph? Explain graph terminology.
8. 8
   Explain Graph ADT and its representations.
9. 9
   Explain the following:

   a) Explain DFS with an example.

   b) Explain BFS with an example.
10. 10
    Explain the following:

    a) Explain Kruskal's algorithm with an example.

    b) Explain Prim's algorithm using an example.

IV Unit – IV

1. 1
   Explain the following:

   a) Explain Sequential Search with an example.

   b) Explain Binary Search technique with an example program.
2. 2
   Explain Quick Sort technique with an example program.
3. 3
   Explain Merge Sort technique with an example program.
4. 4
   Explain Selection Sort technique with an example program.
5. 5
   Explain Heap Sort with an example program.
6. 6
   Explain the concept of List and Table Sorts.

🎓 DegreeCSA

Computer Science Learning Platform

Visit: degreecsa.blogspot.com