COMPUTER SCIENCE ENGINEERING SEMESTER 4 SYLLABUS

COMPUTER SCIENCE ENGINEERING SEMESTER 4 SYLLABUS

SUBJECTS

MA6453 Probability and Queueing Theory
CS6551 Computer Networks
CS6401 Operating Systems
CS6402 Design and Analysis of Algorithms
EC6504 Microprocessor and Microcontroller
CS6403 Software Engineering
CS6411 Networks Laboratory
CS6412 Microprocessor and Microcontroller Laboratory
CS6413 Operating Systems Laboratory

---

---

MA6453 Probability and Queueing Theory

L T P C
3 1 0 4
OBJECTIVE:
To provide the required mathematical support in real life problems and develop probabilistic models which can be used in several areas of science and engineering.

---

UNIT I RANDOM VARIABLES
Discrete and continuous random variables – Moments – Moment generating functions – Binomial, Poisson, Geometric, Uniform, Exponential, Gamma and Normal distributions.

---

UNIT II TWO - DIMENSIONAL RANDOM VARIABLES
Joint distributions – Marginal and conditional distributions – Covariance – Correlation and Linear regression – Transformation of random variables.

---

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

---

UNIT IV QUEUEING MODELS
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
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.
TEXT BOOKS:
1. Ibe. O.C., "Fundamentals of Applied Probability and Random Processes", Elsevier, 1st Indian Reprint, 2007.
2. Gross. D. and Harris. C.M., "Fundamentals of Queueing Theory", Wiley Student edition, 2004.
REFERENCES: 1. Robertazzi, "Computer Networks and Systems: Queueing Theory and performance evaluation", Springer, 3rd Edition, 2006.
2. Taha. H.A., "Operations Research", Pearson Education, Asia, 8th Edition, 2007.
3. Trivedi.K.S., "Probability and Statistics with Reliability, Queueing and Computer Science Applications", John Wiley and Sons, 2nd Edition, 2002.
4. Hwei Hsu, "Schaum’s Outline of Theory and Problems of Probability, Random Variables and Random Processes", Tata McGraw Hill Edition, New Delhi, 2004.
5. Yates. R.D. and Goodman. D. J., "Probability and Stochastic Processes", Wiley India Pvt. Ltd., Bangalore, 2nd Edition, 2012
SUBJECTS

---

---

CS6551 Computer Networks

L T P C
3 0 0 3
OBJECTIVES:
The student should be made to:
Understand the division of network functionalities into layers.
Be familiar with the components required to build different types of networks
Be exposed to the required functionality at each layer
Learn the flow control and congestion control algorithms

---

UNIT I FUNDAMENTALS & LINK LAYER
Building a network – Requirements - Layering and protocols - Internet Architecture – Network software – Performance ; Link layer Services - Framing - Error Detection - Flow control

---

UNIT II MEDIA ACCESS & INTERNETWORKING
Media access control - Ethernet (802.3) - Wireless LANs – 802.11 – Bluetooth - Switching and bridging – Basic Internetworking (IP, CIDR, ARP, DHCP,ICMP )

---

UNIT III ROUTING
Routing (RIP, OSPF, metrics) – Switch basics – Global Internet (Areas, BGP, IPv6), Multicast – addresses – multicast routing (DVMRP, PIM)

---

UNIT IV TRANSPORT LAYER
Overview of Transport layer - UDP - Reliable byte stream (TCP) - Connection management - Flow control - Retransmission – TCP Congestion control - Congestion avoidance (DECbit, RED) – QoS – Application requirements

---

UNIT V APPLICATION LAYER
Traditional applications -Electronic Mail (SMTP, POP3, IMAP, MIME) – HTTP – Web Services – DNS - SNMP
TEXT BOOK:

1. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”, Fifth Edition, Morgan Kaufmann Publishers, 2011. REFERENCES:
1. James F. Kurose, Keith W. Ross, “Computer Networking - A Top-Down Approach Featuring the Internet”, Fifth Edition, Pearson Education, 2009.
2. Nader. F. Mir, “Computer and Communication Networks”, Pearson Prentice Hall Publishers, 2010.
3. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, Mc Graw Hill Publisher, 2011.
4. Behrouz A. Forouzan, “Data communication and Networking”, Fourth Edition, Tata McGraw – Hill, 2011.
SUBJECTS

