Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    Maths MSC

    Uploaded by

    samjaiwin2210
    1. The document outlines the scheme of examination for the M.Sc. Computer Science program including course codes, titles, credits, and assessment details for each semester. 2. In semester 1, courses cover mathematical foundations for compiler science, advanced computer architecture, algorithms, operating systems, web technologies, and soft skills. 3. In semester 2, courses include a supportive course, advanced computer networks, databases, compiler design, labs, and an industrial seminar. 4. The mathematical foundations course introduces concepts like sets, logic, graphs, automata and their applications to computer science areas such as algorithms and cryptography.

    Copyright:

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

    Maths MSC

    Uploaded by

    samjaiwin2210
    13 views3 pages
    1. The document outlines the scheme of examination for the M.Sc. Computer Science program including course codes, titles, credits, and assessment details for each semester. 2. In semester 1, courses cover mathematical foundations for compiler science, advanced computer architecture, algorithms, operating systems, web technologies, and soft skills. 3. In semester 2, courses include a supportive course, advanced computer networks, databases, compiler design, labs, and an industrial seminar. 4. The mathematical foundations course introduces concepts like sets, logic, graphs, automata and their applications to computer science areas such as algorithms and cryptography.

    Original Title

    Maths msc

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. The document outlines the scheme of examination for the M.Sc. Computer Science program including course codes, titles, credits, and assessment details for each semester. 2. In semester 1, courses cover mathematical foundations for compiler science, advanced computer architecture, algorithms, operating systems, web technologies, and soft skills. 3. In semester 2, courses include a supportive course, advanced computer networks, databases, compiler design, labs, and an industrial seminar. 4. The mathematical foundations course introduces concepts like sets, logic, graphs, automata and their applications to computer science areas such as algorithms and cryptography.

    Copyright:

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

    Maths MSC

    Uploaded by

    samjaiwin2210
    1. The document outlines the scheme of examination for the M.Sc. Computer Science program including course codes, titles, credits, and assessment details for each semester. 2. In semester 1, courses cover mathematical foundations for compiler science, advanced computer architecture, algorithms, operating systems, web technologies, and soft skills. 3. In semester 2, courses include a supportive course, advanced computer networks, databases, compiler design, labs, and an industrial seminar. 4. The mathematical foundations course introduces concepts like sets, logic, graphs, automata and their applications to computer science areas such as algorithms and cryptography.

    Copyright:

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

    DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

    M.Se. Computer Seience


    Scheme of Examination |Eect from AY 2022- 2023

    COURSE NAME
    : M.Se. (Computer Science)
    SEMESTER
    SI. SUR SUBJECT TILECLTPINT| EXT
    No CODE

    Mathematical Foundations for Compiler 4 3 0 25 75


    Science
    Advanced Computer Architecture 4
    3 10 25 75
    Design and Analysis of Algorithms 4 3 1 o 25 75
    Advanced Operating System 31025 75
    Web Technologies 4 3|1 0 25 75
    Web Technologies Lab 2 004 50 50
    Design and Analysis of Algorithms Lab 2 0 04S0 50
    8 |Soft Skill Development 0 0 2 50 50

    TOTAL 25 15 5 |10

    COURSE NAME : M.Sc. (Computer Science)


    SEMESTER : II
    SI SUB
    SUBJECTTITLEC L T|PINT EXT
    No CODE
    Supportive Course 3 3 0 025 75
    2 Advanced Computer Networks
    43 1 0 25 75
    3 Advanced Database Management 0 25 75
    System
    Principles of Compiler Design
    Elective I
    43 25 75

    6
    3
    |3 0 0
    2575
    Advanced Database Management
    System Lab
    2 00 4 50 50
    Advanced Computer Networks Lab 2
    Industrial Seminar &Report Writing
    04 50 50

    Career guidance / Library/ Yoga/ LO0 2T 50 50


    0
    Mentoring
    TOTAL 23
    | 15 5 10
    FOR
    MATHEMATICAL
    FOUNDATIONS
    COMPUTER SCIENCE

    CLTP
    a. Ceurse Code:
    3I0
    b. Course Objectives:
    m associata.
    1. To introduce the concepts of sets and pertom associated
    logic,
    To introduce the concepts of mathematical
    on them
    t operations
    To provide basic understanding on abStretalgebrain
    . To construct graphs, its applicat structures
    automata and discuss its
    5. To understand queuing systems and their class and their classifications

    c. Course Prerequisites:
    1. Basic Knowledge in Mathematics
    2. Knowledge of the fundamental concepis in the
    undergraduate level
    d. Course Outcomes (COs):
    After the completion of this course, studen will be able to

    CO1: Evaluate the validity of logieat g I s and construct mathematical proofs

    CO2: administer all the basic operations with sets


    CO3: understand abstract algebralC Suure like groups and their properties

    CO4:Analyse whether given graphs are 1sOmorphic and apply different algorithms to
    find the shortest path ApP!y Mathematical techniques into many areas of
    Computer science like Algornunms, Computer Networks, Cryptography etc.

    CO5: Apply Mathematical technigques into many areas of Computer science like
    Algorithms, ComputerNetvworks, Cryptography etc.

    e. Course Outline:

    Unit-1:Set theory - relations and functions 10 Hours


    Relations Equivalence relation
    The principle of Duality
    -

    Sets Some operations on sets -


    -

    Functions-Composition of functions
    Unit-2: Mathematical logic
    ogeeal pleC 10 Hours
    Connectives Converse, contra positive and inverse statements Tautologies and contradictions
    - Duality law and dual statements The other connectives Functionally complete set of
    connectives Normal forms- Canonical forms - The theory of inferences - Quantifiers - Nested

    Quantifiers
    ds
    exe
    CoA
    e 10 Hours
    Unit-3:Groups Kernel of
    Cyclic Morphism of groups
    -

    Algebraic system Group Subgroup -

    group
    Homomorphism - Cosets and Lagrange's theorem - Normal subgroup

    Unit-4:Graph
    JM Ao 15 Hours
    Graph Theory:Theory andSubgraphs
    Graphs Automata Isomorphism - Some special classes of graphs
    connectedness Euler graphs - Hamiltonian Graphs - Trees - Matrices - Shortest path problem-
    Dijkstra's Algorithm for shortest path-Kruskal's Algorithms- Spanning trees -Networks
    Automata: Formal languages - Phase structure grammar Context free grammar Automation

    - Pushdown automation- Regular sets- Finite state automation

    Unit-5:Probability and Queuingtheory 15 Hours


    Probability: Probabilitytheory- Random variables
    Queuing TheoryQueuing system Operating characteristics of a queuing system
    Deteministic queuing system probability distribution in queuing systems - Classification of
    queuing models - Definition of transient and stcady states-Poisson queuingsystems

    POs and PSOs


    f. Mapping of COs to

    Course PO Addressed Correlation PSO Addressed Correlation Cognitive


    Outcome PO1 to PO7 Level L/M/H PSOl to PSO7 Level L/ M Level K to

    CO1 PO1 H PSO6 K4


    C02 PO1 H PSO6 V K3
    CO3 PO1 PSO1 K2
    CO4 PO4 M PSO4 H KA
    CO5 PO2 P06 M HH PSO2 PS03 | M HI K3
    (L-Low, M- Medium, H- High; Ki -Remember, K2 -Understand, K3-Apply, Ka-Analyze,
    K5-Evaluate, Kg-Create)

    gTextbooks:
    Unit-1: Discrete mathematics by Sankar K, Indian Publishers, Third Edition -Chapter 2
    Unit-2:Discrete mathematics by Sankar K, Indian Publishers, Third Edition - Chapter 1

    Unit-3: Discrete mathematics by Sankar K, Indian Publishers, Third Edition - Chapter 4, (pg

    no. 4.1 to 4.51)

    Unit-4: Discrete Mathematics by K. Chandrasekhara Rao, Narosa Publications Chapter 9 (pg.


    No. 9.1 to 9.12 and 9.24 to 9.40), Chapter 10 (pg. No 10.1 to 10.32)

    Unit-5 Discrete Mathematies by S. Santha, Cengage Learning Publications - Chaper 11


    pg.no 527 to 565)

    Operations Research by Kanti Swarup, P. K Gupta, Man Mohan, Sultan Chand & Sons - Chapter
    21-21.1 to 21.9 (pg. No. 589 - 624))

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy