This download link is referred from the post: DBATU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. Babasaheb Ambedkar Technological University
DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE
Mid Semester Examination Sept. 2019
Course: B. Tech in Information Technology
Subject Name: Design and Analysis of Algorithms
--- Content provided by FirstRanker.com ---
Sem: V
Subject Code: BTITC502
Max Marks: 20
Date: 19/09/2019
Duration: 1 Hr.
--- Content provided by FirstRanker.com ---
Instructions to the Students:
- Assume suitable data wherever necessary.
Q.1 Select any one option from the following questions. (6 Marks)
- Which of the following standard algorithms is not a Greedy algorithm? (CO2)
- Dijkstra's shortest path algorithm
- Prim's algorithm
- Kruskal algorithm
- Huffman Coding
- Bellman Ford Shortest path algorithm
--- Content provided by FirstRanker.com ---
- The 0-1 Knapsack problem can be solved using Greedy algorithm. (CO2)
- True
- False
--- Content provided by FirstRanker.com ---
- Time required to merge two sorted lists of size m and n, is (CO3)
- O(mn)
- O(m+n)
- O(m log n)
- O(n log m)
--- Content provided by FirstRanker.com ---
- What is the worst-case time for binary search finding a single item in an array? (CO3)
- Linear time
- Quadratic time
- Logarithmic time
- Constant time
--- Content provided by FirstRanker.com ---
- What is the worst-case time for quick sort to an array of n elements? (CO3)
- O(log n)
- O(n log n)
- O(n)
- O(n²)
--- Content provided by FirstRanker.com ---
- Which of the following is/are the operations performed by Kruskal's algorithm? (CO2)
- sort the edges of G in increasing order by length
- keep a subgraph S of G initially empty
- builds a tree one vertex at a time
--- Content provided by FirstRanker.com ---
- i, and ii only
- ii and iii only
- i and iii only
- All i, ii and iii
--- Content provided by FirstRanker.com ---
Q.2 Solve Any Two of the following. (3X2)
- Write an algorithm for knapsack problem using greedy method. What is its time complexity? (CO1)
- Explain quick sort with respect to its: (CO2)
- Best case behavior
- Worst case behavior
- What is the time complexity of it?
--- Content provided by FirstRanker.com ---
- Sort the following no. using merge sort: 10, 50, 87, 73, 64, 92, 23, 34, 54, 18, 36. (CO3)
Q.3 Solve Any One of the following. (8)
- We want to merge some sorted files where the no. of records are: {12, 34, 56, 73, 24, 11, 34, 56, 78, 91, 34, 91, 62} what is the optimal way to merge them? (CO3)
- Solve the travelling salesmen problem for the graph given below, adjacency matrix for the graph is (CO4)
--- Content provided by FirstRanker.com ---
1 2 3 4 1 0 4 1 3 2 4 0 2 1 3 1 2 0 5 4 3 1 5 0
*** End ***
--- Content provided by FirstRanker.com ---
This download link is referred from the post: DBATU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. Babasaheb Ambedkar Technological University