Scribd
Upload
69 views4 pages

CSE-230-Course-Description and Outline

BRAC University

Uploaded by

Hasanul Mahi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
69 views4 pages

CSE-230-Course-Description and Outline

BRAC University

Uploaded by

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

Textbook and Its Usage

CSE 230 exclusively focuses on improving students’ logical reasoning, mathematical modeling, and
critical problem-solving skills that are essential for becoming successful computer engineers and
scientists. In that regard, Keneth H. Rosen’s textbook is considered the de facto standard and is being
taught in numerous schools all over the world. CSE 230 focuses on rigorously covering the first half of
the book. Note that, reading the book is NOT A RECOMMENDATION, RATHER A MANDATORY part of the
course. The students must make it a habit of reading the corresponding chapter sections of the book
every week that are related to that week’s lectures.

Note that the after-midterm lectures of the course cover materials from the book more quickly assuming
that students are on track with materials discussed earlier. Hence, the students must understand that
piling things up for studying just before the exams will most likely have a disastrous consequence for
them. So please do not put yourselves in that state. Remember that passing this course is easy, getting
an A in this course is also easy, however, the easiest thing is to fail in this course. All students have to do
is not study regularly.

Strategy for Quizzes


To ensure students’ regular time investment towards studying materials covered in class, CSE 230 follows
the policy of weekly quizzes. Every even numbered lecture will have a 15 minutes long quiz at the end of
it. In the quiz, the students will solve a single problem for 12 minutes related to the current and last
lecture. The remaining three minutes is reserved for question paper distribution and answer script
collection. Students' quiz scores for the final grade will be counted as the average of best N – 3 quizzes.

Marks Distribution
Attendance - 10%
Quiz - 25%
Midterm - 30%
Final - 35%

Lecture Schedule
Slide No Lecture Topics Textbook Reference

1 1. The notion of logic and proof Chapter 1 Section 1.1 (up Three weeks
2. Meaning of a proposition to conditional to complete
3. Logical Connectives statements) Chapter 1

2 4. Truth tables of Conditional Chapter 1 Section 1.1 (from


Statements conditional statements to
the end of the section)
Section 1.2

3 1. Compound Propositions Chapter 1 Section 1.2 and


2. Tautology and Contradictions 1.3 (Except De Morgan’s
3. Logical Equivalence Law and Its Application)
4. Simplification using series of
logical equivalence

4 1. Universal and Existential Chapter 1 Section 1.3


Quantification (De Morgan’s Law and
2. De Morgan’s Law its
3. Nested Quantifiers Application)
4. Applying De Morgan’s Law in Chapter 1 Section 1.4
Nested Quantifier Chapter 1 Section 1.5

5 1. Proof Techniques Chapter 1 Section 1.7


a. Proof by Construction
b. Proof by Contraposition
c. Proof by Contradiction
d. Proof by Counterexample

6 1. Proof Techniques Review Chapter 1 Section 1.6, 1.7


2. Fallacies and 1.8
3. Conjectures

7 1. Set Terminologies Chapter 2 Section 2.1


a. Set and Set Notations
b. Empty Set, Subsets, Power
sets, Cartesian Products
c. Infinite Sets
d. Venn Diagrams

8 1. Set Operations Chapter 2 Section 2.2


2. Set Identities
3. De Morgan’s Law for Set
Operations Three weeks
to complete
9 1. Function Definition Chapter 2 Section 2.3 (up to Chapter 2
2. Domain, and Range Composition and
3. One-to-one and Onto Functions invertibility) and Section
4. Cardinality of Sets 2.5

10 1. Invertibility and Inverse Functions Chapter 2 Section 2.3 (from


2. Function Compositions invertible function to the
rest of the section)

11 1. Sequences and their Summation Chapter 2 Section 2.4


2. Recurrence Relations
17 1. Mathematical Induction Chapter 5 Section 5.1

End of Mid Term Syllabus

12 1. Matrices Chapter 2 Section 2.6


2. Matrix Operations

13 1. The Definition of Algorithm Students are encouraged


2. Characteristics of an Algorithm to read the full Chapter 3.
3. Growth of a Function However, the syllabus is
4. Time complexity of Algorithms the slides and shared
resources.

15 1. Logic of Integer Representation Chapter 4 Section 4.2


2. Decimal and Hexadecimal
Representations
3. Binary Representation
4. Binary Addition Algorithm
5. Binary Multiplication Algorithm
6. Modular exponentiation

14 1. Divisibility Chapter 4 Section 4.1


2. Modular Arithmetic
3. Congruence Relation
4. Congruence proofs divisibility
(cover from book)

GCD, LCM Chapter 4 Section 4.3


Euclid's algorithm
Linear congruence

16 1. Prime Numbers Chapter 4 Section 4.3


2. Prime Factorization And only Fermat’s
3. Relative Prime Number Theorem from Section
4. Fermat's Little Theorem 4.4

18 1. Recursive Definition Chapter 5 Section 5.3 and Exam


2. Recursive Algorithms Section 5.4 (up to Syllabus only
recursive binary search) Includes
1. Linear Homogeneous recurrence Section 5.1
relation (cover from book)(8.2) and 5.3 (Two
2. Linear Non Homogeneous sections to
recurrence relation (cover from study in a
book)(8.2) week)
19 1. Rules of counting Chapter 6 Section 6.1 and
a. Sum Rule 6.2
b. Product Rule
c. Subtraction Rule
2. The Pigeonhole Principle

20 1. Permutations Chapter 6 Section 6.3


2. Combinations

You might also like