Scribd Logo
Upload

Welcome to Scribd!

  • 15 views

    Discrete Structures 30092022 115600am

    Uploaded by

    Abdul
    This document outlines a 3-credit, undergraduate course in discrete structures. The course aims to teach fundamental concepts in set theory, algorithms, relations, functions, mathematical reasoning, graph theory, and Boolean algebra. Upon completion, students will be able to describe key concepts, apply discrete structures to problems involving sets and graphs, and design algorithm pseudocode. The course covers topics like propositions, sets, functions, algorithms, number systems, relations, induction, graph theory, Boolean logic, and trees over 18 weeks. Student learning is assessed through assignments, quizzes, midterms, and a final exam.

    Copyright:

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

    Discrete Structures 30092022 115600am

    Uploaded by

    Abdul
    15 views5 pages
    This document outlines a 3-credit, undergraduate course in discrete structures. The course aims to teach fundamental concepts in set theory, algorithms, relations, functions, mathematical reasoning, graph theory, and Boolean algebra. Upon completion, students will be able to describe key concepts, apply discrete structures to problems involving sets and graphs, and design algorithm pseudocode. The course covers topics like propositions, sets, functions, algorithms, number systems, relations, induction, graph theory, Boolean logic, and trees over 18 weeks. Student learning is assessed through assignments, quizzes, midterms, and a final exam.

    Original Title

    Discrete-Structures-30092022-115600am

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines a 3-credit, undergraduate course in discrete structures. The course aims to teach fundamental concepts in set theory, algorithms, relations, functions, mathematical reasoning, graph theory, and Boolean algebra. Upon completion, students will be able to describe key concepts, apply discrete structures to problems involving sets and graphs, and design algorithm pseudocode. The course covers topics like propositions, sets, functions, algorithms, number systems, relations, induction, graph theory, Boolean logic, and trees over 18 weeks. Student learning is assessed through assignments, quizzes, midterms, and a final exam.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    15 views5 pages

    Discrete Structures 30092022 115600am

    Uploaded by

    Abdul
    This document outlines a 3-credit, undergraduate course in discrete structures. The course aims to teach fundamental concepts in set theory, algorithms, relations, functions, mathematical reasoning, graph theory, and Boolean algebra. Upon completion, students will be able to describe key concepts, apply discrete structures to problems involving sets and graphs, and design algorithm pseudocode. The course covers topics like propositions, sets, functions, algorithms, number systems, relations, induction, graph theory, Boolean logic, and trees over 18 weeks. Student learning is assessed through assignments, quizzes, midterms, and a final exam.

    Copyright:

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

    Discrete Structures

    Course Code: GSC-221


    Credit Hours: 3
    Pre-requisite: None
    The aim of discrete structures is to equip students with
    basic and deep concepts of set theory, algorithms,
    Objectives:
    relations, functions, Mathematical reasoning and
    induction, Graph theory, Boolean algebra, Trees.

    Upon successful completion of this course, the student


    should be able to:

    CLO-1 (C1): Describe the fundamental concepts of sets,


    functions, algorithms, and graph theory.
    Course Learning
    Outcomes (CLOs):
    CLO-2 (C3): Apply the concepts of discrete structures related
    to sets and number theory, rooted and unrooted graphs.

    CLO-4 (C6): Design pseudocodes of algorithms that can


    perform the tasks or operations for the problem

    Course Outline: ● Revision of basic concepts


    ● Propositions
    ● Propositional Equivalence
    ● Conditional Propositions and Logical Equivalence.
    ● Conditional Propositions and Logical Equivalence,
    Proofs
    ● Set Theory, subsets,
    ● Venn Diagrams
    ● Cartesian product
    ● Operations on sets
    ● Unions, intersections, complement of sets.
    ● Properties of union and intersection and proofs
    using Venn diagrams
    ● Functions
    ● One to one and onto functions
    ● Inverse functions
    ● Composition of functions
    ● Sequence and strings
    ● Summations
    ● Integer sequence
    ● Number system
    ● Decimal, Binary, Hexadecimal and Octal Number
    Systems
    ● Relations
    ● Matrices of Relations
    ● Predicates
    ● Quantifiers
    ● Nested Quantifiers
    ● Mathematical Induction
    ● Strong induction
    ● Problem solving corner
    ● Integers
    ● Notations for Algorithms
    ● Algorithms and integers
    ● The Euclidean algorithm
    ● Recursive Algorithm
    ● Complexity of algorithm
    ● Introduction to Graph Theory
    ● Graphs terminologies and special types of graphs
    ● Paths and Cycles
    ● Hamilton cycles and traveling salesperson
    problems
    ● Shortest path algorithms
    ● Combinational Circuits
    ● Properties
    ● Boolean function and its representation
    ● Logic gates
    ● Boolean functions and synthesis circuits
    ● Applications
    ● Introduction to trees
    ● Applications of trees
    ● Spinning trees
    ● Finite state machines
    ● Related Examples and Exercises
    ● Student Theory and Problematic Exercises
    ● Revision and Discussion on Final Examination
    Textbook:
    ● Kenneth H. Rosen, Discrete Mathematics and Its
    Applications, 7th Edition, McGraw Hill Books Co.
    Resources: (Book
    Reference Book(s)
    ● Richard Johnsonbaugh, Discrete Mathematics, 5th
    Edition, Pearson Education Asia. (Book II)

    Mapping of CLOs to PLOs (Program Learning Outcomes)


    CLO
    PLOs CLO 1 CLO 3
    2
    PLO:1 (Engineering Knowledge) X
    PLO:2 (Problem Analysis)
    PLO:3 (Design/Development of Solutions) X X
    PLO:4 (Investigation)
    PLO:5 (Modern Tool Usage)
    PLO:6 (The Engineer and Society)
    PLO:7 (Environment and Sustainability)
    PLO:8 (Ethics)
    PLO:9 (Individual and Teamwork)
    PLO:10 (Communication)
    PLO:11 (Project Management)
    PLO:12 (Lifelong learning)

    Mapping of CLOs to Course Assessment

    Assessments
    CLO 1 CLO 2 CLO 3
    Assignments X X
    Quizzes X X
    Midterm Exam X X
    Final Exam X X X
    BAHRIA UNIVERSITY
    Department of Computer Engineering

    Computer Engineering Program


    GSC 221: Discrete Mathematics 3 (3+0)

    Week: Lecture Breakdown

    Week 1: Introduction to Discrete Mathematics and logic

    Week 2: Set Theory

    Week 3: Introduction to sets

    Week 4: Set Operations

    Week 5: Introduction to Functions, Injective functions

    Week 6: Surjective and Bijective Functions

    Week 7 Sequences and Series

    Week 8: Introduction to Sorting algorithms

    Week 9: MID-EXAM

    Week 10: Searching Algorithms

    Week 11: Introduction to Number Theory

    Congruence Relation and Congruent Classes


    Week 12:
    Week 13: Arithmetic Modulo in detail with application of Congruence

    Week 14: Introduction to graphs and application of graphs

    Week 15: Isomorphic graphs with practice session and applications

    Paths, Hamiltonian and Euler paths/Circuits with application and


    Week 16:
    examples
    Introduction to Trees, Type and Application of trees, Binary search
    Week 17:
    Tree.

    Week 18: FINAL EXAM

    You might also like