Sl.

COURSE CONTACT
COURSE TITLE CATEGORY L T P C
No CODE PERIODS
THEORY
1. MA8402 Probability and Queueing BS
4 4 0 0 4
Theory
2. CS8491 Computer Architecture PC 3 3 0 0 3
3. CS8492 Database Management PC
3 3 0 0 3
Systems
4. CS8451 Design and Analysis of PC
3 3 0 0 3
Algorithms
5. CS8493 Operating Systems PC 3 3 0 0 3
6. CS8494 Software Engineering PC 3 3 0 0 3
PRACTICALS
7. CS8481 Database Management PC
4 0 0 4 2
Systems Laboratory
8. CS8461 Operating Systems PC
4 0 0 4 2
Laboratory
9. HS8461 Advanced Reading and EEC
2 0 0 2 1
Writing
TOTAL 29 19 0 10 24

SEMESTER IV
MA8402 PROBABILITY AND QUEUING THEORY L T P C
4 0 0 4

UNIT I PROBABILITY AND RANDOM VARIABLES 12

Probability – Axioms of probability – Conditional probability – Baye‘s theorem -
Discrete and continuous random variables – Moments – Moment generating
functions – Binomial, Poisson, Geometric, Uniform, Exponential and Normal
distributions.

UNIT II TWO - DIMENSIONAL RANDOM VARIABLES 12

Joint distributions – Marginal and conditional distributions – Covariance –
Correlation and linear regression – Transformation of random variables – Central
limit theorem (for independent and identically distributed random variables).

UNIT III RANDOM PROCESSES 12

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

UNIT IV QUEUEING MODELS 12

Markovian queues – Birth and death processes – Single and multiple server
queueing models – Little‘s formula - Queues with finite waiting rooms – Queues
with impatient customers : Balking and reneging.

UNIT V ADVANCED QUEUEING MODELS 12

Finite source models - M/G/1 queue – Pollaczek Khinchin formula - M/D/1 and
M/EK/1 as special cases – Series queues – Open Jackson networks.

TOTAL : 60 PERIODS

TEXTBOOKS:
1. Gross, D., Shortle, J.F, Thompson, J.M and Harris. C.M., ―Fundamentals of
Queueing Theory", Wiley Student 4th Edition, 2014.
2. Ibe, O.C., ―Fundamentals of Applied Probability and Random Processes",
Elsevier, 1st Indian Reprint, 2007.
CS8492 DATABASE MANAGEMENT SYSTEMS LTPC
3003

UNIT I RELATIONAL DATABASES 10

Purpose of Database System – Views of data – Data Models – Database System
Architecture – Introduction to relational databases – Relational Model – Keys –
Relational Algebra – SQL fundamentals – Advanced SQL features – Embedded
SQL– Dynamic SQL

UNIT II DATABASE DESIGN 8

Entity-Relationship model – E-R Diagrams – Enhanced-ER Model – ER-to-
Relational Mapping – 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 III TRANSACTIONS 9

Transaction Concepts – ACID Properties – Schedules – Serializability –

Concurrency Control – Need for Concurrency – Locking Protocols – Two Phase
Locking – Deadlock – Transaction Recovery - Save Points – Isolation Levels –
SQL Facilities for Concurrency and Recovery.

UNIT IV IMPLEMENTATION TECHNIQUES 9

RAID – File Organization – Organization of Records in Files – Indexing and
Hashing –Ordered Indices – B+ tree Index Files – B tree Index Files – Static
Hashing – Dynamic Hashing – Query Processing Overview – Algorithms for
SELECT and JOIN operations – Query optimization using Heuristics and Cost
Estimation.

UNIT V ADVANCED TOPICS 9

Distributed Databases: Architecture, Data Storage, Transaction Processing –
Object-based Databases: Object Database Concepts, Object-Relational features,
ODMG Object Model, ODL, OQL - XML Databases: XML Hierarchical Model,
DTD, XML Schema, XQuery – Information Retrieval: IR Concepts, Retrieval
Models, Queries in IR systems.

TOTAL: 45 PERIODS

