This download link is referred from the post: OU BSc Computer Science 2021 Important Question Bank || Osmania University (Important Questions)
Data Structures Question Bank
UNIT-I
--- Content provided by FirstRanker.com ---
- Define algorithm and give the steps for algorithm.
- Explain in detail about how an algorithm can be represented as pseudo code.
- Discuss about 1-D & 2-D Arrays.
- Discuss the concept of ordered list.
- Define stack give brief introduction in stack and explain operation performed on stack.
- Explain in detail the various operation of stack ADT.
- Define infix, prefix, and postfix expressions.
- Write how to convert an infix expression in to postfix.
--- Content provided by FirstRanker.com ---
UNIT-II
- What is recursion explain with example also write the advantages and disadvantages of recursion.
- Discuss about various types of recursion.
- Write about iteration versus recursion.
- What is queue explain primitive operation on queue.
- Write in brief about queue ADT.
- Discuss about Enqueue & Dequeue.
- Discuss in detail about array implementation of queue ADT.
- Discuss about CQ.
- Define linked list & explain primitive operations performed on linked list with C++ program.
- Discuss in brief about singly linked and double linked list.
- Garbage collection.
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
UNIT-III
- Define tree explain terminologies associated with it.
- Define Binary tree and full BT, Complete BT.
- Explain in detail about binary tree traversal techniques.
- Explain about applications of binary tree.
- Define graph give the basic terminologies of graph.
-
- Adjacency matrix
- Incidence matrix
- Adjacency list
- Spanning tree
- Minimum spanning tree
--- Content provided by FirstRanker.com ---
- Discuss various graph traversal techniques (DFS&BFS).
- Explain prim’s algorithm and illustrate with suitable example.
- Explain kruskal’s algorithm.
- What is hashing explain in detail.
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
UNIT-1V
- What is searching? Explain various types of searching techniques.
- What is bubble sort? Explain with an example.
- Insertion sort.
- Selection sort.
- Quick sort.
- Merge sort.
- Define heap? Explain Heap ADT.
- Heap sort.
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
This download link is referred from the post: OU BSc Computer Science 2021 Important Question Bank || Osmania University (Important Questions)
--- Content provided by FirstRanker.com ---