Data Structures – CST201 (2019 Scheme)

GATE SYLLABUSProgramming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide and conquer. Graph search, minimum spanning trees, and shortest paths.

Design a site like this with WordPress.com
Get started