Download PTU (I.K.Gujral Punjab Technical University (IKGPTU)) B-Tech (Bachelor of Technology) (CSE-IT)- Computer Science Engineering -Information Technology 2020 December 3rd Sem 56594 Data Structures Previous Question Paper
Roll No.
Total No. of Pages : 02
Total No. of Questions : 18
B.Tech. (CSE)/(IT) (2012 to 2017)
(Sem.?3)
DATA STRUCTURES
Subject Code : BTCS-304
M.Code : 56594
Time : 3 Hrs. Max. Marks : 60
INST RUCT IONS T O 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
has to attempt any FOUR qu estio ns.
3 .
SECT ION-C contains THREE questions carrying T EN marks e ach and s tudents
has to attempt any TWO questions.
SECTION-A
Write Briefly :
1.
Differentiate between Stack and Queue.
2.
What are the circular queues and their use?
3.
Why it is necessary to analyze an algorithm?
4.
Define Priority Queue.
5.
How heaps are represented in memory?
6.
What is data structure for graphs?
7.
What are AVL trees?
8.
Define Sparse Matrices.
9.
What is the purpose of garbage Collection?
10. What is sorting and searching?
1 | M-56594
(S2)-194
SECTION-B
11. Write an algorithm to implement Quick sort.
12. Are B trees of order 2 are full binary trees? If yes, explain how.
13. Make a binary search tree by considering the following eight numbers :
55, 34, 41, 24, 74, 38, 65, 49
14. Write an Algorithm to traverse a graph using Breadth First Search.
15. Build a heap H from the following list of numbers :
42, 35, 5, 8, 34, 56, 70, 32
SECTION-C
16. Consider an array: 99, 2, 34, 17, 75, 12 Depict the state of the array after each pass if
selection sort is applied.
17. Suppose a binary tree T is in memory. Write non-recursive procedure for each of the
following :
a) Finding the number of nodes in T.
b) Finding the depth D of T.
c) Find the number of terminal nodes in T.
18. a) Suppose weighted graph G is maintained in memory by a node array DATA and
weight matrix W as follows :
0
0
3
0
5 0 1 7
W
2 0 0 4
0
6 8
0
Draw the picture of G.
b) Write an algorithm to delete an node from linked list.
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-56594
(S2)-194
This post was last modified on 13 February 2021