0% found this document useful (0 votes)
172 views26 pages

Discrete Math for Computing Students

This document provides an overview and introduction to a discrete structures course being taught in the spring 2021 semester. It introduces the instructor and their background and research interests. It outlines the instructor's teaching style of emphasizing interaction, questions, and practical assignments. It defines discrete math, explains why it is studied, and lists some of its applications. It provides an overview of the topics to be covered, learning outcomes, assessment breakdown, textbook, schedule, and policies regarding attendance, technology use, collaboration, and academic honesty.

Uploaded by

emad aldabsy
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
0% found this document useful (0 votes)
172 views26 pages

Discrete Math for Computing Students

This document provides an overview and introduction to a discrete structures course being taught in the spring 2021 semester. It introduces the instructor and their background and research interests. It outlines the instructor's teaching style of emphasizing interaction, questions, and practical assignments. It defines discrete math, explains why it is studied, and lists some of its applications. It provides an overview of the topics to be covered, learning outcomes, assessment breakdown, textbook, schedule, and policies regarding attendance, technology use, collaboration, and academic honesty.

Uploaded by

emad aldabsy
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/ 26

Discrete Structures

for Computing
Session 0

Welcome!
Spring 2021

January 10th, 2021


Instructor
• Khalid Abualsaud, Ph. D., SMIEEE
[email protected]
• Room: F211 – Building BCR, males Campus
• Phone: 4403-4285

• Research interests:
• Health systems,
• Wireless sensors for IoT applications,
• Cybersecurity, Cloud computing, and
• Computer network protocols

CMPS 205 Discrete Structures for Computing 2


Teaching Style
I like ….
interaction in class
to ask questions
to be asked questions
to give practical assignments
to learn …

CMPS 205 Discrete Structures for Computing 3


Welcome to
“Discrete Structures for Computing”

CMPS 205 Discrete Structures for Computing 4


What is Discrete Math?

Is Math Hard?
CMPS 205 Discrete Structures for Computing 5
What is “Discrete Math”?

CMPS 205 Discrete Structures for Computing 6


Why Study Discrete Mathematics?
• The basis of all of digital information processing:
Discrete manipulations of discrete structures
represented in a computer memory.
• Is the background behind many computer
operations.
• Discrete concepts are also widely used throughout
math, science, engineering, economics, biology, etc.,

Discrete math is the mathematical language


of computer science
CMPS 205 Discrete Structures for Computing 7
Why Discrete Math for Computing?
• Discrete math is an excellent tool for improving
reasoning and problem solving abilities.

• Discrete math is very much "real world" mathematics.

CMPS 205 Discrete Structures for Computing 8


Discrete math is fun

CMPS 205 Discrete Structures for Computing 9


Text Book
Discrete Mathematics
and Its Applications
Seventh Edition

CMPS 205 Discrete Structures for Computing 10


Course General Objectives
Upon successful completion of this course,
students will be expected to demonstrate and
being able to do each of the following:
• Demonstrate critical thinking, analytical thinking, and
problem solving skills. strengthen and increase the
understanding of discrete mathematics.
• Use mathematically correct terminology and notation.
• Construct correct direct and indirect proofs.
• Use counterexamples and division into cases in a proof.
• Apply logical reasoning to solve a variety of problems.
11
CMPS 205 Discrete Structures for Computing
Schedule of Topics
Discrete Math Topics Chapter Weeks
Logic and methods of proof 1 3.5
Logic gates, Boolean algebra, and
12-PDF 2.5
minimization
Numbering systems 4-suppl. 1
Set theory 2 1
Functions 2 1
Sequences and sums 2 1
Induction 5 2
Relations 9 1
Counting 6 1
Revision ----- 1
Total 14
CMPS 205 Discrete Structures for Computing 12
Course Learning Outcomes (CLO)

By the end of this course, students should be able to:


1. Apply knowledge of logic and sets.
2. Design simple logic circuits based on sum-of-
products or product-of-sums.
3. Apply relations, functions, and numeral systems.
4. Prove logical statements deductively and
inductively.

CMPS 205 Discrete Structures for Computing 13


Applications of discrete mathematics:
• Operating systems
• Programming languages, compilers & interpreters.
• Computer networks
• Computer architecture
• Automata Theory
• Advanced algorithms design & data structures
• Relational Database Theory
• Complexity Theory (counting)
• Cryptography
• Error correction codes
• Just about everything!
14
CMPS 205 Discrete Structures for Computing
Grade Distribution

CMPS 205 Discrete Structures for Computing 15


Key Dates
HW Due Quiz Exam
28/1/2021 28/01/2021 Midterm exam:
1
25/2/2021
11/2/2021 11/02/2021 Final exam : TBA by
2
QU
3 Spring Break, March 14 – March 18, 2021
4 11/03/2021 11/03/2021 ////////////
5 01/04/2021 01/04/2021 ////////////

6 /////////////// 15/04/2021 ////////////

CMPS 205 Discrete Structures for Computing 16


Schedule (L52) – FMale
Day Time Activity Room
Sun, Tue, Thr 08:00 - 08:50 AM Class C07 – 0142
Monday 08:30 - 09:20 AM Office Hour C07 – 0122

Schedule (L02) – Male


Day Time Activity Room
Sun, Tue, Thr 10:00 - 10:50 AM Class BCR – E133
Wednesday 08:30 - 09:20 AM Office Hour BCR – F211

 Other times are available by appointment


 Best way to contact me is by email
CMPS 205 Discrete Structures for Computing 17
PLEASE …

CMPS 205 Discrete Structures for Computing 18


Class page on Blackboard
• Planning to use it extensively!
• Hopefully ready over the weekend!
• Announcements
• Course content
• Assignments
• Syllabus
• Other Resources

CMPS 205 Discrete Structures for Computing 19


Course Prerequisites
• None!

Late Policy
• Late submissions are not allowed.

CMPS 205 Discrete Structures for Computing 20


While in class!
• Phones, etc.
• Vibrate or off
• Do not use it during class
• no texting, no tweeting, no updating your status, …
• Computers
• Okay to take notes or give presentations
• Okay to look up stuff related to class when asked to
• Nothing else
• Other devices
• Same basic idea

CMPS 205 Discrete Structures for Computing 21


Attendance Policy
• Attendance will be taken during each lecture.
• If you miss the class, you are responsible for all
material covered and all announcements made
in class.

• If your absence exceeds 25% of the classes, you


will get FB.

CMPS 205 Discrete Structures for Computing 22


External Sources ??

CMPS 205 Discrete Structures for Computing 23


Honesty
• Copying from each other OR from external sources IS
CHEATING
• If happened in one problem or part, you will get ZERO in
the entire homework or project!
• Both cheater & cheated-from and even repeated
plagiarism will get ZERO!
• Assignments for individuals are assignments for
individuals, not teams!
• Encouraged to discuss homework issues with each other
but must be your own

CMPE 263 Computer


24
Architecture I
UNFAIR

!!!!
CMPS 205 Discrete Structures for Computing 25
CMPS 205 Discrete Structures for Computing 26

You might also like