Questions -

1. Define the equivalence classes and boundary values and develop a set of test cases to cover them for the following module description: The module is part of a public TV membership system. The module allows entry of a contribution from $0.01 to $99,999.99. It also enters a member status for the contributor that can be: regular, student/retiree, or studio club.

2. Develop black box test cases using equivalence class partitioning and boundary value analysis to test a module that is software component of an automated teller system. The module reads in the amount the user wishes to withdraw from his/ her account. The amount must be a multiple of $5.00 and be less than or equal to $200.00. Be sure to list any assumptions you make and label equivalence classes and boundary values that you use.

3. Draw a state transition diagram for a simple stack machine. Assume the stack holds n data items where n is a small positive number. It has operations ''push'' and ''pop'' that cause the stack pointer to increment or decrement, respectively. The stack can enter states such as ''full'' if it contains n items and, ''empty'' if it contains no items. Popping an item from the empty stack, or pushing an item on the full stack cause a transition to an error state. Based on your state transition diagram, develop a set of black box test cases that cover the key state transitions. Be sure to describe the exact sequence of inputs, as well as the expected sequence of state changes and actions.