Major concepts of compiler and algorithm design are introduced. Topics include: regular expressions, automata theory, syntactical analyzers, context free grammars and parsers, algorithms complexity, asymptotics, summations, recurrences, intractability and NP-hard problems, sorting algorithms, searching algorithms, dynamic programming and greedy algorithms.
Credit Weight:
0.5
Prerequisite(s):
Software Engineering 2570
Offering:
3-1.5; 0-0
Course Classifications:
Type C: Engineering, Mathematical and Natural Sciences