Scribd
Upload
116 views1 page

Department of Computer Science MA 112: Discrete Mathematics Course Syllabus

This syllabus outlines the topics and structure for a Discrete Mathematics course, including an introduction to propositional logic, sets, functions, proofs, integers, and graph theory. Students will learn through weekly readings, homework assignments, midterm exams, and a final exam. The course is offered at both an ordinary and advanced level, with the advanced option covering additional material.

Uploaded by

Tahar Moustalik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
116 views1 page

Department of Computer Science MA 112: Discrete Mathematics Course Syllabus

This syllabus outlines the topics and structure for a Discrete Mathematics course, including an introduction to propositional logic, sets, functions, proofs, integers, and graph theory. Students will learn through weekly readings, homework assignments, midterm exams, and a final exam. The course is offered at both an ordinary and advanced level, with the advanced option covering additional material.

Uploaded by

Tahar Moustalik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

HELWAN

University Department of Computer Science


Faculty of MA 112: Discrete Mathematics
Computers and Information
Course Syllabus

Instructor Dr. Waleed A. Yousef, Wyousef@fci.Helwan.edu.eg


Office Hours Check webpage
Text Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6 th ed., McGraw-Hill.
Prerequisite No prerequisite.
Objectives This course is a fundamental course for any computer science student. Students should learn in
this course how to be rigorous and start thinking mathematically, with pencil and paper,
before putting their hands on the computer writing a program to solve a problem. The basics of
different areas in mathematics will be taught, e.g., logic and proofs, sets and functions, induction and
recursion,etc. A good theoretical understanding of computer science, as well as any science, is
based on understanding mathematics.
Homework There will be a new assignment every week; problems will be assigned from the book. Every student
has to solve the homework at home, to leave the time of the weekly sections for technical questions
and discussions with the TAs. No late assignments please; copied ones get no marks, are
considered cheating and violation to the ethical code, and influence the whole grade.
Grading Homeworks 10%, midterms 30%, and final exam: 60%.

Syllabus:
Ordinary Course Advanced Course

Lec Book
Topic Book Sections Topics
. Sections
1 1.1 Introduction, propositional logic 1.11.4. Mathematical Logic
2 1.2, 1.3 Mathematical Logic (cont.),
Propositional logic, predicates and Quantifiers 1.51.7. Proofs
3 1.4, 1.5 Nested quantifiers, rules of inference 2.12.3. Sets and Functions
4 1.6, 1.7 Sequences, Summation,
Proofs 2.4, 3.2, 3.3 function Growth,
Complexity
5 2.1, 2.2 Sets, and set operations 3.4, 3.5, 3.8 Integers, Primes, Matrices
6 2.3, 2.4 4.14.3 Induction, Strong induction,
Sequences and summations
(omit trees) Recursive structures.
7 3.4, 3.5 5.1, 5.2 (first Counting, permutation,
Integers, division, primes, and GCD.
pages), 5.3 combination.
8 4.1, 4.2 Mathematical induction, strong induction, and Recurrence and solving
well ordering property 7.1, 7.2 recurrence relations.
9 4.3, 5.1 Divide-and-Conquer with
Recursive definition, structural induction, and
basics of counting
7.3, 7.4, 7.5 recurrence, Generating
functions
10 5.2, 5.3, 7.1 Pigeonhole principle, permutations and Relations, equivalence
combinations, Recurrence relations
8.1, 8.3, 8.5 relations
11 7.2, 7.5 Solving recurrence relations, Inclusion-
exclusion.
9.19.3 Graph
12 3.8, 8.1 Matrices, Relations and their properties. 9.4, 9.5 Graph (Cont)
13 8.3, 8.5 Representing relations, equivalence relations.
14 9.1, 9.2 Graph models and terminology.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy