Learn more about IndiaStudyChannel
Install Alexa Toolbar
and earn more...
 
Communities Members BookmarksPolls Fresher Jobs Funny Pictures MCA Projects New Member FAQ  



My Profile
Active Members
TodayLast 7 Days more...



Awards & Gifts
Online Exams

Fresher Jobs


Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian cities including Bangalore, Chennai, Hyderabad, Pune or Kochi

Resources


Find educational articles, blogs, discussion threads and other resources.

Colleges


Find details about any college in India or search for courses.

website counter



Download Model question papers & previous years question papers

Posted By: Sra1       Member Level: Diamond       Posted Date: 27 May 2008

2007 Jawaharlal Nehru Technological University B.Tech Computer Science & Engineering DESIGN AND ANALYSIS OF ALGORITHMS (Supplimentary Examinations, Aug/Sep 2007) Question paper



Course: B.Tech Computer Science & Engineering   University: Jawaharlal Nehru Technological University




Set No 4
-------------------
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks

1. (a) Define omega notation. Explain the terms involved in it. Give an example.
(b) Show that f1(n)×f2(n) = 0(g1(n)×g2(n) wheref1(n) = 0(g1(n) and f2(n) = 0(g2(n)). [10+6]
2. (a) Write and explain the control abstraction for Divide and conquer.
(b) Suggest refinements to mergesort to make it in-place. [8+8]
3. (a) What is spanning tree? Explain the prim’s algorithm with an example.
(b) Explain the terms Feasible solution, optimal solution and objective function.
[10+6]
4. (a) Explain the OBST algorithm.
(b) Find the shortest tour of a TSP for following instance using dynamic programming [8+8]
5. (a) Explain the properties of depth-first search.
(b) Write a non-recursive algorithm of Post-order traversal of a tree and also analyze its time complexity. [6+10]
6. (a) Draw the state space tree for m coloring when n=3 and m=3
(b) Write a recursive backtracking algorithm. [8+8]
7. Write the LCBB algorithm for the 0/1 Knapsack problem. Also Analyse its complexity. [16]
8. (a) Explain the classes of NP-hard and NP-complete.
(b) Describe clique decision problem and write the algorithm for the same. [8+8]





Return to question paper search

Next Question Paper: DESIGN AND ANALYSIS OF ALGORITHMS (Supplimentary Examinations, Aug/Sep 2007)

Previous Question Paper: LINEAR IC APPLICATIONS (Supplimentary Examinations, Aug/Sep 2007)

Related Question Papers:


  • BIODIVERSITY IPR AND MANAGEMENT OF BIOTECHNOLOGY Set No 1


  • III B.Tech Supplimentary Examinations, Aug/Sep 2008 MATHEMATICAL MODELLING AND SIMULATION


  • object oriented programming using java (set 1)


  • ELECTRO METALLURGY AND CORROSION (Metallurgy & Material Technology) - Set 1


  • BIO PROCESS ECONOMICS AND PLANT DESIGN


  • Categories


    Submit Previous Years University Question Papers and make money from adsense revenue sharing program

    Are you preparing for a university examination? Download model question papers and practise before you write the exam.

    Watch TV Channels



    Contact Us    Editors    Privacy Policy    Terms Of Use   

    ISC Technologies. 2006 - 2008 All Rights Reserved.