UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR

Course Description
Title of Course: Advanced DBMS
Course Code: MCSE201
L-T Scheme: 4-0 Course Credits: 4

Introduction
Database Management Systems (DBMS) consists of a set of interrelated data and a set of programs to
access that data. They underpin any computer system and are therefore fundamental to any program of
study in computer science. An understanding of DBMS is crucial in order to appreciate the limitations of
data storage and application behavior and to identify why performance problems arise. Students who
complete this course are expected to develop the ability to design, implement and manipulate databases.
Students will apply and build databases for various day to day real life scenarios and real life applications.
The course will by and large be structured but will introduce open-ended data base problems.

Course Objectives (Post-conditions)

Knowledge objectives:
Ability to build normalized databases.
Knowledge of storage and indexing, disks and files
Familiarity with SQL, embedded SQL and PLSQL
Familiarity with tree structured indexing
Understanding of transaction processing and evaluating relational operators
Ability to handle recovery and concurrency issues and typical relational query optimizer
Familiarity with physical database design and tuning.

Outcomes:
Develop the ability to design, implement and manipulate databases.
Introduce students to build tree structured indexing.
Apply DBMS concepts to recovery and concurrency issues and typical relational query optimizer.

Course Contents:
Unit 1: OVERVIEW OF STORAGE AND INDEXING, DISKS AND FILES: Data on external storage;
File. Organizations and indexing; Index data structures; Comparison of file organizations; Indexes and
Performance tuning. Memory hierarchy; RAID; Disk space management; Buffer manager; Files
ofrecords; Page formats and record formats.

Unit 2: TREE STRUCTURED INDEXING: Intuition for tree indexes; Indexed sequential access method;
B+ trees,Search, Insert, Delete, Duplicates, B+ trees in practice.

Unit 3: HASH-BASED INDEXING: Static hashing; Extendible hashing, Linear hashing, comparisons.

Unit 4: OVERVIEW OF QUERY EVALUATION, EXTERNAL SORTING: The system catalog;

Introduction tooperator evaluation; Algorithms for relational operations; Introduction to query
optimization;Alternative plans: A motivating example; what a typical optimizer does. When does a
DBMS sort data? Asimple two-way merge sort; External merge sort

Unit 5: EVALUATING RELATIONAL OPERATORS: The Selection operation; General selection

conditions; TheProjection operation; The Join operation; The Set operations; Aggregate operations; The
impact ofbufferingConcurrency control and recovery system: Lock based protocol, dead lock handling,
time stamp based and validation based protocol,failure classification, storage, recovery
algorithm, recovery and atomicity,backup.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Unit 6: A TYPICAL RELATIONAL QUERY OPTIMIZER: Translating SQL queries in to Relational
Algebra; Estimatingthe cost of a plan; Relational algebra equivalences; Enumeration of alternative plans;
Nested subqueries;Other approaches to query optimization.

Unit 7:PHYSICAL DATABASE DESIGN AND TUNING: Introduction; Guidelines for index selection,
examples;Clustering and indexing; Indexes that enable index-only plans; Tools to assist in index
selection;Overview of database tuning; Choices in tuning the conceptual schema; Choices in tuning
queries andviews; Impact of concurrency; DBMS benchmarking.

Unit 8:MORE RECENT APPLICATIONS: Mobile databases; Multimedia databases; Geographical

Information Systems; Genome data management.

Text Books:
th
1. Silberschatz, Korth and Sudarshan, Database System Concepts, 6 Edition,McGraw Hill, 2010
th
2. Elmasri and Navathe, Fundamentals of Database Systems, 6 Edition, Pearson, Addison-Wesley,
2010

References:
th
1. C.J. Date, An Introduction to Database Systems, 8 Edition, Addison-Wesley, 2003
nd
2. Ramakrishnan&Gherke, Database Management Systems, 2 Edn., McGraw
th
3. Connolly and Begg, Database Systems, 4 Edn., Addison-Wesley, 2005
th
4. Toby, Lightstone and Jagadish, Database Modeling and Design, 5 Edn, Elsevier, 2011
th
5. Coronel and Rob, Database Systems, 9 Edn.,Cengage, 2011
6. IEEE / ACM Transactions on Database Systems (TODS).
7. DBMS related Journals.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description

Title of Course: Advanced Computer Network & Security

Course Code: MCSE202
L-T-P Scheme: 4-0-0 Course Credits: 4

Introduction:
This course is to provide students with an overview of the concepts and fundamentals of data
communication and computer networks. Topics to be covered include: data communication concepts
and techniques in a layered network architecture, communications switching and routing, types of
communication, network congestion, network topologies, network configuration and management,
network model components, layered network models (OSI reference model, TCP/IP networking
architecture) and their protocols, various types of networks (LAN, MAN, WAN and Wireless
networks) and their protocols.

Objectives:
At the end of the course, the students will be able to:
1. Build an understanding of the fundamental concepts of computer networking.
2. Familiarize the student with the basic taxonomy and terminology of the computer
networking area.
3. Introduce the student to advanced networking concepts, preparing the student for
entry Advanced courses in computer networking.
4. Allow the student to gain expertise in some specific areas of networking such as the
design and maintenance of individual networks.

Learning Outcomes:
After completing this course the student must demonstrate the knowledge and ability to:
1. Independently understand advanced computer network technology.
2. Understand and explain complex network System and its components.
3. Identify the different types of wireless network topologies (WLAN)and protocols.
5. Identify the different types of network devices and their functions within a network
6. Concept Adhoc network and its protocol.
6. Understand Reactive and Proactive Routing Protocols.
7. Detailed knowledge about Internetworking
8. Knowledge about mobile computing.

Application:
1. To configure and implement network topology.
2. To configure and implement local area network.
3. To design network and assign IP address
4. Connect Remote computers
5. Analyze the security issue of the network.

Course Contents:

Module 1: Introduction To Internetworking: How Networks Differ, How Networks Can Be

Connected, Connectionless Internetworking, Tunneling, Fragmentation, Overview Of Underlying
Technologies (Ethernet, Token Ring, Token Bus, Fddi, Ppp). Network Layer Protocols: Ipv4, Ipv6,
Nat, Arp, Rarp, Dhcp, Icmp, Ospf, Bgp, Igmp, Cidr. Transport Layer Protocols: Udp, Remote
Procedure Call, Rtp, Tcp, Tcp Tahoe, Tcp Reno, Tcp New Reno, Tcp Sack.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description

Module 2: Telephone Systems: Introduction To Wireless Networks And Cellular Technology,

Amps, D-Amps, Gsm, Gprs, Cdma, Bluetooth. Wireless Internet: Mipv4, Mipv6, Tcp Performance, I-
Tcp, Tcp Snoop, Freeze Tcp, Wwp, Tcp Real.

