ADHIYAMAAN COLLEGE OF ENGINEERING

(AUTONOMOUS)
B.TECH. INFORMATION TECHNOLOGY
REGULATIONS 2015
CURRICULUM AND SYLLABUS
SEMESTER IV
COURSE
COURSE TITLE L T P M C
CODE

THEORY
415PQT01 Probability and Queuing Theory 3 1 0 100 4
415CIT02 Operating Systems 3 0 0 100 3
415CIT03 Database Management Systems 3 0 0 100 3
415ITT04 Microprocessors & Microcontrollers 3 0 0 100 3
415CIT05 Computer Networks 3 0 0 100 3
Professional Elective – I 3 0 0 100 3
PRACTICAL
415CIP07 Operating Systems Laboratory 0 0 4 100 2
415CIP08 Database Management Systems Laboratory 0 0 4 100 2
415CIP09 Computer Networks Laboratory 0 0 4 100 2
Total Credits 25

Professional Elective - I

COURSE
COURSE TITLE L T P M C
CODE

415ITE01 Information Storage Management 3 0 0 100 3

415CIE02 System Software 3 0 0 100 3
415CIE03 Design and Analysis of Algorithms 3 0 0 100 3
415ITE04 Signals and Systems 3 0 0 100 3
415ITE05 Theory of Computation 3 0 0 100 3
 PROBABILITY AND QUEUEING L T P C CA EA TOTAL
415PQT01
THEORY 3 1 0 4 50 50 100

(Common to IT & CSE)

OBJECTIVE(S)
 To impart the knowledge of basic probabilistic theory.
 To learn one dimensional discrete and continuous probability distributions occurring in natural
phenomena.
 To extend the probability theory to two dimensional random variable and to study the statistical
measures.
 To study the classification and analysis of few discrete random process.
 To acquire the skills to analyze queueing models.

UNIT-I PROBABILITY AND RANDOM VARIABLE 9+3

Axioms of probability - Conditional probability - Total probability – Baye’s theorem- Random
variable - Probability mass function - Probability density function - Properties - Moments - Moment
generating functions and their properties.

UNIT-II PROBABILITY DISTRIBUTIONS 9+3

Binomial, Poisson, Geometric, Uniform, Exponential, and Normal distributions and their properties -
Functions of a random variable.

UNIT-III TWO-DIMENSIONAL RANDOM VARIABLES 9+3

Joint distributions – Marginal and Conditional distributions – Covariance – Correlation and Linear
regression – Central limit theorem (Statement and applications only forindependent and identically
distributed random variables).

UNIT IV RANDOM PROCESSES 9+3

Classification – Stationary process – Poisson process - Markov process – Discrete parameter Markov
chain – Chapman Kolmogorov equations.

UNIT V QUEUEING THEORY 9+3

Markovian queues – Little’s formula –Models: (M/M/1) : (  /FIFO), (M/M/s) : (  /FIFO) , (M/M/1)
: (k/FIFO), (M/M/s) : (k/FIFO) – Non-Markovian Queues: Pollaczek-Khinchin formula - (M/G/1) : (  /GD)
.
TOTAL: 45 + 15 = 60
COURSE OUTCOMES:
At the end of the course the student will be able to
 Imbibe the knowledge of basic probability improves the quality of interpretation and decision
making in real time problems of uncertainity.
 Learn the concept of two dimensional random variables which helps to understand and analyse the
statistical measures which describes an outcome of a random experiment.
 Understand and characterize the random variable phenomenon which evolve with respect to time in
a probabilistic approach.
 Construct and solve queuing models that are suitable for practical problems encountered in daily
life.

TEXT BOOKS:
1. Ibe, O.C. “Fundamentals of Applied Probability and Random Processes”, Elsevier, U.P., 1st
Indian Reprint, 2007.
2. Gross, D. and Harris, C.M., “Fundamentals of Queueing Theory”, Wiley Student edition, 2008.
REFERENCES:
1. Hwei Hsu, “Schaum’s Outline of Theory and Problems of Probability, Random Variables and
Random Processes”, Tata McGraw Hill, New Delhi, 9th Reprint, 2010.
2. Veerarajan.T., “Probability, Statistics and Random Processes”, Tata McGraw-Hill publishing
company Limited, New Delhi, 2014.
3. Kandasamy.P,Thilagavathy,K.,&Gunavathi.K., “Probability, Statistics and Queueing Theory”.,
S.Chand& Company Ltd., New Delhi, 2014.
4. Gupta.S.C.,& Kapoor,V.K., “Fundamentals of mathematical statistics”, 10th edition(Reprint), Sultan
Chand & Sons publishers, New Delhi, 2002.
 L T P C CA EA TOTAL
415CIT02 OPERATING SYSTEMS
3 0 0 3 50 50 100
OBJECTIVE(S):
 Acquire basic Knowledge on computer operating system structures and functioning
 Impart knowledge on scheduling ,process synchronization and deadlocks
 Be familiar with different memory management techniques and storage management
 Understand security and protection mechanisms in operating systems.
Prerequisite: Fundaments of Computing and C Programming.

UNIT-I PROCESSES AND THREADS 9