TEXT BOOKS:
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, ―Database System
Concepts‖, Sixth Edition, Tata McGraw Hill, 2011.

2.Ramez Elmasri, Shamkant B. Navathe, ―Fundamentals of Database

Systems‖, Sixth Edition, Pearson Education, 2011.
 CS8491 COMPUTER ARCHITECTURE LTPC
3003

UNIT I BASIC STRUCTURE OF A COMPUTER SYSTEM 9

Functional Units – Basic Operational Concepts – Performance –
Instructions: Language of the Computer – Operations, Operands –
Instruction representation – Logical operations – decision making – MIPS
Addressing.

UNIT II ARITHMETIC FOR COMPUTERS 9

Addition and Subtraction – Multiplication – Division – Floating Point

Representation –
Floating Point Operations – Subword Parallelism

UNIT III PROCESSOR AND CONTROL UNIT 9

A Basic MIPS implementation – Building a Datapath – Control
Implementation Scheme – Pipelining – Pipelined datapath and control –
Handling Data Hazards & Control Hazards – Exceptions.

UNIT IV PARALLELISIM 9
Parallel processing challenges – Flynn‘s classification – SISD, MIMD,
SIMD, SPMD, and Vector Architectures - Hardware multithreading – Multi-
core processors and other Shared Memory Multiprocessors - Introduction
to Graphics Processing Units, Clusters, Warehouse Scale Computers and
other Message-Passing Multiprocessors.

UNIT V MEMORY & I/O SYSTEMS 9

Memory Hierarchy - memory technologies – cache memory – measuring
and improving cache performance – virtual memory, TLB‘s – Accessing I/O
Devices – Interrupts – Direct Memory Access – Bus structure – Bus
operation – Arbitration – Interface circuits - USB.

TOTAL : 45 PERIODS

TEXT BOOKS:
1. David A. Patterson and John L. Hennessy, Computer Organization and
Design: The Hardware/Software Interface, Fifth Edition, Morgan
Kaufmann / Elsevier, 2014.
2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky and Naraig Manjikian,
Computer Organization and Embedded Systems, Sixth Edition, Tata
McGraw Hill, 2012.
CS8451 DESIGN AND ANALYSIS OF ALGORITHMS LTPC
3003

UNIT I INTRODUCTION 9
Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving –
Important Problem Types – Fundamentals of the Analysis of Algorithmic
Efficiency –Asymptotic Notations and their properties. Analysis Framework –
Empirical analysis - Mathematical analysis for Recursive and Non-recursive
algorithms - Visualization

UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER 9

n
Brute Force – Computing a – String Matching - Closest-Pair and Convex-Hull
Problems - Exhaustive Search - Travelling Salesman Problem - Knapsack
Problem - Assignment problem. Divide and Conquer Methodology – Binary
Search – Merge sort – Quick sort – Heap Sort - Multiplication of Large Integers –
Closest-Pair and Convex - Hull Problems.

UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE 9

Dynamic programming – Principle of optimality - Coin changing problem,
Computing a Binomial Coefficient – Floyd‘s algorithm – Multi stage graph -
Optimal Binary Search Trees – Knapsack Problem and Memory functions.
Greedy Technique – Container loading problem - Prim‘s algorithm and Kruskal's
Algorithm – 0/1 Knapsack problem, Optimal Merge pattern - Huffman Trees.

UNIT IV ITERATIVE IMPROVEMENT 9

The Simplex Method - The Maximum-Flow Problem – Maximum Matching in
Bipartite Graphs, Stable marriage Problem.

UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER

9 Lower - Bound Arguments - P, NP NP- Complete and NP Hard Problems.
Backtracking – n-Queen problem - Hamiltonian Circuit Problem – Subset Sum
Problem. Branch and Bound – LIFO Search and FIFO search - Assignment
problem – Knapsack Problem – Travelling Salesman Problem - Approximation
Algorithms for NP-Hard Problems – Travelling Salesman problem – Knapsack
problem.

