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 2020 March CSE-IT 5th Sem CS 307 Design And Analysis Of Algorithms Question Paper

Download PTU (I.K. Gujral Punjab Technical University Jalandhar (IKGPTU) ) BE/BTech CSE/IT (Computer Science And Engineering/ Information Technology) 2020 March 5th Sem CS 307 Design And Analysis Of Algorithms Previous Question Paper

This post was last modified on 21 March 2020

Download Document
Download Document

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


FirstRanker.com

Roll No. [ TTTTTT] [ ] Total No. of Pages : 02
Total No. of Questions : 18

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

B.Tech. (CSE) (Sem.=5)
DESIGN AND ANALYSIS OF ALGORITHMS
Subject Code : CS-307
M.Code : 56526
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 ---

Write briefly :

  1. How is the time complexity measured?
  2. What is dynamic programming?
  3. What is a deterministic algorithm?
  4. What do you mean by the running time of an algorithm?

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

  5. What are P and NP problems?
  6. What is the working principle of quicksort?
  7. What are NP-complete algorithms?
  8. What do you understand by Divide and Conquer strategy?
  9. Are the sub solutions overlapping in dynamic programming approach?

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

  10. What is the branch and bound technique?

SECTION-B

Find the Big-OH notations for the following functions :

  1. a) f(n) - 78889
  2. b) f(n)=6n"+135

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

  3. c) f(n)=7n"+8n+56
  4. d) f(n)=n*+35n"+84
  1. What do you analyze in an algorithm? What is the basis of analysis? Explain
  2. What are greedy algorithms? What are their characteristics? Explain any greedy algorithm with example.
  3. Explain the KMP algorithm in detail with an illustrative example.

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

  4. Write an algorithm to solve APSP problem.

SECTION-C

  1. Consider five items along with their respective weights and values :
    I=<il, 12, i3, i4, i5>
    w =<5,10,20,30,40>

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

    v =<30,20,100,90,160>
    The capacity of the knapsack W = 60.Find the solution for the fractional knapsack problem.
  2. What is the relationship among P, NP and NP complete problems? Show with the help of a diagram.
  3. Compare the various programming paradigms such as divide-and-conquer, dynamic programming and greedy approach.

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

FirstRanker.com



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

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

This post was last modified on 21 March 2020