Explain Earned value is a Measure of Progress for Software Engineering Assignment of SMU MBA

“Earned value is a measure of progress. Explain this statement.” This is the question of this SMU MBA assignment for Software Engineering (MI0024). Students of Sikkim Manipal University with Information System (IS) specialty MBA MI0024 can write the assignment. There are some other Software Engineering assignments also of SMU MBA - COCOMOL model, Linear Sequential Model and 4GL Technologies.

Earned value analysis provides the project manager with an indication of progress, but an assessment of the information provided is somewhat subjective. It is reasonable to ask whether there is a quantitative technique for assessing progress as the software team progresses through the work tasks allocated to the project schedule. In fact, a technique for performing quantitative analysis of progress does exist. It is called earned value analysis (EVA).

The earned value system provides a common value scale for every (software project) task, regardless of the type of work being performed. The total hours to do the whole project are estimated, and every task is given an earned value based on its estimated percentage of the total.

Stated even more simply, earned value is a measure of progress. It enables us to assess the “percent of completeness” of a project using quantitative analysis rather than rely on a gut feeling. In fact, Fleming and Koppleman argue that earned value analysis “provides accurate and reliable readings of performance from as early as 15% into the project”.

To determine the earned value, the following steps are performed:

1. The budgeted cost of work scheduled (BCWS) is determined for each work task represented in the schedule. The work of each software engineering task is planned.

2. The BCWS values for all work tasks are summed to derive the budget at completion,

BAC. Hence, BAC=_(BCWSk) for all tasks k

3. Next, the value for budgeted cost of work performed (BCWP) is computed. The value for BCWP is the sum of the BCWS values for all work tasks that have actually been completed by a point in time on the project schedule.

COCOMOL Model of MI0024 Software Engineering for MBA Assignment

“Explain COCOMOL model.” You have to solve the question of SMU MBA MI0024 for Software Engineering. MBA students of Information System (IS) of Sikkim Manipal University MI0024 can write the assignment. I already have shared some other MI0024 MBA assignments also such as - Linear Sequential Model and 4GL Technologies.

In this classic book on “software engineering economics,” Barry Boehm [BOE81] introduced a hierarchy of software estimation models bearing the name COCOMO, for constructive cost model. The original COCOMO model became one of the most widely used and discussed software cost estimation models in the industry. It has evolved into a more comprehensive estimation model, called COCOMO II [BOE96, BOE00]. Like its predecessor, COCOMO II is actually a hierarchy of estimation models that address that following areas:

Application composition model: Used during the early stages of software engineering, when prototyping of user interfaces, consideration of software and system interaction, assessment of performance, and evaluation of technology maturity are paramount.

Early design stage model: Used once requirements have been stabilized and basic software architecture has been established.

Post-architecture-stage model: Used during the construction of the software.

The Software Project Plan is a relatively brief document that is addressed to a diverse audience. It must (1) communicate scope and resources to software management, technical staff, and the customer; (2) define risks and suggest risk aversion techniques; (3) define cost and schedule for management review; (4) provide an overall approach to software development for all people associated with the project; and (5) outline how quality will be ensured and change will be managed.

This is, the project team revisits the plan repeatedly – updating risks, estimates, schedules and related information – as the project proceeds and more is learned.

Similarly, the degree of detail contained within the schedule section may vary with the audience and formality of the plan. It is the important to note that the Software Project Plan is not a static document.

Linear Sequential Model in Software Engineering of MI0024 for SMU MBA Assignment

“Explain Linear Sequential Model.” It is the question of SMU MBA MI0024 for Software Engineering. Students of Information System (IS) of Sikkim Manipal University MBA MI0024 can write the assignment. There are some other MI0024 MBA assignments also such as - software process and different models and 4GL Technologies.

The linear sequential model suggests a systematic, sequential approach to software development. It begins at the system level and progress through analysis, design, coding, testing and support. Modeled after a conventional engineering cycle, the linear sequential model encompasses the following activities:

System/information engineering and modeling: Because software is always part of a larger system (or business), work begins by establishing requirements for all system elements and then allocating some subset of these requirements to software. This system view is essential when software must interact with other elements such as hardware, people and databases.

Software requirements analysis: The requirements gathering process is intensified and focused specifically on software. To understand the nature of the program(s) to be built, the software engineer (“analyst”) must understand the information domain for the software, as well as required function, behavior, performance and interface.

Design: Software design is actually a multistep process that focuses on four distinct attributes of a program: data structure, software architecture, interface representations and procedural detail. The design process translates requirements into a representation of the software that can be assessed for quality before coding begins.

Code generation: The design must be translated into a machine-readable form. The code generation step performs this task.

Testing: Once the code has been generated, program testing begins. The testing process focuses on the logical internals of the software, ensuring that all statements have been tested and on the functional externals, that is, conducting tests to uncover errors and ensure that defined input will produce actual results that agree with the required results.