TOTAL: 45 PERIODS
TEXT BOOKS:
1. Anany Levitin, ―Introduction to the Design and Analysis of Algorithms‖, Third
Edition, Pearson Education, 2012.
2. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer
Algorithms/ C++, Second Edition, Universities Press, 2007.

CS8493 OPERATING SYSTEMS LTPC

3003
UNIT I OPERATING SYSTEM OVERVIEW 7
Computer System Overview-Basic Elements, Instruction Execution, Interrupts,
Memory Hierarchy, Cache Memory, Direct Memory Access, Multiprocessor and
Multicore Organization. Operating system overview-objectives and functions,
Evolution of Operating System.- Computer System Organization Operating
System Structure and Operations- System Calls, System Programs, OS
Generation and System Boot.

UNIT II PROCESS MANAGEMENT 11

Processes - Process Concept, Process Scheduling, Operations on Processes,
Inter-process Communication; CPU Scheduling - Scheduling criteria, Scheduling
algorithms, Multiple-processor scheduling, Real time scheduling; Threads-
Overview, Multithreading models, Threading issues; Process Synchronization -
The critical-section problem, Synchronization hardware, Mutex locks,
Semaphores, Classic problems of synchronization, Critical regions, Monitors;
Deadlock - System model, Deadlock characterization, Methods for handling
deadlocks, Deadlock prevention, Deadlock avoidance, Deadlock detection,
Recovery from deadlock.

UNIT III STORAGE MANAGEMENT 9

Main Memory – Background, Swapping, Contiguous Memory Allocation, Paging,
Segmentation,
Segmentation with paging, 32 and 64 bit architecture Examples; Virtual Memory –
Background, Demand Paging, Page Replacement, Allocation, Thrashing;
Allocating Kernel Memory, OS Examples.

UNIT IV FILE SYSTEMS AND I/O SYSTEMS 9

Mass Storage system – Overview of Mass Storage Structure, Disk Structure, Disk
Scheduling and Management, swap space management; File-System Interface -
File concept, Access methods, Directory Structure, Directory organization, File
system mounting, File Sharing and Protection; File System Implementation- File
System Structure, Directory implementation, Allocation Methods, Free Space
Management, Efficiency and Performance, Recovery; I/O Systems – I/O
Hardware, Application I/O interface, Kernel I/O subsystem, Streams,
Performance.

UNIT V CASE STUDY 9

Linux System - Design Principles, Kernel Modules, Process Management,
Scheduling, Memory Management, Input-Output Management, File System, Inter-
process Communication; Mobile OS - iOS and Android - Architecture and SDK
Framework, Media Layer, Services Layer, Core OS Layer, File System.

TOTAL : 45 PERIODS

TEXT BOOK :
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, ―Operating
System Concepts‖, 9th Edition, John Wiley and Sons Inc., 2012.

CS8494 SOFTWARE ENGINEERING L T P C

3 0 0 3
UNIT I SOFTWARE PROCESS AND AGILE DEVELOPMENT 9
Introduction to Software Engineering, Software Process, Perspective and
Specialized Process Models –Introduction to Agility-Agile process-Extreme
programming-XP Process.

UNIT II REQUIREMENTS ANALYSIS AND SPECIFICATION 9

Software Requirements: Functional and Non-Functional, User requirements,
System requirements,
Software Requirements Document – Requirement Engineering Process:
Feasibility Studies, Requirements elicitation and analysis, requirements
validation, requirements managementClassical analysis: Structured system
Analysis, Petri Nets- Data Dictionary.

UNIT III SOFTWARE DESIGN 9

Design process – Design Concepts-Design Model– Design Heuristic –
Architectural Design Architectural styles, Architectural Design, Architectural
Mapping using Data Flow- User Interface Design: Interface analysis, Interface
Design –Component level Design: Designing Class based components,
traditional Components.

UNIT IV TESTING AND MAINTENANCE 9