Introduction to operating systems – computer system organization –computer system architecture - operating
system structures: OS Services - system calls – system programs – system structure. Processes: Process
concept – Process scheduling – Operations on processes – Interprocess communication – Communication in
client-server systems. Case study: IPC in Linux. Threads: Multi-threading models – Threading issues. Case
Study: Pthreads library.

UNIT-II CPU SCHEDULING AND PROCESS SYNCHRONIZATION 9

CPU Scheduling: Scheduling criteria – Scheduling algorithms – Multiple-processor scheduling – Real time
scheduling – Algorithm Evaluation. Case study: Process scheduling in Linux. Process synchronization: The
critical-section problem – Synchronization hardware – Semaphores – Classic problems of synchronization –
Monitors. Deadlock: System model – Deadlock characterization – Methods for handling deadlocks –
Deadlock prevention – Deadlock avoidance – Deadlock detection – Recovery from deadlock.

UNIT-III MEMORY MANAGEMENT 9

Memory Management: Introduction – Swapping – Contiguous memory allocation– Paging – Segmentation –
Segmentation with paging. Virtual Memory: Introduction – Demand paging –– copy on write – Page
replacement – Allocation of frames – Thrashing. Case Study: Memory management in Linux.

UNIT-IV STORAGE MANAGEMENT 9

Mass-Storage Structure: Introduction– Disk Structure - disk attachment- Disk scheduling – Disk
management – Swap-space management – RAID– stable storage. Case study: I/O in Linux. File-System
Interface: File concept – Access methods – Directory and Disk structure – File-system mounting – file
sharing - Protection. File-System Implementation: Files-system structure – File-System Implementation -
Directory implementation – Allocation methods – Free-space management – efficiency and performance –
recovery. Case studies: File system in Linux – file system in Windows 7.

UNIT-V PROTECTION, SECURITY AND VIRTUAL MACHINES 9

Protection: Goals of protection – Principles of Protection – Domain of Protection – Access Matrix –
Implementation of the Access Matrix – Access Control- Revocation of Access Rights – Capability Based
Systems – Language Based Protection. Security: The Security problem – Program Threats – System and
Network Threats – cryptography as a security tool –User Authentication - implementing Security Defenses –
Firewalling to protect systems and networks – Computer-Security Classifications. Virtual Machines:
Introduction – Benefits and features – Types of Virtual Machines and their implementations – Virtualization
and Operating System components.
TOTAL: 45
COURSE OUTCOMES:
At the end of the course student should be able to
CO1: Gain extensive knowledge and apply the concepts of process management
CO2: Determine the efficiency of CPU Scheduling Algorithms
CO3: Demonstrate and implement memory management, and paging techniques.
CO4: Illustrate I/O system, file system, Disk management functionalities in operating systems.
CO5: Be familiar with protection and security mechanism.

TEXT BOOK:
1. Silberschatz, Galvin, and Gagne, “Operating System Concepts”, Ninth Edition, Wiley India Pvt. Ltd.,
2013.

REFERENCE BOOKS:
1. Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Pearson Education/PHI 2001.
2. Gary Nutt, “Operating Systems”, Third Edition, Pearson Education, 2004. Harvey M. Deital,
“Operating Systems”, Third Edition, Pearson Education, 2004
 DATABASE MANAGEMENT L T P C CA EA TOTAL
415CIT03
SYSTEMS 3 0 0 3 50 50 100

OBJECTIVE(S):
 Learn the fundamentals of data models and to conceptualize and depict a database system using ER
diagram.
 Make a study of SQL and relational database design.
 Know the fundamental concepts of transaction processing, concurrency control techniques and
recovery procedure.
 To know the internal storage structures, indexing and advanced database concepts.

Prerequisites: Fundamentals of computing & C Programming, Data Structures and Algorithms.

UNIT-I INTRODUCTION 7
Purpose of Database System – Views of data - Database Languages – Data Models – Database System
Architecture – Database users and Administrator – Entity Relationship model (E-R Model) – E-R Diagrams.

UNIT-II RELATIONAL MODEL 9

The relational Model – The catalog - Types of Keys - Relational Algebra – Domain Relational Calculus –
Tuple Relational Calculus - SQL fundamentals - operations – Additional Operations- Integrity – Triggers -
Security & Authorization – Advanced SQL features –Embedded SQL– Dynamic SQL- Views – Introduction
to Distributed Databases and Client/Server Databases.

UNIT-III DATABASE DESIGN 9

Functional Dependencies – Non-loss Decomposition– First, Second, Third Normal Forms & Dependency
Preservation – Boyce / Codd Normal Form- Multi-valued Dependencies and Fourth Normal Form – Join
Dependencies and Fifth Normal Form.

UNIT-IV TRANSACTION MANAGEMENT 9

Transaction Concepts - Transaction Recovery – ACID Properties – System Recovery – Two Phase Commit -
Save Points – SQL Facilities for recovery – Concurrency – Need for Concurrency – Locking Protocols –
Two Phase Locking – Intent Locking – Deadlock- Serializability – Recovery Isolation Levels – SQL
Facilities for Concurrency.

UNIT-V DATA STORAGE & ADVANCED DATABASES 11

Overview of Physical Storage Media – Magnetic Disks – Tertiary storage – File Organization – Organization
of Records in Files – Indexing and Hashing – Ordered Indices – B tree - B+ tree Index Files – Static Hashing
– Dynamic Hashing – Query Processing Overview – measures of query cost – Database Tuning - OODB &
XML Databases – Introduction to mobile & web databases.
TOTAL: 45
COURSE OUTCOMES:
At the end of the course student should be able to
CO1: Gain and design extensive knowledge on various data models and ER diagram.
CO2: Recognize and develop sophisticated queries and authorization techniques to extract information
. from database
CO3: Analyze and eliminate all kind of dependency in a database schema via normalization .

techniques.
CO4: Apply concurrency control and recovery mechanism.
CO5: Understand the internal storage structures using different file and indexing techniques
& advanced database concepts

TEXT BOOKS:
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, “Database System Concepts”, 6th Edition, Tata
McGraw Hill, 2013.
2. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database Systems”, 8th Edition, Pearson
Education, 2012.

REFERENCE BOOKS:
1. Ramez Elmasri, Shamkant B. Navathe, “Database Systems”, 6th Edition, Pearson, 2013.
2. Raghu Ramakrishnan, J.Gehrke, “Database Management Systems”, 3rd Edition, McGraw Hill, 2014.
3. Shio Kumar Singh, “Database Systems Concepts, Design and Applications”, 2nd Edition, Pearson, 2011.
 MICROPROCESSORS & L T P C CA EA TOTAL
415ITT04
MICROCONTROLLERS 3 0 0 3 50 50 100

OBJECTIVE(S):
 Describe the architecture and programming of 8086 Microprocessor
 Learn the multiprocessor configurations with I\O processor and Numeric Data Processor.
 Understand the Memory and I/O interfacing of 8086 Microprocessor
 Describe the architecture and programming of 8051 Microcontroller
 Understand the Memory and I/O interfacing of 8051 Microcontroller

Prerequisite: Digital Principles and System Design

UNIT-I INTEL 8086 MICROPROCESSOR 9

Intel 8086 microprocessor - Architecture - Signals- Instruction Set-Addressing Modes- Assembly
Language Programming.

UNIT-II MULTIPROCESSOR CONFIGURATIONS 9

Maximum and minimum mode configuration, Assembler Directives- -Procedures-Macros-Interrupts and
Interrupt Service Routines, 8087 Numeric Data Processor - Architecture –8089 I/O Processor –
Architecture.

UNIT-III MEMORY AND I/O INTERFACING 9

Memory interfacing and I/O interfacing with 8086 – Parallel communication interface(8255) – Serial
communication interface(8251) – Programmable timer(8254)-Keyboard/Display controller(8279) –
Interrupt controller (8259)– DMA controller (8257) .

UNIT-IV INTEL 8051 MICROCONTROLLER 9

Architecture of 8051 Microcontroller – I/O ports – memory –Addressing Modes –Instruction set-
Assembly language programming- Interrupts.

UNIT-V INTERFACING WITH 8051 MICRO CONTROLLER 9

Timers and Counters – Serial data I/O –Interfacing with keyboards, 7 segment LEDs, LCDs, Interfacing
with ADCs. Interfacing with DACs. Applications- Stepper Motor.
TOTAL: 45
COURSE OUTCOMES:
Upon Completion of this course, students will be able to :
CO1: Explain the architecture and programming of 8086 Microprocessor
CO2: Demonstrate the multiprocessor configurations with I\O processor and Numeric Data Processor.
CO3: Analyze the Memory and I/O interfacing of 8086 Microprocessor
CO4: Explain the architecture and programming of 8051 Microcontroller
CO5: Analyze the Memory and I/O interfacing of 8051 Microcontroller
TEXT BOOKS:
1. Yn-cheng Liu,Glenn A.Gibson, “Microcomputer systems: The 8086 / 8088 Family architecture,
Programming and Design”, second edition, Prentice Hall of India , 2006
2. Kenneth J.Ayala, ‘The 8051 microcontroller Architecture, Programming and applications’second
Edition, Penram international.
3. Mohamed Ali Mazidi,Janice Gillispie Mazidi,” The 8051 microcontroller and embedded systems
using Assembly and C”,second edition, Pearson education /Prentice hall of India , 2007.

REFERENCE BOOKS:
1. Douglas V.Hall, “Microprocessors and Interfacing: Programming and Hardware”, second edition,
Tata Mc Graw Hill, 2006.
2. A.K.Ray & K.M Bhurchandi, “Advanced Microprocessor and Peripherals – Architecture,
Programming and Interfacing”, Tata Mc Graw Hill, 2006.
3. .Peter Abel, “IBM PC Assembly language and programming” , fifth edition, Pearson education /
Prentice Hall of India Pvt.Ltd,2007.
 L T P C CA EA TOTAL
415CIT05 COMPUTER NETWORKS
3 0 0 3 50 50 100
OBJECTIVE(S):
 Grasp the principles of data communication.
 Understand the functions of Data link layers.
 Understand the networking concepts and different routing algorithms
 Get familiarized with different Transport and application layer protocols.

Prerequisite: Fundamentals of Computing & C Programming

UNIT– I DATA COMMUNICATIONS & PHYSICAL LAYER 8

