CS 202
Discrete Mathematics
Chapter 9, Section 9.1
Relations and Their Properties
These class notes are based on material from our
textbook, Discrete Mathematics and Its
Applications, 7th ed., by Kenn
CS202
Discrete Mathematics
Chapter 2, Section 2.1
Sets
These class notes are based on material from our
textbook, Discrete Mathematics and Its Applications,
7th ed., by Kenneth H. Rosen, published by
CS202
Discrete Mathematics
Chapter 1, Section 1.1
Propositional Logic
These class notes are based on material from our
textbook, Discrete Mathematics and Its
Applications, 7th ed., by Kenneth H. Rosen
CS202
Discrete Mathematics
Chapter 3, Section 3.1
Algorithms
These class notes are based on material from our
textbook, Discrete Mathematics and Its
Applications, 7th ed., by Kenneth H. Rosen, publish
CS202
Discrete Mathematics
Chapter 8, Section 8.1
Application of Recurrence Relations
These class notes are based on material from our
textbook, Discrete Mathematics and Its
Applications, 7th ed., by
CS202
Discrete Mathematics
Chapter 6, Section 6.1
The Basic of Counting
These class notes are based on material from our
textbook, Discrete Mathematics and Its
Applications, 7th ed., by Kenneth H. Ros
CS202
Discrete Mathematics
Chapter 5
Section 5.1
Mathematical Induction
These class notes are based on material from our
textbook, Discrete Mathematics and Its
Applications, 7th ed., by Kenneth H. Ros
161
Discrete Mathematics and Its Applications
Kenneth H. Rosen- Selected Exercises
CS202 Chapter 1
Section 1.1
1. Which of these are propositions? What are the truth values of those that are propositi
CS202 Chapter 3 answer scheme
Exercises 3.1
1. Devise an algorithm that takes as input a list of n integers and produces as output the largest
difference obtained by subtracting an integer in the list
CS202 Chapter 7
Exercises 7.1
1. Find the first six terms of the sequence defined by each of these recurrence relations and initial
conditions:
a. an = -2n, a0=-1
b. an = an-1 - an-2, a0=1, a1= 2
c. a
161
Discrete Mathematics and Its Applications
Kenneth H. Rosen- Selected Exercises
CS202 Chapter 2
Section 2.3
1. Determine whether f is a function from Z to R if:
a. f(n) = n
b. f(n) = 1/ (n2 4)
2. F
161
Discrete Mathematics and Its Applications
Kenneth H. Rosen- Selected Exercises
CS202 Chapter 2
Section 2.1
1. Use set builder notation to give a description of each these sets.
a. cfw_a,b,c,d
b. c
161
Discrete Mathematics and Its Applications
Kenneth H. Rosen- Selected Exercises
Chapter 6
Section 6.1
1. An office building contains 27 floors and has 37 offices on each floor. How many offices are
161
Discrete Mathematics and Its Applications
Kenneth H. Rosen- Selected Exercises
Chapter 5
Section 5.1
1. Let P(n) be the statement that 13 + 23 + n3 = (n(n+1)/2)2 for the positive integer n.
a. Wha
Discrete Mathematics and Its Applications
Kenneth H. Rosen- Selected Exercises
Chapter 3
Section 3.1
1. Devise an algorithm that takes as input a list of n integers and produces as output the largest
COURSE CODE: PHSC101
CAMPUS: YUC
SEM: 151
Chapter 7
Heat Transfer and Change of
Phase
Objectives
The objectives of this chapter are to
define Conduction
define Convection
define Radiation
identify
Course code: PHSC101
Campus : YUC
Chapter 8
Static and Current Electricity
Instructor: MS.Rubina Shaheen
1
Learning Outcomes
At the end of this chapter the students will be able to
Define static char