Wednesday, 24 February 2021

Software Engineering - Syllabus, Model Paper and Important Questions

Syllabus Paper : Software Engineering

Course Objectives

The Objective of the course is to assist the student in understanding the basic theory of software engineering, and to apply these basic theoretical principles to a group software development project.

Course outcomes

1. Ability to gather and specify requirements of the software projects.

2. Ability to analyze software requirements with existing tools

3. Able to differentiate different testing methodologies

4. Able to understand and apply the basic project management practices in real life projects

5. Ability to work in a team as well as independently on software projects

UNIT I

INTRODUCTION: Software Engineering Process paradigms - Project management - Process and Project Metrics – software estimation - Empirical estimation models - Planning - Risk analysis - Software project scheduling.

UNIT II

REQUIREMENTS ANALYSIS : Requirement Engineering Processes – Feasibility Study – Problem of Requirements – Software Requirement Analysis – Analysis Concepts and Principles – Analysis Process – Analysis Model

UNIT III

SOFTWARE DESIGN: Software design - Abstraction - Modularity - Software Architecture - Effective modular design - Cohesion and Coupling - Architectural design and Procedural design - Data flow oriented design.

UNIT IV

USER INTERFACE DESIGN AND REAL TIME SYSTEMS :User interface design - Human factors - Human computer interaction - Human - Computer Interface design - Interface design - Interface standards.

UNIT V

SOFTWARE QUALITY AND TESTING :Software Quality Assurance - Quality metrics - Software Reliability - Software testing - Path testing – Control Structures testing - Black Box testing - Integration, Validation and system testing - Reverse Engineering and Re-engineering.

CASE tools –projects management, tools - analysis and design tools – programming tools - integration and testing tool - Case studies.

REFERENCE BOOKS:

1. Roger Pressman S., “Software Engineering: A Practitioner's Approach”, 7th

Edition, McGraw Hill, 2010.

2. Software Engineering Principles and Practice by Deepak Jain Oxford University Press

2. Sommerville, “Software Engineering”, Eighth Edition, Pearson Education, 2007

3. Pfleeger, “Software Engineering: Theory & Practice”, 3rd Edition, Pearson

Education, 2009

4. Carlo Ghazi, Mehdi Jazayari, Dino Mandrioli, “Fundamentals of Software

Engineering”, Pearson Education, 2003

Model Question Paper – SOFTWARE ENGINEERING

Section – A

Answer the following 4 questions. Each question carries 10 marks. 4 X 10= 40M

1. (a) Define software engineering and Give a generic view of Software Engineering.

(b) Explain in detail about COCOMO model.

2. (a) Explain in detail Software Requirement Specifications.

Or

(b) Explain the ways and means for collecting the software requirements and how

are they organized and represented?

3(a) Explain in detail about capability maturity model.

(b) Explain in detail the different types of coupling.

4. (a)What is reengineering? Explain in detail.

Or

(b)What is testing? Explain the different levels of testing.

Section – B

Answer any five questions. Each carry 3 marks 5 X 3 = 15 M

5. Write short note on effort estimation techniques.

6. Explain briefly requirements elicitation.

7. What are differences between verification and validation?

8. Write short note on modular design.

9. What are software metrics and measurements?

10. What is software? What are the development lifecycle phases?

11. Write a short note on DFD.

12. What are the risks in software management?

Section – C

Answer all Questions 10 X 2 = 20M

13. What is meant by function point?

14 What is the use of RMMM model?

15. What is the role of an SQA group?

16. Difference between CPM and PERT.

17. What are the phases involved in software life cycle.

18. What is meant by cohesion?

19. What are real time systems?

20. What is integration testing?

21. List out various design concepts.

22. What is the use of organizational Chart?

Important Questions for PAPER – SOFTWARE ENGINEERING

Unit –1

INTRODUCTION:

Essay Questions

1) Define software engineering and Give a generic view of Software Engineering.

2) Define software and explain in detail software evolution.

3) Explain in detail project management.

4) Explain in detail SDLC.

5) Explain in detail CPM with an example.

