FirstRanker Logo

FirstRanker.com - FirstRanker's Choice is a hub of Question Papers & Study Materials for B-Tech, B.E, M-Tech, MCA, M.Sc, MBBS, BDS, MBA, B.Sc, Degree, B.Sc Nursing, B-Pharmacy, D-Pharmacy, MD, Medical, Dental, Engineering students. All services of FirstRanker.com are FREE

📱

Get the MBBS Question Bank Android App

Access previous years' papers, solved question papers, notes, and more on the go!

Install From Play Store

Download PTU B-Tech CSE-IT 2020 Dec 4th Sem 77540 Design And Analysis Of Algorithms Question Paper

Download PTU (I.K.Gujral Punjab Technical University (IKGPTU)) B-Tech (Bachelor of Technology) (CSE-IT)- Computer Science Engineering -Information Technology 2020 December 4th Sem 77540 Design And Analysis Of Algorithms Previous Question Paper

This post was last modified on 13 February 2021

This download link is referred from the post: PTU B.Tech Question Papers 2020 December (All Branches)


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 ALGORITHMS
Subject Code : BTIT-403-18
M.Code : 77540
Time : 3 Hrs. Max. Marks : 60

INSTRUCTIONS TO CANDIDATES :

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

  1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
  2. SECTION-B contains FIVE questions carrying FIVE marks each and students have to attempt any FOUR questions.
  3. 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 ---

  1. How to measure an algorithm’s running time?
  2. What do you mean by “worst case efficiency of an algorithm”?
  3. Differentiate between graph and tree.
  4. What is minimal spanning tree?
  5. Give an example of dynamic programming approach.
  6. --- Content provided by FirstRanker.com ---

  7. What are the graph traversal techniques?
  8. State approximation technique.
  9. Give an example of dynamic programming approach.
  10. Differentiate between time efficiency and space efficiency.
  11. What is flow network?
  12. --- Content provided by FirstRanker.com ---

1| M-77540 (S2)-330


FirstRanker.com


FirstRanker.com

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

Firstranker's choice
FirstRanker.com

SECTION-B

  1. Write a short note on greedy strategy to solve a problem.
  2. 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
  3. What is the relationship among P, NP and NP complete problems? Show with the help of a diagram.
  4. Traverse all the vertices of above figure using breadth-first search.
  5. Find the adjacency list and adjacency matrix of below figure.

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

    A7

SECTION-C

  1. Explain the advantages of using dynamic programming. Introduce travelling salesman problem. Explain the technique to solve travelling salesman problem using this technique.
  2. Why do we perform topological sorts only on directed acyclic graph? Explain
  3. Discuss Heuristics and its characteristic.
  4. --- 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


FirstRanker.com


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


This download link is referred from the post: PTU B.Tech Question Papers 2020 December (All Branches)