Skip to content
CampusPrep
CS-303 · Data Structure/Unsolved PYQ Paper

CS-303 Data Structures - Jun 2024 Question Paper

  1. 7 Marks
    aDescribe Asymptotic notation in detail.
  2. 7 Marks
    bWhat is Recursion? Explain in detail with example.
  3. 7 Marks
    aDifferentiate between the stack and queue.
  4. 7 Marks
    bWrite a 'C' program to convert the infix expression to postfix expression.
  5. 7 Marks
    aWrite an algorithm for insert and delete operations in circular linked list.
  6. 7 Marks
    bHow a binary search tree is traversed? Explain with a suitable example.
  7. 7 Marks
    aHow can you convert an infix expression to postfix expression using stack? Give one example.
  8. 7 Marks
    bWrite functions to implement recursive versions of preorder, inorder and postorder traversals of a binary tree.
  9. 7 Marks
    aWrite a 'C' program, how to insert and delete elements in the Binary search tree?
  10. 7 Marks
    bDiscuss Kruskal's algorithm with an following graph.
    An undirected weighted graph with 9 vertices labeled 0 through 8. Edges with weights: (0, 1) = 4, (0, 7) = 8, (1, 2) = 8, (1, 7) = 11, (2, 3) = 7, (2, 8) = 2, (2, 5) = 4, (3, 4) = 9, (3, 5) = 14, (4, 5) = 10, (5, 6) = 2, (6, 7) = 1, (6, 8) = 6, (7, 8) = 7.
  11. 7 Marks
    aExplain shell sort algorithm and simulate it for the following data 35, 33, 42, 10, 14, 19, 27, 44.
  12. 7 Marks
    bExplain sequential search and simulate it for the following data 4, 21, 36, 14, 62, 91, 8, 22, 81, 77, 10.
  13. 7 Marks
    aExplain Multiway Merge sort with an example.
  14. 7 Marks
    bWhat do you mean by sorting? Describe the need for sorting.
  15. 14 Marks
    Write short notes on any two of the following:
    1. i)Queue using linked list
    2. ii)Hashing
    3. iii)B+ tree
    4. iv)Post fix expression evaluation
Go to where you left off?

Quick Add to Notes

Save questions, your own notes and screenshots into notes filed by unit. It takes a free account.

Create free account

Have an account? Log in