Software testing fundamentals-Internal and external views of Testing-white box
testing - basis path testing-control structure testing-black box testing- Regression
Testing – Unit Testing – Integration Testing – Validation Testing – System
Testing And Debugging –Software Implementation Techniques: Coding
practices-Refactoring-Maintenance and Reengineering-BPR model-
Reengineering process model-Reverse and Forward Engineering.
9
UNIT V PROJECT MANAGEMENT
Software Project Management: Estimation – LOC, FP Based Estimation,
Make/Buy Decision COCOMO I & II Model – Project Scheduling – Scheduling,
Earned Value Analysis Planning – Project Plan, Planning Process, RFP Risk
Management – Identification, Projection - Risk
Management-Risk Identification-RMMM Plan-CASE TOOLS .

TOTAL :45 PERIODS

TEXT BOOKS:
1. Roger S. Pressman, ―Software Engineering – A Practitioner‟s Approach‖,
Seventh Edition, Mc Graw-Hill International Edition, 2010.
2. Ian Sommerville, ―Software Engineering‖, 9th Edition, Pearson Education
Asia, 2011.

CS8481 DATABASE MANAGEMENT SYSTEMS LABORATORY LTPC

0 042

LIST OF EXPERIMENTS:
 1. Data Definition Commands, Data Manipulation Commands for inserting,
deleting, updating and retrieving Tables and Transaction Control
statements
2. Database Querying – Simple queries, Nested queries, Sub queries and
Joins
3. Views, Sequences, Synonyms
4. Database Programming: Implicit and Explicit Cursors
5. Procedures and Functions
6. Triggers
7. Exception Handling
8. Database Design using ER modeling, normalization and Implementation
for any application
9. Database Connectivity with Front End Tools
10. Case Study using real life database applications
TOTAL: 60 PERIODS

CS8461 OPERATING SYSTEMS LABORATORY LTPC

0 042

LIST OF EXPERIMENTS
1. Basics of UNIX commands
 2. Write programs using the following system calls of UNIX operating system
fork, exec, getpid, exit, wait, close, stat, opendir, readdir
3. Write C programs to simulate UNIX commands like cp, ls, grep, etc.
4. Shell Programming
5. Write C programs to implement the various CPU Scheduling Algorithms
6. Implementation of Semaphores
7. Implementation of Shared memory and IPC
8. Bankers Algorithm for Deadlock Avoidance
9. Implementation of Deadlock Detection Algorithm
10. Write C program to implement Threading & Synchronization Applications
11. Implementation of the following Memory Allocation Methods for fixed partition
a) First Fit b) Worst Fit c) Best Fit
12. Implementation of Paging Technique of Memory Management
13. Implementation of the following Page Replacement Algorithms
a) FIFO b) LRU c) LFU
14. Implementation of the various File Organization Techniques
15. Implementation of the following File Allocation Strategies
a) Sequential b) Indexed c) Linked

TOTAL: 60 PERIODS

HS8461 ADVANCED READING AND WRITING L T P C

0 0 2 1

UNIT I
Reading - Strategies for effective reading-Use glosses and footnotes to aid
reading comprehension- Read and recognize different text types-Predicting
content using photos and title Writing-Plan before writing- Develop a paragraph:
topic sentence, supporting sentences, concluding sentence –Write a descriptive
paragraph

UNIT II
Reading-Read for details-Use of graphic organizers to review and aid
comprehension WritingState reasons and examples to support ideas in writing-
Write a paragraph with reasons and examples- Write an opinion paragraph

UNIT III
Reading- Understanding pronoun reference and use of connectors in a passage-
speed reading techniques-Writing- Elements of a good essay-Types of essays-
descriptive-narrative- issuebased-argumentative-analytical.

UNIT IV
Reading- Genre and Organization of Ideas- Writing- Email writing- visumes –
Job application- project writing-writing convincing proposals.

UNIT V
Reading- Critical reading and thinking- understanding how the text positions the
reader- identify Writing- Statement of Purpose- letter of recommendation- Vision
statement

TOTAL:30 PERIODS

TEXT BOOKS:
1. Gramer F. Margot and Colin S. Ward Reading and Writing (Level 3)
Oxford University Press: Oxford, 2011
2. Debra Daise, CharlNorloff, and Paul Carne Reading and Writing (Level
4) Oxford University Press: Oxford, 2011