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

Detailed Syllabus MST 2 (April 2024)

Download as xlsx, pdf, or txt
Download as xlsx, pdf, or txt
You are on page 1of 15

CEC-CSE

2nd MST Syllabus


Semester 4th

Subject Name

Discrete
Mathematics

Computer
Organization &
Architecture

Operating
Systems
Design &
Analysis of
Algorithms

Universal
Human Values

Environmental
Sciences
CEC-CSE
2nd MST Syllabus
Semester 4th
Syllabus

Module 3: Propositional Logic: Syntax, Semantics, Validity and Satisfiability, Basic Connectives and Truth
Tables, Logical Equivalence: The Laws of Logic, Logical Implication, Rules of Inference, The use of Quantifiers.
Proof Techniques: Some Terminology, Proof Methods and Strategies, Forward Proof, Proof by Contradiction,
Proof by Contraposition, Proof of Necessity and Sufficiency.
Module 4:
Algebraic Structures and Morphism: Algebraic Structures with one Binary Operation, SemiGroups, Monoids,
Groups, Congruence Relation and Quotient Structures, Free and Cyclic Monoids and Groups, Permutation
Groups, Substructures, Normal Subgroups, Algebraic Structures with two Binary Operation, Rings, Integral
Domain and Fields. Boolean Algebra and Boolean Ring, Identities of Boolean Algebra, Duality, Representation
of Boolean Function, Disjunctive and Conjunctive Normal Form
Module 1:
Principles of Mathematical Induction: The Well-Ordering Principle, Recursive definition,The Division algorithm:
Prime Numbers, The Greatest Common Divisor: Euclidean Algorithm, The Fundamental Theorem of Arithmetic.
Module 5:
Definition properties and Example, rooted trees, trees and sorting, weighted trees and prefix codes,
Biconnected component and Articulation Points, Shortest distances.

Module 2: Memory system design: semiconductor memory technologies, memory organization.


Peripheral devices and their characteristics: I/O transfers – program controlled, interrupt driven and DMA,
privileged and non-privileged Instructions, I/O device interfaces – SCSI,
USB.
Module 3: Pipelining
Basic concepts of pipelining and its parameters, pipeline hazards, Introduction to parallel processors,
Concurrent access to memory and Cache coherency.
Module 4: Memory Organization
Memory interleaving, cache memory, cache size vs. block size, mapping functions, replacement algorithms,
write policies.

Module 4: Deadlocks Definition, Necessary and sufficient conditions for Deadlock, Deadlock Prevention,
Deadlock Avoidance: Banker’s algorithm, Deadlock detection and Recovery. Module 5: MemoryManagement
Basicconcept,LogicalandPhysical address map, Memory allocation: Contiguous Memory
allocation –Fixedandvariable partition–Internaland External fragmentation and Compaction;
Paging: Principle of operation – Page allocation–Hardware support for paging, Protection and
sharing, Disadvantages of paging.
Virtual Memory: Basics of Virtual Memory – Hardware and control structures – Locality of
reference, Page fault, Working Set, Dirty page/Dirty bit – Demand paging, Page Replacement
algorithms: Optimal, First in First Out (FIFO), Second Chance (SC), Not recently used
(NRU) and Least Recently used (LRU).
Module 6: I/O Hardware
I/O devices, Device controllers, Direct memory access Principles of I/O Software: Goals of
Interrupt handlers, Device drivers, Device independent I/O software, Secondary-Storage
Structure: Disk structure, Disk scheduling algorithms
File Management: Concept of File, Access methods, File types, File operation, Directory
structure, File System structure, Allocationmethods (contiguous, linked, indexed), Free
Space Management (bit vector, linked list, grouping), directory implementation (linear list,
hash table), efficiency and performance.
Disk Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN, C-SCAN, Disk
reliability, Disk formatting, Boot-block, Bad blocks.
Module 3: Graph and Tree Algorithms
Shortest path algorithms, Transitive closure, Minimum Spanning Tree, Topological sorting, Network Flow
Algorithm.
Module 4: Tractable and Intractable Problems
Computability of Algorithms, Computability classes – P, NP, NP-complete and NP-hard.
Cook’s theorem, Standard NP-complete problems and Reduction techniques
Module 5: Advanced Topics
Approximation algorithms, Randomized algorithms, Heuristics and their characteristics
13. Understanding values in human-human relationship; meaning of Justice (nine
universal values in relationships) and program for its fulfilment to ensure mutual
happiness; Trust and Respect as the foundational values of relationship.
14. Understanding the meaning of Trust; Difference between intention and
competence
15. Understanding the meaning of Respect, Difference between respect and
differentiation; the other salient values in relationship.
16. Understanding the harmony in the society (society being an extension of family):
Resolution, Prosperity, fearlessness (trust) and co-existence as comprehensive Human
Goals.
17. Visualizing a universal harmonious order in society- Undivided Society,odule 4: Understanding Harmony in
the Nature and Existence - Whole
existence as Coexistence
18. Understanding the harmony in the Nature
19. Interconnectedness and mutual fulfilment among the four orders of nature -
recyclability and self-regulation in nature
20. Understanding Existence as Co-existence of mutually interacting units in allpervasive space
21. Holistic perception of harmony at all levels of existence.
Include practice sessions to discuss human being as cause of imbalance in nature (film
“Home” can be used), pollution, depletion of resources and role of technology etc.
Module 5: Implications of the above Holistic Understanding of Harmony on
Professional Ethics
22. Natural acceptance of human values
23. Definitiveness of Ethical Human Conduct
24. Basis for Humanistic Education, Humanistic Constitution and Humanistic
Universal Order
25. Competence in professional ethics: a. Ability to utilize the professional
competence for augmenting universal human order b. Ability to identify the scope
and characteristics of peoplefriendly and eco -friendly production systems, c.
Ability to identify and develop appropriatetechnologies and management patterns
for above production systems.
26. Case studies of typical holistic technologies, management models and production
systems.
27. Strategy for transition from the present state to Universal Human Order: a.
At the level of individual: as socially and ecologically responsible engineers,
technologists and managers b. At the level of society: as mutually enriching
institutions and organizations.

