Sunday, July 1, 2018
DAA DESIGN AND ANALYSIS OF ALGORITHMS QUESTIONS FOR GATE
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) Test 1 (Asymptotic notations, space and time complexity)
2) Test 2 (Divide and conquer, Dynamic Programming, Sorting Techniques)
3) Test 3 (P, NP, NP-hard, NP Complete)
4) Grand Test 1 (Questions from whole subject)
5) Grand Test 2 (Questions from whole subject)
Gate Motivational Tips (NEW)
Dos and Donts for Gate Preparation (NEW)
Gate Motivational Tips (NEW)
Dos and Donts for Gate Preparation (NEW)
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.