---

---

CS6401 Operating Systems

L T P C
3 0 0 3
OBJECTIVES:
The student should be made to:

Study the basic concepts and functions of operating systems.
Understand the structure and functions of OS.
Learn about Processes, Threads and Scheduling algorithms.
Understand the principles of concurrency and Deadlocks.
Learn various memory management schemes.
Study I/O management and File systems.
Learn the basics of Linux system and perform administrative tasks on Linux Servers.

---

UNIT I OPERATING SYSTEMS OVERVIEW
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
Processes-Process Concept, Process Scheduling, Operations on Processes, Interprocess Communication; Threads- Overview, Multicore Programming, Multithreading Models; Windows 7 - Thread and SMP Management. Process Synchronization - Critical Section Problem, Mutex Locks, Semophores, Monitors; CPU Scheduling and Deadlocks.

---

UNIT III STORAGE MANAGEMENT
Main Memory-Contiguous Memory Allocation, Segmentation, Paging, 32 and 64 bit architecture Examples; Virtual Memory- Demand Paging, Page Replacement, Allocation, Thrashing; Allocating Kernel Memory, OS Examples.

---

UNIT IV I/O SYSTEMS
Mass Storage Structure- Overview, Disk Scheduling and Management; File System Storage-File Concepts, Directory and Disk Structure, Sharing and Protection; File System Implementation- File System Structure, Directory Structure, Allocation Methods, Free Space Management, I/O Systems.

---

UNIT V CASE STUDY
Linux System- Basic Concepts;System Administration-Requirements for Linux System Administrator, Setting up a LINUX Multifunction Server, Domain Name System, Setting Up Local Network Services; Virtualization- Basic Concepts, Setting Up Xen,VMware on Linux Host and Adding Guest OS.
TEXT BOOK:
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, 9th Edition, John Wiley and Sons Inc., 2012.
REFERENCES:
1. William Stallings, “Operating Systems – Internals and Design Principles”, 7th Edition, Prentice Hall, 2011.
2. Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Addison Wesley, 2001.
3. Charles Crowley, “Operating Systems: A Design-Oriented Approach”, Tata McGraw Hill Education”, 1996.
4. D M Dhamdhere, “Operating Systems: A Concept-Based Approach”, Second Edition, Tata McGraw-Hill Education, 2007.
5. http://nptel.ac.in/.
SUBJECTS

---

---

CS6402 Design and Analysis of Algorithms

L T P C
3 0 0 3
OBJECTIVES:
The student should be made to:
Learn the algorithm analysis techniques.
Become familiar with the different algorithm design techniques.
Understand the limitations of Algorithm power.

---

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

---

UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER
Brute Force - Closest-Pair and Convex-Hull Problems-Exhaustive Search - Traveling Salesman Problem - Knapsack Problem - Assignment problem.
Divide and conquer methodology – Merge sort – Quick sort – Binary search – Multiplication of Large Integers – Strassen’s Matrix Multiplication-Closest-Pair and Convex-Hull Problems.

---

UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE
Computing a Binomial Coefficient – Warshall’s and Floyd’ algorithm – Optimal Binary Search Trees – Knapsack Problem and Memory functions. Greedy Technique– Prim’s algorithm- Kruskal's Algorithm- Dijkstra's Algorithm-Huffman Trees.

---

UNIT IV ITERATIVE IMPROVEMENT
The Simplex Method-The Maximum-Flow Problem – Maximm Matching in Bipartite Graphs- The Stable marriage Problem.

---

UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER
Limitations of Algorithm Power-Lower-Bound Arguments-Decision Trees-P, NP and NP-Complete Problems--Coping with the Limitations - Backtracking – n-Queens problem – Hamiltonian Circuit Problem – Subset Sum Problem-Branch and Bound – Assignment problem – Knapsack Problem – Traveling Salesman Problem- Approximation Algorithms for NP – Hard Problems – Traveling Salesman problem – Knapsack problem.
TEXT BOOK:
1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third Edition, Pearson Education, 2012.
REFERENCES:
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. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson Education, 2009.
Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer, 2008.
4. http://nptel.ac.in/
SUBJECTS

