Software Engineering

Need homework help. Please see attachment. Textbook: Software Engineering: Theory and Practice (2nd ed.) by Shari Lawrence Pfleeger, © 2001published by Prentice-Hall ISBN 0-13-029049-1.

Software Engineering - QA and QC

Identify the test objectives and test approaches for the following project: a software package to sell downloadable video recordings of classic movies. A typical download takes one hour, and an interrupted download must be restarted from the beginning. The number of customers downloading at the same time ranges from 10 to 100 during peak hours. On average, your system could go down about once per week. Best Regards, Vishnu Vandana

Help needed

Need homework help Textbook: Software Engineering: Theory and Practice (2nd ed.) by Shari Lawrence Pfleeger, © 2001published by Prentice-Hall ISBN 0-13-029049-1.

Design a JUnit Test Framework for an ATM machine

Hi, I need assistance in the following problem: Our project is to design a JUnit (CUnit or CppUnit) test framework. If I am good at C, C++, or Java (I am not good in any of them), I can write the ATM machine itself and Unit test in real source code. However, As I am not good at programming, you can use pseudo-code to write the ATM machine and then design the test cases (that should be similar to the test cases in the following link article). After I finish the real code or pseudo-code, I need to discuss the coverage analysis. That is, will my test case be sufficient to cover all possible cases? In another word, if the program passes the Unit test, will that guarantee that the code is fault... click for more

Design an Oracle for this Function

Design an oracle for this function: void compute_maximum_clique( …); Input: a graph G(V,E), that is, V is a set of nodes and E is a set of edges connecting nodes in G. Output: a sub-graph G’(V’,E’) of G such that for any two nodes u,v in V’, there is an edge e=(u,v) in E’. In addition, G’ should be the maximum in terms of the size. That is, for any other G’’ with the above property, we have |G’’| no larger than |G’|. Hints: The clique problem itself is NP-hard. Thus you may not want to have an oracle that runs in exponential time. Think about approach to approximate the solution. In another word, design an oracle that runs efficiently but may make mistakes in some cases.