Introduction: Components – Data representation – Direction of Data flow – Networks: criteria and physical
structure – Protocols and Standards – Layered Tasks – ISO/OSI model and layers in the OSI model –
Addressing. Transmission Media: Guided Transmission Media – Twisted pair – Coaxial Cable – Fiber Optics
– Unguided Media–Radio waves–Microwaves–Infrared. Network Components: Connectors – Transceivers –
Media converters – Network Interface card – PC cards.

UNIT– II DATA LINK LAYER 10

Error Detection and Correction: Types of Errors–Redundancy– Parity – CRC – Hamming code – Data Link
Control: Flow Control and Error control – stop and wait – Go back-N ARQ – selective repeat ARQ- sliding
window – Media Access Control (MAC) – CSMA / CD - Wired & Wireless LAN: Ethernet - Bluetooth.

UNIT– III NETWORK LAYER 10

Internetworking Devices: Repeaters – Hubs – Bridges – Switches – DSL – Routers – Modems -Gateways. IP
addressing methods – Sub netting – Internetworking – Packet Switching and Datagram approach –Routing
Algorithms: Distance Vector Routing – Link State Routing – Network Layer Protocols : ARP –IPV4 –IPV6 -
Address Mapping- ICMP- IGMP.

UNIT– IV TRANSPORT LAYER 9

Process to process delivery – User Datagram Protocol (UDP) – Transmission Control Protocol (TCP) –
Congestion Control Techniques – Congestion Prevention Policies - Quality of Services (QOS) – Integrated
Services.

UNIT– V APPLICATION LAYER 8

Domain Name Space (DNS) – SMTP - POP3 –WWW – HTTP - FTP – SNMP.
TOTAL: 45
COURSE OUTCOMES:
At the end of the course student should be able to
CO1: Gain extensive knowledge on networks, role of each network layers, transmission medias and
network components.
CO2: Apply various routing algorithms over a network to provide optimal, error free transmission of
data using error detection and correction techniques.
CO3: Understand the functionality of protocols.
CO4: Analyze and implement the design of a network using TCP & UDP
CO5: Understand the services in application layer

TEXT BOOKS:
1. Behrouz A. Forouzan, “Data communication and Networking”, 5th Edition, Tata McGraw-Hill, 2013.
2. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks”, 5th Edition, PHI Learning, 2014.

REFERENCE BOOKS:
1. William Stallings, “Data and Computer Communication”, 9th Edition, Pearson Education, 2014.
2. Alberto Leon Garcia, Indra Widjaja, “Communication Networks Fundamental Concepts and key
Architectures”, 2nd Edition, Tata McGraw-Hill, 2009.
3. James F. Kurose and Keith W. Ross, “Computer Networking: A Top-Down Approach Featuring the
Internet”, 6th Edition, Pearson Education, 2012.
4. Larry L Peterson, Bruce S Davie, “Computer Networks”, 5th Edition, Morgan Kaufmann Publisher,2012.
5. Prakash C Gupta, “Data Communications and Computer Networks”, 2nd Edition, PHI Learning, 2013.
 L T P C CA EA TOTAL
OPERATING SYSTEMS
415CIP07
LABORATORY
0 0 4 2 50 50 100

OBJECTIVE(S):
 Learn shell programming and the use of various system calls in the UNIX environment.
 Expose to process creation, scheduling and inter process communication.
 Be familiar with implementation of page replacement algorithms, file allocations, memory
management and deadlock avoidance
Pre requisites: Fundamentals of Computing & C Programming, Operating System

LIST OF EXPERIMENTS
(Implement the following on LINUX or other Unix like platform. Use C for high level language
implementation)
1. Basic Shell commands.
2. Write programs to implement File management and Directory management system calls of UNIX
operating system (open(), close(), lseek(), read(), write(),mount, umount, link, unlink, mkdir, rmdir).
3. Write programs to implement Process management system calls of UNIX operating system (fork(),
wait(), execlp(), exit(), signal(sig, handler), kill(sig, pid)).
4. Given the list of processes, their CPU burst times and arrival times, display/print the Gantt chart for CPU
scheduling algorithms (preemptive and non preemptive). For each of the Scheduling policies, compute
and print the average waiting time and average turnaround time.
5. Implementation of Inter Process Communication (using pipes/ shared memory/ message queues).
6. Implement the producer consumer problem using semaphores.
7. Simulation of deadlock avoidance & prevention algorithms.
8. Simulation of Memory management algorithms.
9. Implementation of page replacement algorithms.
10. Implementation of file allocation methods (linked/indexed/contiguous).
11. Implementation of disk scheduling algorithms.
12. Implementation of user authentication.
TOTAL: 60
COURSE OUTCOMES:
At the end of the course student should be able to
CO1: Implement basic services and functionalities of operating system using system call.
CO2: Implement various CPU scheduling algorithm and inter process communication and
semaphores.
C03: Implement memory management algorithms.
CO4: Demonstrate file allocation and organization techniques.
CO5: Illustrate disk scheduling algorithms.
HARDWARE & SOFTWARE REQUIRED FOR A BATCH OF 36 STUDENTS
Hardware: 36 PC
Software: Linux (Ubuntu/OpenSUSE/Fedora/Red Hat/Debian/Mint OS) Linux could be loaded in individual
PCs
or
A single server could be loaded with Linux and connected from the individual PCs.
 DATABASE MANAGEMENT L T P C CA EA TOTAL