Module 3: Wireless Networks: Wlan: Introduction, Problems And Solutions, Protocol Stack, Access
Methods, Services, Wimax, Wifi, Zigbee. Ad-Hoc Networks: Introduction, Routing Challenges For
Ad-Hoc Networks, Routing Protocols (Aodv, Dsdv, Dsr,), Transport Protocols (Atcp, Tcp-F, Tcp
Bus).

Module 4: Congestion Control: General Principles, Congestion Prevention Policies, Choke Packet,
Red, Ecn, Eln, Eln-Ack. Qos Provisioning: Delay Guarantees, Network Delay, Delay Jitter, Play Out
Delay, Admission Control, Qos Objectives, The Rsvp Approach.

Module 5: Security: Introduction To Cryptography, Symmetric Key And Public Key Algorithms,
Diffie Hellman Key Exchange Algorithm, Digital Signatures, Ipsec, Firewall, Vpn, Vlan, Wireless
Security, Authentication Protocols.

Text Books:

1. Internetworking With Tcp/Ip: Principles, Protocols, And Architecture - Douglas Comer.

2. Computer Networks A.S.Tannenbaum.

Reference Books :

3. Data And Computer Communications William Stallings

4. Wimax Security & Qos-An End-To-End Perspective: Isbn: 978-0-470-72197-1, Wiley Publication.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Theory of Computation
Course Code: MCSE203
L-T Scheme: 4-0 Course Credits: 4

Introduction:
This course examines theory of computation concepts. The Topics to be covered (tentatively) include:
Models of Computation
Regular language and finite automata
Context free language and pushdown automata
Turing Machine
Computational Complexity
Computability and Decidability
Logic
Advanced/Emerging area

Objectives:
This course introduces the fundamental theory of computation. Introduce the student to the concepts of
Theory of computation in computer science and different models of computation also familiarize the
students with formal languages and theory of automation. To introduce the students with the concepts of
propositional logic and their requirement in theory of computation and also tractable and intractable
problems and their classes P, NP and NP-complete problems. Also introduce the students with the
different emerging concepts of computation.
Learning Outcomes:
Knowledge:
Upon successful completion of the course, a student will be able to:
1. To understand the concepts of Theory of computation in computer science and different models of
computation and their equivalence.
2. To recognize languages, employ finite state machines to solve problems in computing.
3. To explain deterministic and non-deterministic machines and comprehend the hierarchy of problems
arising in the computer sciences.
4. To understand the basic principle of different classes of problems like P,NP,NP-complete and
requirement of propositional logic..
5. To know the current trends of theory of computations.
Application:
1. To design the sequence detector, with or without output finite machine.
2. To design the deterministic and non-deterministic PDA.
3. To design the Turing machine.
4. To solve different problem using different emerging technology like DNA computing, cellular
automata, quantum technology.
Course Contents:
Unit 1: Introduction-TOC, Need; Models of computation - classification, properties and equivalences.

Unit 2: Finite automata and Regular language introduction, types, application and limitations of FA.
Definition of RE, rules, closure properties, Constructing FA to RE and vice versa, Pumping lemma of
regular sets.

Unit 3: Context free language and grammar - definition of CFL, closure properties, Pumping lemma and
Ogdens lemma of CFL, Pushdown Automata: definition, type, constructing PDA to CFL and vice versa.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Unit 4: Turing Machine: definition, construction, types of TM. Concepts of Universal Turing machine
and Halting problem.

Unit 5: Computability and Decidability - Church-Turing Thesis, Decision Problems, Decidability

and undecidability, unsolvable problems, Problem reduction (Turing and mapping reduction),
Intractability (Hierarchy Theorems). Mapping reductions. More undecidable languages. Rice theorem.
Reductions using controlled executions. RE Completeness. Reductions using computation histories.

Unit 6: Computational Complexity: Resource-constrained computation. Notion of complexity classes,

classes P NP, NP-complete, Boolean satisfiability, NP-Completeness of CSAT and 3SAT , NP-Hard,
Cooks Theorem, concept of reduction. Space Complexity-Savichs Theorem, class PSPACE.
Optimization, search, and decision problems, approximate solutions to optimization problems.

Unit 7: Logic: Propositional and First-order logic and their applications to theorem proving and logic
programming.

Unit8: Advanced/Emerging area- Elementary introductions to DNA Computing, Quantum Computing,

Cellular Automata.

Text Books
1. Mishra and Chandrashekaran, Theory of Computer Science , Automata Languages and
computation, 2nd edition, PHI.
2. Arnab Biswas and Pallabi Chakraborty, Formal language and automata theory, JBBL.

References
1. Hopcroft H.E. and Ullman J. D ,Introduction to Automata Theory Language and Computation,
Pearson Education.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Cluster, Grid and Cloud computing
Course Code: MCSE204A
L-T Scheme: 3-1 Course Credits: 3

Introduction:
This course examines cluster, grid and cloud architectural design concepts, Behavior and functionalities.
The Topics to be covered (tentatively) include:
Cluster Computing
Grid Computing
Cloud Computing

Objectives:
The main objectives are to provide the students with a solid knowledge of parallel computing (in clusters)
and distributed computing in the Internet infrastructure, mainly Grid Computing and Cloud Computing.
Also we can enlist as objectives the intention of a solid knowledge on parallel architectures and on
developing parallel programs for distributed memory and shared memory architectures. Through
assignments and case studies the students will also obtain experience in the core technologies in the field,
including performance analysis and tuning.
Learning Outcomes:
Knowledge:
1. You can get information regarding cluster computing.
2. Understand the need for and evolution of Grids in the context of processor- and data-intensive
applications
3. To be familiar with the fundamental components of Grid environments, such as authentication,
authorization, resource access, and resource discovery
4. Understanding the systems, protocols and mechanisms to support cloud computing Understanding the
key dimensions of the challenge of Cloud Computing.
6. Assessment of the economics, financial, and technological implications for selecting cloud
computing for own organization

Application:
1. To develop and implement a range of concepts, techniques and tools for creating cluster and grid
computing.
2. To be able to design and implement Grid computing applications using Globus or similar toolkits
3. Developing cloud based software applications on top of cloud platforms.

Course Contents:

Unit-1:
A general introduction to the concept of cluster based distributed computing. Hardware technologies for
cluster computing, including a survey of the possible node hardware and high-speed networking hardware
and software. Software and software architectures for cluster computing, including both shared memory
(OpenMP) and message-passing (MPI/PVM) models MPI-2 extension, dynamic process creation, one-
sided communication, parallel I/O. Variants based on new low level protocols (MVAPICH), evaluation
and tuning of system and software performance evaluation tools, HINT, netperf, netpipe, ttcp, Iperf.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Unit-2:
The Grid - Past, Present, Future, A New Infrastructure for 21st Century Science The Evolution of the
Grid - Grids and Grid Technologies, Programming models - A Look at a Grid Enabled Server and
Parallelization Techniques Grid applications. The concept of virtual organizations Grid architecture
Grid architecture and relationship to other Distributed Technologies computational and data Grids,
semantic grids Case Study: Molecular Modeling for Drug Design and Brain Activity Analysis, Resource
management and scheduling, Setting up Grid, deployment of Grid software and tools, and application
execution

Unit-3:
Introduction to Cloud Computing, Definition, Characteristics, Components, Cloud provider, SAAS,
PAAS, IAAS and Others, Organizational scenarios of clouds, Administering & Monitoring cloud
services, benefits and limitations, Deploy application over cloud, Comparison among SAAS, PAAS,
IAAS Cloud computing platforms: Infrastructure as service: Amazon EC2,Platform as Service: Google
App Engine, Microsoft Azure, Utility Computing, Elastic Computing Data in the cloud: Relational
databases, Cloud file systems: GFS and HDFS, BigTable, HBase and Dynamo.Issues in cloud computing,
Implementing real time application over cloud platform Issues in Intercloud environments, QOS Issues in
Cloud, Dependability, data migration, streaming in Cloud. Quality of Service (QoS) monitoring in a
Cloud computing environment.

Text Books:
1. Cluster Computing by Rajkumar Buyya, Clemens Szyperski
2. High Performance Cluster Computing: Architectures and systems by Rajkumar Buyya
3. Grid and Cluster Computing by C.S.R Prabhu
4. Fran Bermn, Geoffrey Fox, Anthony Hey J.G., Grid Computing: Making the Global Infrastructure a
Reality, Wiley, USA, 2003

Reference Books:
1. Joshy Joseph, Craig Fallenstein, Grid Computing, Pearson Education, New Delhi, 2004,
2. Cloud Security by Ronald Krutz and Russell Dean Vines, Wiley-India
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Mobile Computing
Course Code: MCSE204B
L-T-P Scheme:4-0-0 Course Credit: 4

Introduction:
This course aims at discovery of a comprehensive and important issues inmobile computing and
communications. The topics are grouped into different areas, like basic issues and problems, mobile and
wireless networks, mobile/wirelesscommunication architectures and related communication protocols, Ad
hoc network. Theproblems in mobile computing comparing with computing in fixed networksystems will
be explained.

Objectives:
The objective of the course is to
Understand the different mobile communication architectures whichwould be introduced.
Understand the Wireless networks and protocols such mobile/wireless TPC, wireless
LAN,Mobile Ad-hoc networks, multimedia sensor networks and mobility management strategies
that are needed to support mobile computing will be discussed. Mobile ad hoc networks will be
also studied.

Learning Outcomes:
Upon successful completion of this course, students should be able to:

Identify the basic problems, limitations, strengths and current trends of mobile computing;
fundamentals of cellular communications.
Explain the current wireless networking mechanisms for mobile computing; Wireless
transmission.
Create novel mechanisms and systems for supporting mobile computing and communications
including wireless communication architectures, mobile/wireless TCP and wireless LAN;
multimedia sensor networks and mobile ad-hoc networks.
Analyze the performance of different networks and algorithms for mobile computing.
Develop an attitude to propose solutions with comparisons for problems related to mobile
computing through investigation of different protocols and mobile/wireless networks

Course Contents:
Module-I: Fundamentals of Cellular Communications
Introduction, First- and Second-Generation Cellular Systems, Cellular Communications from 1G to 3G,
Tele-trafficEngineering, Radio Propagation and Propagation Path-Loss Models, Cellular Geometry,
Interference in CellularSystems, Frequency Management and Channel Assignment Issues, Multiple
Access Techniques, GSM LogicalChannels and Frame Structure, Privacy and Security in GSM, Mobility
Management in Cellular Networks.

Module-II: Wireless Transmission Fundamentals

Spread Spectrum (SS) and CDMA Systems, Wireless Medium Access Control, IEEE 802.11 Architecture
and Protocols,Issues in AdHoc Wireless Networks (Medium Access Scheme), Routing, Multicasting,
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Transport Layer Protocols, QoS Provisioning,Energy Management and Energy Consumption Models,
Traffic Integration in Personal, Local, and GeographicalWireless Networks, Bluetooth, Technologies for
High-Speed WLANs, Third-Generation Cellular Systems: UMTS.

Module-III: Mobile Adhoc Networks

Introductory Concepts. Different models of operation, various applications of MANET, Destination-
SequencedDistance Vector protocol - overview, Route Advertisement, Extending Base Station Coverage,
Properties of DSDVprotocol, Dynamic Source Routing protocol - overview and properties, DSR Route
Discovery, Route Maintenance,Support for Heterogeneous Networks and Mobile IP, Multicast routing
with DSR, Ad Hoc On-Demand Distance-Vectorprotocol - properties, Unicast Route Establishment,
Multicast Route Establishment, Broadcast Optimizations andEnhancements, Link Reversal Routing -
Gafni-Bertsekas Algorithm, lightweight mobile routing algorithm, TemporallyOrdered Routing
Algorithm, Preserving battery life of mobile nodes - Associativity Based Routing, Effects of beaconingon
battery life.

Module-IV: Wireless Sensor Networks

Sensor networks overview: introduction, applications, design issues, requirements, Sensor node
architecture, Networkarchitecture: optimization goals, evaluation metrics, network design principles,
Sensor network operating systems andbrief introduction to sensor network Programming, Network
protocols: MAC protocols and energy efficiency, Routingprotocols: data centric, hierarchical, location-
based, energy efficient routing etc, Sensor deployment, scheduling andcoverage issues, Self-
Configuration and Topology Control, Querying, data collection and processing, collaborative information
processing and group connectivity, Target tracking, localization and identity management,
Powermanagement, Security and privacy.

Module-V: Topology Control and Clustering in Adhoc Networks

Algorithms for Graphs Modeling Wireless Ad Hoc Networks, Clustering and Network Backbone,
Dominating SetBasedRouting in Ad Hoc Wireless Networks, Formation of a Connected Dominating Set,
Backbone-FormationHeuristics.

Module-VI: Mobile, Distributed and Pervasive Computing

Pervasive Computing Applications, Architecture of Pervasive Computing Software, Indoor Wireless
Environments,Challenges for the Future: Nomadic Computing.

Text Books:
1. Sivaram Murthy, Manoj, Adhoc Wireless and Sensor Networks: Architecture and Protocols,
Pearson.
2. Vijay Garg, Wireless Communications and Networking, Morgan Kaufmann Publishers
3. Gast, 802.11 Wireless Networks, Oreilly-SPD
4. Theodore Rappaport, Wireless Communications: Principles and Practice TMH.
5. J. Schiller, Pearson Education, Mobile Communications, TMH.
6. William C.Y Lee Cellular Mobile Telecommunications, TMH
7. Garg and Wilkes, Principles and Applications of GSM, Pearson.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description

References:
1. Gabrilovska, Prasad, Adhoc Networking Towards Seamless Communication, Springer.
2. AzzedineBoukerche, Handbook of Algorithms for Wireless Networking and Mobile
Computing, Chapmanand Hall/CRC, New York.
3. Wagner, Wattenhofer (Eds.), Algorithms for Adhoc and Sensor Networks: Advanced Lectures,
SpringerLecture Notes in Computer Science.
4. Mukherjee, Bandopadhyay, Saha, Location Management and Routing in Mobile Wireless
Networks, ArtechHouse, London.
5. Redl, S.M., Weber, M.K., Oliphant, M.W.: An Introduction to GSM. Artech House, London.
6. Mehrotra, A.: GSM System Engineering. Artech House, London.
7. Ivan Stojmenovic, Handbook of Wireless Networking and Mobile Computing, Wiley Inc, New
York.
8. XiangYang Li, Wireless Adhoc and Sensor Networks, Cambridge University Press.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Advanced Web Technology
Course Code: MCSE204C
L-T Scheme: 4-0 Course Credits: 4

Introduction:
Service oriented Computing and its predominant implementation as Web Services are at the
forefront of industrial practice in software engineering. There are two major technologies supporting WS
development: Microsofts .net and Java based technologies. In this course we will use the former. One
crucial aspect of SoA is the marrying of IT artifacts with business processes and objectives, so part of the
course will concentrate on business processes and their relation to services. Finally, service applications
need to be executed in a scalable fashion and cloud computing provides one possible deployment
architecture. We will consider the main business drivers and advantages for adopting cloud computing
and study details of some cloud computing platforms with practical exercises based on the Azure
platform.

Objectives:
Appreciate the increasing importance of Web technology and how it is changing the role of the
information technology. Understand what strategic web development is and apply a framework to help
identify strategic uses of Internet. Compare the fundamental types of web technologies and how they can
be used to provide real business benefit. Explore new technologies and issues affecting the web
development. Apply a web development approach in analyzing the role of web technology in
organizations. Describe the process used in developing information systems and the concepts of web
engineering and web process reengineering. Analyze the skills needed for web development
professionals. Ready to apply for any job where need web technology.

Learning Outcomes:
Knowledge:
1. Understand the major areas and challenges of web programming.
2. Distinguish web-related technologies.
3. Use advanced topics in HTML5, CSS3, and JavaScript.
4. Use a server-side scripting language, PHP.
5. Use a relational DBMS, MySQL.
6. Use PHP to access a MySQL database.

Application:
1. Design and implement dynamic websites with good aesthetic sense of designing and latest
technical know-how's.
2. Have a Good grounding of Web Application Terminologies, Internet Tools, E Commerce and
other web services.
3. Get introduced in the area of Online Game programming.

Course Contents:
Unit 1: Overview, Computer Network, Intranet, Extranet and Internet. Types of Networks (LAN, MAN,
WAN), Network Topologies .Definition of Internet, Internet organization. Growth of Internet, Internet
Application.
Review of TCP/IP: OSI Reference model, TCP/IP Model, IP addressing, Classful and Classless
Addressing, Subnetting, Features and services of TCP/IP, Three-Way Handshaking, Flow Control, Error
Control, Congestion control, IP Datagram. Routing -Intra and Inter Domain Routing, Unicast and
Multicast Routing, Broadcast. Electronic Mail-POP3, SMTP.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
World Wide Web: Evolution of distributed computing. Core distributed computing technologies
Client/Server Architecture & its Characteristics, JAVA RMI. Challenges in Distributed Computing, role
of J2EE and XML in distributed computing, emergence of Web Services and Service Oriented
Architecture (SOA). Introduction to Web Services The definition of web services, basic operational
model of web services, tools and technologies enabling web services, benefits and challenges of using
web services. Web Server Concept and Architecture. Definition of DNS (Domain Name System). Domain
and Sub domain, Address Resolution, FTP & its usage, Telnet Concepts, Remote Logging, HTTP &
HTTPs.

Unit 2: HTML & CSS: Introduction, Editors, Elements, Tags, Attributes, Heading, Paragraph.
Formatting, Link, Image, Table, List, Block, Form, Frame Layout, DHTML, Basic Web Page
Development, CSS- Create Class Styles, Create ID Styles ,Span, Colors.HTML5 in brief.
Extensible Markup Language (XML): Brief Over View of XML XML Document structure,
XML namespaces, Defining structure in XML documents, Reuse of XML schemes, Document navigation
and transformation, Tree, Syntax, Elements, Attributes, Validation, and Viewing. XHTML in brief.
JavaScript: Introduction, JavaScript in Web Pages, The Advantages of JavaScript Writing
JavaScript into HTML; Building Up JavaScript Syntax; Basic Programming Techniques ; Operators and
Expressions in JavaScript; JavaScript Programming Constructs; Conditional Checking Functions in
JavaScript, Dialog Boxes, Statements, comments, variable, comparison, condition, switch, loop, break.
Object string, array. Function, Errors, Validation. The JavaScript Document Object Model-Introduction
(Instance, Hierarchy); The JavaScript Assisted Style Sheets DOM; Understanding Objects in HTML
(Properties of HTML objects, Methods of HTML objects); Browser Objects, Handling Events Using
JavaScrip

Unit 3: Installing and Configuring (2L) : Current and Future Versions of MySQl and PHP, How to Get
MySQL, Installing MySQL on Windows, Trouble Shooting your Installation, Basic Security Guidelines,
Building PHP on Windows with Apache, Windows, php.ini.Basics,The Basics of PHP scripts.
The Building blocks of PHP (3L): Variables, Data Types, Operators and Expressions, Constants.
Flow Control Functions in PHP: Switching Flow, Loops, Code Blocks and Browser Output.
Functions (3L): What is function? Calling functions, Defining Functions. Variable Scope, more
about arguments. Working with Arrays and Some Array-Related Functions.
Working with Objects (2L): Creating Objects, Object Instance Working with Strings, Dates and
Time: Formatting strings with PHP, Investigating Strings with PHP, Manipulating Strings with PHP,
Using Date and Time Functions in PHP.
Working with Forms (2L): Creating Forms, Accessing Form Input with User defined Arrays,
Combining HTML and PHP code on a single Page, Using Hidden Fields to save state, Redirecting the
user, Sending Mail on Form Submission, and Working with File Uploads.
Learning basic SQL Commands (2L): Learning the MySQL Data types, Learning the Table
CreationSyntax, Using Insert Command, Using SELECT Command, Using WHERE in your
Queries,Selecting from Multiple Tables, Using the UPDATE command to modify records, Using the
DELETE Command, Frequently used string functions in MySQL, Using Date and Time Functions in
MySQL.
Interacting with MySQL using PHP (2L): MySQL Versus MySQLi Functions, Connecting to
MySQL with PHP, Working with MySQL Data.

Unit 4: Multimedia Application Development (4L): Pixel, Image Resolution, Image Editing using
Photoshop, 2D & 3D Animation, Logo Design, Banner. Animated Component Preparation using Flash &
Action script.
Multimedia Web Applications (2L): Multimedia over IP: RTP, RTCP. Streaming media, Codec
and Plugins, VoIP, Text and Voice Chat.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Text Books
1. Web Technology: A Developer's Perspective, N.P. Gopalan and J. Akilandeswari, PHI Learning,
Delhi, 2013. (Chapters 1- 5,7,8,9).
2. Internetworking Technologies, An Engineering Perspective, Rahul Banerjee, PHI Learning,
Delhi, 2011. (Chapters 5,6,12)
3. Internetworking Technologies, An Engineering Perspective, Rahul Banerjee, PHI Learning,
Delhi, 2011.
4. Web Technology & Design, C.Xavier, New Age International Publication, Delhi

References
1. E. Balagurusamy " Programming With Java: A Primer" 3rd Ed. , Tata Mc Graw Hill.
2. Herbert Schildt, Java: The Complete Reference (Tata Mcgraw Hill Education Private , 7th Ed).
3. Data Communications and Networking, Behrouz A. Forouzan, TMH
4. Data and Computer Communications, William Stallings, PHI
5. Sams Teach Yourself PHP in 24 Hours, Third Edition
6. Wrox, Beginning PHP, Apache, MySQL Web Development
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Soft Computing
Course Code: MCSE204D
L-T-P Scheme:4-0-0 Course Credit: 4

Introduction:
Soft computing is the use of inexact solutions to computationally hard tasks such as the solution of NP-
complete problems, for which there is no known algorithm that can compute an exact solution in
polynomial time. 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.

Objectives:
The main objective of the course is to expose the students to softcomputing, various types of soft
computing techniques, and applicationsof soft computing. .Upon completion of this course, the student
shouldbe able to get an idea on:
Artificial Intelligence, Various types of production systems,characteristics of production systems.
Neural Networks, architecture, functions and various algorithmsinvolved.
Fuzzy Logic, Various fuzzy systems and their functions.
Genetic algorithms, its applications and advances.

Learning Outcomes:
At the end of the course the student should be able to
Learn about soft computing techniques and their applications
Analyze various neural network architectures
Understand perceptrons and counter propagation networks.
Define the fuzzy systems
Analyze the genetic algorithms and their applications.

Course Contents:
Module-I: Introduction to Soft Computing
Evolution of Computing - Soft Computing Constituents From Conventional Artificial Intelligence to
Computational Intelligence - Machine Learning Basics.

Module-II: Fuzzy Logic

Fuzzy sets and Fuzzy logic: Introduction, Fuzzy sets versus crisp sets, operations on fuzzy sets, Extension
principle, Fuzzy relations and relationequations, Fuzzy numbers, Linguistic variables, Fuzzy logic,
Linguistic hedges, App lications, fuzzy controllers, fuzzy pattern recognition, fuzzy image processing,
fuzzy database.

Module-III: Artificial Neural Networks

Artificial Neural Network: Introduction, basic models, Hebb's learning, Adaline, Perceptron, Multilayer
feed forward network, Back propagation, Different issues regarding convergence of Multilayer
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Perceptron, Competitive learning, Self-Organizing Feature Maps, Adaptive Resonance Theory,
Associative Memories, Applications.

Module-IV: Genetic Algorithms

Evolutionary and Stochastic techniques: Genetic Algorithm (GA), different operators of
GeneticAlgorithm, Analysis of selection operations, Hypothesis of buildingBlocks, Schema theorem and
convergence of Genetic Algorithm, Simulated annealing and Stochastic models, Boltzmann Machine,
Applications. Rough Set: Introduction, Imprecise Categories Approximations and Rough Sets, Reduction
of Knowledge, Decision Tables, and Applications.

Module-V: Hybrid Systems

Neural-Network-Based Fuzzy Systems, Fuzzy Logic-Based Neural Networks, Genetic Algorithm for
Neural Network Design andLearning, Fuzzy Logic and Genetic Algorithm for Optimization,
Applications.

Text Books:
Mitchell Melanie, An Introduction to Genetic Algorithm, Prentice Hall, 1998.
David E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning,
Addison Wesley, 1997.
S. Haykin, Neural Networks, Pearson Education, 2ed, 2001.
S. Rajasekaran& G. A. V. Pai , Neural Networks, Fuzzy logic, and Genetic Algorithms, PHI.
Fuzzy Sets and Fuzzy Logic, Klir& Yuan, PHI, 1997
Rough Sets, Z. Pawlak, Kluwer Academic Publisher, 1991.
Neural Networks, Fuzzy logic, and Genetic Algorithms, S. Rajasekaran and G. A. V. Pai, PHI.
Intelligent Hybrid Systems, D. Ruan, Kluwer Academic Publisher, 1997.

References:
N.K.Bose, Ping Liang, Neural Network fundamental with Graph,Algorithms & Applications,
TMH, 1st Edition, 1998.
Bart Kosko, Neural Network & Fuzzy System, PHI Publication, 1stEdition, 2009.
Rich E, Knight K, Artificial Intelligence, TMH, 3rd Edition, 2012.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description

Title of Course: Cryptography & Computer Security

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

Introduction:
With the growth of the Internet, the need for secured data transmission increased manifold. In fact it
became a pre-condition to the usage of the Internet for business transaction. Therefore security is a
major concern in the Internet World.

Objectives:

We will study security from multiple perspectives. We will consider a variety of security policies,
authentication before access, integrity of information, and confidentiality of information. The course
will focus on the models, the tools, and the techniques for enforcement of security policies, with some
emphasis on the use of cryptography. And because todays implementation approaches are typically
flawed, we will also address the penetration and disruption of information systems in the context of
operating systems and networks.

Learning Outcomes:
Knowledge:

