본문 바로가기 사이드메뉴 바로가기 대메뉴 바로가기

Computer Science

Courses

Foundations of Computer Science I
Text code : CSE113 / Credit : 4
  • Prerequisites AMS 151 or MAT 125 or MAT 131
  • Textbook information  Discrete Mathematics: Introduction to Mathematical Reasoning. Susanna S. Epp. Brief Edition.

Credits 4
Course Coordinator

TBD

Description Introduction to the mathematical foundations of computer science. Topics include logic (propositional and predicate); proof techniques (induction/recursion, contradiction, and others); and key concepts of mathematical structures (sequences, sets, functions, relations, and graphs).
Prerequisite AMS 151 or MAT 125 or MAT 131 or level 6 on the mathematics placement examination
Course Outcomes
  • An ability to use sound logical reasoning in solving computational problems.
  • An ability to use proof techniques such as induction/recursion, contradiction, and others.
  • An ability to identify key concepts of mathematical structures such as sequences, sets, functions, relations, and graphs.
Textbook

 Discrete Mathematics: Introduction to Mathematical Reasoning. Susanna S. Epp. Brief Edition.

Major Topics Covered in Course
  • Speaking Mathematically
  • The Logic of Compound Statements
  • The Logic of Quantified Statements
  • Elementary Number Theory and Methods of Proof
  • Sequences, Mathematical Induction, and Recursion
  • Set Theory
  • Properties of Functions
  • Properties of Relations
Laboratory Projects

 

Course Webpage

 

No content has been registered.