File Details:

{"filename":"bca-3-sem-data-structure-using-c-and-cpp-3101-2023.pdf","description":"This file contains the B.C.A. Third Semester examination paper for Data Structure Using C and C++ (Second Paper) from 2023. It includes questions on topics such as arrays, sparse arrays, postfix expression evaluation, linked lists, binary trees, sorting algorithms, and hashing."}

Questions:

  1. Why are arrays known as static data structures?
  2. What are the applications of sparse arrays in theoretical computer science?
  3. Write the vector representation for a lower triangular matrix and illustrate with an example.
  4. Write the algorithm for evaluation of postfix expression using a stack.
  5. Write the method of interconversion between infix, prefix, and postfix expressions using a stack with examples.
  6. Write a short note on: Queue and its applications, Deque or D-queue, Priority queue.
  7. How are sequential and linked lists represented in memory?
  8. Show the process of insertion, deletion, and counting of nodes in a singly linked list in memory.
  9. Show how doubly linked lists can be represented and traversed in memory.
  10. Write a short note on: Binary tree, B-Tree, Binary Search Tree.
  11. Write the algorithm for insertion sort and trace it with a random selection of a list consisting of 10 integers.
  12. Explain with example data set: Merge Sort, Heap Sort.
  13. Differentiate between linear search and binary search with an example.
  14. What are the collision problems that occur in hashing? How can these be resolved?
Back to list

GKPAD.COM by SK Yadav | Disclaimer

free counter