Weekly outline

• Heartiest Welcome to the world of Logic Development.
  

  Heartiest Welcome to the world of Logic Development.

  
  

  
  

  Welcome to Math for Computer Science (CSE-236). I am MD. SHARZUL MOSTAFA, Lecturer, Department of Computer Science and Engineering (CSE) and I am your instructor in this course. In addition to welcome you to the course, I would like to say "Online courses provide a different way to study and place different skills from students". I will provide you the necessary support during the course to successfully complete this course.

  Thank you and good luck

  
  

  • COURSE INSTRUCTOR : Forum

    Mark as done

    
    

  • Course Details : Forum

    Mark as done

    Course Rationale

    This course emphasizes mathematical definitions and proofs and applicable methods to solve and analyse problems that arise in computer science. It trains students in developing the ability to think quantitatively and analyze problems critically.
    

    
    

    Course objective:

    Mathematical Reasoning: To construct mathematical arguments and formulae from mathematical reasoning and logic

    Combinatorial Analysis: To Develop problem-solving skills using the ability to count or enumerate objects

    Algorithmic Thinking: To use mathematical methods for developing algorithms
    

    Applications and Modeling: To apply mathematical models to applications in Computer Science. 

    
    

    Course Outcome:

    CO1	Able to solve computational problem using mathematical models
    CO2	Able to implement basic mathematical reasoning techniques and logical operations for engineering problems
    CO3	Able to apply graph theory and other mathematical methods to both data structures and analysis of algorithms, and some other analytical problems in computer science

    
    Grading Scheme:
    Attendance: 7%
    Class Tests/Quizes:  15%
    Assignment: 5%
    Presentation (using video/ppt): 8%
    Midterm Exam: 25%
    Final Exam: 40% 
    

  • Text Book URL
  • Course Outline (OBE) URL

    Mark as done

    Outcome based Teaching and Learning Action Plan

  • Announcements Forum
  • Resource URL

    Mark as done
  • Recorded Live Class ( Section-D )

    Restricted Not available unless: You belong to Section-D
  • Recorded Live Class ( Section-E )

    Restricted Not available unless: You belong to Section - E
  • Recorded Live Class ( Section - F )
    

    Restricted Not available unless: You belong to Section - F
  • Recorded Live Class ( Section - G )
    

    Restricted Not available unless: You belong to Section - G
  • Student's Feedback Forum

    Mark as done

    
  • For Section -E Permanent Google Meet Link : URL

    Mark as done

    Join the class on time. Thank you.

  • For Section-F Permanent Google Meet Link : URL

    Mark as done

    Join the class on time. Thank you.

  • For Section- D Permanent Google Meet Link : URL

    Mark as done

    Join the class on time. Thank you.

  • For Section-G Permanent Google Meet Link : URL

    Mark as done

    Join the class on time. Thank you.

  • Quiz-1

    Mark as done

    Read the question attentively and follow the instructions carefully.

  • QUIZ-2

    Mark as done

    Follow the instruction carefully !

  • Making ppt presentation Assignment

    Mark as done

    Based on BFS & DFS.

  • QUIZ-3

    Mark as done

    Follow the instruction carefully !
• Week 1
  

  Week 1

  • Lesson 1.1: Introduction URL

    Mark as done

    Course introduction, Objective and outcome of course, Assessment policies, Application etc.

  • Lesson 1.2: Logic and Propositional Logic URL

    Mark as done

    Concept of Logic and logical sense, the foundations of math with logic
    

  • Lesson 1.3: Logic Puzzle URL

    Some Logic Puzzles

  • Tutorials

    Mark as done
  • 
    

    Mark as done
• Week 2
  

  Week 2

  • Lesson 2.1: Mathematical Proofs URL

    Mark as done

    Introduction to mathematical proofs using axioms and propositions, Propositional logic, propositional equivalence, Logic Puzzle, Laws of Logic
    

  • Lesson 2.2.1: Predicate Logic I URL

    Mark as done

    Predicates, Quantifiers I, Quantifiers II
    

  • Lesson 2.2.2: Predicate Logic II URL

    Mark as done

    Predicates, Quantifiers I, Quantifiers II
    

  • Tutorial : Forum

    Mark as done

    
    

• Week 3
  

  Week 3

  • Lesson 3.1: Sets URL

    Mark as done

    Sets: Concept, type, Finite and Infinite sets, Power set etc.
    

  • Lesson 3.2: Set Operations URL

    Mark as done

    Set Operations: Union, Intersection etc. and rules of set operations
    

