This download link is referred from the post: PTU B.Sc FD (Fashion Design)Last 10 Years 2010-2020 Previous Question Papers
Firstranker's choice
Total No. of Pages : 02
--- Content provided by FirstRanker.com ---
Roll No.
Total No. of Questions : 07
B.Sc.(IT) (2015 & Onward) (Sem.-3)
DATA STRUCTURES
Subject Code : BSIT-302
--- Content provided by FirstRanker.com ---
M.Code : 74060
Time: 3 Hrs.
Max. Marks : 60
INSTRUCTIONS TO CANDIDATES :
- SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
- SECTION-B contains SIX questions carrying TEN marks each and students have to attempt any FOUR questions.
--- Content provided by FirstRanker.com ---
SECTION-A
- Answer briefly :
- Give the names of linear data structure.
- Give the names of non-linear data structure.
- When is a binary search best applied?
- What is a linked list?
- List out different operations you can perform on tree.
- How do you reference all the elements in a one-dimension array?
- Write short note on multiply linked lists.
- Explain application of linked list.
- What is the complexity of quicksort algorithm?
- In tree construction, which is the suitable efficient data structure
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
1 | M-74060 (S3)-815
Firstranker's choice
--- Content provided by FirstRanker.com ---
SECTION-B
- What is average, best and worst case complexity? Define O notation of time complexity.
- Write pseudo code to add node at the end in circular linked list. Explain doubly linked list with advantage and disadvantage of it.
-
- What are the various steps in which the number 86 will be found by the Binary search?
- Suppose a sequence of numbers is given like :
5, 10, 13, 19, 63, 69, 72, 86, 97, 2
In how many steps the number 86 will be found in the linear search?
--- Content provided by FirstRanker.com ---
- Explain operation of linked stack and linked queue. Write algorithm for push/pop operation on a linked stack.
- What is the advantage of the heap over a stack? What is the minimum number of queues needed when implementing a priority queue?
- Construct a Binary tree whose nodes are as under :
Preorder : A B D G H C E F I K J
Inorder : B G H D A E C I K F J
--- Content provided by FirstRanker.com ---
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.
--- Content provided by FirstRanker.com ---
2 | M-74060 (S3)-815
This download link is referred from the post: PTU B.Sc FD (Fashion Design)Last 10 Years 2010-2020 Previous Question Papers
--- Content provided by FirstRanker.com ---