IT6413 SOFTWARE ENGINEERING LABORATORY Syllabus Semester IV IT BTECH Anna University-Regulation-2013

IT6413                                  SOFTWARE ENGINEERING LABORATORY                               L T  P  C
0 0 3  2
OBJECTIVES:

• To understand the software engineering methodologies for project development.
• To gain knowledge about open source tools for Computer Aided Software Engineering.
• To develop an efficient software using case tools.

SOFTWARE REQUIRED:
Open source Tools: StarUML / UMLGraph / Topcased
Prepare the following documents for each experiment and develop the software using software engineering methodology.

1. Problem  Analysis   and   Project   Planning   -Thorough   study   of   the   problem   –

Identify Project scope, Objectives and Infrastructure.

2. Software Requirement Analysis - Describe the individual Phases/modules of the project and

Identify deliverables.

3. Data Modelling -  Use work  products  – data dictionary,  use  case  diagrams  and  activity diagrams, build and test  class diagrams, sequence  diagrams  and  add  interface to  class diagrams.

4. Software Development and Debugging – implement the design by coding
5. Software Testing - Prepare test plan, perform validation testing, coverage analysis, memory leaks, develop test case hierarchy, Site check and site monitor.

Sample Experiments: Academic domain

1. Course Registration System
2. Student marks analysing system

Railway domain

3. Online ticket reservation system
4. Platform assignment system for the trains in a railway station

Medicine domain

5. Expert system to prescribe the medicines for the given symptoms
6. Remote computer monitoring

Finance domain

7. ATM system
8. Stock maintenance

Human Resource management

9. Quiz System
10. E-mail Client system.

TOTAL: 45 PERIODS

OUTCOMES:
Upon Completion of the course, the students should be able to:

• Use open source case tools to develop software.
• Analyze and design software requirements in efficient manner.

LAB EQUIPMENT  FOR A BATCH OF 30 STUDENTS: SOFTWARE:
Argo UML / StarUML / UMLGraph / Topcased or Equivalent.

HARDWARE:
Standalone desktops                         30 Nos



#################################################################################################

IT6412 OPERATING SYSTEMS LABORATORY Syllabus Semester IV IT BTECH Anna University-Regulation-2013

IT6412                                   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
5. a) Sequential b) Indexed c) Linked
6. Implement Semaphores
7. Implement all File Organization Techniques
8. a) Single level directory b) Two level c) Hierarchical d) DAG
9. Implement Bankers Algorithm for Dead Lock Avoidance
10. Implement an Algorithm for Dead Lock Detection
11. Implement e all page replacement algorithms a) FIFO b) LRU c) LFU
12. Implement Shared memory and IPC
13. Implement Paging Technique of memory management.
14. Implement Threading & Synchronization Applications

REFERENCE:
spoken-tutorial.org


TOTAL: 45 PERIODS


OUTCOMES:
At the end of the course, the student should be able to

• Implement deadlock avoidance, and Detection Algorithms
• Compare the performance of  various CPU Scheduling Algorithm
• Critically analyze the performance of the various page replacement algorithms
• Create processes and implement IPC

LAB EQUIPMENT  FOR A BATCH OF 30 STUDENTS:
Standalone desktops with C / C++ / Java / Equivalent  complier    30 Nos. (or)
Server with C / C++ / Java / Equivalent  complier supporting 30 terminals or more.


#################################################################################################

IT6411 MICROPROCESSOR AND MICROCONTROLLER LABORATORY Syllabus Semester IV IT BTECH Anna University-Regulation-2013

IT6411                  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

OUTCOMES:
At the end of the course, the student should be able to:

• Write ALP Programmes for fixed and Floating Point and Arithmetic
• Interface different I/Os with processor
• Generate waveforms using Microprocessors
• Execute Programs in 8051
• Explain the difference between simulator and Emulator

TOTAL: 45 PERIODS

LAB EQUIPMENT  FOR A BATCH OF 30 STUDENTS: HARDWARE:
8086 development kits                      - 30 nos Interfacing Units                                - Each 10 nos Microcontroller                                   - 30 nos

SOFTWARE:
Intel Desktop Systems with  MASM   - 30 nos
8086 Assembler
8051 Cross Assembler


#################################################################################################