---

---

EC6504 Microprocessor and Microcontroller

L T P C
3 0 0 3
OBJECTIVES:
The student should be made to:
Study the Architecture of 8086 microprocessor.
Learn the design aspects of I/O and Memory Interfacing circuits.
Study about communication and bus interfacing.
Study the Architecture of 8051 microcontroller.

---

UNIT I THE 8086 MICROPROCESSOR
Introduction to 8086 – Microprocessor architecture – Addressing modes - Instruction set and assembler directives – Assembly language programming – Modular Programming - Linking and Relocation - Stacks - Procedures – Macros – Interrupts and interrupt service routines – Byte and String Manipulation.

---

UNIT II 8086 SYSTEM BUS STRUCTURE
8086 signals – Basic configurations – System bus timing –System design using 8086 – IO programming – Introduction to Multiprogramming – System Bus Structure - Multiprocessor configurations – Coprocessor, Closely coupled and loosely Coupled configurations – Introduction to advanced processors.

---

UNIT III I/O INTERFACING
Memory Interfacing and I/O interfacing - Parallel communication interface – Serial communication interface – D/A and A/D Interface - Timer – Keyboard /display controller – Interrupt controller – DMA controller – Programming and applications Case studies: Traffic Light control, LED display , LCD display, Keyboard display interface and Alarm Controller.

---

UNIT IV MICROCONTROLLER
Architecture of 8051 – Special Function Registers(SFRs) - I/O Pins Ports and Circuits - Instruction set - Addressing modes - Assembly language programming.

---

UNIT V INTERFACING MICROCONTROLLER
Programming 8051 Timers - Serial Port Programming - Interrupts Programming – LCD & Keyboard Interfacing - ADC, DAC & Sensor Interfacing - External Memory Interface- Stepper Motor and Waveform generation.
TEXT BOOKS:
1. Yu-Cheng Liu, Glenn A.Gibson, “Microcomputer Systems: The 8086 / 8088 Family - Architecture, Programming and Design”, Second Edition, Prentice Hall of India, 2007.
2. Mohamed Ali Mazidi, Janice Gillispie Mazidi, Rolin McKinlay, “The 8051 Microcontroller and Embedded Systems: Using Assembly and C”, Second Edition, Pearson Education, 2011
REFERENCE:
1. Doughlas V.Hall, “Microprocessors and Interfacing, Programming and Hardware:,TMH, 2012
SUBJECTS

---

---

CS6403 Software Engineering

L T P C
3 0 0 3
OBJECTIVES:
The student should be made to:
Understand the phases in a software project
Understand fundamental concepts of requirements engineering and Analysis Modelling.
Understand the major considerations for enterprise integration and deployment.
Learn various testing and maintenance measures

---

UNIT I SOFTWARE PROCESS AND PROJECT MANAGEMENT
Introduction to Software Engineering, Software Process, Perspective and Specialized Process Models – Software Project Management: Estimation – LOC and FP Based Estimation, COCOMO Model – Project Scheduling – Scheduling, Earned Value Analysis - Risk Management.

---

UNIT II REQUIREMENTS ANALYSIS AND SPECIFICATION
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 management-Classical analysis: Structured system Analysis, Petri Nets- Data Dictionary.

---

UNIT III SOFTWARE DESIGN
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 IMPLEMENTATION
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.

---

