Download PTU M.Tech. Food Technology 1st Semester 75598 ADVANCES IN FOOD ENGINEERING Question Paper

Download PTU. I.K. Gujral Punjab Technical University (IKGPTU) M.Tech. Food Technology 1st Semester 75598 ADVANCES IN FOOD ENGINEERING Question Paper.

This post was last modified on 13 December 2019

Download Document

PTU M.Tech 1st Semester Last 10 Years 2010-2020 Previous Question Papers|| Punjab Technical University

Code: 13A05402

R13

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

B. Tech II Year II Semester Examinations, May - 2015

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

DESIGN AND ANALYSIS OF ALGORITHMS

(Common to CSE, IT)

Time: 3 Hours Max. Marks: 75

Note: This question paper contains two parts A and B.

Part A is compulsory which carries 25 marks. Answer all questions in Part A.

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

Part B consists of 5 Units. Answer any one full question from each unit. Each question carries 10 marks.

PART - A (25 Marks)

1. Define algorithm. What are the characteristics of an algorithm? [2M]
2. Write the control abstraction for Divide-and-Conquer strategy. [3M]
3. What is principle of optimality? [2M]
4. Define dynamic programming. [3M]
5. Write any two differences between Backtracking and Branch and Bound. [2M]
6. Define Graph Coloring. [3M]
7. What is meant by NP-Hard? [2M]
8. What is meant by NP-Completeness? [3M]
9. Define Approximation algorithm. [2M]
10. Define Biconnected graph. [3M]

PART - B (50 Marks)

(Answer all five units, choosing one question from each unit)

UNIT - I

Explain the algorithm for finding the maximum and minimum problem using Divide and Conquer technique. [10M]

OR
--- Content provided by⁠ FirstRanker.com ---
Explain the algorithm for finding the Quick Sort problem using Divide and Conquer technique. [10M]

UNIT - II

Write the algorithm for Single source shortest path problem with example. [10M]
--- Content provided by FirstRanker.com ---

OR
Explain about matrix chain multiplication with example. [10M]

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

UNIT - III

Explain Graph traversals techniques. [10M]

OR
Write and explain the algorithm for finding articulation points. [10M]

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

UNIT - IV

Explain the algorithm for sum of subsets problem. [10M]

OR
Explain the algorithm for graph coloring problem. [10M]
--- Content provided by‌ FirstRanker.com ---

UNIT - V

Explain about NP-Hard and NP-Complete problems. [10M]

OR