FirstRanker.com
Firstranker's choice
FirstRanker.com
--- Content provided by FirstRanker.com ---
Roll No. ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ Total No. of Pages : 02
Total No. of Questions : 18
B.Tech. (IT) (2018 Batch) (Sem.-4)
--- Content provided by FirstRanker.com ---
DESIGN & ANALYSIS OF ALGORITHMSSubject Code : BTIT-403-18
M.Code : 77540
Time : 3 Hrs. Max. Marks : 60
INSTRUCTIONS TO CANDIDATES :
--- Content provided by FirstRanker.com ---
- SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
- SECTION-B contains FIVE questions carrying FIVE marks each and students have to attempt any FOUR questions.
- SECTION-C contains THREE questions carrying TEN marks each and students have to attempt any TWO questions.
SECTION-A
Answer briefly :
--- Content provided by FirstRanker.com ---
- How to measure an algorithm’s running time?
- What do you mean by “worst case efficiency of an algorithm”?
- Differentiate between graph and tree.
- What is minimal spanning tree?
- Give an example of dynamic programming approach.
- What are the graph traversal techniques?
- State approximation technique.
- Give an example of dynamic programming approach.
- Differentiate between time efficiency and space efficiency.
- What is flow network?
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
1| M-77540 (S2)-330
--- Content provided by FirstRanker.com ---
Firstranker's choiceFirstRanker.com
SECTION-B
- Write a short note on greedy strategy to solve a problem.
- Solve the following problem by using least cost branch and bound method :
--- Content provided by FirstRanker.com ---
Knapsack instance n =4, p(1:4) = {1,1,12,18} and
Weight w (1:4) =(2,4,6,9) & max capacity m =15 - What is the relationship among P, NP and NP complete problems? Show with the help of a diagram.
- Traverse all the vertices of above figure using breadth-first search.
- Find the adjacency list and adjacency matrix of below figure.
--- Content provided by FirstRanker.com ---
A7
SECTION-C
- Explain the advantages of using dynamic programming. Introduce travelling salesman problem. Explain the technique to solve travelling salesman problem using this technique.
- Why do we perform topological sorts only on directed acyclic graph? Explain
- Discuss Heuristics and its characteristic.
--- 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.
2 | M-77540 (S2)-330
--- Content provided by FirstRanker.com ---
This download link is referred from the post: PTU B.Tech Question Papers 2020 December (All Branches)