Download DBATU B.Tech 2019 Oct-Nov CSE 3rd Sem Data Structure Question Paper

DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

Mid Semester Examination - Oct 2019

Course: B. Tech in Comp Science & Engineering Sem: III

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

Subject Name: Data Structure

Max Marks: 20

Date: 5/10/19

Subject Code: BTCOC303

Duration: 1 Hr.

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

Instructions to the Students:

1. Check whether you have received the right question paper.
2. Assume suitable data, wherever required.

2.1 Attempt the following questions:

1. Sparse matrices have
   1. many zero entries

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

   2. many non-zero entries
   3. higher dimension
   4. none of these
2. What are the disadvantages of arrays?
   1. We must know beforehand how many elements will be there in the array

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

   2. There are chances of wastage of memory space if elements inserted in an array are lesser than than the allocated size.
   3. Insertion and deletion becomes tedious.
   4. All of the mentioned
3. Assuming int is of 4 bytes, what is the size of int arr[15];?
   1. 15

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

   2. 19
   3. 11
   4. 60
4. The space factor when determining the efficiency of algorithm is measured by
   1. Counting the maximum memory needed by the algorithm

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

   2. Counting the minimum memory needed by the algorithm
   3. Counting the average memory needed by the algorithm
   4. Counting the maximum disk space needed by the algorithm
5. The complexity of linear search algorithm is
   1. O(n)

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

   2. O(log n)
   3. O(n²)
   4. O(n log n)
6. The elements of an array are stored successively in memory cells because
   1. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

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

   2. the architecture of computer memory does not allow arrays to store other than serially
   3. both of above
   4. none of above

Q.2 Solve Any Two of the following.

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

1. (A) Explain open addressing with its different types in detail.
2. (B) What are the different Asymptotic notations? Explain them in detail.
3. (C) Explain Linear search with code & an example.

Q.3 Solve Any One of the following.

1. (A) Explain radix sort with example.

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

2. (B) Write the algorithm for finding transpose of sparse matrix and explain its logic.

*** All the best ***

FirstRanker.com

Firstranker's choice

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