V Semester B.C.A. Degree Examination, November/December 2011
(Y2K7 Scheme)
COMPUTER SCIENCE
BCA 504 : Software Engineering
Time: 3 Hours Max. Marks:8O
PART - A
1. Answer any ten sub-questions. Each sub question carries two marks. (10x2=20)
1) Define software engineering.
2) Explain Requirement specification and requirement a validation.
3) Define Throw-away proto-typing.
4) Write the advantages of client server model.
5) Define object oriented decomposition.
6) What is statistical testing ?
7) What is structural decomposition ?
8) List out the advantages of waterfall model.
9) Define defective testing and validation testing.
10) Define Quality Assurance.
PART - B
II. Answer any five of the following questions. Each question carries five marks. (5x5=25)
11. a) Explain spiral model with a neat diagram.
b) What are the activities involved in system design ?
12. a) Write a divide and conquer algorithm to find maximum and minimum in an array of numbers. Analyse ts space and time complexity.
b) Briefly explain Greedy method.
13. a) Write the Dijkstra's algorithm for single source shortest path.
b) Obtain the single source paths from the source vertex 1) in the following graph (refer to pdf file).
(Y2K7 Scheme)
COMPUTER SCIENCE
BCA 504 : Software Engineering
Time: 3 Hours Max. Marks:8O
PART - A
1. Answer any ten sub-questions. Each sub question carries two marks. (10x2=20)
1) Define software engineering.
2) Explain Requirement specification and requirement a validation.
3) Define Throw-away proto-typing.
4) Write the advantages of client server model.
5) Define object oriented decomposition.
6) What is statistical testing ?
7) What is structural decomposition ?
8) List out the advantages of waterfall model.
9) Define defective testing and validation testing.
10) Define Quality Assurance.
PART - B
II. Answer any five of the following questions. Each question carries five marks. (5x5=25)
11. a) Explain spiral model with a neat diagram.
b) What are the activities involved in system design ?
12. a) Write a divide and conquer algorithm to find maximum and minimum in an array of numbers. Analyse ts space and time complexity.
b) Briefly explain Greedy method.
13. a) Write the Dijkstra's algorithm for single source shortest path.
b) Obtain the single source paths from the source vertex 1) in the following graph (refer to pdf file).
Comments
Post a Comment