GATE CS Algorithms Online Test

Home/CS Algorithms
CS Algorithms 2017-04-12T19:37:39+00:00

Syllabus

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.

Analysis of Previous GATE Papers

Exam Year 03 04 05 06 07 08 09 10 11 12 13
1 Mark Questions 3 1 2 7 2 0 3 1 1 3 4
2 Mark Questions 5 7 7 5 8 11 5 3 3 3 3
Total Marks 13 15 16 17 18 22 13 7 7 9 10

 

Exam Year 2014
Set Set 1 Set 2 Set 3
1 Mark Questions 2 2 1
2 Mark Questions 2 2 3
Total Marks 6 6 7

 

Avada WordPress Theme