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.
|
Download Model question papers & previous years question papers
|
Posted By: kiranmai Member Level: Bronze Posted Date: 26 Jul 2008
|
2007 Andhra Pradesh State Osmania University Computer Science m.sc second semister examination SUB: DAA Question paper
SECTION-A
1.What is algorithm? Define Time Complexity and Space Complexity of Algorithms.
2.Explain hashing with examples.
3.Explain binary search tree with example.
4.Find minimum and maximum merge sort.
5.Explain reliability design problem.
6.Explain travelling salesman problem.
7.Define Back travelling . Explain 8-queens problem.
8. What is NP-hard and NP-completeness?
SECTION-B
9. (a) What is data structure ? Explain sorting and searching algorithms for a heap sort with example.
OR
(b) Explain sets representation,UNION,FIND operations in detail.
10. (a) Describe divide- and - conquer method
11,2,9,13,57,25,17,1,90,30 sort the given elements using selection sort and write the complexity of selection sort.
OR
(b) Discuss a minimum spanning tree with example. List its advantages.
11. (a) What is O/I knapsack ? Discuss game trees in detail.
OR
(b) What is multistage graph? Explain difference between disconnected components and depth-first search with example.
12. (a) Describe Coole's theorem.
OR
(b) Explain the following with example:
(i) Graph coloring
(ii) Hamitonian cycles
Return to question paper search
|
|
|
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
|