Support: Software will undoubtedly undergo change after it is delivered to the customer. Change will occur because errors have been encountered, because the software must be adapted to accommodate changes in its external environment or because the customer requires functional or performance enhancements.

The linear sequential model requires his and has difficult accommodating the natural uncertainty that exists at the beginning of many projects.

4GL Technologies for MBA Assignment of MI0024 Software Engineering

“What are 4GLs explain in brief.” The question has been taken from MI0024 SMU MBA of Software Engineering. It is the question of Information System (IS) for Sikkim Manipal University MBA MI0024. I have already shared software process and different models also for MI0024 assignment.

For small applications, it may be possible to move directly from the requirements gathering step to implementation using a nonprocedural fourth generation language (4GL), or a model composed of a network of graphical icons.

However, for larger efforts, it is necessary to develop a design strategy for the system, even if a 4GL is to be used. The use of 4GT without design (for large projects) will cause the same difficulties (poor quality, poor maintainability, poor customer acceptance) that have been encountered when developing software using conventional approaches.

Implementation using a 4GL enables the software developer to represent desired results in a manner that leads to automatic generation of code to create those results. Obviously, a data structure with relevant information must exist, and be readily accessible by the 4GL. To transform a 4GT implementation into a product, the developer must conduct through testing, develop meaningful documentation, and perform all other solution integration activities that are required in other software engineering paradigms. In addition, the 4GT developed software must be built in a manner that enables maintenance to be performed expeditiously.

Like all software engineering paradigms, the 4GT model has advantages and disadvantages. Proponents claim dramatic reduction in software development time and greatly improved productivity for people who build software. Opponents claim that current 4GT tools are not all that much easier to use than programming languages, that the resultant sources code produced by such tools is ‘inefficient,” and that the maintainability of large software systems developed using 4GT is open to question. 4GT begins with a requirements gathering step.

Software Process and Different Models Involved In This Process for MI0024 MBA Assignment

“Explain the software process and different models involved in this process.” This is MI0024 SMU MBA question assignment. The question has been taken from Software Engineering for Information System (IS) of SMU MBA MI0024. I have decided to write the assignment question after Branch and Bound Technique to solve an I.P.P. problem.

In the recent years, there has been a significant emphasis on “process maturity.” The Software Engineering Institute (SEI) has developed a comprehensive model predicated on a set of software engineering capabilities that should be present as organizations reach different levels of process maturity. To determine an organization’s current state of process maturity, the SEI uses an assessment that results in a five point grading scheme.

To solve actual problems is an industry setting, a software engineer or a team of engineers must incorporate a development strategy that encompasses the process, methods, and tools layers. All software development can be characterized as a problem solving loop in which four distinct stages are encountered: status quo, problem definition, technical development and solution integration.

This problem solving loop applies to software engineering work at many different levels of resolution. It can be used at the macro level when the entire application is considered, at a mid-level when program components are being engineered and even at the line of code level.

Software Process Models:

The Linear Sequential Model: Sometimes called the classic life cycle or the waterfall model, the linear sequential model suggest a systematic, sequential approach to software development that begins at the system level and progress through analysis, design, coding, testing and support.

The Prototyping Model: Often, a customer defines a set of general objectives for software but does not identify detailed input, processing, or output requirements.

The Incremental Model: The incremental model combines elements of the linear sequential model with the iterative philosophy of prototyping.

The Spiral Model: The spiral model, originally proposed by Boehm [BOE88], is an evolutionary software process model that couples the iterative nature of prototyping with the controlled and systematic aspects of the linear sequential model.

The RAD Model: Rapid application development (RAD) is an incremental software development process model that emphasizes an extremely short development cycle.

The intent of software engineering is to provide a framework for building software with higher quality. Software engineering is a discipline that integrates process, methods and tools for the development of computer software.

Branch and Bound Technique to solve an I.P.P. Problem for MB0032 SMU MBA Assignment

“Describe the Branch and Bound Technique to solve an I.P.P. problem.” This is MB0032 SMU MBA question assignment. It is solved assignment of Operation Research chapter of Sikkim Manipal University. I already have shared North-West Corner rule, Matrix Minimum Method and Integer Programming Problem assignments also of SMU MBA MB0032.

Sometimes a few or all the variables of an IPP are constrained by their upper or lower bounds or by both. The most general technique for the solution of such constrained optimization problems is the branch and bound technique.

To explain how this partitioning helps, let us assume that there were no integer restrictions, and suppose that this then yields an optimal solution to LPP.

Then the solution having the larger value for z is clearly optimum for the given IPP. However, it usually happens that one of these problems has no optimal solution satisfying and thus some more computations are necessary. We now discuss step wise the algorithm that specifies how to apply the partitioning and in a systematic manner to finally arrive at an optimum solution.

We start an initial lower bound for z, say z at the first iteration which I less than or equal to the optimal value z, this lower bound may be taken as the starting Lj for some Xj.

