Friday, May 9, 2014

DAA DESIGN AND ANALYSIS OF ALGORITHMS QUESTIONS FOR GATE



Syllabus for DAA in GATE and Various Competitive Exams

Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis(best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete. 

Topic wise Questions and Answers with Explanations 


1 comment:

  1. Thanks for sharing information.If anyone is searching for Gate coaching institutes in pune then I.C.E GATE institute is the best place for you.For more details,Contact I.C.E Gate Institute.

    ReplyDelete