CS6403 SOFTWARE ENGINEERING | syllabus

                                         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.

                                                                                                                           TOTAL: 45 PERIODS
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.

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

Click here to download full syllabus                              AULibrary.com

Read More

CS6411 NETWORKS LABORATORY | syllabus

                                       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

                                                                                                                           TOTAL: 45 PERIODS
REFERENCE:

spoken-tutorial.org.

OUTCOMES:

At the end of the course, the student should be able to
 Use simulation tools
 Implement the various protocols.
 Analyse the performance of the protocols in different layers.
 Analyze various routing algorithms

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS

SOFTWARE:

 C / C++ / Java / Equivalent Compiler 30
 Network simulator like NS2/Glomosim/OPNET/
Equivalent

HARDWARE:

Standalone desktops 30 Nos

Click here to download full syllabus                              AULibrary.com

Read More

CS6413 OPERATING SYSTEMS LABORATORY | syllabus

 

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

                                                                                                                            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

REFERENCE:

spoken-tutorial.org

LIST OF 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

Click here to download full syllabus                              AULibrary.com

Read More

CS6412 MICROPROCESSOR AND MICROCONTROLLER LABORATORY | syllabus

   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

                                                                                                                          TOTAL: 45 PERIODS
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

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

Click here to download full syllabus                              AULibrary.com

Read More