1. You will understand the basic security services e.g.bAuthentication, Access Control,
Confidentiality, Integrity, and Non repudiation)
2. You will understand the concepts of risk, threats, vulnerabilities and attack.
3. You will know the important ethical and legal issues to consider in computer security.
4. You will know the goals of end-to-end data security.
5. You will understand the role of random numbers and prime numbers in security.
You will learn standard symmetric encryption algorithms
6. You will learn the architecture for public and private key cryptography and how public key
infrastructure (PKI) supports network security.
7. You will learn the methods of digital signature and encryption.
8. You will learn key management and how key exchange protocols work.
9. You will learn security protocols at different layers of Network layer heirachy.
10. You will learn futuristic cryptographic techniques like Eliptic Curve and quantum cryptography.
11. You will learn the concept of trusted computing.
12. You will learn the Web security Protocol.

Application :

1. Apply appropriate known cryptographic techniques for a given scenario.

2. You will be able to analyze the tradeoffs of balancing key security properties.
3 You will be able to design a security solution and do the cryptanalysis. .

Course Contents:

Unit 1: Introduction
Linear algebra: non linearity, echelon form of matrix, Galois Field, vector space, Modular arithmetic
Coding Theory :Huffman coding, Hamming coding,
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description

Number Theory : Prime Numbers, Modular Arithmetic and Discrete Logarithms, FermetsThoerem,
Eulers Theorem, Chinese Remainder Theorem, Quadratic Reciprocity Theorem
Information Theory : Entropy and Uncertainty

Unit 2: Attacks on Computers & Computer Security

Introduction, Need for Security, Security approaches, Principles of Security, Types of attack.
Cryptography: Concepts & Techniques
Introduction, Plaintext & Cipher text, Substitution Techniques, Transposition Techniques, Encryption
& Decryption, Symmetric & Asymmetric key Cryptography, Key Range & Key Size
.
Unit 3: Symmetric Key Algorithm
Introduction, Algorithm types & Modes, Overview of Symmetric Key Cryptography, DES(Data
Encryption Standard) algorithm, IDEA(International Data Encryption Algorithm) algorithm,
RC5(Rivest Cipher 5) algorithm.
.
Unit 4: Asymmetric Key Algorithm, Digital Signature and RSA
Introduction, Overview of Asymmetric key Cryptography, RSA algorithm, Symmetric & Asymmetric
key Cryptography together, Digital Signature, Basic concepts of Message Digest and Hash Function
(Algorithms on Message Digest and Hash function not required).

Unit 5: Internet Security Protocols, User Authentication

Basic Concepts, SSL protocol, Authentication Basics, Password, Authentication Token, Certificate
based Authentication, Biometric Authentication

Unit 6 : Electronic Mail Security

Basics of mail security, Pretty Good Privacy, S/MIME.

Unit 7 : Firewall
Introduction, Types of firewall, Firewall Configurations, DMZ Network

Text Books

1. Cryptography and Network Security, William Stallings, 2nd Edition, Pearson Education Asia
2. Network Security private communication in a public world, C. Kaufman, R. Perlman and M.
Speciner, Pearson
3. Cryptography & Network Security: AtulKahate, TMH.

Reference :

1. Network Security Essentials: Applications and Standards by William Stallings, Pearson

2. Designing Network Security, MerikeKaeo, 2nd Edition, Pearson Books
3. Building Internet Firewalls, Elizabeth D. Zwicky, Simon Cooper, D. Brent Chapman, 2nd
Edition, Oreilly
4. Practical Unix & Internet Security, SimsonGarfinkel, Gene Spafford, Alan Schwartz, 3rd Edition,
Oreilly
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description

Title of Course: Image Processing

Course Code: MCSE205A
L-T-P Scheme: 4-0-0Course Credits: 4

Introduction:
Signal processing is a discipline that deals with analysis and processing of analog and digital
signals.It deals with storing , filtering , and other operations on signals. These signals include
transmission signals , sound or voice signals , image signals , and other signals e.t.c.
Out of all these signals , the field that deals with the type of signals for which the input is an image
and the output is also an image is done in image processing. As it name suggests, it deals with the
processing on images.
It can be further divided into analog image processing and digital image processing.

Objectives:
Digital image processing deals with manipulation of digital images through a digital computer. It is a
subfield of signals and systems but focus particularly on images. DIP focuses on developing a
computer system that is able to perform processing on an image. The input of that system is a digital
image and the system process that image using efficient algorithms, and gives an image as an output.

Learning Outcomes:

Students will be able to apply various image processing concepts and models to input images or
input signals for various purposes. For example :image compression, image de-noising, image
enhancement, edge detection and sharpening etc.

Application :

Remote Sensing picture processing :

o Tracking of Earth Resources
o Weather Forecasting
o Geographical Mapping
o Identifying different areas like Water Body
o area, Forest Area, Hilly area etc.
Image Transmission & Storage
o Image Compression technique is applied

Medical applications :
o X-Ray, Ultra sound, etc.
Defence :
o Tracking missiles, vehicles etc.
Industrial machine vision
o we can inspect different objects

Course Contents:

Unit 1:Introduction
Background, Digital Image Representation, Fundamental steps in Image Processing, Elements of
Digital Image Processing Image Acquisition, Storage, Processing, Communication, Display.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description

Unit 2: Digital Image Formation

A Simple Image Model, Geometric Model- Basic Transformation (Translation, Scaling, Rotation),
Perspective Projection, Sampling & Quantization - Uniform & Non uniform.

Unit 3:Mathematical Preliminaries

Neighbour of pixels, Connectivity, Relations, Equivalence & Transitive Closure; Distance Measures,
Arithmetic/Logic Operations, Fourier Transformation, Properties of The Two Dimensional Fourier
Transform, Discrete Fourier Transform, Discrete Cosine & Sine Transform

Unit 4:Image Enhancement

Spatial Domain Method, Frequency Domain Method, Contrast Enhancement -Linear & Nonlinear
Stretching, Histogram Processing; Smoothing - Image Averaging, Mean Filter, Low-pass Filtering;
Image Sharpening. High-pass Filtering, High-boost Filtering, Derivative Filtering, Homomorphic
Filtering; Enhancement in the frequency domain - Low pass filtering, High pass filtering.

Unit 5:Image Restoration

Degradation Model, Discrete Formulation, Algebraic Approach to Restoration - Unconstrained &
Constrained; Constrained Least Square Restoration, Restoration by Homomorphic Filtering,
Geometric Transformation - Spatial Transformation, Gray Level Interpolation

Unit 6 :Image Segmentation

Point Detection, Line Detection, Edge detection, Combined detection, Edge Linking & Boundary
Detection - Local Processing, Global Processing via The Hough Transform; Thresholding -
Foundation, Simple Global Thresholding, Optimal Thresholding; Region Oriented Segmentation -
Basic Formulation, Region Growing by Pixel Aggregation, Region Splitting & Merging.

Text Books

