Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 23 views

    CE303 Mathematical Foundation of Computer Science (3 1 0 4)

    Uploaded by

    Tamal Chakraborty
    This document provides information about the CE303 Mathematical Foundation of Computer Science course. The course aims to help students understand discrete mathematics preliminaries, apply the concepts to computer science problems, and use analytical problem solving. The syllabus covers topics like sets theory, permutations, combinations, relations, graphs, trees, and algorithm analysis. Students will complete self-study and tutorial work based on these topics. References for further reading are also included.

    Copyright:

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

    CE303 Mathematical Foundation of Computer Science (3 1 0 4)

    Uploaded by

    Tamal Chakraborty
    23 views2 pages
    This document provides information about the CE303 Mathematical Foundation of Computer Science course. The course aims to help students understand discrete mathematics preliminaries, apply the concepts to computer science problems, and use analytical problem solving. The syllabus covers topics like sets theory, permutations, combinations, relations, graphs, trees, and algorithm analysis. Students will complete self-study and tutorial work based on these topics. References for further reading are also included.

    Original Description:

    Mathematics

    Original Title

    Maths

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides information about the CE303 Mathematical Foundation of Computer Science course. The course aims to help students understand discrete mathematics preliminaries, apply the concepts to computer science problems, and use analytical problem solving. The syllabus covers topics like sets theory, permutations, combinations, relations, graphs, trees, and algorithm analysis. Students will complete self-study and tutorial work based on these topics. References for further reading are also included.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    23 views2 pages

    CE303 Mathematical Foundation of Computer Science (3 1 0 4)

    Uploaded by

    Tamal Chakraborty
    This document provides information about the CE303 Mathematical Foundation of Computer Science course. The course aims to help students understand discrete mathematics preliminaries, apply the concepts to computer science problems, and use analytical problem solving. The syllabus covers topics like sets theory, permutations, combinations, relations, graphs, trees, and algorithm analysis. Students will complete self-study and tutorial work based on these topics. References for further reading are also included.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    CE303 Mathematical Foundation of Computer Science [3 1 0 4]

    Course Learning Outcome:

    After successful completion of this course, student will be able to


    • understand discrete mathematical preliminaries
    • apply discrete mathematics in formal representation of various computing constructs
    • recognize the importance of analytical problem solving approach in engineering problems

    Syllabus:

    Sets Theory, Propositions and Computability: Introduction, Combinations of Sets, Finite and Infinite
    Sets, Uncountable Infinite Sets, Mathematical Induction, Principle of Inclusion and Exclusion,
    Propositions and Propositional Calculation, Russell’s Paradox and Non computability, Applications of
    these concepts in language Theory and AI.

    Permutations, Combinations, and Discrete Probability: Introduction, The Rules of sum and product,
    Permutations, Combinations, Generation of Permutations and Combinations, Discrete Probability ,
    Applications in Data recovery and Security.

    Relations and Functions: Introduction, A relational Model for Data Bases, Properties of Binary
    Relations, Equivalence Relations and Partitions, Partial Ordering Relations and Lattices, A Job-
    scheduling Problem, Functions types of functions and the Pigeonhole Principle

    Graphs and Trees: Basic Terminology, Multigraphs and Weighted Graphs, Paths and Circuits Shortest
    Paths in Weighted Graphs, Euclidian Paths and Circuits, Hamiltonian Paths and Circuits, The Traveling
    Salesperson Problem, Factors of a Graph, Planar Graphs, Trees, Rooted Trees, Path Lengths in Rooted
    Trees, Prefix Codes, Binary Search Trees, Spanning Trees and Cut-Sets, Minimum Spanning Trees

    Analysis of Algorithms Time Complexity of Algorithms: A Shortest-Path Algorithms, Complexity of


    Problems, Tractable and Intractable Problems, Numeric Functions, Asymptotic Behavior of Numeric
    Functions.

    Recurrence Relations and Recursive Algorithms: Recurrence Relations, Linear Recurrence Relations
    with Constant Coefficients, Homogeneous Solutions, Particular Solutions, Total Solutions. Use of
    Recurrence Relations for Analysis of Algorithms.

    Self-Study:

    The self-study contents will be declared at the commencement of semester. Around 10% of the questions
    will be asked from self-study contents.

    Tutorial Work:

    Tutorial work will be based on above syllabus with minimum 10 tutorials to be incorporated.
    Page 1 of 2
    References:

    1. C. L. Liu, Elements of Discrete Mathematics, Tata McGraw Hill


    2. Tremblay, J.P. & Manohar, Discrete mathematical structures with application to computer
    science, McGraw Hill
    3. Rosen, Kenneth L., Discrete Mathematics and its applications, McGraw Hill

    Page 2 of 2

    You might also like