415CIP08
SYSTEMS LABORATORY 0 0 4 2 50 50 100

OBJECTIVE(S):
 Create database with different types of integrity constraints and use the SQL commands such as
DDL, DML & DCL to access data from database.
 Learn to implement SQL join operations & functions, Views
 To know the fundamental concepts of procedures & reports
 To design a database using different tools

Pre requisites: Fundamentals of Computing & C Programming

LIST OF EXPERIMENTS:
1. Create table for any schema & perform following operations
A. Add new fields, modify table & fields, remove any record & empty using DDL Commands
B. Add new record, remove old record & update fields using DML Commands
C. Apply following constraints: Check, Default, Null, Primary & Foreign key
2. Create tables for any schema & perform Undo, Redo operations, User permission using DCL Commands
3. Create any two tables & convert into normalized form using
A. Nested Queries
B. Join queries
C. Set Operations
4. Implement SQL functions such as Date, Character, general, Aggregate & number functions, etc…
5. Create Horizontal, Vertical view & perform following operations add, remove, join, check view updates
6. Implement PL/SQL Programs with Embedded SQL form
A. Control structures using Loop, if-else, While & for loop
B. Procedures to update & reflect in related tables
C. Using Functions
7. Create trigger for update & modify database
8. Design any simple program using VB / VC++
9. Design oracle form for any schema that uses both manual & design wizard option
10. Display database details with oracle reports using manual & design wizard option.
11. Develop menu design for any schema using VB
12. Design & develop any schema with front-end tools using VB/VC++ with Database connection.
13. Design any program / application using MongoDB
TOTAL: 60
COURSE OUTCOMES:
At the end of the course student should be able to
CO 1: Design and implement database schema for a given problem domain.
CO 2: Populate and query a database using SQL operations.
CO 3: Prepare reports.
CO 4: Design & develop an application using advanced databases.
HARDWARE AND SOFTWARE REQUIRED FOR A BATCH OF 36 STUDENTS:
Hardware:
36 Personal Computers
Software:
Front end : VB / VC ++
Back end : MySQL, Oracle 11g, MongoDB
Platform : Windows 2000 Professional/XP or higher
Oracle server could be loaded and can be connected from individual PCs
 COMPUTER NETWORKS L T P C CA EA TOTAL
415CIP09
LABORATORY 0 0 4 2 50 50 100
OBJECTIVE(S):
 Get familiarized with socket programming
 Understand the basic networking commands
 Analyze the performance of protocols in different layers using simulation tools.
Prerequisite: Fundamentals of Computing & C Programming, Object Oriented Programming
LIST OF EXPERIMENTS:
1. Basic network command line utilities such as ping, netstat, tracert, nslookup, port scan, ARP, ipconfig.
Implement the following experiments in C/C++/Java:
2. Generate Hamming code for error detection and correction
3. Implement Error Detection code using CRC
4. Implementation of stop and wait protocol
5. Implementation of sliding window protocol
6. Implementation of UDP
7. Implementation of TCP
Implement the following experiments using simulator:
8. Study of Basic concepts of Network Simulator (NS2), its installation and working environment.
9. Using NS2 Network Simulation,
i) Initialize & Network simulator object.
ii) Group of Nodes to form a LAN
iii) Delay of Link
iv) Bandwidth of Link.
10. Simulate a four Duplex network and apply TCP agent between two nodes and UDP agents between
other two nodes and by changing the parameters, determine the number of packets sent and dropped by
TCP/UDP.
11. Simulate a wired network and measure the following performance metrics
i) Throughput ii) Delay iii) Packet Loss
12. Implement Link State routing and Distance Vector routing measure the following performance metrics
i) Throughput ii) Delay iii) Packet Loss
13. Experiment on packet capture and network traffic using wire shark tool.
TOTAL: 60
COURSE OUTCOMES:
At the end of the course student should be able to
CO1: Gain knowledge on the basic concepts of open source network simulator.
CO2: Analyze and implement various routing algorithms.
CO3: Simulate networks and analyze traffic using various tools.
CO4: Analyze the performance of protocols in different layers.
HARDWARE AND SOFTWARE REQUIRED FOR A BATCH OF 36 STUDENTS:
Hardware:
36 Personal Computers
Software:
 C / C++/ Java - Compiler, JDK1.5 or Higher.
 Network simulator like NS2 / Wire Shark.
 Linux / Windows 2000 Professional/XP or higher - OS.
 INFORMATION STORAGE L T P C CA EA TOTAL
415ITE01
MANAGEMENT
3 0 0 3 50 50 100

OBJECTIVE(S):
 Understand logical and physical components of a storage infrastructure
 To study different types of storage area networks
 To gain knowledge in different backup and recovery topologies and their role in providing disaster
recovery and business continuity capabilities
 To gain knowledge in information security and identify different storage virtualization technologies
Pre requisites: Computer Networks, Database Systems

UNIT I INTRODUCTION TO STORAGE TECHNOLOGY 9

