Solved question paper for DS Dec-2018 (DIPLOMA 4th)

Solved Question Paper

Data structure using c Dec-2018

PSBTE • DIPLOMA • Information Technology • 4th • Dec-2018

DS for Punjab State Board of Technical Education, Diploma in Engineering Information Technology 4th Semester helps students find subject-wise previous year question papers and exam paper references in one place. This page is useful for quick revision, checking repeated questions, and understanding the exam pattern and marking style before the exam. BRpaper is not the official website of the university or board. It is a student help page for locating data structure using c previous year papers and related exam-prep material, so you can open the correct subject page faster and prepare with more confidence.

Solved Questions

Solved
  1. What is stack overflow?
    Short Answer 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  2. Array is a _________ data structure.
    Fill in the Blanks 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  3. A binary tree can have at most __________ children.
    Fill in the Blanks 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  4. In stack elements can push and pop through _________ only.
    Fill in the Blanks 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  5. Queue follow the property of LIFO.
    True / False 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  6. A node is divided into two parts: first is ________ and second is _________.
    Fill in the Blanks 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  7. Tree is __________ data structure.
    Fill in the Blanks 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  8. Time complexity of binary search is O(log2n).
    True / False 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  9. Big Oh notation describes the _________ of an algorithm.
    Fill in the Blanks 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  10. An algorithm is sequence of _________ to complete a task.
    Fill in the Blanks 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  11. Define data structure. Explain types of data structure.
    Long Answer 6 Marks Dec-2018 • PSBTE DIPLOMA
  12. Write binary search algorithm and explain briefly.
    Long Answer 6 Marks Dec-2018 • PSBTE DIPLOMA
  13. Define postfix evaluation algorithm with following infix expression: ((A+2)*(B+7))-3. Convert this into postfix first. You may take any positive value for A and B.
    Long Answer 6 Marks Dec-2018 • PSBTE DIPLOMA
  14. What is linked list? Write an algorithm to insert an element at any location in linked list.
    Long Answer 6 Marks Dec-2018 • PSBTE DIPLOMA
  15. Explain bottom up and top down programming methodologies.
    Long Answer 6 Marks Dec-2018 • PSBTE DIPLOMA
  16. Explain one application of stack.
    Short Answer 6 Marks Dec-2018 • PSBTE DIPLOMA
  17. Explain one application of queue.
    Short Answer 6 Marks Dec-2018 • PSBTE DIPLOMA
  18. What are the drawbacks of linked list and how can we overcome them?
    Long Answer 6 Marks Dec-2018 • PSBTE DIPLOMA
  19. Write algorithms to push an element through stack.
    Short Answer 6 Marks Dec-2018 • PSBTE DIPLOMA
  20. Write algorithms to pop an element through stack.
    Short Answer 6 Marks Dec-2018 • PSBTE DIPLOMA
  21. Write an algorithm to convert infix notation to postfix notation.
    Long Answer 15 Marks Dec-2018 • PSBTE DIPLOMA
  22. Write a note on Binary Tree.
    Long Answer 5 Marks Dec-2018 • PSBTE DIPLOMA
  23. Write a note on De-queue.
    Long Answer 5 Marks Dec-2018 • PSBTE DIPLOMA
  24. Write a note on Recursion.
    Long Answer 5 Marks Dec-2018 • PSBTE DIPLOMA
  25. Write a note on Memory representation of an array.
    Long Answer 5 Marks Dec-2018 • PSBTE DIPLOMA
  26. What do you understand by binary tree traversal? Explain various traversal techniques with suitable example.
    Long Answer 15 Marks Dec-2018 • PSBTE DIPLOMA
  27. Write an algorithm to traverse a linked list.
    Long Answer 15 Marks Dec-2018 • PSBTE DIPLOMA
  28. Write an algorithm to search a node in linked list.
    Long Answer 15 Marks Dec-2018 • PSBTE DIPLOMA
  29. A binary tree can have at most __________ children
    Fill in the Blanks 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  30. In stack elements can push and pop through _________only
    Fill in the Blanks 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  31. Queue follow the property of LIFO (T/F)
    True / False 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  32. A node is Divided into two parts first is ________ and 2nd is _________.
    Fill in the Blanks 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  33. Tree is __________ data structure
    Fill in the Blanks 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  34. Time Complexity of Binary search is O(log2n). True/False
    True / False 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  35. Big Oh notation describes the _________of an algorithm.
    Fill in the Blanks 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  36. An algorithm is sequence of _________to complete a task.
    Fill in the Blanks 1.5 Marks Dec-2018 • PSBTE DIPLOMA
  37. Write Binary search algorithm and explain briefly?
    Long Answer 6 Marks Dec-2018 • PSBTE DIPLOMA
  38. Define postfix evaluation algorithm with following infix expression. ((A+2)*(B+7))-3, (convert this into postfix first). You may take any positive value for A and B.
    Long Answer 6 Marks Dec-2018 • PSBTE DIPLOMA
  39. Explain one application of each stack and queue.
    Long Answer 6 Marks Dec-2018 • PSBTE DIPLOMA
  40. What are the drawbacks of linked list and how we can overcome them?
    Long Answer 6 Marks Dec-2018 • PSBTE DIPLOMA
  41. Write algorithms to push and pop an element through stack.
    Long Answer 6 Marks Dec-2018 • PSBTE DIPLOMA
  42. Write a note on any three: i. Binary Tree ii. De-queue iii. Recursion. iv. Memory representation of an array
    Long Answer 15 Marks Dec-2018 • PSBTE DIPLOMA
  43. Write an algorithm to traverse a linked list and also to search a node in linked list.
    Long Answer 15 Marks Dec-2018 • PSBTE DIPLOMA

Explore all data

FAQ

Frequently Asked Questions

Answers about this subject, solved papers, and preparation.

Updated regularly
01 Where can I find DS previous year question papers for PSBTE Diploma IT 4th semester?

You can use this subject page to locate DS previous year question papers for PSBTE Diploma IT 4th semester and open the relevant paper quickly.

02 Is this page for data structure using c subject papers?

Yes, this page is for DS, which stands for data structure using c in the PSBTE Diploma in Engineering Information Technology 4th semester.

03 Can I use old DS papers for exam revision?

Yes, old DS papers are useful for revision because they help you understand common question types, repeated questions, and the exam pattern.

04 Does BRpaper provide official question papers for this subject?

No. BRpaper is not the official website of the Punjab State Board of Technical Education. It only helps students find previous year question papers and related exam material.

05 Are solved papers or answer keys guaranteed on this page?

Not always. This page is mainly for finding the subject paper, so availability of solved papers or answer keys may vary.