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 77629 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 77629 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

Total No. of Pages : 02
Total No. of Questions : 18

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

B.Tech. (CSE) (2018 Batch) (Sem.-4)
DESIGN & ANALYSIS OF ALGORITHMS
Subject Code : BTCS-403-18
M.Code : 77629
Time : 3 Hrs. Max. Marks : 60

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

INSTRUCTIONS TO CANDIDATES :

  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

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

Answer briefly :

  1. “Asympotic notation Q is transitive”. Justify.
  2. Define P and NP class problem.
  3. Give recurrence relation in general for computing complexity of divide and conquer algorithm.
  4. Define live node and dead node.
  5. --- Content provided by FirstRanker.com ---

  6. Solve the recurrence equation T(n)=9 T(n/3)+n.
  7. What is flow network?
  8. What is time and space complexity?
  9. Define dynamic programming approach.
  10. Write any algorithm to find shortest path.
  11. --- Content provided by FirstRanker.com ---

  12. What is Cook’s theorem?

SECTION-B

  1. Explain the term Algorithm with its characteristics.
  2. What is Knapsack problem? Justify that “All optimal solutions will fill the knapsack exactly”.
  3. Explain the general method of Branch and Bound.
  4. --- Content provided by FirstRanker.com ---

  5. Give a set S=<1, 4, 5, 6, 7, 3> and W=12. Obtain the sum of subset using backtracking approach.
  6. Define flow network and write an iterative Ford-Fulkerson’s method for solving Max-Flow problem.

SECTION-C

  1. Explain Depth First Search and Breadth First Search method with example.
  2. Explain Greedy method with suitable example.
  3. --- Content provided by FirstRanker.com ---

  4. Find the minimum spanning tree for the graph given below :

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 ---

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