Download OU B.Sc 2019 Dec 3rd Sem (2nd Year) 8078 Computer Science (Data Structures) Question Paper

Time: 3 Hours

Subject: Computer Science

Paper: Data Structures

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

Part— A (5x4 =20 marks)

(Short Answer Type)

Note: Answer any FIVE of the following questions.

1. Define data structure and describe the types of data structure.
2. What is stack? List out applications of stack.
3. Why linked list is called dynamic data structure? What are the advantages of linked list over arrays?

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

4. Describe execution of recursive calls with example.
5. What are the binary tree applications?
6. Define graph and explain graph representation.
7. Write a program for sequential search.
8. What is heap? Explain heap construction process?

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

Part— B (4x15=60 marks)

(Essay Answer Type)

Note: Answer ALL questions.

1. (a) (i) What is an array and explain its advantages and disadvantages?
   (ii) Explain memory representation and address calculation of 1-D and 2-D arrays.
   OR
   

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

   (b) Write a program to implement a stack abstract data type using an array.
2. (a) (i) What is recursion and write an example for recursion?
   (ii) What is queue? And explain about circular queue and double ended queue.
   OR
   (b) Write a program to create a double linked list insert, delete and search for an element operations.

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

3. (a) (i) Define the binary tree and explain its properties. Explain the binary tree techniques with example.
   (ii) Write a program to travel binary tree in pre-order, post-order.

For more previous year question papers, visit FirstRanker.com