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 76391 Data Structure And Algorithms Previous Question Paper
Total No. of Pages : 02
Total No. of Questions : 18
B.Tech. (IT) (2018 Batch) (Sem.?3)
DATA STRUCTURE & ALGORITHMS
Subject Code : BTIT-301-18
M.Code : 76391
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
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.
How the AVL trees are different Binary trees?
2.
Write briefly about working principle of Priority Queue.
3.
How do space complexity affect performance of a program?
4.
Define Data Structure.
5.
Write name of Best Sorting Algorithm. What are its time and space complexities?
6.
What are applications of Graphs?
7.
Write down the necessary condition for a tree to become binary search tree.
8.
Define Hashing.
9.
What do you understand by shortest path in a graph?
10. List various types of linked lists and define advantage of using linked list.
1 | M-76391
(S2)- 912
SECTION-B
11. What are various operations applicable for graphs? Discuss.
12. What is the role of data structures in computer science? Discuss different mathematical
notations and time space tradeoff of data structures.
13. Elaborate following :
a) Enqueue and Dequeue operations.
b) Circular and doubly link list.
14. What are the various steps involved in insertion sort? Explain with example.
15. What is the benefit of using AVL Trees as data structure?
SECTION-C
16. What are the applications of Stack? Discuss different stack operations. Elaborate by
evaluating any sample postfix expression using stack.
17. How binary search trees are helpful in information searching in comparison to other data
structures? How they are different from AVL Trees?
18. Compare selection sort and quick sort algorithm. Explain their working.
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-76391
(S2)- 912
This post was last modified on 13 February 2021