UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR

Course Description
Title of Course: Advanced Engineering Mathematics
Course Code: MCSE101
L-T Scheme: 3-1 Course Credits: 4

Introduction:
The goal of this mathematics course is to provide high school students and college freshmen an
introduction to basic mathematics and especially show how mathematics is applied to solve fundamental
engineering problems. The Topics to be covered (tentatively) include:
Numerical Methods

Stochastic process

Advanced linear Equations

Advanced Graph theory

Course Objectives:

In this course, the students will learn differentiation and integration of Complex functions and mappings
in the complex plane. They are introduced to Fourier Transforms to stimulate interest in communications,
control and signal processing to prepare them for follow up courses in these areas. They also learn to
extend and formalize knowledge of the theory of probability and random variables and get motivated to
use of statistical inference in practical data analysis.

Course Contents:

Module I

Numerical Analysis: Introduction to Interpolation formulae: Stirling, Bessels And Spline.

Solutions of system of linear and non-linear simultaneous equations: SOR algorithm, Newtons
method

Module II

Stochastic process: Probability: review, random variables, random processes, Random walk, Brownian
motion, markov process, queues: (M/M/1):(/FIFO),(M/M/1):(N/FIFO).

Module III

Advanced linear algebra: Vector spaces, linear transformations, eigenvalues, Eigenvectors, some
applications of eigen value problems, symmetric, skew-symmetric And orthogonal matrices, similarity of
matrices, basis of Eigenvectors, diagonalisation

Module IV

Advanced Graph Theory: Connectivity, Matching, Hamiltonian Cycles, Coloring Problems and
Algorithms for searching an element in a data structure (DFS, BFS).
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Optional:

Module V

A: Complex Variables: Review of Complex variables, Conformal mapping and transformations,

Functions of complex variables, Integration with respect to complex argument, Residues and basic
theorems and applications of residues.

B: Combinatorics: Basic Combinatorial Numbers, Generating Functions and Recurrence Relations,

Inclusion-Exclusion Principles.

C: Optimization Technique: Calculus of several variables, Implicit function theorem, Nature of singular
points, Necessary and sufficient conditions for optimization, Elements of calculus of variation,
Constrained Optimization, Lagrange multipliers, Gradient method, Dynamic programming.

D: Fourier series and Transform: Revision of Fourier series, integrals and transforms and their
properties. The2- dimensional Fourier transform, convolution theorem, Parsevals formula, discrete
Fourier transform, fast Fourier transform

E: Z-transforms: sequence, representation of sequence, basic operations on Sequences, z-transforms,

properties of z-transforms, change on scale, shifting Property, inverse z-transform, solution of
difference equations, region of Convergence, bilinear (s to z) transform

F: Walsh function and hadamard transform: generating walsh functions of Ordern, characteristic sand
applications of walsh function, hadamard Matrix, properties, fast hadamard transform, applications.
Wavelet transform: fundamentals, the Fourier transform and the short term Fourier transform, resolution
problems, multi-resolution analysis, the Continuous wavelet transform, the discrete wavelet transform.

Referencesbooks:

1. Sen, M.K.andMalik, D.F.-FundamentalofAbstractAlgebra,Mc.GrawHill

2. Khanna,V. K.and Ghamdri, S.K.-CourseofAbstractAlgebra,VikashPub.

3. Halmos, T.R.-NaveSetTheory,VanNostrand

4. Scarborough,J. B.-Numerical Mathematical Analysis, Oxford University Press

5. Cone, S.D.-Elementary Numerical Analysis, Mc.GrawHill.

6. Mukhopadhyay, P.-Mathematical Statistics, New Central Book Agency

7. Kapoor, V.K andGupta, S.C.-Fundamental of Mathematical Statistics, Sultan Chand and Sons.

8. Uspensky, J.V.-Introduction to Mathematical Probability, Tata Mc.Graw Hill

9. Dreyfus, S.E.-TheArt and Theory of Dynamic ProgrammingTheory and Applications.

 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
10. Rao, S.S.-Optimisation Theory and Application,Wiley Eastern Ltd., NewDelhi

11. Somasundaram, Discrete Mathematical structures, PHI

12. Kolman, Busby & Ross, Discrete Mathematical structures, PHI

13. V.Krishnamurthy, Combinatorics, Theory and Applications, East-WestPress,1985.

14. N.Alonand J. Spenser, Probabilistic Methods, John Wiley and Sons, 2nd edition, 2000.

15. R.Diestel, Graph Theory, Springer-Verlag, 2nd edition, 2000.

16. I. N.Herstein,"Topics in Algebra",Vani Educational Books, India 1986

17. Kryszig,advancedengineeringmathematics

18. Numerical Methods for Engineers & Scientists by Joe D. Hoffman

 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Advanced Operating System
Course Code: MCSE102
L-T Scheme: 3-1 Course Credits: 3

Introduction:
This advance course of operating system examines operating system design concepts, data structures and
algorithms, systems programming basics, distributive behavior and real time characteristics. The Topics
to be covered (tentatively) include:
Comparative study of various operating systems
Overview on modern operating system structure
Process and thread management
Process synchronization and communication
Memory management
Virtual memory
File system
I/O subsystem and device management
Selected examples in networking, protection and security
Real time operating system and its various applications
Distributed operating system
Embedded system

Objectives:
In this course we will study the basic components of modern operating system, their functions,
mechanisms, policies and techniques used in their implementation and examples from popular operating
systems. The way different modules in the operating system interact and work together to provide the
basic as well as advance services of an operating system.

