Scribd
Upload
14 views

DS (3rd) May2018

Uploaded by

hvviz
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
14 views

DS (3rd) May2018

Uploaded by

hvviz
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

Roll No. Total No.

of Pages: 02
Total No. of Questions: 07

BCA (2011 & Onward) (Sem. – 3)


DATA STRUCTURES
M Code: 10058
Subject Code: BSBC-302
Paper ID: [B0229]
Time: 3 Hrs. Max. Marks: 60

INSTRUCTIONS TO CANDIDATES:
1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
2. SECTION-B contains SIX questions carrying TEN marks each and students ha ve to
attempt any FOUR questions.

SECTION A

1. Attempt all questions:


o m
a) Write short note on recursion.
.r c m
b) List the various types of queues.

p e o
.r c
c) What are the various non-linear data structures?

p a
d) What do you mean by algorithm?

r
e) What is the difference between data and information?

b p e
a
f) What are the front and rear pointers of queue?

rp
g) What is need for garbage collection?

h) Discuss Polish notation.

i) What is problem analysis? Explain. b


j) What do you mean by Dynamic Storage Management?

M-10058 Page 1 of 2
SECTION B

2. What do you mean by data and data structure? What is need of algorithm complexity and
how it is evaluated? Describe any notation used to represent algorithm complexity.
3. Write an algorithm for Binary Search. How it is better from Linear Search?
4. What are the various operations possible on stacks? Explain the algorithm for each of them?
5. In what way, doubly linked list is better than single linked list. Give examples.
6. What are the various binary tree traversal techniques? Discuss with example and algorithm.
7. Write an algorithm for insertion sort. Discuss with help of an example.

o m
.r c m
p e o
p a .r c
b r p e
a
b rp

M-10058 Page 2 of 2

You might also like