Review data creation and the amount of data being created and understand the value of data to a business,
challenges in data storage and data management, Solutions available for data storage, Core elements of a data
center infrastructure, role of each element in supporting business activities.

UNIT II STORAGE SYSTEMS ARCHITECTURE 9

Hardware and software components of the host environment, Key protocols and concepts used by each
component, Physical and logical components of a connectivity environment , Major physical components of
a disk drive and their function, logical constructs of a physical disk, access characteristics, and performance
Implications, RAID , RAID levels, Compare and contrast integrated and modular storage systems, High-level
architecture and working of an intelligent storage system

UNIT III INTRODUCTION TO NETWORKED STORAGE 9

Evolution of networked storage, Architecture, components, and topologies of FC -SAN, NAS, and IP-SAN,
FCoE , iSCSI Benefits of the different networked storage options, understand the need for long-term
archiving solutions and describe how CAS full fill the need, understand the appropriateness of the different
networked storage options for different application environments.

UNIT IV INFORMATION AVAILABILITY, MONITORING & MANAGING DATACENTER

9
Business Continuity- Information Availability, RTO and RPO, Identify single points of failure in a storage
infrastructure and list solutions to mitigate these failures, Architecture of backup/recovery and the different
backup/ recovery topologies, Data Deduplication, Local and Remote replication technologies. Monitoring
the storage infrastructure, Information Life cycle Management.

UNIT V SECURING STORAGE AND STORAGE VIRTUALIZATION 9

Information security, Critical security attributes for information systems, Storage security domains, List and
analyzes the common threats in each domain, Virtualization technologies, block-level and file-level
virtualization technologies and processes.
COURSE OUTCOMES:
At the end of the course student should be able to
CO1: Ability to identify the key requirements of data center.
CO2: Analyze the different storage systems architecture.
CO3: Analyze different storage networking technologies.
CO4: Ability to identify key challenges in managing information and also describe the different role in
providing disaster recovery and business continuity capabilities.
CO5: Ability to identify and analyzes the common threats in different domains.

REFERENCE BOOKS:
1. EMC Corporation, Information Storage and Management, Wiley, India, 2nd Edition, 2012.
2. Robert Spalding, “Storage Networks: The Complete Reference“, Tata McGraw Hill, Osborne, 2003.
3. Marc Farley, “Building Storage Networks”, Tata McGraw Hill ,Osborne, 2001.
 L T P C CA EA TOTAL
415CIE02 SYSTEM SOFTWARE
3 0 0 3 50 50 100

OBJECTIVE(S):
 Understand the Concepts of Assemblers.
 Gain the Knowledge on Linkers and Loaders as well as their Interactions with Hardware.
 Learn the working nature of Macro Processors and Text Editors.
 Understand the key Virtual Machine concepts, and explore an Emerging Applications in the field of Virtual
Machines.
Prerequisite: Fundamentals of Computing and C Programming, Computer Architecture.

UNIT-I ASSEMBLERS 9
System Software and Machine Architecture - SIC Machine Architecture - SIC/XE Machine Architecture -
Assemblers - Basic Assembler Functions - Machine Dependent Assembler Features - Machine Independent
Assembler Features - Assembler Design Options - One Pass Assemblers - Multi-Pass Assemblers.

UNIT-II LOADERS AND LINKERS 9

Basic Loader Functions - Machine - Dependent Loader Features - Machine - Independent Loader Features -
Loader Design Options - Linkage Editors - Dynamic Linking - Bootstrap Loaders.

UNIT-III MACROPROCESSORS AND TEXT EDITORS 9

Basic Macro Processor Functions - Machine-Independent Macro Processor Features - Macro Processor
Design Options - Text editors - Overview of the Editing Process - User Interface - Editor Structure -
Interactive debugging systems - Debugging functions and capabilities - Relationship with other parts of the
system - User Interface Criteria.

UNIT-IV VIRTUAL MACHINES 9

Introduction to Virtual Machines (VM) - Computer Architecture- Virtual Machine Basics - Process Virtual
Machines - System Virtual Machines - Basic Interpretation - Threaded Interpretation - Interpreting a
Complex Instruction Set - Code Discovery and Dynamic Translation, Control Transfer Optimization.

UNIT-V ADVANCED FEATURES 9

Dynamic Binary Optimization - Profiling – Object oriented High Level Language Virtual Machines - Java
Virtual Machines - Common Language Infrastructure - Code optimizations- Security - Migration - Grids -
Examples of Real World Implementations of System Software.
TOTAL: 45

COURSE OUTCOMES:
At the end of the course the students are able to
CO1: Conceptualize the Features of Assemblers.
CO2: Design and Implement the functionalities of Loaders and Linkers.
CO3: Implement the Functions of Macro Processors and Text Editors.
CO4: Conceptualize the process and system Virtual Machines
CO5: Apply Virtual Machine concepts to implement Real Time Applications.
TEXT BOOKS:
1. Leland L. Beck and D. Manjula “System Software - An Introduction to System Programming”, Third
Edition, Pearson Education, 2009.
2. James E Smith and Ravi Nair, “Virtual Machines”, Elsevier, 2005