1. Digital Image Processing, Gonzalves,Pearson

2. Digital Image Processing, Jahne, Springer India
3.Digital Image Processing &Analysis,Chanda&Majumder,PHI
4.Fundamentals of Digital Image Processing, Jain, PHI
5.Image Processing, Analysis & Machine Vision, Sonka, VIKAS
6. Getting Started with GIS- Clarke Keith. C; PE.
7. Concepts & Techniques of GIS - Lo C.P, Albert, Yeung K.W- PHI.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Pattern Recognition
Course Code: MCSE205B
L-T Scheme:4 -0 Course Credits: 4

Introduction:

The goal of this lecture is to familiarize the students with the overall pipeline of a Pattern Recognition
system. The various steps involved from data capture to pattern classification are presented.
The Topics to be covered (tentatively) include:
Introduction
Bayesian Decision Theory
Feature vectors - Feature spaces
Different approaches to Feature Selection
Principal Component Analysis (PCA)
K-means algorithm
SVMs
fuzzy techniques

Objectives:
This course will introduce the fundamentals of statistical pattern recognition. First we will focus on
generative methods such as those based on Bayes decision theory and related techniques of parameter
estimation and density estimation. Next we will focus on discriminative methods such as nearest-neighbor
classification and support vector machines. Methods of pattern recognition are useful in many
applications such as information retrieval, data mining, document image analysis and recognition,
computational linguistics, forensics, biometrics and bioinformatics. In this course, we will emphasize
computer vision applications.
Learning Outcomes:
Knowledge:
1. Understand the theory and logic behind the Structure of a typical pattern recognition system.
2. You will examine the Different Paradigms of Pattern Recognition.
3. You will differentiate between various approaches to Feature Selection.
4. Become aware of the issues in the Classification performance measures Risk and error probabilities.
5. Know the problems in the Clustering.
6. Understanding SVM, Soft-computing and Neuro-fuzzy techniques
Course Contents:
Unit 1: INTRODUCTION TO PATTERN RECOGNITION: Basic concepts- Definitions, data sets for
Pattern Recognition, Structure of a typical pattern recognition system. Different Paradigms of Pattern
Recognition. Representations of Patterns and Classes. Metric and non-metric proximity measures.

Unit 2: FEATURES SELECTION- Feature vectors - Feature spaces - Different approaches to Feature
Selection-Branch and Bound Schemes. Sequential Feature Selection.

Unit 3: FEATURES EXTRACTION: Principal Component Analysis (PCA), Kernel PCA

Unit 4: PATTERN CLASSIFICATION- Pattern classification using Statistical classifiers - Bayes

classifier - Classification performance measures Risk and error probabilities. Linear Discriminant
Function, Mahalanobis Distance, K-NN Classifier, Fishers LDA, Single Layer Perceptron, Multi-layer
Perceptron, Training set, test set; standardization and normalization.
Unit 5: CLUSTERING: Basics of Clustering; similarity / dissimilarity measures; clustering criteria.
Different distance functions and similarity measures. K-means algorithm, K-medoids, DBSCAN.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Unit 6: RECENT ADVANCES IN PATTERN RECCOGNITION- Structural PR, SVMs, FCM, Soft-
computing and Neuro-fuzzy techniques, and real life examples.

Text Books
1. Devi V.S.; Murty, M.N. (2011) Pattern Recognition: An Introduction, Universities Press, Hyderabad.
2. R.O.Duda, P.E.Hart and D.G.Stork, Pattern Classification, John Wiley, 2001.
3. Statistical pattern Recognition; K. Fukunaga; Academic Press, 2000.
4. S.Theodoridis and K.Koutroumbas, Pattern Recognition, 4th Ed., Academic Press, 2009.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Real-Time Embedded System and Programming Course Code: MCSE205C
L-T Scheme: 4-0 Course Credits: 4

Introduction: Real-time systems are computer systems that monitor, respond to, or control an external
environment. This environment is connected to the computer system through sensors, actuators, and other
input-output interfaces. It may consist of physical or biological objects of any form and structure. Often
humans are part of the connected external world, but a wide range of other natural and artificial objects,
as well as animals, are also possible. The computer system must meet various timing and other constraints
that are imposed on it by the real-time behavior of the external world to which it is interfaced. Hence
comes the name real time. Another name for many of these systems is reactive systems, because their
primary purpose is to respond to or react to signals from their environment. A real-time computer system
may be a component of a larger system in which it is embedded; reasonably, such a computer component
is called an embedded system.

Objectives: The main objective of this course is to accustom the students with

number representations and arithmetic,

basic microprocessor design,
embedded system development environments,
processor input/output implementations and electronic interfaces (including analog-to-digital
translation),
serial protocols and implementation,
control loop design and implementation,
finite state machines, and
Issues in embedded hardware design and debugging.

Learning Outcomes: By the end of this course, students should be able to:

design and implement embedded circuits involving microcontrollers, sensors, and actuators,
use code and circuit design tools,
design, program and debug embedded sensing and control software,
work in collaborative teams to solve system design and implementation problems, and
communicate in both oral and written forms.

Course Contents:

Unit 1: Introduction to Embedded Systems :- Definition of Embedded System, Embedded Systems Vs

General Computing Systems, History of Embedded Systems, Classification, Major Application Areas,
Purpose of Embedded Systems, characteristics and Quality Attributes of Embedded Systems.

Unit 2: Typical Embedded System: Core of the Embedded System: General Purpose and Domain
Specific Processors, ASICs, PLDs, Commercial Off-The-Shelf Components (COTS), Memory: ROM,
RAM, Memory according to the type of Interface, Memory Shadowing, Memory selection for Embedded
Systems, Sensors and Actuators, Communication Interface: Onboard and External Communication
Interfaces.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Unit 3: Embedded Firmware: Reset Circuit, Brown-out Protection Circuit, Oscillator Unit, Real Time
Clock, Watchdog Timer, Embedded Firmware Design Approaches and Development Languages.

Unit 4: RTOS Based Embedded System Design: Operating System Basics, Types of Operating Systems,
Tasks, Process and Threads, Multiprocessing and Multitasking, Task Scheduling.

Unit 5: Task Communication: Shared Memory, Message Passing, Remote Procedure Call and Sockets,
Task Synchronization: Task Communication/Synchronization Issues, Task Synchronization Techniques,
Device Drivers, How to Choose an RTOS.

Text Books
1. Introduction to Embedded Systems -Shibu K.V, Mc Graw Hill.
2. Embedded Systems, Raj Kamal, TMH
3. Embedded System Design Frank Vahid, Tony Givargis, John Wiley
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Complex Systems
Course Code: MCSE205D
L-T Scheme: 3-1 Course Credits: 3

