CS 103 Discrete Structures
Lecture 20
Trees (1)
Chapter 11
Trees
11.1 Introduction to Trees
Chapter 11
Trees
11.1 Introduction to Trees
Trees
Trees are graphs
They are called trees because they look like trees. For
example, family trees are graphs that re
CS 103 Discrete Structures
Lecture 17
Graphs (1)
Second Midterm Exam
Thursday, 4 December 2014 (same time as the lecture)
75 minute duration
Will cover all lectures delivered since midterm 1 and up
to the exam date
Will consist of MCQs, fill-in-the-bl
CS 103 Discrete
Structures
Lecture
15
Relations (1)
Second Midterm Exam
Thursday, 4 December 2014 (same time as
the lecture)
75 minute duration
Will cover all lectures delivered since
midterm 1 and up to the exam date
Will consist of MCQs, fill-in-the-bla
CS 103 Discrete
Structures
Lecture
01
Introduction
Logic and Proofs (1)
CS 103 Discrete Structures
Textbook
Discrete Mathematics and Its Applications, 7th
ed. By K. Rosen
Attendance
75% in is mandatory
You are not allowed to miss lectures for the exams
of
CS 103 Discrete
Structures
Lecture
13
Counting (1)
Chapter 6
Counting
6.1 The Basics of Counting
The Basics of Counting
Suppose that a password on a computer system
consists of 8 characters
Each of these characters must be a digit (0-9:
10 possibilities)
CS 103 Discrete
Structures
Lecture
05
Logic and Proofs (5)
First Midterm Exam
Thursday, 30 October 2014 (same time as the lecture)
75 minute duration
Will cover all lectures delivered before the exam date
Will consist of MCQs, fill-in-the-blanks, question
CS 103 Discrete
Structures
Lecture
08
Logic and Proofs (8)
First Midterm Exam
Thursday, 30 October 2014 (same time as the lecture)
75 minute duration
Will cover all lectures delivered before the exam date
Will consist of MCQs, fill-in-the-blanks, question
CS 103 Discrete
Structures
Lecture
11
Sets, Functions, and
Relations (1)
Chapter 2
Sets, Functions, and
Relations
2.1 Sets
Sets
A set is an unordered collection of objects.
Capital letters (A, B, S) are used to
denote sets
The objects in a set are called
CS 103 Discrete
Structures
Lecture
10
Logic and Proofs (10)
Chapter 1
The Foundations:
Logic and Proofs
1.8 Introduction to Proofs
Proofs
We
introduce the notion of a proof and
describe methods for constructing proofs.
A
proof is a valid argument that
est
CS 103 Discrete
Structures
Lecture
07
Logic and Proofs (7)
First Midterm Exam
Thursday, 30 October 2014 (same time as the lecture)
75 minute duration
Will cover all lectures delivered before the exam date
Will consist of MCQs, fill-in-the-blanks, question
CS 103 Discrete
Structures
Lecture
12b
Induction and Recursion (1)
Chapter 5
Induction and
Recursion
5.1 Mathematical Induction
Mathematical
Induction
A technique for constructing proofs
Mathematical induction is based on the
following rule of inference:
CS 103 Discrete
Structures
Lecture
03
Logic and Proofs (3)
Chapter 1
The Foundations:
Logic and Proofs
1.3 Propositional Equivalences
Propositional Equivalences
Compound propositions can be classified
according to their possible truth values
into three ty