In addition to the lower bound z, we also have a list of LPP’s differing only in the bounds. To start with the master list contains a single LPP consisting of 1, 2, 3, 4 and 5. We now discuss below, the step by step procedure that specifies how the partitioning 6 and 7 can be applied systematically to eventually get an optimum integer – valued solution.

Now, on terming we find that only two feasible integer solution namely 5 and 6 have been recorded. The best of these gives the optimum solution to the given IPP. Hence the optimum integer solution to the given IPP is:

Z0 = 55, X1 = 4, X2 = 3.

North West Corner Rule for Finding the Initial Basic Feasible Solution in the Transportation Problem from MB0032 Assignment

“Describe the North-West Corner rule for finding the initial basic feasible solution in the transportation problem.” The question has been taken from MB0032 MBA assignment of SMU. This question has been taken from Operation Research chapter of Sikkim Manipal University. We already have discussed about MODI method, Matrix Minimum Method and Integer Programming Problem in this series.

North West Corner Rule:

Step 1: The first assignment is made in the cell occupying the upper left hand (North West) corner of the transportation table. The maximum feasible amount is allocated there, that is X11 = min (a1, b1).

So that either the capacity of origin O1 is used up or the requirement at destination D1 is satisfied or both. This value of X11 is entered in the upper left hand corner (Small Square) of cell (1, 1) in the transportation table.

Step 2: If b1 > a1 the capacity of origin O, is exhausted but the requirement at destination D1 is still not satisfied, so that at least one more other variable in the first column will have to take on a positive value. Move down vertically to the second row and make the second allocation of magnitude X21 = min (a2, b1 – x21) in the cell (2, 1). This either exhausts the capacity of origin O2 or satisfies the remaining demand at destination D1.

If a1 > b1 the requirement at destination D1 is satisfied but the capacity of origin O1 is not completely exhausted. Move to the right horizontally to the second column and make the second allocation of magnitude X12 = min (a1 – x11, b2) in the cell (1, 2). This either exhausts the remaining capacity of origin O1 or satisfies the demand at destination D2.

If b1 = a1, the origin capacity of O1 is completely exhausted as well as the requirement at destination is completely satisfied. There is a tie for second allocation; an arbitrary tie breaking choice is made. Make the second allocation of magnitude X12 = min (a1 – a1, b2) = 0 in the cell (1, 2) or X21 = min (a2, b1 – b2) = 0 in the cell (2, 1).

Step 3: Start from the new north west corner of the transportation table satisfying destination requirements and exhausting the origin capacities one at a time, move down towards the lower right corner of the transportation table until all the rim requirements are satisfied.

Transportation Problem and MODI Method of Solving Transportation Problem From MB0032 Assignment

The question is – “What do you understand by the transportation problem? What is the basic assumption behind the transportation problem? Describe the MODI method of solving transportation problem.” It has been taken from MB0032 assignment of SMU MBA. It is the question of Operation Research book of Sikkim Manipal University. I am back with this question after the - Matrix Minimum Method, Integer Programming Problem and Penalty Cost Method or Big-M Method for Solving LPP.

Transportation Problem:

Here we study an important class of linear programs called the transportation model. This model studies the minimization of the cost of transporting a commodity from a number of sources to several destinations. The supply at each source and the demand at each destination are known.

The objective is to develop an integral transportation schedule that meets all demands from the inventory at a minimum total transportation cost.

Basic Assumption behind Transportation Problem:

Let us consider a T.P involving m-origins and n-destinations. Since the sum of origin capacities equals the sum of destination requirements, a feasible solution always exists. Any feasible solution satisfying m+n-1 of the m + n constraints is a redundant one and hence can be deleted. This also means that a feasible solution to a T.P can have at the most only m + n – 1 strictly positive components, otherwise the solution will degenerate.

It is always possible to assign an initial feasible solution to a T. P. in such a manner that the rim requirements are satisfied. This can be achieved either by inspection or by following some simple rules. We begin by imagining that the transportation table is blank i.e. initially all Xij = 0. The simplest procedures for initial allocation discussed in the following section.

MODI Method of Solving Transportation Problem:

The first approximation to (2) is always integral and therefore always a feasible solution. Rather than determining a first approximation by a direct application of the simplex method it is more efficient to work with the table given below called the transportation table. The transportation algorithm is the simplex specialized to the format of table it involves:

a) Finding an integral basic feasible solution
b) Testing the solution for optimality
c) Improving the solution, when it is not optimal
d) Repeating steps (1) and (2) until the optimal solution is obtained

The solution of T.P. is obtained in two stages. In the first stage we find basic feasible solution by any one of the following methods a) North-west corner rale b) Matrix Minima method or least cost method c) Vogel’s approximation method. In the second stage we test the B.Fs for its optimality either by MODI metod or by stepping stone method.