Module 3 : Biodiversity and its conservation • Introduction – Definition : genetic, species and ecosystem
diversity. • Biodiversity at global, National and local levels. • Inida as a mega-diversity nation • Hot-sports of
biodiversity. • Threats to biodiversity : habitat loss, poaching of wildlife, man-wildlife conflicts. • Endangered and
endemic species of India • Module 4 : Social Issues and the Environment • From Unsustainable to Sustainable
development • Resettlement and rahabilitation of people; its problems and concerns. • Environmental ethics :
Issues and possible solutions. • Climate change, global warming, acid rain, ozone layer depletion, Nuclear
accidents and holocaust. Case Studies. • Public awareness.

CEC-CSE
2nd MST Syllabus
Semester 6th
Subject Name Syllabus

unit II: syntax analysis: Perdictive parser- LL(1) parser- shift reduce parser- LR parser-
LR(0) item construction of SLR parsing table- introduction to LALR parser- Error handling
and recovery in syntax analyzer- YACC.
unit III: Intermediate Code generation: Syntax Directed
definition, Evaluation orders for syntax Directed definitions, Intermediated languages:
Compiler syntax tree, Three Adress code, Types and declarations, translation of expressions, type
Design checking. Unit IV: Run time environment and
code generation: storage organisation, stack allocation space, access to non- local data on
the stack, heap management- issues in code generation- design of a simple code
generator. Unit
V: code optimization: principle sources of optimization- peep hole optimization- DAG-
optimization of basic blocks- global flow analysis- efficient data flow algorithm.

UNIT 3: Bayesian Networks- representation, construction and inference, temporal model,


hidden Markov model.
UNIT 4: Markov Decision process MDP formulation, utility theory, utility functions, value
Artificial iteration, policy iteration and partially observable MDPs.
Intelligence UNIT 5: Reinforcement Learning Passive reinforcement learning, direct utility estimation,
adaptive dynamic programming, temporal difference learning, active reinforcement
learning- Q learning.

UNIT 4: Cloud deployment models: Introduction to cloud deployment models, Public


clouds,
Private clouds, Hybrid clouds, Community clouds, Migration paths for cloud,
Selection criteria for cloud deployment.
Cloud
UNIT 5: Security in cloud computing: Understanding security risks,
Computing
Principal security dangers to cloud computing, Internal security breaches,
User account and service hijacking, measures to reduce cloud security
breaches Case Studies: Comparison of existing Cloud platforms /Web Services.
Unit-IV DETAIL CONTENTS 1. Sprucing up Mobile apps: App functionality beyond
user interface- Threads, sync task, Services-states and life cycle, Notifications,
Broadcast receivers, Telephony and SMS APIs Native data handling: on device
file I/O, shared preferences, mobile databases such as SQLite, Working with a
content provider .
Unit-V Introduction to IoT Architectural Overview, Design principles and needed
capabilities, IoT Applications, Sensing, Actuation, Basics of Networking, M2M and
IoT Technology Fundamentals- Devices and gateways, Data management,
Business processes in IoT, Everything as a Service(XaaS), Role of Cloud in IoT,
MAD
Security aspects in IoT. 2. Elements of IoT ,Factors in Developing Mobile
Applications: Mobile Software Engineering, Frameworks and Tools, Generic UI
Development, Android User Graphics and Multimedia: Performance and
Multithreading, Graphics and UI Performance, Android Graphics, Mobile Agents
and Peer-to-Peer Architecture, Android Multimedia
Unit-VI Computing (Arduino, Raspberry Pi), Communication, Sensing, Actuation,
I/O interfaces. Platforms and Additional Issues: Development Process,
Architecture, Design, Technology Selection, Testing, Security and Hacking, Active
Transactions, More on Security

UNIT 4 Classification: Need and Applications of Classification, Logistic Regression,