6) Explain in detail PERT with an example.

7) Describe in detail RAD model.

8) Explain in detail about COCOMO model.

9) Explain in detail process and project metrics.

10) Define software estimation and explain function point method.

Short Questions.

1) Write a short note on history of software engineering.

2) How to use software paradigms in organizing the projects?

3) Write a short note on software applications.

4) Write a short note on scope of project management.

5) Differences between CPM and PERT

6) What are the different phases in waterfall model?

7) Discuss WBS and explain the rules of it.

8) What are the different steps involved in Delphi method?

9) Write a short note on risk analysis?

10) Difference between Verification and Validation?

Very Short Questions.

1) What are the challenges in software engineering?

2) What is the Role of metrics in software development?

3) What is the Role of measurements in software development?

4) What is meant by Risks in a project?

5) Difference between measure and metric?

6) Difference between transactional functions and data functions?

Unit –2

REQUIREMENTS ANALYSIS:

Essay Questions

1) What are the different activities involved in requirement engineering process?

2) Explain in detail Software Requirement Specifications

3) Explain in detail requirements elicitation for software.

4) Explain the horizontal and vertical partitioning of safehome software

5) Define data and explain in detail data dictionary

Short Questions.

1) Write a short note on feasibility study?

2) What are the characteristics of good SRS document?

3) Write a short note on requirements analysis?

4) Write a short note on quality function deployment?

5) Write a short note on information domain?

Very Short Questions.

1) Define modelling?

2) Define SRS?

3) Define information?

4) What are the uses of requirement analysis?

5) What are the uses of documentation?

Unit –3

SOFTWARE DESIGN:

Essay Questions

1) Explain different levels used in software design.

2) Discuss various techniques used in modular design

3) Explain in detail the different types of coupling.

4) Explain in detail the different types of cohesion

5) what are the symbols used in drawing a DFD and explain the different types of DFD’S

Short Questions.

1) Write a short note on level 0 DFD?

2) Write a short note on software architecture?

3) Write a short note on organisation and refinement?

4) Explain modularity

5) Explain cohesion and coupling.

Very Short Questions.

1) What are the advantages of DFD

2) Define data coupling.

3) Define logical cohesion

4) Define functional cohesion

5) What is abstraction?

Unit –4

USER INTERFACE DESIGN AND REAL TIME SYSTEMS:

Essay Questions

1) What is user interface design what are the rules to be followed while designing user interface?

2) Explain in detail user interface design process

3) Explain the important aspects of human computer interaction

4) Explain the human factors in user interface design

5) What is real time system what are its characteristics

6) Explain various real time system applications in detail.

Short Questions.

1) Explain the steps in the user interface design

2) What is the user interface design pattern list the various interface design patterns

3) Explain various design issues in user interface design

4) What is user interface design evaluation how is it done explain

5) Differences between hard and soft real time systems.

Very Short Questions.

1) What is interface analysis?

2) Write the guidelines for Menu selection.

3) Mention the potential disadvantages of reading from displays.

4) What is dialog box trees?

5) Distinguish between keyboards and keypads

Unit –5

SOFTWARE QUALITY AND TESTING:

Essay Questions

1) Explain various activities in software quality assurance.

2) Define testing and explain the different types of software testing

3) Explain in detail about capability maturity model.

4) Explain in detail derived test cases

5) Explain in detail black box testing.

6) Explain in detail integration testing.

7) Explain in detail system testing.

8) How to reverse engineering to understand data and processing?

9) Explain in detail validation testing.

Short Questions.

1) Define software reliability and explain any 2 basic reliability metrics.

2) Write short notes on flow graph notation?

3) Explain in detail graph matrices

4) Write short on condition testing?

5) Write short on data flow testing?

6) Write short note on alpha and beta testing?

7) What Is the Difference Between Reverse Engineering and Re-Engineering?

Very Short Questions.

1) What is meant by SQA?

2) What are the goals of software testing?

3) What is CASE?

4) What are the Reasons for using CASE tools

5) What is loop testing?

Monday, 15 February 2021

Problems on PERT