Introduction:
This course examines mathematical description of complex systems decomposed into subsystems, which
include interactions. The Topics to be covered (tentatively) include:
Non Linear Complex Systems
Special Matrices
Principle of Decomposition
Direct Lyapunov method
Stability analysis of Complex Systems

Objectives:
In this course we will study the basic concept on non linear complex system, their applications and
techniques used in their implementation. Information regarding special matrices, methods of aggregation
will be acquired from this course. Principle of decomposition and stability analysis of non linear system
will also be studied in this course.

Learning Outcomes:
1. To learn mathematical description of complex systems decomposed into subsystems, which include
interactions.
2. To acquire the basic theory of special matrices and methods of aggregation.
3. To handle the principles of decomposition of complex systems, analysis of their stability using
Lyapunov stability theory including aggregation systems.

Application:
1. To develop and implement a range of concepts, techniques to solve the problem of non linear complex
system.
2. To implement principle of decomposition to solve various complex system problem.
3. It helps to analysis the stability of complex system.
4. To implement the concept of Lyapunov method for complex system analysis.

Course Contents:
Unit 1: Non-linear complex systems, mathematical description in the shape of subsystems and
interactions between them (lectures: 4).
Unit 2: Special matrices (Minkowski, Metzler) and their use for analysis of complex systems. (lectures:
6)
Unit 3: Estimation of eigen values of aggregation matrices, estimation of border interactions (lectures: 4)

Unit 4: Principles of decomposition and aggregation of systems (lectures: 4)

Unit 5: The direct Lyapunov method (lectures: 4)

Unit 5: Stability analysis of complex nonlinear systems by the method of vector Lyapunov function
(lectures: 4)

Text Books
BZIK, J. -- MUDRONK, D. Teria vekch systmov. Bratislava : SVT v Bratislave, 1988. 101 p.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Distributed System
Course Code: MCSE205E
L-T Scheme: 4-0 Course Credits: 4

Introduction
The programme focuses on utilizing networks, from concurrent processes inside a computer to
world-wide cooperating systems using the Internet.
Course Objectives (Post-conditions)
Knowledge objectives:
1. Implement a simple distributed application using a message based protocol.
2. Specify the four main goals of a Distributed System and the use of middleware in achieving
those goals.
3. Model connection-oriented and connectionless communication in a 2 tier Client Server
architecture.
4. Distinguish the five main failure types in a Distributed System and specify algorithms for
achieving fault tolerance and error recovery within such a system.
5. Implement a remote object based system to demonstrate parameter passing and code migration
in a Distributed System.
6. Discuss the issues involved in achieving synchronisation among a group of processes in a
distributed system.
7. Specify algorithms for determining global state, electing a co-ordinator for a group of
communicating processes and implementing mutual exclusion in a Distributed System.
8. Differentiate between client centric and data centric consistency models and describe protocols
for implementing consistency models and updating replicas in a Distributed System
Application objectives:
1. To implement design patterns
2. Implementation of aspect-oriented programming (AOP).
3. Implementation of service-oriented architecture framework.

Expected Student Background (Preconditions)

Students are expected to have a solid grasp of the fundamentals of computer system, including a
basic understanding of the operation of the computer, especially CPU. In addition, students are
expected to know application development environment and programming concepts. Assembly
programming ability will be helpful, as we will be looking at implementations of microprocessor
operations.

Course Contents:

UNIT-1: Basic concepts: Models of computation, shared memory and message passing systems,
synchronous and asynchronous systems. Logical time and event ordering. Global state and snapshot
algorithms, mutual exclusion, clock synchronization, leader election, deadlock detection, termination
detection, spanning tree construction.

UNIT-2: Programming models: remote procedure calls, distributed shared memory.

Unit-3: Fault tolerance and recovery: basic concepts, fault models, agreement problems and its
applications, commit protocols, voting protocols, check pointing and recovery, reliable communication.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
UNIT-4: Security and Authentication: basic concepts, Kerberos. Resource sharing and load balancing.

UNIT-5: Special topics: distributed objects, distributed databases, directory services,

Text Books
1. Advanced Concepts in Operating Systems, Mukesh Singhal and Niranjan G. Shivaratri , McGraw
Hill International Edition

References
1. Introduction to Distributed Algorithms, Gerard Tel,Cambridge University Press
2. A.S. Tanenbaum and M. van Steen, Distributed Systems: Principles and Paradigms, Prentice-
Hall, 2002.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Computer Networking & DBMS Laboratory Lab
Course Code: MCSE291
L-T-P Scheme: 0-0-3Course Credits: 2

Objective:
- To get familiar with basic EER concepts (generalization and specialization)
- Study of ODL schema.
- Implement Abstract data type.
- To study varying array.
- Implement object Table.
- To study implementation of nested tables.
- To understand use of objects in member procedure.
- To study horizontal Partitioning
- To study horizontal Partitioning.
- To study semistructureddata.

Learning Outcomes:
Ability to build normalized databases.
Knowledge of Entity Relationship Modelling.
Familiarity with SQL, embedded SQL and PLSQL, ODL schema.
Familiarity with query processing and query optimization techniques.
Understanding of Member procedure.,Partitioning on the tables.
Ability to handle recovery and concurrency issues.
Familiarity with XML commands.

Course Contents:
Exercises that must be done in this course are listed below:
Exercise No.1:Study of EER diagram.
Exercise No. 2:Study of ODL schema.
Exercise No. 3:Implement Abstract data type.
Exercise No. 4:Implement Varrays.
Exercise No. 5:Implement object Table.
Exercise No. 6:Implement Nested table.
Exercise No. 7:Implement Member procedure.
Exercise No. 8:Implement Member Function.
Exercise No. 9:Implement Partitioning on the tables.
Exercise No. 10:Study of XML commands.

References
1. Database Systems: A Practical Approach to design, Implementation and Management.
Thomas Connolly, Carolyn Begg; Third Edition, Pearson Education.
2. "Fundamentals of Database Systems" Elmasri, Navathe, Pearson Education.
3. Bipin C Desai, ?An Introduction to Database Systems?, Galgotia. Publications Pvt Limited,
2001
4. An Introduction to Database Systems, C.J.Date, Pearson Education.
5. A first course in Database Systems, Jeffrey D. Ullman, Jennifer Windon, Pearson, Education.
6. Data Management: databases and organization, Richard T. Watson, Wiley.
7. DataModeling Essentials, Graeme C. Simxion, Dreamtech.
8. Introduction to Data Base Management, Naveen Prakash, Tata McGraw Hill
UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
9. Oracle 10g manuals.
 UNIVERSITY OF ENGINEERING AND MANAGEMENT, JAIPUR
Course Description
Title of Course: Seminar
Course Code: MCSE281
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