The course is about sets which are discrete in nature. It starts from ways of describing them, then size estimates of sets (combinatorics), and then culminates in studying structured sets. After completing the course, the student will be able to:
(1) Use logical notation to define and reason mathematically about the fundamental data types and structures (such as numbers, sets) used in computer algorithms and systems. (2) Comprehend and Evaluate rigour in the definitions and conclusions about mathematical models and identify fallacious reasoning and statements. (3) Identify and Apply properties of combinatorial structures and properties - know the basic techniques in combinatorics and counting.
(4) Analyze sets with operations, and identify their structure. (5) Reason and Conclude properties about the structure based on the observations. (6) Gain the conceptual background needed to be able to identify structures of algebraic nature, and discover, prove and use properties about them.
- Teacher: prangan Pandu Rangan C