Download Software Engineering Exam for BSc (Hons) in Software Dev & Comp Networking and more Exams Software Engineering in PDF only on Docsity! Cork Institute of Technology Bachelor of Science (Honours) in Software Development & Computer Networking ā Award (NFQ Level 8) Autumn 2007 Software Engineering Time 2 hours Answer four questions. Examiners: Mr. John OāBrien Dr. Jim Buckley Dr. Austin Kinsella Q1. (a) Reviews are a crucial part of cleanroom software development team operations; every work-product is the subject of repeated team reviews as it undergoes development from initial concept to final form. A formal technical review, FTR, serves as a training ground. It enables junior engineers to observe different approaches to analysis, design, and implementation. It also serves to promote backup and continuity as individual engineers become familiar with parts of the software that would, otherwise, be unseen. Every FTR is conducted as a meeting. It will be successful only if properly planned, controlled and attended. Do you agree/disagree? State your reason(s). [10 marks] (b) Cleanroom software engineering is characterised by three principal technologies, namely: (i) Incremental development under statistical control; (ii) Function-based specification, design and verification; (iii) Statistical testing and software certification. Elaborate on each of the above-identified technologies. [15 Marks] Q2. (a) Software engineering methods can be categorised on a āformalityā spectrum. Discuss, briefly. [4 Marks] (b) The following diagram illustrates a network of one-way roads: B A C D (i) Model this as a relation, R (ii) Calculate the value of R-1 (iii) Calculate the value of R;R;R. [6 Marks] (c) The air-traffic control of an airport keeps a record of the planes waiting to land and the assignment of planes to gates on the ground. There are operations to accept a plane when it arrives in the airportās waiting space, to assign a plane to a gate at the airport and to record that a plane leaves its gate. Consider the following types: [PLANE] the set of all possible, uniquely identified planes [GATE] the set of all gates at this airport. The state of the airport, at any time, can be expressed by the following Z schema: ______Airport________________________________ | | waiting : P PLANE | assignment : GATE PLANE |____________________________________________ | | waiting ā© ran assignment = {} |____________________________________________ Each plane is assigned to at most one gate and each gate has at most one plane assigned to it. No plane is both waiting and assigned to a gate. Initially, there are no planes waiting or at any gate. Therefore: _______Init___________________________ | | Airportā |___________________________________ | waitingā = {} | assignmentā = {} |___________________________________ (i) Write a Z schema, called Arrive, that records the arrival of plane p in the airportās waiting area. The plane must be neither already waiting nor assigned to a gate (ii) Write a Z schema, called Assign, that records the assignment of plane p to a free gate g. The plane must be waiting and the gate must be free. (iii) Write a Z schema, called Leave, that records plane p leaving its gate. The plane p must be assigned to the gate. [15 Marks]
