Download PTU B.Tech 2021 Jan Software Engineering 3rd Sem 78675 Data Structure And Algorithms Question Paper

Download PTU (Punjab Technical University) B.Tech (Bachelor of Technology) / BE (Bachelor of Engineering) 2021 January Software Engineering 3rd Sem 78675 Data Structure And Algorithms Previous Question Paper

Roll No.
Total No. of Pages : 02
Total No. of Questions : 18
B.Tech. (Software Engineering) (Sem.?3)
DATA STRUCTURE & ALGORITHMS
Subject Code : SE-301-19
M.Code : 78675
Time : 3 Hrs. Max. Marks : 60
INST RUCT ION TO CANDIDAT ES :
1 .
SECT ION-A is COMPULSORY cons is ting of TEN questions carrying TWO marks
each.
2 .
SECT ION-B c ontains F IVE questions c arrying FIVE marks eac h and s tud ents
have to atte mpt any FOUR q ues tions.
3 .
SECT ION-C contains THREE questions carrying T EN marks e ach and s tudents
have to atte mpt any T WO questio ns.
SECTION-A
Write briefly :
1)
Big `O' Notation
2)
Applications of Stack
3)
In-degree
4)
Dynamic memory allocation
5)
Advantages of Linked List over Array
6)
Polish Notation
7)
AVL Tree
8)
Binary Tree
9)
Algorithm
10) Dangling Pointer
1 | M - 78675
(S2)-480

---

SECTION-B
11) What is Data Structure? Explain various operations on it.
12) Differentiate between stacks and queue. How they are implemented using linked list?
13) Explain depth first search and breadth first search in graphs.
14) Write a program/algorithm to generate Fibonacci series using recursion.
15) Explain the working of quick sort with example.
SECTION-C
16) A Binary Tree T has 9 nodes :
Inorder :
E
A
C
K
F
H
D
B
G
Preorder :
F
A
E
K
C
D
H
G
B
17) What is Heap? How to insert and delete a node from heap?
18) Define hashing and hash table. Also explain the concept of collision and its resolution.
NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any
page of Answer Sheet will lead to UMC against the Student.
2 | M - 78675
(S2)-480

---