ICOM 4075 – Foundations of Computing (Fall 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 & 6:30-7:45) @ Stefani 227

  • 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 Studied this Semester)
  • Chapter 10. Graphs (Part1)
  • Chapter 11. Trees (Part1)

Exams

  • Exam 1: September 22 8-10PM @ S-113 (PracticeExam, Solution)
  • Exam 2: October 20 8-10PM @ S-113 (Solution)
  • Exam 3: November 17 8-10PM @ S-113 (Solution)
  • Final Exam: TBA

Problem Sets:

  • Problem Set 1: Handout, Solution
  • Problem Set 2: Handout, Solution
  • Problem Set 3: Handout, Solution
  • Problem Set 4: Handout, Solution
  • Problem Set 5&6: Handout, Solution
  • Problem Set 7: Handout, Solution
  • Problem Set 8: Handout, Solution
  • Problem Set 9: Handout, Solution

Grades:

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

Textbook:

  • Discrete Mathematics and Its Applications Seventh Edition by Kenneth Rosen. ISBN-13: 978-0073383095 

RosenBookCover