REFERENCE BOOKS:
1. D.M.Dhamdhere: System Programming and Operating Systems, Second Edition, Tata McGraw - Hill,
2011
2. John J.Donovan, “Systems Programming”, Tata McGraw-Hill, 2009.
3. John R. Levine, “Linkers & Loaders”, Morgan Kauffman, 2003
 DESIGN AND ANALYSIS OF L T P C CA EA TOTAL
415CIE03
ALGORITHM
3 0 0 3 50 50 100

OBJECTIVE(S):
 Learn and analyze various algorithm techniques.
 Aware of mathematical background for algorithm analysis and implementation of various strategies like
Divide and Conquer, Greedy Method, Dynamic Programming , Backtracking , Branch and Bound
 Be familiar with limitations of algorithm and solving iterative problems.

Prerequisites: Data Structures and Algorithms

UNIT-I INTRODUCTION 9
Algorithm- Fundamentals of Algorithmic Problem Solving: Algorithm design and analysis process - Algorithm
Design Techniques - Methods of Specifying an Algorithm – Algorithm Analysis - Important Problem Types
- Asymptotic Notations - Properties of big-Oh notation – Recurrence equations – Solving recurrence
equations: Substitution method, Iteration method and Master’s method.

UNIT-II DIVIDE AND CONQUER AND GREEDY ALGORITHMS 10

Divide and Conquer: General Method – Binary Search – Finding Maximum and Minimum – Merge Sort –
Greedy Algorithms: General Method – Single Source Shortest Path Problem - Container Loading –
Knapsack Problem - Huffman codes.

UNIT-III DYNAMIC PROGRAMMING AND GRAPH TRAVERSALS 10

Dynamic Programming: General Method – Multistage Graphs – All-Pair shortest paths – Optimal binary
search trees – 0/1 Knapsack – Travelling salesperson problem, Flow Shop Scheduling. Graph Traversals:
Breadth First Search – Depth First Search – Connected Components – Spanning Trees – Biconnected
Components.

UNIT-IV BACKTRACKING AND BRANCH AND BOUND 8

Backtracking: General Method – 8 Queens Problem – Sum of Subsets – Graph Coloring – Hamiltonian
Problem – Knapsack Problem. Branch and Bound: Least Cost Search (LC) – FIFO Branch and Bound - 0/1
Knapsack Problem.

UNIT-V ITERATIVE IMPROVEMENT AND LIMITATIONS OF ALGORITHM POWER

8
Iterative Improvement: The Maximum-Flow Problem – Maximum Matching in Bipartite Graphs – The
Stable Marriage Problem. Limitations of Algorithm Power: P, NP and NP-Complete Problems.
TOTAL: 45

COURSE OUTCOMES:
At the end of the course the students are able to
CO1: Analyze time and space complexity of algorithms.
CO2: Decisively analyze diverse algorithm strategies for the given problem.
CO3: Formulate and compute recurrence relations for the given algorithm.
CO4: Select optimal solution for the given computational problem.
CO5: Improve the efficiency of the algorithm by understanding its limitations.
TEXT BOOKS:
1. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, “Computer Algorithms/ C++”, Second Edition,
Universities Press, 2007.
2. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third Edition, Pearson Education, 2012.

REFERENCE BOOKS:
1. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”,
Third Edition, PHI Learning Private Limited, 2012.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson Education,
Reprint 2006.
3. Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer, 2008.
 L T P C CA EA TOTAL
415ITE04 SIGNALS AND SYSTEMS
3 0 0 3 50 50 100

OBJECTIVE(S):
 Demonstrate an understanding of the fundamental properties and representation of discrete and
continuous time signals.
 Spectral analysis of CT periodic and aperiodic signals using CT Fourier and Laplace methods.
 Analysis and Characterization of total response, impulse response and frequency response of LTI CT
systems.
 Use Discrete Time Fourier Transforms and Z transform to analyze discrete time signals.
 Analysis and Characterization of total response, impulse response and frequency response of LTI DT
systems.

Prerequisites: Engineering Mathematics - I & II

UNIT-I CLASSIFICATION OF SIGNALS AND SYSTEMS 9

Continuous Time signals (CT signals), Discrete Time signals (DT signals) - Step, Ramp, Impulse,
Exponential, Classification of CT and DT signals - periodic and aperiodic, Energy and power, even and odd,
Deterministic and Random signals, Transformation on Independent variables -CT systems and DT systems,
Properties of Systems – Linearity, Causality, Time Invariance, Stability, Invertibility and LTI Systems.

UNIT-II ANALYSIS OF CT SIGNALS 9

Fourier Series Analysis, Spectrum of CT Signals, Continuous Time Fourier Transform and Laplace
Transform in Signal Analysis, Properties of Fourier Transform, Laplace Transform-Properties-ROC,
Parseval’s Theorem, Sampling Theorem and Aliasing.

UNIT-III LTI-CT SYSTEMS 9

Differential equations-Total Response- Fourier Transform & Laplace Transform, Impulse response,
Convolution Integral, Frequency response.

UNIT-IV ANALYSIS OF DT SIGNALS 9

Spectrum of DT Signals, Discrete Time Fourier Transform (DTFT), Z-Transform in signal analysis, Z-
transform-Properties-ROC and Inverse Z Transform-Partial Fraction-Long Division.

