Scribd
Upload
53 views3 pages

Bca Part 2 Data Structure 59 2020

This document is an examination paper for a Data Structure course, detailing the structure and requirements for the exam. It includes a compulsory question section and four units with various questions covering topics such as algorithms, data structures, array indexing, queues, binary trees, and graphs. Students are required to attempt five questions, selecting one from each unit, with a total of 80 marks available.

Uploaded by

sheetaldankher
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
53 views3 pages

Bca Part 2 Data Structure 59 2020

This document is an examination paper for a Data Structure course, detailing the structure and requirements for the exam. It includes a compulsory question section and four units with various questions covering topics such as algorithms, data structures, array indexing, queues, binary trees, and graphs. Students are required to attempt five questions, selecting one from each unit, with a total of 80 marks available.

Uploaded by

sheetaldankher
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/ 3

https://www.kuonline.

in

Roll No. ...................... Total Pages : 3

BCA/M-20 59
DATA STRUCTURE
Paper–BCA-202

Time : Three Hours] [Maximum Marks : 80

Note : Attempt five questions in all, selecting one question from


each unit. Questions No. 1 is compulsory.

Compulsory Question

1. (a) Define string.

(b) What is pattern matching ?

(c) Differentiate between array and linked list.

(d) List searching techniques along with their complexity.

(e) Differentiate between an array and a stack.

(f) What is priority Queue ?

(g) What is Warshall's Algorithm ?

(h) What is binary search tree ? (2×8=16)

UNIT–I

2. What are different Applications of data structure ? Describe


different structure operation. Give example. 16

59/PDF/KD/108 [P.T.O.
https://www.kuonline.in

3. What is an algorithm ? Given two algorithms for a task.


How do we find out which one is better. Explain with
example. 16

UNIT–II

4. Differentiate between row major and column major array


index notation. How is index calculated in both. Explain
your answer by using the example of a two dimensional
Array having m-rows and n-columns, the element Aij is to
be accessed. 16

5. (a) What is sparse matrix ? Describe a data structure for


the efficient storage of a sparse matrix. 10

(b) Describe header linked list with its advantages. 6

UNIT–III

6. (a) What is DEQUEUE ? Given an option between a linear


and circular QUEUE, which one you choose to
implement ? Justify your answer. 8

(b) Discuss Array and linked representation of Stack. 8

7. Explain working of Quick sort on the following data :

12, 17, 2, 19, 22, 27, 32, 18, 72, 8

show all intermediate steps. 16

59//KD/108 2

https://www.kuonline.in
https://www.kuonline.in

UNIT–IV

8. (a) What is binary tree ? Discuss preorder and post order


tree traversal. 8
(b) Convert the expression (A + B) * C – (D – E) * (F + G)
into binary tree. 8

9. What is graph ? Describe sequential and linked representation


of a graph. 16

59//KD/108 3

You might also like