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

Welcome to Scribd!

  • 18 views

    Lecture 1

    Uploaded by

    the
    This 3-credit course on Engineering Mathematics-III is offered to second year B.Tech students in Computer Science and Engineering and Information Technology. The course aims to develop students' understanding of relations on sets, basic counting techniques, propositional and predicate logic, algebraic structures, graph theory, and trees. Key topics include partial order relations, lattices, graph algorithms, tree algorithms, permutations and combinations, propositional and predicate calculus, and group theory. Students will be assessed through internal exams, quizzes, assignments, and an end-term exam.

    Copyright:

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

    Lecture 1

    Uploaded by

    the
    18 views10 pages
    This 3-credit course on Engineering Mathematics-III is offered to second year B.Tech students in Computer Science and Engineering and Information Technology. The course aims to develop students' understanding of relations on sets, basic counting techniques, propositional and predicate logic, algebraic structures, graph theory, and trees. Key topics include partial order relations, lattices, graph algorithms, tree algorithms, permutations and combinations, propositional and predicate calculus, and group theory. Students will be assessed through internal exams, quizzes, assignments, and an end-term exam.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This 3-credit course on Engineering Mathematics-III is offered to second year B.Tech students in Computer Science and Engineering and Information Technology. The course aims to develop students' understanding of relations on sets, basic counting techniques, propositional and predicate logic, algebraic structures, graph theory, and trees. Key topics include partial order relations, lattices, graph algorithms, tree algorithms, permutations and combinations, propositional and predicate calculus, and group theory. Students will be assessed through internal exams, quizzes, assignments, and an end-term exam.

    Copyright:

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

    Lecture 1

    Uploaded by

    the
    This 3-credit course on Engineering Mathematics-III is offered to second year B.Tech students in Computer Science and Engineering and Information Technology. The course aims to develop students' understanding of relations on sets, basic counting techniques, propositional and predicate logic, algebraic structures, graph theory, and trees. Key topics include partial order relations, lattices, graph algorithms, tree algorithms, permutations and combinations, propositional and predicate calculus, and group theory. Students will be assessed through internal exams, quizzes, assignments, and an end-term exam.

    Copyright:

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

    B.

    TECH SECOND YEAR


    ACADEMIC YEAR: 2023-2024

    COURSE NAME: ENGINEERING MATHEMATICS-III


    COURSE CODE : MA 2101
    LECTURE SERIES NO : 1
    CREDITS : 3
    MODE OF DELIVERY :

    1
    “TO DEVELOP THE UNDERSTANDING
    SESSION OUTCOME OF THE COURSE’

    2
    Introduction about the course

    Course Name : Engineering Mathematics-III

    Course Code : MA 2101


    (A, R )

    Course Credits: 3 Credits

     LTPC: 3003

    3
    Introduction:
    This course is offered by Dept. of Mathematics & Statistics as a regular course,
    targeting students who wish to pursue B.Tech., in Computer Science and
    Engineering, Information Technology & Computer Communication Engineering. It
    offers in depth knowledge of relations on sets, Basic counting techniques,
    (A, R )

    propositional and predicate and propositional logic, basic/introductory level


    algebraic structures, graph theory & trees. Students are expected to have

    background knowledge on number system.

    4
    Course Outcomes: At the end of the course, students will be able to
    [2101.1]. Understand the concept of Partial Order Relations, lattices and their
    applications.

    (A, R )
    [2101.2]. Understand the concepts of Graph Theory and apply the graph algorithm to
    evaluate and analyze the problems, which enhance the analytical and logical
    skills.

    [2101.3]. Understand the concepts of Trees and apply the tree algorithm to analyze the
    shortest path problems, which enhance the analytical and logical skills.

    5
    Course Outcomes: At the end of the course, students will be able to

    [2101.4]. Describe basic counting techniques and their applications to evaluate the
    relevant problems

    (A, R )
    [2101.5]. Describe the concept of Predicates, logics, and their properties which
    enhance the logical and programming skills and make them employable in
    the relevant industry.

    [2101.6]. Describe the concept of Algebraic structure and Group theory, Boolean
    Algebra which helps to increase the logical skills.

    6
    Assessment Plan

    Criteria Description Maximum


    Marks
    Sessional Exam 30
    Internal
    (A, R )
    Assessment In class Quizzes and/or Assignments , Activity 30
    (Summative) feedbacks
    End Term End Term Exam 40

    Exam
    (Summative)
    Total 100

    7
    SYLLABUS
    Partial ordering relations, Poset, Lattices, Basic Properties of Lattices. Distributive and complemented lattices,

    Graph theory: Basic definitions, Degree, regular graphs, Eulerian and Hamiltonian graphs,
    Trees and Properties, Center, radius and diameter of a graph, Rooted and binary trees, Matrices associated with
    graphs, Algorithms for finding shortest path, Algorithm.
    Elementary configuration: Permutations and Combinations, Generating function, Principle of inclusion and
    (A, R )

    exclusion Partitions.
    Propositional and Predicate Calculus: Well-formed formula, connectives, quantifications, Inference theory of
    propositional and predicate calculus.

    Algebraic Structures: Group theory: Semi groups, Monoids, Groups subgroups, Normal Subgroups, Cosets,
    Lagrange's Theorem, Cyclic groups. Boolean Algebra: Boolean lattices and Boolean Algebra.

    8
    References Books

    1. T Veerarajan, Discrete Mathematics with Graph Theory and Combinatorics, Tata MCGraw
    Hill.
    2. C. L. Liu, Elements of Discrete Mathematics, (2e), McGraw Hill, New Delhi, 2007.
    3. J. P. Trembaly, R. Manohar, Discrete Mathematics Structures with application to computer
    (A, R )

    science, McGraw Hill, 2012.


    4. E. S. Page, L. B. Wilson, An Introduction to Computational Combinatorics, Cambridge

    Univ. Press, 1979.


    5. N. Deo, Graph theory with Applications to computer science, Prentice Hall of India, 2012.

    9
    (A, R )

    THANKS

    10

    You might also like