UNIT-V LTI-DT SYSTEMS 9

Difference equations, Total Response-Z- Transform, Impulse response, Convolution sum, Frequency
response

TOTAL: 45
COURSE OUTCOMES:
Upon Completion of this course, students will be able to :
CO1: Categorize the properties and representation of discrete and continuous time signals.
CO2: Analyze the continuous time signal using Fourier and Laplace transform.
CO3: Determine total response, impulse response and frequency response of LTI-CT systems
CO4: Analyze the discrete time signals using Discrete Time Fourier Transforms and Z transform
CO5: Determine total response, impulse response and frequency response of LTI-DT systems
TEXT BOOKS:
1 AlanV.Oppenheim, Alan S.Willsky with S.Hamid Nawab, Signals & Systems, 2ndedn., Pearson
Education, 2015
2 M.J.Roberts, Signals and Systems Analysis using Transform method and MATLAB, TMH 2003.

REFERENCE BOOKS:
1 Lathi.B.P,Signals Systems and Communication, B S Publications, Hyderabad, 2001.
2 Simon Haykin and Barry Van Veen, Signals and Systems, John Wiley, 1999
3 K.Lindner, “Signals and Systems”, McGraw Hill International, 1999
4 Michael J Roberts, "Fundamentals of Signals and systems" Tata McGraw Hill, 2007.
 L T P C CA EA TOTAL
415ITE05 THEORY OF COMPUTATION
3 0 0 3 50 50 100

OBJECTIVE(S):
 Understand the Properties of formal languages and formal grammars.
 Introduce deterministic and non-deterministic finite automata.
 Learn Pushdown Automata and Context free language.
 Understand Turing machines and computing with Turing machines.
 Acquaint with the fundamentals of decidability and Reducibility.
Prerequisite: Engineering Mathematics
UNIT– I INTRODUCTION TO AUTOMATA 9
Sets – functions – relations – Languages– Basic Machines - Finite Automata – Basic definitions–
Deterministic Finite Automata (DFA), Non-Deterministic Finite Automata (NFA) – Finite automata with
Epsilon transitions –Equivalence of DFA`s and NFA`s - Applications of finite state automata.

UNIT– II REGULAR EXPRESSIONS AND LANGUAGES 9

Regular languages - Regular Expressions – Finite automata and regular expressions – Properties of regular
sets –Properties of Regular Language: Proving languages not to be Regular – Pumping Lemma for Regular
Language, Closure properties of Regular Language, Equivalence and Minimization of Automata.

UNIT– III CONTEXT FREE LANGUAGES AND PUSH DOWN AUTOMATA 9

Context Free Grammar (CFG) – Derivation trees – Ambiguity-Normal Forms, Chomsky Normal Form
(CNF) and Griebach Normal Form (GNF)– Introduction to Push Down Automata (PDA) – PDA definition –
Equivalence of PDA and context free language –Deterministic pushdown automata – Properties of context
free languages.

UNIT– IV TURING MACHINES 9

Church-Turing thesis: Turing machines - Language of a TM, TM as accepters and deciders. Programming
techniques for TM -Storage in state, multiple tracks, and subroutines. Variants of Turing Machines-Universal
Turing machine.

UNIT– V DECIDABILITY AND REDUCIBILITY 9

Decidability: Decidable languages Halting problem: Diagonalization Method-Halting Problem is
Undecidable- Reducibility: Undecidable problems from Language theory - A simple Undecidable problem:
Rice Theorm - Post's Correspondence Problem (PCP) -Definition, Undecidability of PCP.
TOTAL: 45
COURSE OUTCOMES:
At the end of the course student should be
CO1: Acquire a fundamental understanding of the core concepts in Automata theory and Formal
Languages.
CO2: An ability to design grammars and Automata (recognizers) for different language classes.
CO3: Able to identify the relationship between Push down Automata and Context Free
Languages.
CO4: Be exposed to a broad overview of the computation and exercise of Turing Machine.
CO5: Acquire a fundamental understanding of computational models including decidability,
reducibility and intractability.
TEXT BOOKS:
1. John E. Hopcroft and Rajeev Motwani and Jeffrey D. Ullman, “Introduction to Automata Theory,
Languages and Computation”, third edition, Pearson Education, New Delhi, 2013.
2. John C. Martin, “Introduction to Languages and the Theory of Computation”, Third Edition, Tata
McGraw-Hill Education Pvt. Ltd., New Delhi, 2009.
3.Rajendra Kumar, “Theory of Automata Languages and Computation”, first edition Tata McGraw-Hill
Education Pvt. Ltd., New Delhi, 2010.

REFERENCE BOOKS:
1. S.N.Sivanadam , M.Janaki Meena, “ Theory of Computation” , I.K.International Publishing House Pvt.
Ltd, ISBN: 9789380026206, 2009.
2. Michael Sipser , “Introduction to the Theory of Computation”, third edition, PWS Publications, Boston,
2013.
3. Harry R. Lewis, Chris H Papadimitriou, “Elements of the Theory of Computation”, Second Edition,
PHI / Pearson Education, New Delhi, 1997.
4. Peter Linz, “An Introduction to Formal Language and Automata”, fifth edition, Narosa Publishers, New
Delhi, 2011.