| Course |
CSE213 |
| Title |
Foundations of Computer Science II |
| Credits |
3 |
| Course Coordinator |
Leo Bachmair |
| Current Catalog Description |
A continuation of CSE 113 focusing on the descriptive formalisms relevant to computing, including set theory and its application to quantifiers, relations and graphs, combinatorics , and finite state machines. |
| Prerequisite |
CSE 113 (foundations of CSE) |
| Course Goals |
- Continue the development of a strong theoretical foundation for subsequent courses in the computer science curriculum.
- Introduce descriptive structures such as sets, equivalence relations, and partial orders.
- Introduce construction techniques for formal languages, including grammars and inductive definitions.
- Provide students with more advanced proof techniques based on predicate logic and well-founded induction.
|
| Textbook |
Discrete Math, Ross & Wright 5th edition, Prentice Hall ISBN: 0130652474 |
| Major Topics Covered in Course |
- Set theory (basic concepts, set operations, finite and infinite sets)
- Ordered Structures (tuples, lists, strings and languages)
- Construction Techniques (inductively defined sets, grammars)
- Relations (equivalence relations, closures of relations, order relations, well-founded induction)
- Predicate logic (predicates and quantifiers, equivalence of formulas, formal proofs)
|
| Laboratory Projects |
No laboratory projects required |
| Course Webpage |
http://www.cs.sunysb.edu/~cse213 |