Learning Outcomes:
Knowledge:
1. Understand the theory and logic of traditional and modern operating system.
2. You will examine the real time algorithms used for various operations on operating systems.
3. You will differentiate between various operating systems functionalities in terms of performance.
4. Become aware of the issues in the management of resources like processor, memory and input-output.
5. Know the problems in the design of operating system and study the probable solutions.
6. Learn to calculate the performance of CPU scheduling and disk scheduling
7. Learn about distributive File systems and methods of accessing
8. Understanding various security threats
9. Get detailed idea on real time operating systems, distributed operating system and their various
applications in real world.
Application:
1. To develop, implement, and debug various CPU scheduling algorithms
2. To develop, implement, and demonstrate the algorithms of synchronizing the processes
3. To develop algorithms to find deadlocks
4. To develop Disk scheduling algorithms
5. To develop event driven scheduling algorithm
6. To implement distributive operating system
7. To implement real time scheduling algorithm
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Course Contents:
Unit 1: Operating System Introduction, Structures - Simple Batch, Multi programmed, time-shared,
Personal Computer, Parallel, Distributed Systems, Real-Time Systems, System components, Operating-
System services, System Calls, Virtual Machines, System Design and

Implementation. Process and CPU Scheduling - Process concepts and scheduling, Operation on processes,
Cooperating Processes, Threads, and Interposes Communication Scheduling Criteria, Scheduling
Algorithm, Multiple -Processor Scheduling, Real-Time Scheduling

Unit 2: Memory Management and Virtual Memory - Logical versus Physical Address Space, Swapping,
Contiguous Allocation, Paging, Segmentation, Segmentation with Paging. Demand Paging, Performance
of Demanding Paging, Page Replacement, Page Replacement Algorithm, Allocation of Frames,
Thrashing. File System Interface and Implementation -Access methods, Directory Structure, Protection,
File System Structure, Allocation methods, Free-space Management, Directory Management, Directory
Implementation, Efficiency and Performance

Unit 3: Deadlocks - System Model, Dead locks Characterization, Methods for Handling Dead locks
Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, and Recovery from Deadlock. Process
Management and Synchronization - The Critical Section Problem, Synchronization Hardware,
Semaphores, and Classical Problems of Synchronization, Critical Regions, Monitors

Unit 4: Operating System Security Issues- Introduction to the topic of Security in Operating Systems,
Principles of Information Security, Access Control Fundamentals, Generalized Security Architectures

Unit 5: Introduction to Distributed systems: Goals of distributed system, hardware and software
Concepts, design issues. Elementary introduction to the terminologies within Modern Oss: Parallel,
Distributed, Embedded & Real Time, Mobile, Cloud and Other Operating System Models

Text Books
1. Silberschatz, P. Galvin and Greg Gagne, Operating System Concepts, Wiley International Company.
2. A.S. Tanenbaum, Modern Operating Systems, Prentice Hall India.
3. Distributed Operating System - Andrew. S. Tanenbaum, PHI

References
1. J. Archer Harris, Operating systems Schuams outlines, Tata Mc Graw Hill.
2. Gary Nutt, Operating Systems A modern perspective, Pearson Education.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Advanced Computer Architecture
Course Code: MCSE103
L-T Scheme: 4-0 Course Credits: 4

Introduction:

This course focuses on modern advancements in parallel computer architecture, with emphasis on
advanced instruction level parallelism (ILP) and multiprocessor architectures. Topics include: advanced
branch prediction, data speculation, computation reuse, memory dependence prediction, trace caches,
dynamic optimizations, checkpoint architectures, latency-tolerant processors, simultaneous
multithreading, speculative multithreading,
virtual machines, message passing multiprocessors, UMA, NUMA and COMA shared-memory
multiprocessors, single-chip multiprocessors, wormhole routing techniques, cache coherence, memory
consistency models, high performance synchronization methods, speculative lock elision and
transactional memory.

Objectives: 1. To enable students to understand the need for parallel processing.

2. To give an exposure to the problems related to multiprocessing.
3. To get an understanding of the recent trends in the field of Computer Architecture and identify
performance related parameters.
4. To impart understanding on different types of multi core architectures and multithreading.

Learning Outcomes: Upon successful completion of the course student should be able to:
1. Modern multi-core processor micro-architectures and interconnect technologies, and be able to explain
their evolution and be able to critically evaluate their design decisions.
2. Be familiar with a variety of parallel architectures including high performance computing architectures.

Course Contents:

Unit 1: The evolution of modern Computer systems from DEC PDP-11, IBM 360/370 family, CDC
Cyber 6600, Intel X86 architecture, Performance measurement parameters MIPS, MFLOPS, SPEC
ratings, CPI etc. Introduction to high performance Computing Overview, Flynns classifications SISD,
SIMD, MISD, MIMD, Examples from Vector & Array Processors, Performance comparison of
algorithms for Scalar, Vector and Array Processors, Fundamentals of UMA, NUMA, NORMA
architectures, Performance measurement for parallel architectures Flynn,s measure, Feng,s measure,
Handlers measure, Amadahls law of limitation for parallel processing, Gustafsons law

Unit 2: Pipelined processor design, Pipeline performance measurement parameters speedup factor,
efficiency, throughput of a linear pipeline, comparing performance of a N stage pipeline with a N
processor architecture, Pipeline design principles Uniform sub computations, Identical computations,
Independent computations, Examples from design of Arithmetic pipelines Floating point Adders,
Multipliers, Dividers etc, Classifications of Uni function, Multifunction & Dynamic pipelines, Scheduling
in a pipelines with feedback , Pipeline hazards and their solutions.

Unit 3: RISC architecture, characteristics of RISC instruction set & RISC pipeline, its comparisons with
CISC, necessity of using optimizing compilers with RISC architecture, Examples from POWER PC and
SPARC architectures, Super pipelining (MIPS architecture), Superscalar architecture , Diversified
pipelines and out of order execution, VLIW architecture, Hardware multithreading (Coarse grained, fine
grained & simultaneous multithreading.)
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description

