KTU S6 Sylabus
KTU S6 Sylabus
KTU S6 Sylabus
Syllabus
Introduction to software engineering- Phases in Software development. Process models- prescriptive
process models- Specialised process models- The unified process- Agile development- Agile
development models. Project management concepts. Process and project metrics- Estimation for
software projects- Software project estimation, decomposition techniques. Empirical estimation
models- Task set- Scheduling. Risk management- The RMMM Plan. Software Configuration
Management - The SCM Repository - The SCM Process. Software quality assurance- Formal
Approaches to SQA. Statistical Software Quality Assurance- Six Sigma for Software Engineering.
Software Reliability. The ISO 9000 Quality Standards. The SQA Plan. Software process
improvement- The CMMI, SPI Return on Investment. SPI trends.
Expected Outcome
After the successful completion of the course students will be able to
i. Identify the theoretical and methodological issues involved in modern software
engineering project management
ii. Develop the transferable skills in logical analysis, communication and project
management necessary for working within a team.
iii. Translate a specification to a design, and identify the components to build the
architecture for a given problem, using an appropriate software engineering
methodology.
iv. Select and use project management frameworks that ensure successful outcomes.
v. Develop software projects based on current technologies, by managing resources
economically and keeping ethical values.
References
1. Roger S. Pressman, Software Engineering, 8/e, McGraw Hill, 2014.
2. Ian Sommervile, Software Engineering, 7/e, University of Lancastor, Pearson
Education, 2004.
3. Bob Huges, Mike Cotterell, Rajib Mall, Software Project Management, 8/e, McGraw Hill,
2015.
4. Walker Royce, Software Project Management : A Unified Frame Work, Pearson
Education.
Course Plan
Sem.
Module Contents Hours Exam
Marks
Introduction to software engineering- scope of software
I engineering, historical aspects, economic aspects, maintenance 3 15%
aspects, specification and design aspects, team programming
aspects. Layered technology, processes, methods and tools.
Part A shall consist of three questions of 15 marks each uniformly covering Modules I and
II. The student has to answer any two questions (15×2=30 marks).
Part B shall consist of three questions of 15 marks each uniformly covering Modules III and
IV. The student has to answer any two questions (15×2=30 marks).
Part C shall consist of three questions of 20 marks each uniformly covering Modules V and
VI. The student has to answer any two questions (20×2=40 marks).
INTERNETWORKING BASICS
1. Familiarization of Internetworking - Network Cables- Colour coding - Crimping.
Internetworking Operating Systems- Configurations.
IP ROUTING
2. Implementing static routing.
3. Implementing dynamic routing using RIP.
4. Implementing dynamic routing using OSPF.
5. Implementing dynamic routing using EIGRP.
SWITCHING SERVICES
VIRTUAL LANS
6. Layer 2 Switching configuration -VLAN configuration.
7. VTP Configuration, VTP pruning.
8. Implement inter-VLAN routing.
SECURITY
9. Access Control List
a. Standard Access Lists.
b. Extended Access Lists.
MANAGING A INTERNETWORK
10. Backup and restoring IOS.
11. Familiarization of network simulators.
Part A: 4 questions uniformly covering modules I and II. Each question carries 10 marks
Students will have to answer any three questions out of 4 (3X10 marks =30 marks)
Part B : 4 questions uniformly covering modules III and IV. Each question carries 10 marks
Students will have to answer any three questions out of 4 (3X10 marks =30 marks)
Part C: 6 questions uniformly covering modules V and VI. Each question carries 10 marks
Students will have to answer any four questions out of 6 (4X10 marks =40 marks)
Note: In all parts, each question can have a maximum of four sub questions, if needed.
Course Objectives:
• To understand the concepts that underlie distributed computing systems along with design and
implementation issues.
• To study the key mechanisms and models for distributed systems.
Syllabus
Introduction to distributed systems, inter process communication, distributed files systems, Name
service, Time and global states, election algorithms, distributed files systems and case study.
Expected Outcome:
The students will
i. gain a clear understanding of the concepts that underlie distributed computing systems along
with design and implementation issues.
ii. use key mechanisms and models for distributed systems including logical clocks, causality,
vector timestamps, and election algorithms.
Text Books:
1. George Coulouris, Jean Dollimore, Tim Kindberg, “Distributed Systems: Concepts and
Design”, Pearson 2009, 4th Edition.
References:
1. Andrew S Tanenbaum and Marteen Van Steen, “Distributed Systems Principles and
Paradigms”, Pearson Education / Prentice Hall of India , New Delhi, 2002.
2. Pradeep K Sinha, “Distributed Operating Systems: Concepts and Design”, Prentice Hall of
India, New Delhi, 2004.
3. Mukesh Singhal, Niranjan G Shivarathri, “Advanced Concepts in Operating systems”, Tata Mc
Graw Hill Ltd.
4. Tanenbaum A S, “ Modern Operating System”, 3/e, PHI
Course Plan
Sem.
Module Contents Hours Exam
Marks
Characterization of Distributed Systems-Introduction-Examples-
Resource Sharing and the Web-Challenges. System Models-
Architectural-Fundamental. Inter process Communication-
I 7 15%
Introduction-API for Internet protocols-External data representation
and marshalling--Client-server communication-Group communication-
Case study: Inter process Communication in UNIX.
Text Book:
1. Jaiwei Han, Micheline Kamber, “Data Mining Concepts and Techniques”, Elsevier, 2006.
2. M. Sudeep Elayidom, “Data Mining and Warehousing”, 1st Edition, 2015 Cengage Learning India
Pvt. Ltd.
References:
1. Pang-Ning Tan, Michael Steinbach, “Introduction to Data Mining”, Addison Wesley, 2006.
2. Dunham M H, “Data Mining: Introductory and Advanced Topics”, Pearson Education, New Delhi,
2003.
3. Mehmed Kantardzic, “Data Mining Concepts, Methods and Algorithms”, John Wiley and Sons,
USA, 2003.
Course Plan
Sem. Exam
Module Contents Hours
Marks
Data Mining: Concepts: Concepts, Data Mining Applications, Data
Mining Stages, Data Mining Models, Data Warehousing and OLAP,
Need for Data Warehousing, Challenges, Application of Data
I 8 15%
Mining Principles, Machine Learning and Statistics, Ethics of Data
Mining, Popular Tools.
OLTP Vs DWH, Applications of DWH
Data Preprocessing: Data Preprocessing Concepts, Data Cleaning,
Handling Missing Data, Data Transformation and Discretization,
II 6 15%
Data Visualization. UCI Data Sets and Their Significance
Part A shall consist of three questions of 15 marks each uniformly covering Modules I and
II. The student has to answer any two questions (15×2=30 marks).
Part B shall consist of three questions of 15 marks each uniformly covering Modules III and
IV. The student has to answer any two questions (15×2=30 marks).
Part C shall consist of three questions of 20 marks each uniformly covering Modules V and
VI. The student has to answer any two questions (20×2=40 marks).
Expected Outcomes
After the course the students would be able to
i. analyze and apply the role of languages like HTML, CSS, XML, Javascript, PHP
and the workings of the web and web applications
ii. analyze a web project and identify its elements and attributes in comparison to
traditional projects.
iii. analyze and create web pages using HTML, and Cascading Styles sheets.
iv. analyze and build dynamic web pages using JavaScript (client side programming).
v. analyze and create XML documents and XML Schema.
vi. analyze and build interactive web applications using PHP
TEXT BOOK
1. Paul J. Deitel, Harvey M. Deitel, Abbey Deitel, “Internet and World Wide Web How To
Program”, 5/E, Pearson Education, 2012.
REFERENCES
1. Robert W. Sebesta, “Programming the World Wide Web”, 8/E, Pearson Education, 2012.
2. Chris Bates, “Web Programming – Building Intranet applications”, Wiley Publications,
3rd Edition, 2009.
3. Jonathan Chaffer, Karl Swedberg, “Learning jQuery: Better interaction Design and Web
Development with Simple JavaScript Techniques”, PACKT publishing, 2007
4. www.w3schools.com
Part A shall consist of three questions of 15 marks each uniformly covering Modules I and
II. The student has to answer any two questions (15×2=30 marks).
Part B shall consist of three questions of 15 marks each uniformly covering Modules III and
IV. The student has to answer any two questions (15×2=30 marks).
Part C shall consist of three questions of 20 marks each uniformly covering Modules V and
VI. The student has to answer any two questions (20×2=40 marks).