Compilers, Spring 2003
This course is being taught by Prof.
Benjamin Goldberg. It
involves understanding the rudiments of building a fairly useful
compiler for a subset of the pascal language. Assignments include
building a lexer and a parser using tools like flex and yacc
respectively. Then, a semantic analysis followed by generation of a
compact intermediate code leads finally to a compiler generating
assembly code.
Fundamental
Algorithms, Fall 2002
This course was taught by Prof.
Chee Yap. It is an introductory course on the subject of algorithms.
The Mathematics required for analysis of algorithms was developed. A
good deal of algorithmic techniques like Divide and Conquer, Dynamic
Programming etc., were introduced alongwith the basics of more
advanced topics like NP-completeness. A range of applications of
algorithmic techniques to sorting, graph theory etc., were
demonstrated.