ICOM 4075 – Foundations of Computing (Fall 2014)

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 (5:00 – 6:15 & 6:30-7:45) @ Stefani 113

  • Chapter 1. Logic and Proofs (Part1, Part2, Part3)
  • Chapter 2. Basic Structures (Part1, Part2)
  • Chapter 3. Algorithms (Part1, Part2)
  • Chapter 4. Divisibility, Modular Arithmetic, and Prime Numbers (Part1, Part2)
  • Chapter 5. Induction and Recursion (Part1, Part2, Part3)
  • Chapter 6. Counting, Permutations and Combinations (Part1, Part2)
  • Chapter 9. Relations and their Properties (Part1)
  • Chapter 10. Graphs (Part1)

Exams

  • Exam 1: Thursday October 2nd (Solution)
  • Exam 2: Tuesday October 28 8-10PM @ S-113 (Solution)
  • Exam 3: Tuesday November 18 8-10PM @ S-227 (Solution)
  • Final Exam: Friday December 12-2PM @ S-113

Assignments: