CS 221 Discrete Theory and Structures
The course will introduce concepts of elementary discrete mathematics and their application in computer science, engineering and biological mathematical modeling. It focuses on mathematical vocabulary, definitions and proofs.
Students will become proficient in completing logical proofs. They will become familiar with different applications of discrete mathematics. Students will gain experience in critically reviewing and analyzing current scientific literature. Students will gain experience in oral presentations. Students will gain experience in critical thinking and quantitative reasoning, Students will be encouraged to be curious skilled and will improve their communications skills.
Topics covered include: fundamentals of logic and set theory, methods of proof and formal reasoning, counting and enumeration, discrete probability, binary relations, and graph theory
Different problem sets to reinforce the concepts discussed in the lectures, Research for the critical review project, Presentations of the Critical Review
- Prerequisites: Pre-Calculus 2 or Calculus 1, Introduction to Computing & Information Systems or Programming 2 / Computer Programming or Computer Programming for Engineering