Embedded Files
Week 1 : (Propositional Logic)
Topics of Discussion:
Propositional logic.
Translation of natural language to symbolic form.
Simple and Compound proposition with propositional logic.
Expected Learning Outcomes:
Understand the basics of Propositional Logic.
Abel to translate natural language into Propositional Logic
Apply different connectives to represent compound Propositions.
Able to construct truth table for Simple and compound propositions.
Resources of Learning:
Lesson 1: Introducing Class-- [Discussion in order to make students familiar about the outcome of the course and formal introduction with Students and teacher]
Lesson 2: Propositional Logic [PPT Lecture Slide]
To do: Complete the activity
Dear Student,
Please help me improve the course by answering the following to provide feedback about the course. Please try to make your answer as candid and specific as possible. This will help me to determine what steps can be taken to make your learning more effective.
The survey is anonymous and you can be sure that your privacy will be maintained.
Please complete the survey by Thursday 21th June 2021 within 10 PM.
Thank you.
Mark as done
Mark as done
Week 2 : (Logical Equivalence)
Topics of Discussion:
Basics of Logical equivalence.
Proof of Logical equivalence.
Proof propositional equivalence using truth table and series of logic.
Expected Learning Outcomes:
Understand the basics of logical equivalences.
Proof whether two given propositions are equivalent or not
Apply the knowledge to prove whether to given propositions are equivalent or not by using Truth tables
Apply the knowledge to prove whether to given propositions are equivalent or not by developing a series of logical equivalences
Resources of Learning:
Lesson 3: Logical Equivalences [Pdf Lecture Slide]
Lesson 4: Practices on Logical Equivalences [Pdf Lecture Slide]
Mark as done
To do: Complete the activity
Opened: Friday, 26 August 2022, 12:00 AM
Due: Friday, 26 August 2022, 11:59 PM
Done
Week 3 : (Predicates and Quantifiers)
Topics of Discussion:
Propositional function.
Discussion on Universal and Existential quantifiers.
Conversion of natural language into propositional function and vice-versa.
Expected Learning Outcomes:
Understand the basics of the propositional function.
Understand about Universal and Existential quantifiers.
Convert natural languages into propositional function.
Implement propositional functions using quantifiers.
Resources of Learning:
Lesson 5: Predicates and Quantifiers [Pdf Lecture Slide]
Lesson 6: Practices on Predicates and Quantifiers.
Mark as done
To do: Complete the activity
Week 4 : (Negation and Nested Quantifiers))
Not available
Week 5 : (Set Operation)
Topics of Discussion:
Concept of Set theory.
Discuss different types of set operations.
Different kinds of set operations using Ven diagram
Expected Learning Outcomes:
Understand the concepts of Sets.
Represent sets using set builders.
Understand about cardinality, power set and cartesian product of sets
Understand different kinds of set operations .
Apply different kinds of operations using Ven diagram.
Resources of Learning:
Lesson 9: Sets [Pdf Lecture Slide]
Lesson 10: Set operations
Mark as done
To do: Complete the activity
Week 6 : (Function)
Topics of Discussion:
Define and concept of function.
Discuss different types of functions.
Composite functions.
Expected Learning Outcomes:
Understand the concept of Functions .
Identify different types of Functions
Derive composite Functions
Resources of Learning:
Lesson 11: Function [Pdf lecture Slide]
Lesson 12: In this lesson, a discussion on relations and its closure operations will be continued.
Mark as done
Done: Complete the activity
Week 7 : - [Midterm Exam]
Not available
Week 8 : (Graph)
Topics of Discussion:
Basic concept of Graph.
Converting natural phenomena into graphs.
Types of basic graphs.
Handshaking Theorem.
Expected Learning Outcomes:
Able to understand the basics of Graphs.
Able to represent natural phenomena into graphs
Able to apply Handshaking Theorem
Able to classify Graphs
Able to identify Bipartite Graphs using coloring algorithm
Resources of Learning:
Lesson 13: Graph [Pdf lecture slide]
Lesson 14: Bipartite graph [Pdf lecture slide]
Mark as done
Due: Friday, 7 October 2022, 10:27 AM
To do: View To do: Make forum posts: 1
Week 9 : (Graph Terminologies and Isomorphism)
Topics of Discussion:
Graph representation in various ways.
Basic terminologies of the graph.
Discuss the way to identify a graph isomorphism or not.
How to find the shortest path using Dijkstra algorithm.
Expected Learning Outcomes:
Able to represent Graphs using matrix.
Able to determine path lengths from any given vertex to any other vertex.
Able to identify isomorphic graphs.
Able to apply Dijkstra algorithm to find shortest path.
Resources of Learning:
Lesson 15: Graph terminologies [Pdf Lecture Slide]
Lesson 16: Graph Isomorphism [Pdf Lecture Slide]
Mark as done
Mark as done
Week 10 : (Relation and Graph Representation)
Topics of Discussion:
Discuss the basic properties of relation.
Discuss the closure of the relation.
Differentiate graph and tree.
Expected Learning Outcomes:
Able to differentiate between Graphs and Trees
Able to demonstrate basic concepts of Tree
Able to demonstrate knowledge about the relation.
Able to identify the properties of the relation.
Able to identify closures of relations.
Resources of Learning:
Lesson 17: Graph Representation [Pdf Lecture slide]
Lesson 18: Relation [Pdf Lecture slide]
Mark as done
Week 11 : (Mathematical Induction & Spanning tree)
Topics of Discussion:
Discuss the concept of mathematical induction.
How to derive formula from a given mathematical sequence.
Prove derived formula using Mathematical Induction.
Concept of Minimum spanning tree.
How to derive minimum spanning tree from weighted graphs
Expected Learning Outcomes:
Demonstrate the conception of Mathematical Induction .
Able to derive a formula from a given mathematical sequence.
Able to prove derived formula using Mathematical Induction .
Able to apply algorithms to derive minimum spanning tree from weighted graphs
Resources of Learning:
Lesson 19: Mathematical Induction [Pdf lecture slide]
Lesson 20: Minimum Spanning tree [Pdf lecture slide] [Pdf lecture slide]
Mark as done
Week 12 : (Rules of Inference)
Not available
Week 13 (Presentation and Review Class for final Exam)
Not available
Week 14:- [Final Exam]
Not available
Page updated
Google Sites
Report abuse