Mathematical methods for characterizing and analyzing discrete systems. Modern algebraic concepts, logic theory, set theory, grammars and formal languages, and graph theory. Application to the analysis of computer systems and computational structures.
Graduate Introduction to Computational Complexity
CSE1729 is a rigorous introduction to programming based on the famous Structure and Interpretation of Computer Programs.
The course will delve into methods and techniques used to solve combinatorial optimization problems with examples drawn from industry and covering scheduling, resource allocation or routing to name just a few. It will focus on mainstream optimization techniques with an emphasis on mathematical programming (e.g., Linear Programming, Integer Programming, Constraint Programming).
CSE3150 is a two credits course offered concurrently with CSE3100 during the last two thirds of the semester. The course picks up with the knowledge of C and covers all the essential capabilities of C++, illustrating their specificities as well as how the language can be used to model object-oriented implementation of a number of classic problems.
The course will get stated on the week of February 5, 2018 and will spread over the last 11 weeks of the semester (excluding the spring break week). This is meant to be the normal schedule for this 2 credit course so that students taking CSE3100 can complete the segment on C before starting C++ Essentials. We will follow the same schema this semester.