Scribd
Upload
14 views2 pages

2024 model paper data structure-1

The document outlines an examination paper for a B.Sc. in Computer Science, focusing on data structures and algorithms. It includes various types of questions such as definitions, comparisons, algorithm writing, and explanations of concepts like binary trees and sorting techniques. The paper is divided into sections with specific instructions on answering the questions within word limits.

Uploaded by

paramkrishnaawasthii
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 views2 pages

2024 model paper data structure-1

The document outlines an examination paper for a B.Sc. in Computer Science, focusing on data structures and algorithms. It includes various types of questions such as definitions, comparisons, algorithm writing, and explanations of concepts like binary trees and sorting techniques. The paper is divided into sections with specific instructions on answering the questions within word limits.

Uploaded by

paramkrishnaawasthii
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

24/1116 (Printed Pages 4)

(b) What is the difference betweeni Roll No.


5x4=20
() Row Major form and column
Major Form.
24/1116
(i) Quick Sort and Bubble Sort. 2024
Examination,
(i) Array and linked list. B.Sc. (Fifth Semester)
(iv) Prefix and Postfix
Notations. COMPUTER SCIENCE
() Write the Recursive algorithm for the First Paper :(Major)
computation of the GCD of two integers Data Structures
20 Analysisof Algorithm and
M and N.
(d) () What is a Binary Tree? Write the Time :Tso Hours] /Maximum Marks: 75
applications of Binary Trees.
6+7+7 Note :Answer questions as directed.
Section-A
(ii) Given the following Binary tree,
Answer Type Questions)
(Very Short
write the Preorder and postorder
Note : Attempt all the 05 (five) questions.
traversal sequence :
Each question carries 02 (two) marks.

The answer of each question should not

exceed 50 words. 5x2=10

(a) Define Algorithm. Give an illustrative


1.

example.
are the characteristics of the
with the (b) What
(Ht) Draw a Binary tree
Greedy method?
following Traversal:
(c) Write the time complexity of Merge
Inorder:DBHEAIFJCG
HCFIJG Sort.
Preorder :A BDE P.T.O.
24/1116
24/1116
(d) How is binry search different from (e) Explain with diaaram. Define, Priority

linear search? Queue.

How can we implement stack using


(e) Draw the complete binary tree with () a

three filled levels from the root. an array?


Section-B
(9) Implement a queue as a linked Iist

(ShortAnswer Type Questions)


Note :Attempt any 05 (five) questions out of
and explain its

deletion of nodes.
traversal,addition and

total 08 (Eight)questions. Each question


(h) Whatare the advantages of Recursion?
carry 05 (five) marks. The answer of
Give an of a recursive
example
each questions should not exceed 100
Words. 5x5=25 algorithm.
Section-C
2. (a) Write the alcorithm for the basic 'Divide
and Conquer Technique. Explain it (LongAnswer Type Questions)
briefly. Note : Attempt any 02 (two) questions out

(b) Explain Radex sort with asample data of a total 04 (four) questions. Each

set of ten (10) numbers. question carries 20 (twenty) marks


of binary and the answer of each question should
(C) Derive the time complexity
search. Is this an efficient searching not exceed 400 words. 2x 20=40
technique? 3. (a) Write the algorithm for Merge Sort,

Sparse Matrix? Define and Trace and explain the algorithm on the
(d) what is a
example. What following data set : 20
give an illustrative

matrix in
are the usesS of a sparse 38, 27, 43, 3, 9, 82, 10, 51

Computer Science? 3 P.T.O.


2

You might also like