Section outline



  • 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% 

    • Follow this notice board for any urgent notices.

    • assign icon
      Quiz-1 & 2 ( For B section) Assignment

      The question and Google Form for submission can be found here.
      Google Form

      Also, give your attendance in BLC


      Not available unless: You belong to B
    • assign icon
      Quiz-1 & 2 ( For C section) Assignment

      The question and Google Form for submission can be found here.
      Google Form

      Also, give your attendance in BLC


      Not available unless: You belong to C
    • Presentation Instructions

      The instructions for the presentations are as follows.

      1. Submit the slide that you are presenting.

      2. Submit the google meet recording like the google meet sessions.

      3. Turn on the camera while you are presenting.

      4. If you have any questions ask them in the telegram group.

      5. This is a single person presentation

      6. You can choose to present any topic

      7. At least present 10 slides(without the introductory or conclusion slides)

      8. The last date of submission is 10.04.20(11:59 pm)

      9. This deadline will be strictly maintained, please submit as early as possible.

    • Follow the presentation instructions and submit the materials here.

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

    • Predicates, Quantifiers I, Quantifiers II

    • Predicates, Quantifiers I, Quantifiers II

    • Class Record for Section B

      Here is the link

      Not available unless: You belong to B
    • Class Record for Section C

      Here is the link

      Not available unless: You belong to C
    • Sets: Concept, type, Finite and Infinite sets, Power set etc.

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

    • Tutorials


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


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

    • Class Test: 1

    • Class Record

      Here is the link

      Not available unless: You belong to C
    • Rules of Inference (What, Why, How) 

    • Class Record

      Here is the link

      Not available unless: You belong to C
    • Class Records

      Here is the link

      Not available unless: You belong to B
    • Submit your answers in BLC
  • Mid-term Week

    • Introduction to graphs, graph terminologies and application, Representing graphs


    • Connectivity, Directed and Undirected graphs

    • Tutorial


    • Class records for B

      Here is the link


      Not available unless: You belong to B
    • Class records for C

      Here is the link


      Not available unless: You belong to C
    • Basics of Tree

    • Tree traversal, Minimum Spanning Trees


    • Class records for B

      Here is the link


      Not available unless: You belong to B
    • Class records for C

      Here is the link


      Not available unless: You belong to C
    • Review Week
      Topics for Final
      Contents of Week-6  to Week-12