BSc Semester 2 Computer Data Structure Question Bank
B. Sc. Semester 2
Computer
Data Structure
Question Bank
Chapter-1
- What is pointer? How to declare pointer, explain with example.
- What is array? Explain types of array with example.
- What is dynamic memory allocation? Explain dynamic memory allocation functions.
- Explain sparse matrix.
- What is Data Structure? Explain types of data structure.
Chapter-2 & 3
- What is Queue? Explain types of Queue.
- Write a program to perform insert, delete and display operations on simple queue.
- What is stack? Write program of stack.
- Explain circular queue with example.
- Difference between Stack and Queue.
- Explain evaluation of express using stack.
- What is linked list? Explain in detail.
- Write a program for Singly Linked List.
- Write a program for Doubly Linked List.
- Singly linked list v/s doubly linked list.
- Explain circular linked list with example.
Chapter-4
- Explain B-tree with example.
- Write a short note on binary search tree and how to insert in bst.
- Explain shortest path problem.
- Explain minimal spanning tree.
- Explain DFS in detail.
- Define root, leaf, parent, child node.
- What is binary tree? Explain binary tree traversal techniques.
- Write a program to create binary tree and find out pre order, in order and post order.
- 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
- What is sorting? List out types of sorting and explain insertion sort in detail.
- Write a program to sort an array element using bubble sort technique.
- Explain Quick Sort.
- Explain binary search with example.
Comments
Post a Comment