Unit 4: Memory hierarchy Techniques for improving Cache memory performance parameters,( reduce
cache miss rate, reduce hit time, reduce miss penalty), Main memory performance enhancement
interleaved memory, improvement of memory bandwidth, use of TLB for performance enhancement

Text Books
1. Computer Architecture: A Quantitative Approach Patterson & Hennessy (Elsevier)
2. Computer organization and architecture, designing for performance Stallings (PHI)
3. Computer Architecture & Parallel Processing Hwang & Briggs(TMH)
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description

Title of Course: Advanced Algorithms

Course Code: MCSE104
L-T Scheme: 4-0 Course Credits: 4

Introduction:
This is a graduate courseon the design and analysis ofalgorithms, covering several
advanced topics not studiedin typicalintroductory courseson algorithms The Topics to be
covered (tentatively) include:

Complexity Analysis
Advanced data structure
Divide and Conquer
Priority queue
Dynamic Programming
Branch and Bound
Backtracking
Greedy Method
Graph traversal algorithm
Computational geometry
Notion of NP-completeness
Approximation Algorithms
Randomized algorithm
Multithreaded algorithm
Parallel algorithm

Objectives:
Theneedforefficientalgorithmsarisesinnearly everyarea of computerscience.Butthe typeof
problem tobesolved,thenotionofwhatalgorithmsare"efficient,"andeventhemodelof
computationcanvarywidelyfrom area toarea. Inadvance algorithmscourse,we willsurvey
many of thetechniques that applybroadly in thedesign of efficientalgorithms,andstudy
their application inawide rangeof application domainsand computational
models.Techniques tobe covered include randomized algorithm,multithreaded
algorithm,parallel algorithm, and approximation algorithms.

Learning Outcomes:
Knowledge:
1. Understand the different complexity analysis according different problem.You will examine the
algorithms used for various operations on operating systems.
2. Understand the advanced data structure like 2-3 tree, red- black tree, B tree, B+ tree, tries, spatial data
representation using k-d tree, quad tree
3. Visualize different types of algorithm techniques.Become aware of the issues in the management of
resources like processor, memory and input-output.
4. Understand how to traverse a graph and the maximum flow of a network and also pattern matching of a
text.
5. Understand the basic principle of different classes of problems like P,NP,NP-complete.
6. Understand the basic concepts of randomized algorithm, multithreaded algorithm, parallel algorithm,
and approximation algorithms.

Application:
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description

1. Some familiarity with several ofthemain thrustsofwork in algorithms-sufficient to give

you some context for formulating and seeking known solutions to an algorithmic
problem.
2. Sufficient background and facility tolet youreadcurrent research publications inthearea
ofalgorithms.
3. A set oftools for designand analysisofnew algorithms for new problems that you
encounter.

Course Contents:

Unit 1: Complexity Analysis of an algorithm, Different Asymptotic notations their mathematical

significance,Amortized Analysis.
Unit 2:Advanced data structure-2-3 tree, red- black tree, B tree, B+ tree, tries, spatial data representation using k-d
tree, quad tree.
Unit 3: Basic method, use, Examples of Divide and Conquer algorithm,Dynamic Programming,Greedy
Method,Backtracking and their complexity,Basic method and example of Graph traversal algorithm.

Unit 4:Computational geometry- robust geometric primitives, convex hull, triangulation, voronoi diagrams, nearest
neighbor search, range search, point location, intersection detection, bin packing, medial-axis transform,
polygon partitioning, simplifying polygons, shape similarity, motion planning, maintaining line arrangements,
minkowski sum.

Unit 5: Set and string problems: set cover, set packing, string matching, approximate string matching, text
compression, cryptography, finite state machine minimization, longest Common substring/subsequence, shortest
common superstring.

Unit 6:Advanced areas: notion of np-completeness: p class, np-hard class, np-complete class, circuit satisfiability
problem. Approximation algorithms, randomized algorithms, multithreaded algorithms, parallel algorithms and its
applications,

Text Books
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, 3rd edition, PHI.
2. Chvatal, V. Linear Programming. New York, NY: W.H. Freeman and Company, 1983, appendix.
ISBN: 9780716715870. [An easy to read description without all the details.]
3. Korte, B. H., and J. Vygen. Combinatorial Optimization. New York, NY: Springer-Verlag, 2002,
chapter 4. ISBN: 9783540431541. [A detailed description.]
4. Boyd, Stephen, and LievenVandenberghe. Convex Optimization .Cambridge, UK: Cambridge Univ. Press,
2005. ISBN: 9780521833783
5. Nemirovski, Arkadi. "Lectures on Modern Convex Optimization." (PDF - 2.7MB)
6. Approximation algorithms. Vazirani, V. Approximation Algorithms. NewYork, NY: Springer-Verlag,
2004. ISBN: 9783540653677.
7. de Berg, Mark, O. Cheong, M. van Kreveld, and M. Overmars.
8. Computational Geometry. 3rd ed. New York, NY: Springer-Verlag, 2008. ISBN:978354077973

References
1. E.Horowitz and Shani Fundamentals of Computer Algorithms, 2nd edition, Orient Black Swan.
2. A. Aho, J.Hopcroftand J.Ullman The Design and Analysis of computer Algorithms, Pearson.
UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Artificial Neural Network
Course Code: MCSE105A
L-T Scheme: 4-0 Course Credits: 4

Introduction:
This course examines Artificial Neural Network concepts and prolog programming basics. The Topics to
be covered (tentatively) include:
Introduction to artificial neural networks
Linear models for regression and classification
Feed forward neural networks
Radial basis function networks
Kernel methods for pattern analysis
Self-organizing maps
Feedback neural networks
Kernel methods for pattern analysis

Objectives:
In this course we will study the basic components of an Artificial Neural Network, their functions,
mechanisms and techniques used in their implementation and examples from Prolog. The way different
modules in the ANN interact and work together to provide the basic services of an ANN.