PERT Problem 1:

Activity	O	M	P	Predecessor
A	3	4	5	-
B	2	2	2	A
C	3	5	7	A
D	1	3	5	B,C
E	3	3	3	D

Duration to the above PERT Project can be calculated using the formulae :

(O + 4M + P )/ 6

where O Represents Optimistic Time

M Represents Most Likely Time or Expected Time

P Represents Pessimistic Time

Activity	O	M	P	Predecessor	Duration
A	3	4	5	-	4
B	2	2	2	A	2
C	3	5	7	A	5
D	1	3	5	B,C	3
E	3	3	3	D	3

Network Diagram:

Now apply Node rule to all the above activities as shown in fig

Forward Pass:

ES + Duration = EF

Under Forward Pass we need to consider the MAX Value

Backward Pass:

LS = LF - Duration

Under Backward Pass we need to consider the MIN Value

Critical Path Network Diagram:

Forward Pass:

The forward pass is carried out to calculate the earliest finish dates on which each activity may be started and completed.

Activity A may start immediately. Hence, earliest date for its start is zero i.e. ES(A) = 0. It takes 4 weeks to complete its execution. Hence, earliest it can finish is week 4 i.e. EF(A) = 4.

Activity B may start immediately. Hence, earliest date for its start is 4 i.e. ES(B) = 4. It takes 2 weeks to complete its execution. Hence, earliest it can finish is week 6 i.e. EF(B) = 6.

Activity C starts as soon as activity A completes its execution. Hence, earliest week it can start its execution is week 4 i.e. ES(C) = 4. It takes 5 weeks to complete its execution. Hence, earliest it can finish is week 9 i.e. EF(C) = 9.

Activity D starts as soon as activity B and activity C completes their execution. Since, activity requires the completion of both for starting its execution, we would consider the MAX(EF(B), EF(C)). Hence, earliest week it can start its execution is week 9 i.e. ES(D) = 9. It takes 3 weeks to complete its execution. Hence, earliest it can finish is week 12 i.e. EF(D) = 12.

Activity E starts as soon as activity D completes its execution. Hence, earliest week it can start its execution is week 3 i.e. ES(E) = 12. It takes 3 weeks to complete its execution. Hence, earliest it can finish is week 15 i.e. EF(E) = 15.

Backward Pass :

The backward pass is carried out to calculate the latest dates on which each activity may be started and finished without delaying the end date of the project.

Activity E’s LS =LF - Duration latest finish date is equal to the earliest finish date of the precedent activity of finish according to the assumption i.e. LF(E) = 15. It takes 3 weeks to complete its execution. Hence, latest it can start is week 10 i.e. LS(G) = 10.

Activity H’s latest finish date is equal to the earliest finish date of the precedent activity of finish according to the assumption i.e. LF(H) = 13. It takes 2 weeks to complete its execution. Hence, latest it can start is week 11 i.e. LS(H) = 11.

The latest end date for activity C would be the latest start date of H i.e. LF(C) = 11. It takes 3 weeks to complete its execution. Hence, latest it can start is week 8 i.e. LS(C) = 8.

The latest end date for activity D would be the latest start date of H i.e. LF(D) = 11. It takes 4 weeks to complete its execution. Hence, latest it can start is week 7 i.e. LS(D) = 7.

The latest end date for activity E would be the latest start date of G i.e. LF(G) = 10. It takes 3 weeks to complete its execution. Hence, latest it can start is week 7 i.e. LS(E) = 7.

The latest end date for activity F would be the latest start date of G i.e. LF(G) = 10. It takes 10 weeks to complete its execution. Hence, latest it can start is week 0 i.e. LS(F) = 0.

The latest end date for activity A would be the latest start date of C i.e. LF(A) = 8. It takes 6 weeks to complete its execution. Hence, latest it can start is week 2 i.e. LS(A) = 2.

The latest end date for activity B would be the earliest of the latest start date of D and E i.e. LF(B) = 7. It takes 4 weeks to complete its execution. Hence, latest it can start is week 3 i.e. LS(B) = 3.