To operate the Blended Learning Center(BLC) at optimal level, maintenance will be performed every day at 8:30 AM and at 5:00 PM regularly which can take up to 30 minutes. Please consider scheduling your activity in the BLC platform accordingly.
Topic outline
- Discrete Mathematics : the journey begins here.
Discrete Mathematics : the journey begins here.
CSE-131: Discrete Mathematics
Dear Students,
Welcome to the Fall2022 Semester!
Welcome back, Students. I can’t wait to see all your smiling faces! I am here to support you every step of the way.
I encourage you to make the most of your time here. Remember to make it a great year. I will see you soon.
INSTRUCTION/GUIDELINE FOR THE COURSE
- All the students registered for this course have to enroll in Moodle
- Students can find all the course materials from Moodle.
- All the students have to submit the soft copy of their "Assignment
" in Moodle under assignment
section created here and for this they will be graded here.
- One discussion or feedback forum is created under each of the lecture. Students have to give their feedback on these forum and marks will be given for their feedback
- Announcement regarding the class will be posted on Moodle.
- Quizzes and presentation
may be held on face to face class and may be few of the class will be held on online (Moodle) and it will be announced before the class
- The question pattern and the syllabus for the quizzes, midterm and final exam is given here under each of the section (quizzes, midterm and final)
- There are midterm and final exam preparation
forum under these sections where students can discuss with each other about their midterm and final exam syllabus, any problem regarding the exam etc.
COURSE RATIONALE
Concepts and notations from discrete mathematics
are useful in studying and describing objects and problems in all branches of
computer science, such as computer algorithms, programming languages,
cryptography, automated theorem proving, and software development. It helps
improving reasoning power and problem-solving skills. Therefore, it can be
considered as the backbone of computer science.
COURSE OBJECTIVE
- The goal of this course is to introduce students
to ideas and techniques from discrete mathematics that are widely used in
science and engineering for thinking logically and mathematically and apply
these techniques in solving problems.
- To achieve this goal, students will learn
logic and proof, sets, functions, mathematical reasoning as well as key topics
involving relations, graphs and trees.
COURSE OUTCOME
After completing this course satisfactorily, a student will:
CO1
|
Be
able to comprehend formal logical arguments as well as to construct logical
proofs with ability to verify them
|
CO2
|
Demonstrate
skills in expressing mathematical properties formally via the formal language
of propositional logic and predicate logic
|
CO3
|
Gain
experience in using various techniques of mathematical induction to prove
simple mathematical properties of a variety of discrete structures
|
| |
ASSESSMENT PLAN
COURSE OUTLINE
REFERENCE TEXTBOOKS
ADDITIONAL MATERIALS
- NOTICE BOARD
NOTICE BOARD
QUIZ FOR J: CHAPTER 1: SECTION: 1.1 - 1.3, DATE: 31.8.2022
QUIZ FOR K:
CHAPTER 1: SECTION: 1.1 - 1.3 ,DATE: 29.8.2022
- Assignment :Previous year Question
This topic
Assignment :Previous year Question
- FORUMS
- SURVEY
- Week 1
Week 1
LESSON OBJECTIVE
Lesson 1
- In this lesson, discrete mathematics will be introduced and a discussion on propositional logic will be initiated.
Lesson 2
- In this lesson, a discussion on propositional logic will be continued.
LEARNING OUTCOME
- Students will understand what makes up a correct mathematical argument
- Students will be able to develop an arsenal of different proof methods that will enable students to prove many different types of results
- Students will be able to explain the process of developing mathematics.
- They will get the concept of propositional logic and why this logic is used in Computer Science.
- They will get an overview of why Discrete Mathematics is important in building the logic in Computer Science.
Pre-Recorded Video
Introduction to Propositional Logic
Content Sources
Required links
Class Lecture Slide |
Class Recorded Video |
Lecture-1 |
Lecture-1 |
Lecture-2 |
Lecture-2 |
- Week 2
Week 2
LESSON OBJECTIVE
Lesson 3
- In this lesson, discussion on propositional logic will be continued with the topic of logical equivalence
Lesson 4
- In this lesson, a discussion on predicates and quantifiers in propositional logic will be introduced.
LEARNING OUTCOME
- correct mathematical argument and introduce tools to construct these arguments
- different proof methods
- several strategies for constructing proofs
- the notion of a conjecture and the process of developing mathematics by studying conjectures
- truth table and strategies for constructing logical equivalence
Pre-recorded Video
Predicate and Quantifiers
- Week 3
Week 3
LESSON OBJECTIVE
Lesson 5
- In this lesson, a discussion on predicates and quantifiers in propositional logic will be continued
Lesson 6
- In this lesson, a discussion on sets and its operations will be introduced
LEARNING OUTCOME
- After this lecture students will get clear conception about Predicates and Quantifiers
- They will be able to represent a sentence using Predicates and Quantifiers
.
- They will also get a basic concept of set, set operations and why set is used in Discrete Mathematics
Content Sources
Required links
Class Lecture Slide |
Class Recorded Video |
Lecture-1 |
Lecture-1 |
Lecture-2 |
Lecture-2 |
- Week 4
Week 4
LESSON OBJECTIVE
Lesson 7
- In this lesson, a discussion on sets and its operations will be continued
Lesson 8
- In this lesson, a discussion on functions and its usage will be introduced
LEARNING OUTCOME
- After the lecture students will be able to learn why set is important in discrete mathematics and different operation of sets.
- They will also get the idea of functions, its importance, use of function
Content Sources
Required links
Class Lecture Slide |
Class Recorded Video |
Lecture-1 |
Lecture-1 |
Lecture-2 |
Lecture-2 |
Lecture-3 |
Lecture-3 |
- Week 5
- Week 6
- Midterm survey of the course [just before midterm]
Midterm survey of the course [just before midterm]
- Week 7
- Midterm Exam
- Week 8
Week 8
Lesson 12
Details about Relation
Lecture
Lesson 13
In this lesson, a discussion on graphs will be introduced.
Lectures
Lesson 14
In this lesson, a discussion on bipartite graph and its applications will be introduced.
Lectures
Outcome of the week Lecture
- After this lecture students will get clear conception about Pair, Ordered Pair, Graph, Edge
- Different kind of graph, different ways of representing graph, Bipartite Graph
- will be able to find out whether a graph is bipartite or not
- Week 9
- Week 10
- Week 11
- Week 12
- Week 13
- Week 14
- Final Exam Summer-20