Learning Outcomes:
Knowledge:
1. Understand the theory and logic behind the design and construction of ANN.
2. You will examine the algorithms used for various operations on ANN.
3. You will differentiate between various ANN functionalities in terms of performance.
4. Know the problems in the design of ANN and study the probable solutions.
5. Learn to calculate the performance of Kononen.
6. An overview of advanced ANN and compare the technical aspects of all the advanced ANN.
Application:
1. To develop, implement, and debug various algorithms
2. To develop, implement, and demonstrate the algorithms of SVM
3. To develop algorithms to find RBF.
4. To develop Kononen algorithms.

Course Contents:
Unit 1: Biological neural networks, Pattern analysis tasks: Classification, Regression, Clustering,
Computational models of neurons, Structures of neural networks, Learning principles.

Unit 2: Polynomial curve fitting, Bayesian curve fitting, Linear basis function models, Bias-variance
decomposition, Bayesian linear regression, Least squares for classification, Logistic regression for
classification, Bayesian logistic regression for classification.

Unit 3: Pattern classification using perceptron, Multilayer feed forward neural networks(MLFFNNs),
Pattern classification and regression using MLFFNNs, Error back propagation learning, Fast learning
methods: Conjugate gradient method, Auto associative neural networks, Bayesian neural networks.

Unit 4: Regularization theory, RBF networks for function approximation, RBF networks for pattern
classification.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Unit 5: Pattern clustering, Topological mapping, Kohonens self-organizing map.

Unit 6: Pattern storage and retrieval, Hopfield model, Boltzmann machine, Recurrent neural
networks.

Unit 7: Statistical learning theory, Support vector machines for pattern classification, Support vector
regression for function approximation, Relevance vector machines for classification and regression.

Text Books
1. B.Yegnanarayana, Artificial Neural Networks, Prentice Hall ofIndia,1999.
2. C.M.Bishop, Pattern Recognition and MachineLearning,Springer,2006.

References
1. . S.Haykin, Neural NetworksAComprehensiveFoundation,PrenticeHall,1998.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Agent Based Intelligent Systems
Course Code: MCSE105B
L-T Scheme: 4-0 Course Credits: 4

Introduction:
The growth of Internet has created new ways for education systems. Learners and teachers realize
their pedagogic activities with less effort, time and money. Agent Based Intelligent System (ABIS) have
proved their worth in multiple ways and in multiple domains in Education. An ABIS is a system that
provides direct customized instruction or feedback to students without the intervention of human beings.
With the explosion of content on the World Wide Web (WWW), the scope of application of Data and
Web Mining to E- Learning applications has increased tremendously. ABIS is a software tool designed
initially to manage user learning processes. ABIS go far beyond conventional training records
management and reporting. The value-add for ABIS is the extensive range of complementary
functionality they offer. Learner self-service (e.g. self-registration on instructor-led training), learning
workflow (e.g. user notification, teacher approval, waitlist management), the provision of on-line
learning, on-line assessment, management of continuous professional education, collaborative learning
(e.g. application sharing, discussion threads), and training resource management (e.g. instructors,
facilities, equipment), are some of the additional dimensions to leading learning management systems. In
addition to managing the administrative functions of online learning, some systems also provide tools to
deliver and manage instructor-led synchronous and asynchronous online teaching based on learning
object methodology. These systems are also called learning content management systems. An ABIS
provides tools for authoring and re-using or content as well as virtual spaces for learner interaction (such
as discussion forums and live chat rooms). Unlike other computer-based training technologies, these
systems assess each learner's actions within these interactive environments and develop a model of their
knowledge, skills, and expertise. Based on the learner model, ABIS tailor instructional strategies, in terms
of both the content and style, and provide explanations, hints, examples, demonstrations, and practice
problems as needed.

Objectives:
1. To introduce the students with different issues involved in trying to define and simulate
intelligence.
2. To familiarize the students with specific, well known Artificial Intelligence methods, algorithms
and knowledge representation schemes.
3. To introduce students different techniques which will help them build simple intelligent systems
based on AI/IA concepts.

Learning Outcomes:
Knowledge:
1. Students will develop a basic understanding of the building blocks of AI as presented in terms
of intelligent agents.
2. Students will be able to develop/demonstrate/ build simple intelligent systems or classical toy
problems using different AI techniques.

Application
1. Students will be able to choose an appropriate problem-solving method and knowledge
representation scheme.
2. Students will develop an ability to analyze and formalize the problem (as a state space, graph,
etc.) and select the appropriate search method.
Course Contents:
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Unit 1: Definitions, Foundations, History, Intelligent Agents, Problem Solving, Searching,
Heuristics, Constraint Satisfaction Problems, Game playing.

Unit 2: Logical Agents, First order logic, First Order Inference, Unification, Chaining,
Resolution Strategies, Knowledge Representation, Objects, Actions, Events.

Unit 3: Planning Problem, State Space Search, Partial Order Planning, Graphs, Nondeterministic
Domains, Conditional Planning, Continuous Planning, Multi-Agent Planning.

Unit 4: Acting under uncertainty Probability Notation, Bayes Rule and use, Bayesian
Networks, Other Approaches, Time and Uncertainty, Temporal Models, Utility Theory,
Decision Network Complex Decisions.

Unit 5: Knowledge in Learning, Relevance Information, Statistical Learning Methods,

Reinforcement Learning, Communication, Formal Grammar, Augmented Grammars, Future of
AI.

Text Books
1. Stuart Russell and Peter Norvig, "Artificial Intelligence - A Modern Approach",2nd Edition,
Prentice Hall, 2002

References
1. Michael Wooldridge, "An Introduction to Multi Agent System", John Wiley, 2002.
2. Patrick Henry Winston, Artificial Intelligence, 3rd Edition, AW, 1999.
3. Nils.J.Nilsson, Principles of Artificial Intelligence, Narosa Publishing House, 1992.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Advanced Soft Computing
Course Code: MCSE105C
L-T Scheme: 4-0 Course Credits: 4