Decision tree, Tree induction algorithm – split algorithm based on information theory, split
algorithm based on Gini index; Random forest classification, Naïve Bayes algorithm;
KNearest Neighbours (K-NN), Support Vector Machine (SVM), Evaluating Classification
Models Performance (Sensitivity, Specificity, Precision, Recall, etc.). Clustering: Need and
Applications of Clustering, Partitioned methods, Hierarchical methods, Density-based
Machine methods.
Learning UNIT 5 Association Rules Learning: Need and Application of Association Rules Learning,
Basic concepts of Association Rule Mining, Naïve algorithm, Apriori algorithm. Artificial
Neural Network: Need and Application of Artificial Neural Network, Neural network
representation and working, Activation Functions. Genetic Algorithms: Basic concepts,
Gene Representation and Fitness Function, Selection, Recombination, Mutation and
Elitism.

Packet Radio Protocols; Pure ALOHA, Slotted ALOHA. (CO3)


Unit 4: Wireless Systems & Standards: AMPS and ETACS, United states digital cellular
(IS- 54 & IS 136), IEEE Standards, Global system for Mobile (GSM): Services, Features,
System Architecture and Channel Types, Frame Structure for GSM, Speech Processing in
Wireless
GSM, GPRS/EDGE specifications and features. 3G systems: UMTS & CDMA 2000
Communicatio
standards and specifications. CDMA Digital standard (IS 95): Frequency and Channel
n
specifications, Forward CDMA Channel, Reverse CDMA Channel, Wireless Cable
Television.(CO4)
Unit 5: Evolution of Communication Generations: Introduction to Bluetooth, Zigbee, LTE-
Advance systems, 4G & 5G Mobile techniques and Emerging technologies. (CO5)
CEC-CSE
2nd MST Syllabus
M.Tech 2nd
Subject Name

Advance
Algorithms

Soft
computing

Computer
vision
Human
Computer
Interactions
CEC-CSE
2nd MST Syllabus
M.Tech 2nd
Syllabus

Unit 3
Flow-Networks: Maxflow-mincut theorem, Ford-Fulkerson Method to compute
maximum flow, Edmond-Karp maximum-flow algorithm. Matrix Computations: Strassen's algorithm and
introduction to divide and conquer
paradigm, inverse of a triangular matrix, relation between the time complexities of basic
matrix operations, LUP-decomposition.
Unit 4
Shortest Path in Graphs: Floyd-Warshall algorithm and introduction to dynamic
programming paradigm. More examples of dynamic programming. Modulo Representation of
integers/polynomials: Chinese Remainder Theorem, Conversion between base-representation and modulo-
representation. Extension to
polynomials. Application: Interpolation problem. Discrete Fourier Transform (DFT): In complex field, DFT in
modulo ring. Fast Fourier
Transform algorithm. Schonhage-Strassen Integer Multiplication algorithm.
Unit 5
Linear Programming: Geometry of the feasibility region and Simplex algorithm. NP-completeness: Examples,
proof of NP-hardness and NP-completeness. One or more of the following topics based on time and interest
Approximation algorithms, Randomized Algorithms, Interior Point Method, Advanced
Number Theoretic Algorithm.

Unit 3 - NEURAL NETWORKS: Machine Learning Using Neural Network, Adaptive Networks, Feed forward
Networks, Supervised Learning Neural Networks, Radial Basis Function Networks : Reinforcement Learning,
Unsupervised Learning Neural Networks, Adaptive Resonance architectures, Advances in Neural networks , Unit 4
GENETIC ALGORITHMS: Introduction to Genetic Algorithms (GA), Applications of GA in Machine Learning:
Machine Learning Approach to Knowledge Acquisition, Unit 5 Matlab/Python Lib: Introduction to Matlab/Python,
Arrays and array operations, Functions and Files, Study of neural network toolbox and fuzzy logic toolbox, Simple
implementation of Artificial Neural Network and Fuzzy Logic.

Unit 4:
Feature extraction, shape, histogram, color, spectral, texture, using CVIPtools, Feature 9
analysis, feature vectors, distance /similarity measures, data pre- processing.
Unit 5:
Pattern Analysis:
Clustering: K-Means, K-Medoids, Mixture of Gaussians
Classification: Discriminant Function, Supervised, Un-supervised, Semisupervised.
Classifiers: Bayes, KNN, ANN models; Dimensionality Reduction: PCA, LDA, ICA, and Nonparametric
methods.
Unit 6:
Recent trends inActivity Recognition, computational photography, Biometrics.
Unit 4: Mobile Ecosystem: Platforms, Application frameworks- Types of Mobile Applications: Widgets,
Applications, Games- Mobile Information Architecture, Mobile 2.0, Mobile Design: Elements of Mobile
Design, Tools.
Unit 5: Designing Web Interfaces – Drag & Drop, Direct Selection, Contextual Tools, Overlays, Inlays and
Virtual Pages, Process Flow. Case Studies.
Unit 6: Recent Trends: Speech Recognition and Translation, Multimodal System.

You might also like