UNIT V PROJECT MANAGEMENT Estimation – FP Based, LOC Based, Make/Buy Decision, COCOMO II - Planning – Project Plan, Planning Process, RFP Risk Management – Identification, Projection, RMMM - Scheduling and Tracking –Relationship between people and effort, Task Set & Network, Scheduling, EVA - Process and Project Metrics.
TEXT BOOK:
1. Roger S. Pressman, “Software Engineering – A Practitioner’s Approach”, Seventh Edition, Mc Graw-Hill International Edition, 2010.
REFERENCES:
1. Ian Sommerville, “Software Engineering”, 9th Edition, Pearson Education Asia, 2011. 2. Rajib Mall, “Fundamentals of Software Engineering”, Third Edition, PHI Learning Private Limited ,2009.
3. Pankaj Jalote, “Software Engineering, A Precise Approach”, Wiley India, 2010.
4. Kelkar S.A., “Software Engineering”, Prentice Hall of India Pvt Ltd, 2007.
5. Stephen R.Schach, “Software Engineering”, Tata McGraw-Hill Publishing Company Limited, 2007.
6. http://nptel.ac.in/.
SUBJECTS

---

---

CS6411 Networks Laboratory

L T P C
0 0 3 2
OBJECTIVES:
The student should be made to:
Learn socket programming.
Be familiar with simulation tools.
Have hands on experience on various networking protocols.
LIST OF EXPERIMENTS:
1. Implementation of Stop and Wait Protocol and Sliding Window Protocol.
2. Study of Socket Programming and Client – Server model
3. Write a code simulating ARP /RARP protocols.
4. Write a code simulating PING and TRACEROUTE commands
5. Create a socket for HTTP for web page upload and download.
6. Write a program to implement RPC (Remote Procedure Call)
7. Implementation of Subnetting .
8. Applications using TCP Sockets like
a. Echo client and echo server
b. Chat
c. File Transfer
9. Applications using TCP and UDP Sockets like
d. DNS
e. SNMP
f. File Transfer
10. Study of Network simulator (NS).and Simulation of Congestion Control Algorithms using NS
11. Perform a case study about the different routing algorithms to select the network path with its optimum and economical during data transfer.
i. Link State routing
ii. Flooding
iii. Distance vector
SUBJECTS

---

---

CS6412 Microprocessor and Microcontroller Laboratory

L T P C
0 0 3 2
OBJECTIVES:
The student should be made to:
Introduce ALP concepts and features
Write ALP for arithmetic and logical operations in 8086 and 8051
Differentiate Serial and Parallel Interface
Interface different I/Os with Microprocessors
Be familiar with MASM
LIST OF EXPERIMENTS:
8086 Programs using kits and MASM
1. Basic arithmetic and Logical operations
2. Move a data block without overlap
3. Code conversion, decimal arithmetic and Matrix operations.
4. Floating point operations, string manipulations, sorting and searching
5. Password checking, Print RAM size and system date
6. Counters and Time Delay
Peripherals and Interfacing Experiments
7. Traffic light control
8. Stepper motor control
9. Digital clock
10. Key board and Display
11. Printer status
12. Serial interface and Parallel interface
13. A/D and D/A interface and Waveform Generation
8051 Experiments using kits and MASM
14. Basic arithmetic and Logical operations
15. Square and Cube program, Find 2’s complement of a number
16. Unpacked BCD to ASCII
SUBJECTS

---

---

CS6413 Operating Systems Laboratory

L T P C
0 0 3 2
OBJECTIVES:
The student should be made to:
Learn shell programming and the use of filters in the UNIX environment.
Be exposed to programming in C using system calls.
Learn to use the file system related system calls.
Be exposed to process creation and inter process communication.
Be familiar with implementation of CPU Scheduling Algorithms, page replacement algorithms and Deadlock avoidance
LIST OF EXPERIMENTS:
1. Basics of UNIX commands.
2. Shell Programming.
3. Implement the following CPU scheduling algorithms
a) Round Robin b) SJF c) FCFS d) Priority
4. Implement all file allocation strategies
a) Sequential b) Indexed c) Linked
5. Implement Semaphores
6. Implement all File Organization Techniques
a) Single level directory b) Two level c) Hierarchical d) DAG
7. Implement Bankers Algorithm for Dead Lock Avoidance
8. Implement an Algorithm for Dead Lock Detection
9. Implement e all page replacement algorithms
a) FIFO b) LRU c) LFU
10. Implement Shared memory and IPC
11. Implement Paging Technique of memory management.
12. Implement Threading & Synchronization Applications
SUBJECTS