Introduction:
Review of AI techniques and soft computing techniques and their applications in instrumentation
engineering. Soft computing differs from conventional (hard) computing in that, unlike hard computing, it
is tolerant of imprecision, uncertainty, partial truth, and approximation. In effect, the role model for soft
computing is the human mind. The principal constituents, i.e., tools, techniques, of Soft Computing (SC)
are Fuzzy Logic (FL), Neural Networks (NN), Support Vector Machines (SVM), Evolutionary
Computation (EC), and Machine Learning (ML) and Probabilistic Reasoning (PR).

Objectives:
To understand the concepts of advanced soft computing, to enable to develop applications of
advanced soft computing in instrumentation.

Learning Outcomes:
Knowledge:
1. Use soft computing techniques.
2. Handle multi objective optimization problems.

Application
1. Use advanced AI techniques of swarm intelligence, particle swarm optimization, antcolony
optimization and petrinets.
2. Use rough set theory and granular computing

Course Contents:
Unit 1: Introduction to Soft Computing; Difference between Hard and Soft Computing; Introduction to
Fuzzy Systems, Artificial Neural Network, Evolutionary Algorithms, Rough Set Theory; Hybrid Systems.

Unit 2: Introduction to Fuzzy Sets; Classical and Fuzzy Sets; Fuzzy Sets - Membership Function, Basic
Operations, Linguistic Variable, Properties; Fuzzy relations - Cartesian product, Operations on relations;
Crisp logicLaws of propositional logic, Inference; Predicate logicInterpretations, Inference; Fuzzy
logicQuantifiers, Inference; Fuzzy Rule based system; De-fuzzification methods; Basic Applications of
Fuzzy Sets and Logics.
Unit 3: Pattern Classification, Pattern Association, Clustering, Simple Clustering algorithm, k-means &
k-medoid based algorithm.
Unit 4: Neural Networks: Introduction, Mathematical Models, ANN architecture, Learning rules,
Supervised, Unsupervised and reinforcement Learning, Multilayer Perceptron, Applications of Artificial
Neural Networks. Competitive learning networks, Kohonen self organizing networks, Hebbian learning;
Hopfield Networks, Associative Memories, The boltzman machine; Applications of ANN
Unit 5: Other Soft Computing techniques: Simulated Annealing, Tabu search, Ant colony optimization
(ACO), Particle Swarm Optimization (PSO).
Unit 6: Introduction, Single and Multi-Objective Optimization, Encoding, Fitness Function, Genetic
Operations, Genetic Parameters; Schema theorem; Convergence Theory; Multiobjective optimization
using GA (MOGA); Non-Dominated Sorting Genetic Algorithm; Basic Applications.
Unit 7: Hybrid systems, GA based ANN (Optimal Weight Selection); Neuro Fuzzy Systems, fuzzy
Neuron, architecture, learning, application.

Text Books
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
1. Neuro-Fuzzy and Soft computing, Jang, Sun, Mizutani, Pearson 2. Neural networks: a
comprehensive foundation, Haykin, Pearson
2. K. Deb, Multi-Objective Optimization Using Evolutionary Algorithms. Chichester, England:
John Wiley, 2001.
3. Genetic Algorithms, Goldberg, Pearson
4. Fuzzy Sets & Fuzzy Logic, G.J. Klir & B. Yuan, PHI
References
1. An Introduction to Neural Networks, Anderson J.A., PHI, 1999.
2. Introduction to the Theory of Neural Computation, Hertz J. Krogh, R.G. Palmer, Addison-
Wesley, California, 1991.
3. An Introduction to Genetic Algorithm, Melanie Mitchell, PHI, 1998.
4. Neural Networks-A Comprehensive Foundations, Prentice-Hall International, New Jersey,
1999.
5. Neural Networks: Algorithms, Applications and Programming Techniques, Freeman J.A. &
D.M. Skapura, Addison Wesley, Reading, Mass, (1992).
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Object Oriented Information System Design
Course Code:MCSE105D
L-T-P Scheme:4-0-0 Course Credit: 4

Introduction:
Object oriented analysis and design is a course that presents an introduction to the design and
constructionof software systems using techniques that view a system as a set of objects that work
together to realizethe system's functionality. This perspective stands in contrast to more traditional
procedural" or structured" design techniques that viewed systems as a set of procedures that
manipulate shared data structures.
Objectives:
The course presents Proponents of object-oriented techniques point to the exibility and extensibility of
object-oriented systems along with other such as increased modularity, abstraction, and encapsulation.

Learning Outcomes:
After completion of this course, we will examine fundamental object-oriented analysis and design
techniques and show how decisions made during analysis and design impact the implementation of
software systems. This class does not focus on object-oriented programming, however, we will
examine many examples of object-oriented systems written in Java, Python, and Ruby.

Course Contents:
Module 1:
Data and Information Types of information: operational, tactical, strategic and statutory why do
we need information systems management structure requirements of information at different
levels of management functional allocation of management requirements of information for
various functions qualities of information small case study
Module 2:
Systems Analysis and Design Life Cycle: Requirements determination requirements specifications
feasibility analysis final specifications hardware and software study system design system
implementation system evaluation system modification. Role of systems analyst attributes of a
systems analyst tools used in system analysis
Module 3:
Information gathering strategies methods case study documenting study system requirements
specification from narratives of requirements to classification of requirements as strategic, tactical,
operational and statutory. Example case study
Module 4:
Feasibility analysis deciding project goals examining alternative solutions cost benefit analysis
quantifications of costs and benefits payback period system proposal preparation for
managements parts and documentation of a proposal tools for prototype creation
Module 5:
Tools for systems analysts data flow diagrams case study for use of DFD, good conventions
leveling of DFDs leveling rules logical and physical DFDs software tools to create DFDs
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Module 6:
Structured systems analysis and design procedure specifications in structured English examples
and cases decision tables for complex logical specifications specification oriented design vs
procedure oriented design
Module 7:
Data oriented systems design entity relationship model E-R diagrams relationships cardinality
and participation normalizing relations various normal forms and their need some examples of
relational data base design
Module 8:
Data input methods coding techniques requirements of coding schemes error detection of codes
validating input data input data controls interactive data input

