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: Haritha       Member Level: Bronze       Posted Date: 29 May 2008

2008 Osmania University M.C.A Computer Aplications MCA II Year II Sem (New) Design & Analysis Of Algorithms Question paper



Course: M.C.A Computer Aplications   University: Osmania University




Code No. : 3828/N

FACULTY OF INFORMATICS
MCA II YEAR II SEMESTER (New) Main Examination
May - 2008
DESIGN & ANALYSIS OF ALGORITHMS

Time : 3 Hours] [Max. Marks : 80


Note : Answer one question from each unit. All questions carry equal marks.



UNIT - I

1. (a) Briefly explain how to analyze algorithms. [Marks 8]

(b) What is Heap ? How to delete an element from the Heap ? [Marks 8]


OR

2. (a) Define the following notations
(i) BigOh
(ii) Omega
(iii) Theta [Marks 8]

(b) Write an algorithm to add an element to a circular queue. [Marks 8]


UNIT - II

3. Write the quick sort algorithm using divide and conquer strategy. [Marks 16]

OR

4. What is minimum spanning tree ? Write Prim's algorithm for finding minimum spanning tree. [Marks 16]


UNIT - III

5. Write BFS and DFS algorithms. Explain their working with suitable examples. [Marks 16]

OR

6. Write an algorithm to find an Optimal Binary Search tree using dynamic programming. [Marks 16]


UNIT - IV

7. What is M-Colorability optimisation problem ? Write an algorithm that finds all M-Colorings of a
Graph. [Marks 16]

OR

8. Explain how the branch and bound technique can be used to solve 0/1 Knapsack problem. [Marks 16]


UNIT - V

9. State and prove Cook's Theorem. [Marks 16]

OR

10. What is Directed Hamiltonian Cycle ? Prove that CNF - Satisfiability reduces to Directed Hamiltonian
Cycle. [Marks 16]










Return to question paper search

Next Question Paper: DATABASE MANAGEMENT SYSTEMS NOV/DEC 2006

Previous Question Paper: Microbiology

Related Question Papers:


  • Software Engineering


  • Programming Lab-IV(Data Structure in C ++)


  • BHMCT II Year I Semester (Main) Examination, December 2008


  • Data Communications and Networking


  • BHMCT III Year- II Semester-F&B Management-May 2008


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