Nothing Special   »   [go: up one dir, main page]
Scribd Logo
Upload

Welcome to Scribd!

  • 21 views

    Introduction

    Uploaded by

    Shadmaan Sabit
    This document outlines the syllabus for the CSE 2213 Discrete Mathematics course taught by Nabila Sabrin Sworna. It details the course assessments including attendance, assignments, class tests, midterm exam, and final exam. Students must attend classes regularly, complete assignments on time, and prepare adequately for tests. Course materials will be provided on the learning management system. Communication should be done via email, phone, or LMS messaging rather than IM apps. Topics to be covered include logic and proofs, sets and functions, mathematical induction, counting problems, recurrence relations, and graphs and trees. Discrete mathematics is relevant to computer science as it involves the mathematics of discrete objects like those used in computing.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    Introduction

    Uploaded by

    Shadmaan Sabit
    21 views24 pages
    This document outlines the syllabus for the CSE 2213 Discrete Mathematics course taught by Nabila Sabrin Sworna. It details the course assessments including attendance, assignments, class tests, midterm exam, and final exam. Students must attend classes regularly, complete assignments on time, and prepare adequately for tests. Course materials will be provided on the learning management system. Communication should be done via email, phone, or LMS messaging rather than IM apps. Topics to be covered include logic and proofs, sets and functions, mathematical induction, counting problems, recurrence relations, and graphs and trees. Discrete mathematics is relevant to computer science as it involves the mathematics of discrete objects like those used in computing.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines the syllabus for the CSE 2213 Discrete Mathematics course taught by Nabila Sabrin Sworna. It details the course assessments including attendance, assignments, class tests, midterm exam, and final exam. Students must attend classes regularly, complete assignments on time, and prepare adequately for tests. Course materials will be provided on the learning management system. Communication should be done via email, phone, or LMS messaging rather than IM apps. Topics to be covered include logic and proofs, sets and functions, mathematical induction, counting problems, recurrence relations, and graphs and trees. Discrete mathematics is relevant to computer science as it involves the mathematics of discrete objects like those used in computing.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    21 views24 pages

    Introduction

    Uploaded by

    Shadmaan Sabit
    This document outlines the syllabus for the CSE 2213 Discrete Mathematics course taught by Nabila Sabrin Sworna. It details the course assessments including attendance, assignments, class tests, midterm exam, and final exam. Students must attend classes regularly, complete assignments on time, and prepare adequately for tests. Course materials will be provided on the learning management system. Communication should be done via email, phone, or LMS messaging rather than IM apps. Topics to be covered include logic and proofs, sets and functions, mathematical induction, counting problems, recurrence relations, and graphs and trees. Discrete mathematics is relevant to computer science as it involves the mathematics of discrete objects like those used in computing.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 24

    CSE 2213

    DISCRETE
    MATHEMATICS
    Course teacher: Nabila Sabrin Sworna

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 1
    MARKS BREAKDOWN
    Assessment type Marks
    Attendance 5
    Assignment 5
    Class test 20
    Mid-term Exam 30
    Final Exam 40

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 2
    ASSIGNMENT
    One assignment before Mid-term and one before Final
    Marks of both will be averaged

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 3
    CLASS TESTS
    Will be held in 6th, 11th, 18th and 23rd class
    🢝Exact dates will be given in LMS

    Best 3 will be counted

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 4
    MID-TERM AND FINAL
    Will be taken centrally
    As per the rules of the authority

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 5
    CODE OF CONDUCT
    Join the classes regularly
    Pay attention and try to solve the problems
    Attend the tests with adequate preparation
    Submit the assignments timely
    Inform me of any problems before time

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 6
    MATERIALS
    Class materials will be given in LMS

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 7
    COMMUNICATION
    The allowed communication media are email, phone and LMS message.
    Use of IM like Messenger, Whatsapp, Viber, Imo etc is strongly prohibited.
    Send an email in case you need counseling hours.

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 8
    SO, LET’S BEGIN!!!

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD
    WHICH TOPICS WILL WE
    COVER?

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD
    Knights and Knaves

    LOGIC AND PROOFS


    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 11
    Greek Latin

    Cyrillic

    SETS AND FUNCTIONS


    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 12
    MATHEMATICAL INDUCTION

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 13
    COUNTING PROBLEMS
    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 14
    RECURRENCE RELATIONS

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 15
    GRAPHS AND TREES
    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 16
    BUT WHY DO WE CALL IT
    DISCRETE MATH??

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD
    DISCRETE MATH IS THE
    MATH OF DISCRETE
    THINGS

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD
    MATH OF DISCRETE THINGS
    Propositions, predicates, graphs, trees are discrete objects
    Counting, induction, recurrence involve discrete objects and techniques
    Even the sets/functions we discuss will involve discrete objects

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 19
    SO, WHY STUDY DM AS A
    CS COURSE???

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD
    COMPUTER IS A MACHINE
    OF DISCRETE OBJECTS!!!

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD
    MACHINE OF DISCRETE
    OBJECTS
    Memory units are divided into bits (0 or 1) – discrete entity!!!
    Even continuous quantities (like real numbers) are represented as discrete entities!!!
    🢝Approximations of real numbers to a very large precision

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 22
    DISCRETE MATH IS THE
    BASE OF COMPUTER
    SCIENCE!!!

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD
    BASE OF COMPUTER SCIENCE
    Logics, proofs, sets, functions, recurrence, graphs, trees …
    Basic building blocks of more advanced CS topics like data structures, algorithms,
    …
    Basic building blocks for problem solving!!!

    18/6/2022 MUNTAKA@CSE.UIU.AC.BD 24

    You might also like