Dear candidates you will find MCQ questions of Software Project Management (SPM) here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.
Explanation: function-point and object-point estimates are easier to produce than estimates of code size but are often still inaccurate.
Explanation: the cost of a new project is estimated by analogy with these completed projects.
Explanation: osi is the abbreviation for open system interconnection. osi model provides a structured plan on how applications communicate over a network, which also helps us to have a structured plan for troubleshooting. it is recognized by the iso as the generalized model for computer network i.e. it can be modified to design any kind of computer network.
Explanation: in osi reference model, there
Explanation: in osi reference model, there are two layers which are not present in tcp/ip model. they are presentation and session layer. the functions of presentation and session layer in the osi model are handled by the transport layer itself in tcp/ip.
Explanation: according to the time estimates made by the pert planners, the maximum time that would be needed to complete an activity is called the pessimistic time estimate. this estimate does not include possible effects of floods, earthquakes, etc.
Explanation: in a network, a critical path is the time-wise longest path. the critical path in the critical path method plays an essential role in scheduling and planning.
Explanation: the difference between the maximum time available and the actual time needed to perform an activity is known as the total float. hence, the total float is the excess of the maximum available time throughout the time of the activity.
Explanation: a randomized algorithm is an algorithm that employs a degree of randomness as a part of its logic using random bits as inputs and in hope of producing average case good performace.
Explanation: monte carlo algorithms are very vast, but only probably correct. on thr other side, las vegas algorithms are always correct, but probably fast.
Jump to