CS6403 SOFTWARE ENGINEERING Syllabus Semester IV IT BTECH Anna University-Regulation-2013

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                                             9
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                                                     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 management-Classical 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 IMPLEMENTATION                                                                                 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.

UNIT V        PROJECT MANAGEMENT                                                                                               9
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.


OUTCOMES:
At the end of the course, the student should be able to

• Identify the key activities in managing a software project.
• Compare different process models.
• Concepts of requirements engineering and Analysis Modeling.
• Apply systematic procedure for software design and deployment.
• Compare and contrast the various testing and maintenance

TOTAL: 45 PERIODS


TEXT BOOKS:

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/.

#################################################################################################

CS6401 OPERATING SYSTEMS Syllabus Semester IV IT BTECH Anna University-Regulation-2013

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                                                                                  9
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                                                                                                 9
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                                                                                               9
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                                                                                                                    9
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                                                                                                                    9
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.


OUTCOMES:
At the end of the course, the student should be able to:

• Design various Scheduling algorithms.
• Apply the principles of concurrency.
• Design deadlock, prevention and avoidance algorithms.
• Compare and contrast various memory management schemes.
• Design and Implement a prototype file systems.
• Perform administrative tasks on Linux Servers.

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.

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/.

#################################################################################################

CS6402 DESIGN AND ANALYSIS OF ALGORITHMS Syllabus Semester IV IT BTECH Anna University-Regulation-2013

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                                                                                                                 9
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                                                               9
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                                             9
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                                                                                             9
The Simplex MeFthod-The Maximum-Flow Problem – Maximm Matching in Bipartite Graphs- The
Stable marriage Problem.

UNIT V      COPING WITH THE LIMITATIONS OF ALGORITHM POWER                                         9
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.


OUTCOMES:
At the end of the course, the student should be able to:

• Design algorithms for various computing problems.
• Analyze the time and space complexity of algorithms.

TOTAL: 45 PERIODS

• Critically analyze the different algorithm design techniques for a given problem.
• Modify existing algorithms to improve efficiency.

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/

#################################################################################################

EC6504 MICROPROCESSOR AND MICROCONTROLLER Syllabus Semester IV IT BTECH Anna University-Regulation-2013

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                                                                                      9
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                                                                                   9
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                                                                                                            9
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                                                                                                     9
Architecture of 8051 – Special Function Registers(SFRs) - I/O Pins Ports and Circuits -  Instruction set - Addressing modes - Assembly language programming.

UNIT V       INTERFACING MICROCONTROLLER                                                                             9
Programming 8051 Timers - Serial Port Programming - Interrupts Programming – LCD & Keyboard Interfacing  - ADC, DAC & Sensor Interfacing  - External Memory Interface- Stepper Motor and Waveform generation.


OUTCOMES:
At the end of the course, the student should be able to:

• Design and implement programs on 8086 microprocessor.
• Design I/O circuits.
• Design Memory Interfacing circuits.
• Design and implement 8051 microcontroller based systems.

TEXT BOOKS:

TOTAL: 45 PERIODS

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

#################################################################################################

MA6453 PROBABILITY AND QUEUEING THEORY Syllabus Semester IV IT BTECH Anna University-Regulation-2013

MA6453                                PROBABILITY AND QUEUEING THEORY                               L  T  P  C
3   1 0 4
OBJECTIVES:
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                                                                                                  9+3
Discrete and continuous random variables – Moments – Moment generating functions – Binomial, Poisson, Geometric, Uniform, Exponential, Gamma and Normal distributions.

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

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

UNIT IV       QUEUEING MODELS                                                                                                    9+3
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                                                                              9+3
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.


OUTCOMES:

TOTAL (L:45+T:15): 60 PERIODS

• The students will have a fundamental knowledge of the probability concepts.
• Acquire skills in analyzing queueing models.
• It also helps to understand and characterize phenomenon which evolve with respect to time in a probabilistic manner.

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", ,

3rd Edition, Springer, 2006.

2. Taha. H.A., "Operations Research", 8th Edition,  Pearson Education, Asia, 2007.
3. Trivedi.K.S.,  "Probability  and  Statistics  with  Reliability,  Queueing  and  Computer  Science

Applications", 2nd Edition, John Wiley and Sons, 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", 2nd Edition, Wiley India

Pvt. Ltd., Bangalore, 2012.



#################################################################################################