Text Books:
Design Patterns Explained: A New Perspective on Object Oriented Design (Second Edition)
Alan Shalloway and James R. Trott ISBN 0-321-24714-0
Design Patterns: Elements of Reusable Object-Oriented Software Erich Gamma, Richard
Helm, Ralph Johnson and John Vissides ISBN 0-201-63361-2

References:
Refactoring: Improving the Design of Existing Code Martin Fowler, Kent Beck, John Brant,
William Opdyke and Don Roberts ISBN 0-201-48567-2
Refactoring to Patterns Joshua Kerievsky ISBN 0-321-21335-1
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Software Engineering & CASE tools
Course Code: MCSE105E
L-T Scheme: 4-0 Course Credits: 4

Introduction:
To review and understand the software Process, software engineering models, Software engineering
Practice, data flow diagrams, requirement engineering, object-orientation, understand analysis
modeling, design engineering and architectural design, User interface Design and software testing
strategies, learn ethical and social implications of computing and exposure to Professional software
development tools and techniques.
Appreciate understanding the critical issues involved in software development and accordingly
develop analysis and design strategies for tackling the core problems across various industry
domains. This would be imparted through hands on exercises and case studies on some real-life and
popular software engineering tools and technologies involving databases, CASE Tools, web servers
and other web related tools and technologies (for a N-tier architecture) like Eclipse, Rational Rose,
C++ / Java etc. through an Enterprise wide software project implementation in a specific domain area
In addition, provided that the student has reached an acceptable standard in the assessments and
examinations, the student may then undertake a dissertation / industry project as part of his summer
training module. Work on a dissertation / industry project for this course will normally involve an in-
depth study in the area of distributed information systems and computing (e.g., a state-of-the-art
review together with appropriate software development) and provides the student with an excellent
opportunity to demonstrate expertise in this area to future employers or as a basis for future MS/PhD
study.
Objectives:
1. Case Study based on Software life cycle.
2. To develop, implement, and demonstrate the learning through a project that meet stated
specifications.
3. You will learn User Interface Design.
4. To understand Software Cost Estimation and web engineering.
Learning Outcomes:
Knowledge:
1. You will broaden your knowledge of Software Process Models.
2. You will become aware of the Software Product.
3. You will increase your proficiency in Software Project Management.
4. You will gain practical experience in Requirements Engineering.
5. You will gain practical experience in UML tools.
6. You will acquire the background of Software Architecture.
7. to understand and be able to explain Software Metrics and Software Reliability.
8. You will learn concepts associated with Software Construction.
9. You will learn about Software Verification Application:

Course Contents:
Unit 1: Software Engineering - Objectives, Definitions, Software Process models - Waterfall Model,
Prototype model, RAD, Evolutionary Models, Incremental, Spiral.
Software Project Planning - Feasibility Analysis, Technical Feasibility, Cost- Benefit Analysis,
COCOMO model.
Unit 2: Structured Analysis, Context diagram and DFD, Physical and Logical DFDs, Data Modeling, ER
diagrams, Software Requirements Specification
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Unit 3: Design Aspects, Top-Down And Bottom-Up design; Decision tree, decision table and structured
English, Structure chart, Transform analysis Functional vs. Object- Oriented approach.
Unit 4: Unified Modeling Language, Class diagram, interaction diagram: collaboration diagram,
sequence diagram, state chart diagram, activity diagram, and implementation diagram.
Unit 5: Coding & Documentation Structured Programming, Modular Programming, Module
Relationship- Coupling, Cohesion, OO Programming, Information Hiding, Reuse, System
Documentation.
Testing Levels of Testing, Integration Testing, System Testing.
Software Quality, Quality Assurance, Software Maintenance, Software Configuration Management,
Software Architecture, Computer Aided Software Engineering (CASE) tool .
Unit 6: Object modeling and design
Classes, objects, relationships, key abstractions, common mechanisms, diagrams, class diagrams,
advanced classes, advanced relationships, interfaces, types, roles, packages, instances, object diagrams,
interactions, use cases, use case diagrams, interaction diagrams, activity diagrams, events and signals,
state machines, processes, threads, state chart diagrams, components, deployment, collaborations, patterns
and frameworks, component diagrams, systems and models, code generation and reverse engineering.
Text Books
1. .Software Engineering- Rajib Mall (PHI)
2. Software Engineering- Pankaj Jalote (Wiley-India)

References
1. Software Engineering : A practitioners approach Pressman(TMH)
2. Software Engineering- Pankaj Jalote (Wiley-India)
3 .Software Engineering- Rajib Mall (PHI)
4. Software Engineering Agarwal and Agarwal (PHI)
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Computer Graphics & Multimedia
Course Code: MCSE105F
L-T Scheme: 3-1 Course Credits: 4

Introduction:
Computer Graphics course presents an introduction to computer graphics designed to give the
student an overview of fundamental principles. It covers the fundamental concepts in creating
graphical images on the computer. Computer graphics uses ideas from Art, Mathematics, and
Computer Science to create images. Course work stresses the reduction of concepts to practice in
the form of numerous programming assignments. The course will include an overview of
common graphics hardware, 2D and 3D transformations and viewing, and basic raster graphics
concepts such as scan-conversion and clipping. Methods for modeling objects as polygonal
meshes or smooth surfaces, and as rendering such as hidden-surface removal, shading,
illumination, and shadows will be investigated.
Multimedia course provides mainstreaming the technological media within what is called
Multimedia is the pattern which led to infinite applications of computer technologies. The
concept of this technology came into being with the appearance of sound cards, then compact
disks, then came the use of digital camera, then the video which made computer an essential
educational tool. Nowadays, multimedia expanded to become a field on its own.

