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 5th Sem 70536 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 5th Sem 70536 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) (2012 to 2017) (Sem.-5)
DESIGN & ANALYSIS OF ALGORITHMS
Subject Code : BTCS-503
M.Code : 70536
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 the following briefly :

  1. What is asymptotic notation?
  2. Define Big Oh.
  3. What are the steps involved in proving a problem to be NP complete?
  4. What are the applications of Fast Fourier transform?
  5. --- Content provided by FirstRanker.com ---

  6. How the Prim’s algorithm is better in finding the Minimal spanning tree in comparison to the Kruskal’s method?
  7. What is the time complexity of the algorithm for finding all-pairs-shortest-path problem?
  8. What are NP class problems?
  9. What is the minimal spanning tree? What are its advantages?
  10. What is a deterministic algorithm?
  11. --- Content provided by FirstRanker.com ---

  12. Distinguish between deterministic and non-deterministic algorithms.

SECTION-B

  1. What is the relationship between the classes P and NP? Explain. (5)
  2. Explain the Big -Oh computation for each of the following control structures : (5)
    a) Sequencing b) If-then-else c) “for” loop

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

    d) “While” loop e) Recursion
  3. What do you analyze in an algorithm? What is the basis of analysis? Explain. (5)
  4. Explain topological sort with an example. (5)
  5. What are greedy algorithms? What are their characteristics? Explain any greedy algorithm with example. (5)

SECTION-C

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

  1. Explain the KMP algorithm in detail with an illustrative example. (10)
  2. Explain in detail quick sorting method. Provide a complete analysis of quick sort. (10)
  3. Order the following functions by growth rate: N, N1.5, N log log N, N log2 N, N log (N2), 2/N, 2N, 2√N, N2 log N, N4. Indicate which functions grow at the same rate. (10)

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.

FirstRanker.com

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



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

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