Download PTU B.Sc IT (BCA) 2019 May 3rd Semester 74060 DATA STRUCTURES Question Paper

Firstranker's choice

FirstRanker.com

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 :

1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.

--- Content provided by FirstRanker.com ---

2. SECTION-B contains SIX questions carrying TEN marks each and students have to attempt any FOUR questions.

SECTION-A

1. Answer briefly :
   1. Give the names of linear data structure.
   2. Give the names of non-linear data structure.
   3. When is a binary search best applied?

   --- Content provided by FirstRanker.com ---

   4. What is a linked list?
   5. List out different operations you can perform on tree.
   6. How do you reference all the elements in a one-dimension array?
   7. Write short note on multiply linked lists.
   8. Explain application of linked list.

   --- Content provided by⁠ FirstRanker.com ---

   9. What is the complexity of quicksort algorithm?
   10. In tree construction, which is the suitable efficient data structure

1 | M-74060 (S3)-815

Firstranker's choice

--- Content provided by‍ FirstRanker.com ---

FirstRanker.com

SECTION-B

2. What is average, best and worst case complexity? Define O notation of time complexity.
3. Write pseudo code to add node at the end in circular linked list. Explain doubly linked list with advantage and disadvantage of it.
4. 1. What are the various steps in which the number 86 will be found by the Binary search?

   --- Content provided by⁠ FirstRanker.com ---

   2. 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?
5. Explain operation of linked stack and linked queue. Write algorithm for push/pop operation on a linked stack.

--- Content provided by⁠ FirstRanker.com ---

6. What is the advantage of the heap over a stack? What is the minimum number of queues needed when implementing a priority queue?
7. 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

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