Sample Question Set SW Engg2025
Sample Question Set SW Engg2025
Q: What are the limitations in waterfall SDLC model and how are they solved in the prototype and
iterative enhancement models? (2+1.5+1.5)
Q: A software project has to be developed very quickly using parallel processing. What is that
model? Explain the process (RAD) (1+2)
Q: A project needs to be developed for a substantial period of time. It may face several technical and
commercial risks. Which SDLC model needs to be followed? Draw a self-explanatory diagram of that
SDLC model. (Spiral model since it handles risk, full detailed diagram with 4 quadrants using radial
dimensions have to be shown) (1+4)
Q: Almost all SDLC models are iterative in nature. Which models are sequential in nature? (Waterfall
model and V-model) (1/2X2=1)
Q: What are the advantages/disadvantages of waterfall model, iterative model, prototype model, V-
model, RAD model, Spiral model (Give 2 adv, 2 disadv) (2)
Q: An SDLC Model is to be followed where the exact specifications are unclear to the developers as
well as the client. The developers are also unsure whether the product they will develop will be right
the first time. What SDLC model is to be followed and why? (Prototype) (1+1)
Q: What is the importance of SRS document? What are the characteristics of a good SRS document?
(2)
Q: When an SRS document is prepared, there are certain requirements say functional requirements,
design constraints, etc. Describe any 2 such requirements in details (1.5X2=3)
A person can have up to a few hundreds of books. The details of all the books such as name of the
book, year of publication, date of purchase, price, and publisher would be entered by the owner. A
book should be assigned a unique serial number by the computer. This number would be written by
the owner using a pen on the inside page of the book. Only a registered friend can be lent a book.
While registering a friend, the following data would have to be supplied—name of the friend, his
address, land line number, and mobile number. Whenever a book issue request is given, the name of
the friend to whom the book is to be issued and the unique id of the book is entered. At this, the
various books outstanding against the borrower along with the date borrowed are displayed for
information of the owner. If the owner wishes to go ahead with the issue of the book, then the date
of issue, the title of the book, and the unique identification number of the book are stored. When a
friend returns a book, the date of return is stored, and the book is removed from his borrowing list.
Upon query, the software should display the name, address, and telephone numbers of each friend
against whom books are outstanding along with the titles of the outstanding books and the date on
which those were issued. The software should allow the owner to update the details of a friend such
as his address, phone, telephone number, etc. It should be possible for the owner to delete all the
data pertaining to a friend who is no more active in using the library. The records should be stored
using a free (public domain) data base management system. The software should run on both
Windows and UNIX machines.
Whenever the owner of the library software borrows a book from his friends, would enter the
details regarding the title of the book, and the date borrowed and the friend from whom he
borrowed it. Similarly, the return details of books would be entered. The software should be able to
display all the books borrowed from various friends upon request by the owner. It should be possible
for anyone to query about the availability of a particular book through a web browser from any
location. The owner should be able to query the total number of books in the personal library,
and the total amount he has invested in his library. It should also be possible for him to view the
number of books borrowed and returned by any (or all) friend(s) over any specified time.
QUESTIONS
1. Develop the functional requirements for the software. Note, there are many functional
requirements, therefore, the requirements must be organised into sections.
2. Develop the non-functional requirements for the software.
Decision Table and Decision Tree
Q: A shop owner allows credit facility to his customers if they satisfy any one of these conditions
Draw a decision table. Reduce the table and show whether the table is complete or not. (2+1.5+1.5)
Q: Draw a decision table to select the largest of three distinct numbers A,B and C. Reduce the table
and show whether the table is complete or not. (2+1.5+1.5)
Q: A sales organization is seeking to hire some salesmen and sales-women having special characteristics.
They need only unmarried personnel between the age of 18 and 30. If male, they want the salesman to be over
5½ ft in height but less than 75 Kg. in weight and not bald. If female, the sales woman is to be less than 5½ft. in
height and less than 55 kg. in weight and is to have shoulder-length hair.
Draw the decision table. Reduce the table. Analyse the completeness of the table with reasons.(2+1.5+1.5)
Q: The Head of department (HOD) recommends books to be bought by the library. If funds are available, books
are bought. If funds do not permit, the book is kept waitlisted for purchase on a priority basis for the next year,
whereas the Library returns the requisitions for all other books to the HOD.
Represent this problem as a decision table with decision rules. Reduce the table.
Also give the corresponding decision tree logic structure representation (2+ 1.5 + 1.5)
Q: Construct a decision tree using this pay-off table. Where should a person invest as per the decision tree
analysis? (3)
Q: Consider a scenario of new membership in a library management system (LMS). The application
might present you with a menu for membership with several sub-menus, including options for new
members, renewal of membership for existing members, and cancellation of membership. Now at a
conceptual level, Decision Trees can represent these choices and the corresponding actions
associated with each choice. Draw the corresponding Decision table and the Decision Tree (2X2.5)
DFD and Structure Charts
Q: Given the DFD, arrive at the structure chart using Transformation Analysis. Show the afferent
flow, transform flow and efferent flow clearly in the transformation analysis. (5)
Q: Given the following DFD, arrive at the Structure chart using Transaction analysis. (5)
a)
CASE file-code OF
Read customer transaction record
1:
If not EOF
increment customer-transaction-count
end-if
Read customer master record
2:
If not EOF
increment customer-master-count
end-if
Read product master record
3:
If not EOF
increment product-master-count
end-if
ENDCASE
END
b) Read-student-records-and-total-student-ages
No-of-records = 0
Total-age = 0
Read student-record
While not EOF
Tot-age = Tot-age + student-age
No-of-records = No-of-records + 1
End do
END
c)
Initialisation
Open files
Enter date
Initialise counts / sums to zero
Print report headings, etc
END
Q: There are 4 slices and 31 tokens in a procedure A. 0 tokens have 100% adhss. 4 token are in 3 slice
(75% adhhs), 8 token are on two slices (50% adhss), the rest 19 token are in one slice(25% adhss).
Find the cohesion of the procedure in terms of adhesiveness. (2)
(iii) Passing a non-global data structure (rather than a simple data) to another module in the form
of a parameter is ___________ coupling (1)
(iv) A module passing a non-global data variable to another module is example of _______ coupling
(1)
Q: Given the values of 50 user inputs, 40 user outputs, 35 external inquiries, 6 internal files and 4
external interfaces, if average weighing factors are considered, compute the Function Point when all
complexity adjustment factors (CAF) and weighting factors are average. (5)
Q: Given the following program, draw the corresponding CFG and find out its McCabe’s cyclomatic
complexity using 3 formulae. Write down the independent paths to cover the CFG (5)
Program Length (N), Vocabulary (n), Volume (V) = 417.23 bits, Estimated Program Length (N^),
Potential Volume (V*) = 11.6
Q: Determine the early start and late start in respect of all node points and identify critical
path for the following network. (5)