• Week 4
  

  Week 4

  • Lesson 4.1: Function I URL

    Mark as done

    Functions I: Function – “Machines” Definition, Representation of function, Function Vs. non Function, Properties of functions

    
    

  • Lesson 4.2: Function II URL

    Mark as done

    Functions II: Composition of Functions, An Application of Functions: The Pigeonhole Principle
    

  • Class Test: 1

    Mark as done
• Week 5
  

  Week 5

  • Lesson 5.1.1: Basics of Counting URL

    Mark as done

    Basic counting techniques

  • Lesson 5.1.2: Pigeonhole Principle URL

    Mark as done

    The Pigeonhole Principle

  • Lesson 5.1.3: Permutations-Combinations URL

    Mark as done

    Permutations and Combinations

  • Lesson 5.2: Mathematical Induction URL

    Mark as done

    Induction: An introduction to proof techniques, covering proof by contradiction and induction
    

• Week 6
  

  Week 6

  • Lesson 6.1: Inference URL

    Mark as done

    Rules of Inference (What, Why, How) 
    

  • Class Test: 2

    Mark as done
• Week 7
  

  Week 7

  Mid-term Week

  • MID_Exam_Spring_2021 Assignment

    Mark as done

    Follow all the instruction carefully!

• Week 8
  

  Week 8

  • Lesson 8.1: Graph I URL

    Mark as done

    Introduction to graphs, graph terminologies and application, Representing graphs

    
    

  • Lesson 8.2: Graph II URL

    Mark as done

    Connectivity, Directed and Undirected graphs
    

• Week 9
  

  Week 9

  • Lesson 9.1: Euler Path URL

    Mark as done

    Euler paths: Concept and application
    

  • Lesson 9.2: Hamilton Path URL

    Mark as done

    Hamilton paths Concept and application

    
    

  • Euler_Graph URL

    Mark as done

    Here you can Euler Graph's Pdf.

  • Hamilton_Graph URL

    Mark as done

    Here You can Hamilton Graph's Pdf! 

  • Euler Graph's Video Lecture!

    Mark as done
  • Hamilton Graph's Video Lecture!

    Mark as done
  • Euler Graph Page

    Mark as done

    
    

  • Hamiltonian Graph Page

    Mark as done

    
    

• Week 10
  

  Week 10

  • Lesson 10.1: Shortest Path URL

    Mark as done

    Shortest path problem and application
    

  • Lesson 10.2.1: Introduction to Planar Graph URL

    Mark as done

    Basics of Planar graph

  • Lesson 10.2.2: Planar Graphs Formula URL

    Mark as done

    Formula of Planar Graph

  • Planer Graph With Example !

    Mark as done
  • Planner Graph Page

    Mark as done

    
    

• Week 11
  

  Week 11

  • Lesson 11.1: Introduction to Trees URL

    Mark as done

    Basics of Tree

  • Lesson 11.2: Minimum Spanning Tree URL

    Mark as done

    Tree traversal, Minimum Spanning Trees

    
    

  • Class Test: 3

    Mark as done
• Week 12
  

  Week 12

  • Lesson 12.2.1: Relation I URL

    Mark as done

    Relations and their properties,
    

  • Lesson 12.2.2: Relation II URL

    Mark as done

    Representation of relations, Partial Order

    
    

  • Lesson 12.1.1: Introduction to Probability URL

    Mark as done

    Basics of Probability
    

  • Lesson 12.1.2: Probability Theory URL

    Mark as done

    Theory of probability

  • Probability Slide-01

    Mark as done
  • Probability Slide-02

    Mark as done
• Final Assessment
  

  Final Assessment

  • Final Assessment Spring 2021 Assignment

    Mark as done

    Go through the instructions before you start the Assessment.

    1. Template for Answer Script is provided. You have to hand write the answers and submit the answer script in a single pdf. Typed answer script is not allowed. It will lead to plain 00 marks. So be very much careful about that.
    2. Write your ID on each page of your answer script.
    3. You will get 4:00 hours to perform all the task related to the assessment. No late submission is allowed.
    4. Be honest and Do not try to copy or provide your answer script to others. If plagiarism is found both will get plain 00 marks out of  40 whether you copy answer of a little like 1/2 marks.
    5. Please submit your answer script in a single PDF. File name will be your name then an underscore followed by your ID. Example- Your ID is 191-15-12345, then File name will be "Your Name_191-15-12345_MCS.pdf".