Objectives:

This course is designed to provide a comprehensive introduction to computer graphics

leading to the ability to understand contemporary terminology, progress, issues, and
trends. A thorough introduction to computer graphics techniques, focusing on 3D
modelling, image synthesis, and rendering. We will look at raster scan graphics including
line and circle drawing, polygon filling, anti-aliasing algorithms, clipping, hidden-line
and hidden surface algorithms including ray tracing and, of course, rendering - the art of
making photo realistic pictures with local and global illumination models. The
interdisciplinary nature of computer graphics is emphasized in the wide variety of
examples and applications. The purpose of multimedia study is to find out the impact of
using multimedia on students academic achievement in the College of Education at King
Saud University. This studys effort is to answer the following questions like what is the
impact of using multimedia on students academic achievement in the computer & its
use in education curriculum and are there any statistically-significant differences
between the average marks of the experimental group & that of the control group in the
pre & post measurements of students academic achievement in the school of Education?

Learning Outcomes:
Knowledge:
1. To know and be able to understand the core concepts of computer graphics.
2. To know and be capable of using OpenGL to create interactive computer graphics.
3. To know and be able to understand a typical graphics pipeline.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
4. To know and be able to make interactive graphics applications in C++ using one or
more graphics application programming interfaces.
5. To know and be able to demonstrate an understanding of the use of object hierarchy in
graphics applications.
6. To know and be able to write program functions to implement visibility detection.
7. To know and be able to make pictures with their computer.
8. To know and be able to describe the general software architecture of programs that use
3D computer graphics
9. To know the pictorial representation of various points in a image

