Scribd
Upload
68 views2 pages

Ds Preparatory 23-3-2022

This document provides instructions and questions for a Data Structures exam. It is divided into three parts. Part A contains 6 short answer questions worth 2 marks each. Part B contains 4 longer answer questions worth 5 marks each. Part C contains 4 more in-depth questions worth 8 marks each, including problems on postfix expressions, binary search trees, and graph representations. The exam is 2 hours long and has a maximum score of 60 marks.

Uploaded by

lilliangrace1320mhds
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
68 views2 pages

Ds Preparatory 23-3-2022

This document provides instructions and questions for a Data Structures exam. It is divided into three parts. Part A contains 6 short answer questions worth 2 marks each. Part B contains 4 longer answer questions worth 5 marks each. Part C contains 4 more in-depth questions worth 8 marks each, including problems on postfix expressions, binary search trees, and graph representations. The exam is 2 hours long and has a maximum score of 60 marks.

Uploaded by

lilliangrace1320mhds
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Bangalore University

I Semester BCA Examination (NEP - SCHEME)


Subject: COMPUTER SCIENCE
PAPER: DATA STRUCTURES
PREPARATORY EXAMINATION
Date : 23-Mar-2022 Time : 10.00 – 12.00
Duration: 2 hours Max. Marks: 60

Instruction: Answer any FOUR questions from each part


PART- A
I. ANSWER ANY 4 QUESTIONS
Each question carries 2 marks 4x2=8
1. Define ADT with an example.
2. What are sparse matrices? Give an example.
3. What is Doubly Linked List?
4. List out any 4 applications of Stack.
5. What is Directed Acyclic Graph?
6. List the technique used for hash collision.

PART-B
II ANSWER ANY 4 QUESTIONS
Each question carries 5 marks 4 x 5 = 20

7. Explain the application of data structure.


8. Briefly define the various operation performed on stack with syntax and example.
9. Write a c-program for tower-of-honai problem.
10. Write a short note on AVL tree.
11. Solve the problem 40, 10, 2, 5, 20, 30, 25, 50, 12 ,9 by using shell sort.
12. Consider the graph shown below. Starting at vertex 1, traverse the
graph by DFS.

1
3
2

5 6 7
4

8
PART-C
III ANSWER ANY 4 QUESTIONS
Each question carries 8 marks 4 x 8 = 32

13. a) Explain Omega Notation with an example. (4marks)


b) Evaluate a postfix expression 8 7 4 * + 3 – 2 * using stack (4marks)
14. Write an algorithm for Binary Search and explain. (8marks)

15. What is Linked List? Write a C program to create a SLL and perform inserting, deleting
and display the content of list. (8marks)
16. Construct a Max heap for the given numbers: 13, 86, 43, 38, 54, 23, 08, and 63. (8marks)
Explain every step.
17. Construct Binary search tree using : (8marks)
Inorder : E A C K F H D B G
Postorder : E C K A H B G D F

18. A) Explain sequential representation of graphs in memory.


B) Explain Hashing. (5+3 marks)

********************* ALL THE BEST *******************

You might also like