Scribd
Upload
33 views2 pages

Dsa 20209

This document outlines the B. Tech (Sem III) Theory Examination for Basics Data Structure and Algorithms, including a total of 100 marks and a 3-hour duration. It consists of three sections: Section A includes brief questions, Section B has detailed questions requiring in-depth answers, and Sections C through G provide options for various topics related to data structures and algorithms. The exam covers concepts such as binary trees, sorting algorithms, and complexity analysis.

Uploaded by

kunalsinghjayant.05
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
33 views2 pages

Dsa 20209

This document outlines the B. Tech (Sem III) Theory Examination for Basics Data Structure and Algorithms, including a total of 100 marks and a 3-hour duration. It consists of three sections: Section A includes brief questions, Section B has detailed questions requiring in-depth answers, and Sections C through G provide options for various topics related to data structures and algorithms. The exam covers concepts such as binary trees, sorting algorithms, and complexity analysis.

Uploaded by

kunalsinghjayant.05
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

Printed Page 1 of 2 Sub Code:KOE035

Paper Id: 199359 Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

B. TECH
(SEM III) THEORY EXAMINATION 2019-20
BASICS DATA STRUCTURE AND ALGORITHMS
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A

1. Attempt all questions in brief. 2 x 10 = 20


Qno. Question Marks CO
a. What is primitive data type? 2 CO1
b. Define sparse matrix. 2 CO1
c. What is PUSH and POP operation. 2 CO2
d. What are two fields in Link list 2 CO2
e. What is Binary Tree? 2 CO3
f. What is AVL Tree. 2 CO3
g. Explain Adjacency list for any graph 2 CO4
h. Explain connected components 2 CO4
i. What is unstable sorting? 2 CO4
j. What is hoisting? 2 CO4
SECTION B
www.aktuonline.com

2. Attempt any three of the following: 3 x 10 = 30


Qno. Question Marks CO
a. Explain asymptotic notations. Define Big-Oh notation and find the 10 CO1
complexity of the following recursive function
T(n) = 4T(n/2)+nlogn
b. Show the addition of given polynomials using linked list: 10 CO2
P=3X^2+2X+7 Q=5X^3+2X^2+X
c. What is binary search tree? Make a binary search tree for following 10 CO3
sequence: 8 7 17 25 23 6 9 2 15 22 12 1
d. Differentiate between BFS and DFS with suitable example. 10 CO4
e. What is stable sorting? Explain quick sort in detail. 10 CO4
SECTION C
3. Attempt any one part of the following: 1 x 10 = 10
Qno. Question Marks CO
a. How do you find the complexity of an algorithm? What is the relation 10 CO1
between the time and space complexities of an algorithm? Justify your
answer with an example
b. Define queue. Explain various operations performed on queue with 10 CO5
suitable example

4. Attempt any one part of the following: 1 x 10 = 10


Qno. Question Marks CO
a. What is recursion? Write a C code to solve tower of Hanoi problem. 10 CO2

b. Write an algorithm for conversion of infix to postfix expression. 10 CO3


Translate infix expression into its equivalent post fix expression:
A * (B+D)/E-F * (G+H/I()
1|P a ge
http://www.aktuonline.com
Printed Page 2 of 2 Sub Code:KOE035
Paper Id: 199359 Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

5. Attempt any one part of the following: 1 x 10 = 10


Qno. Question Marks CO
a. Draw a binary tree which following traversal: 10 CO4
In order: DBHEAIF J CG
Preorder: ABDEHCFIJG
b. What is Threaded Binary Tree? Explain insertion and deletion 10 CO4
algorithms on threaded binary trees

6. Attempt any one part of the following: 1 x 10 = 10


Qno. Question Marks CO
a. Differentiate between Prims and Kruskal Algorithms with example. 10 CO2
b. Write Short notes on: 10 CO2
i) Walk
ii) Path
iii) Topological sort

7. Attempt any one part of the following: 1 x 10 = 10


www.aktuonline.com

Qno. Question Marks CO


a. Explain merge sort. Discuss its worst-case time complexity. 10 CO4
b. What is B-Tree? Differentiate between B-Tree & B+ Tree. 10 CO3

2|P a ge
http://www.aktuonline.com

You might also like