Application:
1. Know and be able to discuss hardware system architecture for computer graphics. This includes,
but is not limited to: graphics pipeline, frame buffers, and graphic accelerators/co-processors.
2. Know and be able to use a current 3D graphics API (e.g., OpenGL or DirectX).
3. Know and be able to use the underlying algorithms, mathematical concepts, supporting computer
graphics. These include but are not limited to:
Composite 3D homogeneous matrices for translation, rotation, and scaling transformations.
Plane, surface normals, cross and dot products.
Hidden surface detection / removal.
Scene graphs, display lists.
4. Know and be able to select among models for lighting/shading: Color, ambient light; distant and
light with sources; Phong reflection model; and shading (flat, smooth, Gourand, Phong).
5. Know and be able to use and select among current models for surfaces (e.g., geometric;
polygonal; hierarchical; mesh; curves, splines, and NURBS; particle.
6. Know and be able to design and implement model and viewing transformations, the graphics
pipeline and an interactive render loop with a 3D graphics API.
7. Be able to design and implement models of surfaces, lights, sounds, and textures (with texture
transformations) using a 3D graphics API.
8. Be able to discuss the application of computer graphics concepts in the development of computer
games, information visualization, and business applications.
9. Be able to discuss future trends in computer graphics and quickly learn future computer graphics
concepts and APIs.

Course Contents:
Unit 1: Introduction to computer graphics & graphics systems
Overview of computer graphics, representing pictures, preparing, presenting & interacting with pictures
for presentations; Visualization & image processing; RGB color model, direct coding, lookup table;
storage tube graphics display, Raster scan display, 3D viewing devices, Plotters, printers, digitizers, Light
pens etc.; Active & Passive graphics devices; Computer graphics software.
Scan conversion
Points & lines, Line drawing algorithms; DDA algorithm, Bresenhams line algorithm, Circle generation
algorithm; Ellipse generating algorithm; scan line polygon, fill algorithm, boundary fill algorithm, flood
fill algorithm.

Unit 2: 2D transformation & viewing

Basic transformations: translation, rotation, scaling; Matrix representations & homogeneous coordinates,
transformations between coordinate systems; reflection shear; Transformation of points, lines , parallel
lines, intersecting lines. Viewing pipeline, Window to viewport co-ordinate transformation, clipping
operations, point clipping, line clipping, clipping circles, polygons & ellipse .
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
3D transformation & viewing
3D transformations: translation, rotation, scaling & other transformations. Rotation about an arbitrary axis
in space, reflection through an arbitrary plane; general parallel projection transformation; clipping,
viewport clipping, 3D viewing

Unit 3: Curves
Curve representation, surfaces, designs, Bezier curves, B-spline curves, end conditions for periodic B-
spline curves, rational B-spline curves. Hidden surfaces, Depth comparison, Z-buffer algorithm, Back
face detection, BSP tree method, the Painters algorithm, scan-line algorithm; Hidden line elimination,
wire frame methods, fractal - geometry. Color & shading models Light & color model; interpolative
shading model; Texture.

Unit 4: Multimedia
Introduction to Multimedia: Concepts, uses of multimedia, hypertext and hypermedia; Image, video and
audio standards. Audio: digital audio, MIDI, processing sound, sampling, compression. Video: MPEG
compression standards, compression through spatial and temporal redundancy, inter-frame and intra-
frame compression. Animation: types, techniques, key frame animation, utility, morphing. Virtual Reality
concepts.

Text Books
1. Hearn, Baker Computer Graphics ( C version 2nd Ed.) Pearson education
2. Z. Xiang, R. Plastock Schaums outlines Computer Graphics (2nd Ed.) TMH
3. D. F. Rogers, J. A. Adams Mathematical Elements for Computer Graphics (2nd Ed.) TMH
4. Mukherjee, Fundamentals of Computer graphics & Multimedia, PHI
5. Sanhker, Multimedia A Practical Approach, Jaico
6. Buford J. K. Multimedia Systems Pearson Education
7. Andleigh & Thakrar, Multimedia, PHI
8. Mukherjee Arup, Introduction to Computer Graphics, Vikas
9. Hill,Computer Graphics using open GL, Pearson Education
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Operating System Lab
Course Code: MCSE191
L-T-P scheme: 0-0-3 Course Credit: 2

Objectives:
1. To learn and understand system calls (remote procedure calls) related to files, processes, threads,
signals, semaphores and implement system programs based on that.
2. To provide an understanding of the design aspects of operating system.
3. To provide an efficient understanding of the language translation peculiarities by designing a
complete translator for a mini language.

Learning Outcomes: The students will have a detailed knowledge of the concepts of process and
shared memory, aware of a variety of approaches to process management and main-memory
management, including interference, deadlock, scheduling, fragmentation, thrashing, learn the basics
behind file systems and input output systems and understand the fundamentals of network and
distributed operating systems. Upon the completion of Operating Systems practical course, the student
will be able to:
Understand and implement basic services and functionalities of the operating system using
system calls.
Use modern operating system calls and synchronization libraries in software/ hardware
interfaces.
Understand the benefits of thread over process and implement synchronized programs using
multithreading concepts.
Analyze and simulate Deadlock Avoidance and Protection algorithm like Bankers.
Implement memory management schemes
Implement remote procedure call
Understand producer and consumer problem.

Course Contents:
Exercises that must be done in this course are listed below:
Exercise No.1: Simulate Bankers Algorithm for Dead Lock Avoidance
Exercise No.2: Simulate Bankers Algorithm for Dead Lock Prevention
Exercise No. 3: Simulate Paging Technique of Memory Management
Exercise No. 4: Thread Creation
Exercise No. 5: Process Creation
Exercise No. 6: Producer and Consumer Problem
Exercise No. 7: Implementation of Remote Procedure Call

Text Book:
1. Maurice J. Bach, Design of the UNIX Operating System, PHI.

Recommended Systems/Software Requirements:

1. Intel based desktop PC with minimum of 166 MHZ or faster processor with at least 64 MB RAM
and 100 MB free disk space.
2. Turbo C or TC3 complier in Windows XP or Linux Operating System.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Advanced Programming Lab
Course Code: MCSE192
L-T-P scheme: 0-0-3 Course Credit: 2

Objectives:
1. To learn and understand different types artificial neural network algorithm.
2. To learnMatLab for the programming of ANN.

Learning Outcomes: The students will have a detailed knowledge of the concepts of matlab.Upon
the completion of Advanced algorithm course, the student will be able to:
Understand and implement basic services and functionalities of the ANN using matlab.
Use KohonenSelfOrganizingfeaturemaptoClusterthe vectorsusingowninitial weightsand
learningrate.
Understand the benefits of artificial neural network in artificial intelligence.

Course Contents:
Exercises that must be done in this course are listed below:
Exercise1: Programtogenerate a few activationfunctionthat are being used in neural network
Exercise2: Programtoclassifywith a 2-inputperceptron.
Exercise 3: Program for perceptron net for an AND function with bipolar inputs and targets.
Exercise 4: Developa MatlabprogramforOR functionwith bipolar inputsand
targetsusingADALINEnetwork.
Exercise 5: Developa MatlabprogramtogenerateXOR functionforbipolar inputsand
targetsusingMADALINENetwork.
Exercise 6: Developa Matlabprogramtostorethe vector(-1,-1,-1,-1)and(-1,-1,1,1)inanauto-
associativenetwork.Findtheweight matrix.Test thenet with (1,1,1,1)asinput.
Exercise 7: Considera vector(1,0,1,1)to bestoredinthenet.Test a discreteHopfieldnet with
error inthe1stand4thcomponents (0,0,1,0)ofthestoredvector.
Exercise 8: Developa MatlabprogramforXOR function (binaryinputandoutput) with
momentumfactorusingback-propagation algorithm.
Exercise 9: DevelopMatlabprogramfordrawingfeature maps(KohonenSelfOrganizingFeature
maps)in 1-Dimensionalview.
Exercise 10: UseKohonenSelfOrganizingfeaturemaptoClusterthe
vectors(assumefourbinaryvectors)usingowninitial weights(to be assumed)and
learningrate(tobe assumed).

Text Book:
1. B.Yegnanarayana, ArtificialNeuralNetworks,PrenticeHall ofIndia,1999
2. SatishKumar,NeuralNetworksAClassroomApproach,Tata McGraw-Hill,2003
3. S.Haykin,NeuralNetworksAComprehensiveFoundation,PrenticeHall,1998
4. C.M.Bishop,PatternRecognitionand MachineLearning,Springer,2006

Recommended Systems/Software Requirements:

1. Intel based desktop PC with minimum of 166 MHZ or faster processor with at least 64 MB RAM
and 100 MB free disk space.
2. Matlab software in Windows XP .
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Seminar Based on Literature Survey
Course Code: MCSE181
L-T-P scheme: 0-2-0 Course Credit: 1

The overall aim of the seminar series is to help develop an emerging field at the intersection of
multi-disciplinary understandings of culture and education. It will build on the existing body of
work on education and culture, but its aim is explore and develop new perspectives in this area.
The objectives of the six exploratory seminars are:
to explore new research from a range of academic disciplines which sheds light on the
questions outlined above
to showcase cutting edge research on education and culture from outstanding academic
researchers from the UK and internationally
to bring together seminar participants from different disciplines such as Sociology,
Philosophy, Psychology, Human Geography, Media Studies as well as Education and
Cultural Studies
to encourage and financially support the participation of PhD students
to actively involve practitioners and users from each venue
to engage a core group of policy makers
to use the seminars to develop links between academics and stakeholders in the arts,
library, media, community and educational sectors