PTU B.Tech ECE 5th Semester May 2019 70544 DATA STRUCTURES Question Papers

PTU Punjab Technical University B-Tech May 2019 Question Papers 5th Semester Electronic and Communication Engineering (ECE-EIE)

Roll No.
Total No. of Pages : 02
Total No. of Questions : 09
B.Tech.(ECE)/(ETE) (2011 Onwards)
B.Tech.(Electronics Engg.) (2012 Onwards)
(Sem.?5)
DATA STRUCTURES
Subject Code : BTCS-304
M.Code : 70544
Time : 3 Hrs. Max. Marks : 60
INSTRUCTION TO CANDIDATES :
1.
SECTION-A is COMPULSORY consisting of TEN questions carrying T WO marks
each.
2.
SECTION-B contains FIVE questions carrying FIVE marks each and students
have to attempt any FOUR questions.
3.
SECTION-C contains T HREE questions carrying T EN marks each and students
have to attempt any T WO questions.




SECTION-A
Q1
Answer briefly :

a) Dangling pointers

b) Queue

c) Complexity of Linear Search

d) Heaps

e) Out degree in graphs

f) Linked Lists

g) Sparse matrix

h) Rehashing

i) Big `O' notation

j) AVL Trees
1 | M-70544

(S2)-161

---

SECTION-B
Q2.
Write a note on Arrays.
Q3.
Write an algorithm to insert in an item in the beginning on circular queue.
Q4.
Differentiate between BFS and DFS in graphs.
Q5.
Discuss various operations on queue.
Q6.
Write an algorithm for binary search.

SECTION-C
Q7.
Create a BST of 15 nodes. Write all 3 traversals.
Q8.
What do you mean by infix, prefix and postfix expressions? How to evaluate postfix?
Q9.
Discuss with example procedure of radix sort.











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-70544

(S2)-161

---