ICOM 4075 – Foundations of Computing (Spring 2015)

Discussion of discrete structures frequently encountered in computer science and engineering, with an emphasis in problem solving skills and algorithms. Topics include set theory, proof techniques, graphs and trees, functions, recursive functions and procedures, inductively defined sets, grammars, equivalence, inductive proof, counting, discrete probability, and their applications to computing problems.

General Information

  • Course Information Sheet A.K.A. Prontuario (PDF)

Lecture Tu & Th (3:30-4:45 & 5:00-6:15 & 6:30-7:45) @ Stefani 229

  • Chapter 1. Logic and Proofs (Part1Part2Part3)
  • Chapter 2. Basic Structures (Part1Part2)
  • Chapter 3. Algorithms (Part1Part2)
  • Chapter 4. Divisibility, Modular Arithmetic, and Prime Numbers (Part1Part2)
  • Chapter 5. Induction and Recursion (Part1Part2Part3)
  • Chapter 6. Counting, Permutations and Combinations (Part1Part2)
  • Chapter 9. Relations and their Properties (Not covered this term)
  • Chapter 10. Graphs (Not covered this term)

Exams

  • Exam 1: Feb 10 8-10PM @ S-113 (PracticeExam, Solution)
  • Exam 2: Mar 03 8-10PM @ S-113 (Solution)
  • Exam 3: Mar 24 8-10PM @ S-113 (Solution)
  • Exam 4: Apr 21 8-10PM @ S-113 (Solution)
  • Final Exam: May 21st 9:45-11:45AM @ S-113

Problem Sets:

Grades:

  • You may access your grades in the eCourses (Moodle) system