BSc Semester 2 Computer Data Structure Question Bank


B. Sc. Semester 2 
Computer 
Data Structure 
Question Bank

Chapter-1
  1. What is pointer? How to declare pointer, explain with example.
  2. What is array? Explain types of array with example.
  3. What is dynamic memory allocation? Explain dynamic memory allocation functions.
  4. Explain sparse matrix.
  5. What is Data Structure? Explain types of data structure.


Chapter-2 & 3
  1. What is Queue? Explain types of Queue.
  2. Write a program to perform insert, delete and display operations on simple queue.
  3. What is stack? Write program of stack.
  4. Explain circular queue with example.
  5. Difference between Stack and Queue.
  6. Explain evaluation of express using stack.
  7. What is linked list? Explain in detail.
  8. Write a program for Singly Linked List.
  9. Write a program for Doubly Linked List.
  10. Singly linked list v/s doubly linked list.
  11. Explain circular linked list with example.

Chapter-4
  1. Explain B-tree with example.
  2. Write a short note on binary search tree and how to insert in bst.
  3. Explain shortest path problem.
  4. Explain minimal spanning tree.
  5. Explain DFS in detail.
  6. Define root, leaf, parent, child node.
  7. What is binary tree?  Explain binary tree traversal techniques.
  8. Write a program to create binary tree and find out pre order, in order and post order.
  9. Create a binary tree for the following: 15,12,6,9,24,13,29,20,27,10,8 Also write in-order, pre order and post order for the same.


Chapter-5
  1. What is sorting? List out types of sorting and explain insertion sort in detail.
  2. Write a program to sort an array element using bubble sort technique.
  3. Explain Quick Sort.
  4. Explain binary search with example.




Comments

Popular posts from this blog

પટેલ સમાજનો ઈતિહાસ જાણો : કોણ અને ક્યાંથી આવ્યા હતા પાટીદારો

Python HTML Generator using Yattag Part 1

Java Event Delegation Model, Listener and Adapter Classes