Download OU B.Sc 2018 Dec 2nd Year 3077 Data Structures Question Paper

FACULTY OF SCIENCE

(CBCS) Examination, November / December 2018

Subject : Computer Science

--- Content provided by​ FirstRanker.com ---

Paper - II : Data Structures (DQC) Max. Marks: 80

PART - A (5 x 4 = 20 Marks)

(Short Answer Type)

Answer any FIVE of the following questions.

1. Differentiate between Atomic and Composite data with examples.

--- Content provided by‌ FirstRanker.com ---

2. What is Sequential Organization? Briefly explain its advantages.
3. Explain the use of Stack to find the factorial of a number.
4. What are the demerits of recursion?
5. Construct a binary tree using the following data:
   • Inorder: [D, B, I, H, I, E, A, F, J, C, G]
   • Preorder: [A, B, D, I, E, J, H, C, F, I, J, G]

   --- Content provided by‍ FirstRanker.com ---

6. Explain how to represent the following graph using Inverse Adjacency List.
7. What are the Pros of binary search?
8. Define minheap and maxheap with examples.

PART - B (4 x 16 = 60 Marks)

--- Content provided by​ FirstRanker.com ---

(Essay Answer Type)

Note: Answer ALL questions.

1. (a) Define ADT for the “Integer” and explain all its functions and axioms in detail.

   OR

   (b) Write a C++ program to implement the following operations on Arrays.
   1. To insert an element at a given position
   2. To delete an element at a given position

   --- Content provided by⁠ FirstRanker.com ---

2. (a) Explain the representation of stack using a linked list.

   OR

   (b) Explain the operations of inserting a node, deleting a node, and traversal in a circular linked list with examples.
3. (a) Write the algorithm for the construction of Expression Tree. Explain the steps to construct an expression tree for the expression: E=(a+b*g)/d

   OR

   (b) Explain the representation of graph using the adjacency matrix, adjacency list, and adjacency multi-list.

--- Content provided by‌ FirstRanker.com ---

4. (a) Write a C++ program for insertion sort. Show the steps of the insertion algorithm for the list of data: 78, 67, 36, 55, 23, 14, 6

   OR

   (b) Explain the step-by-step procedure to construct a heap tree using the list of keys: 8, 20, 9, 4, 15, 10, 7, 72, 3, 12

FirstRanker.com