Deterministic and non-deterministic computation, Turing machines, post machines, RAMs and their equivalence, universal Turing machine, halting problem, solvability and undecidability, Rice's theorem, equivalence of general recursive and Turing computable function;(introduction to theory of formal languages and their relation to automata, introduction to complexity theory.
Introduction to algorithms, Time, and Space Complexity, Basic elements of data structures like linked lists, stacks and queues, trees, graphs, recursion. Different types of sorting algorithms and their complexities
Introduction, Array, amortized time analysis, red black trees, hashing, heaps, dynamic equivalence relations and union-find programs, priority queues with decrease key operations, traversing graphs, DFS, strongly connected components, bioconnected complaints, minimum spanning tree algo., single source shortest paths,all pair shortest paths.
This action might not be possible to undo. Are you sure you want to continue?