Questions with Detailed Verified
Answers (100% Correct Answers) |
Already Graded A+
Finite State Machine - 🧠ANSWER ✔✔an abstract representation of
behavior exhibited by some systems. a system that can only be in one
state at a time and changes between states based on certain inputs or
conditions.
Chow (W) method - 🧠ANSWER ✔✔Step 1: Estimate the maximum number
of states (m) in the correct implementation of the given FSM M.
Step 2: Construct the characterization set W for M.
Step 3: (a) Construct the testing tree for M and (b) generate the transition
cover set P from the testing tree.
, Step 4: Construct set Z from W and m.
Step 5: Desired test set=P.Z
combinatorial design rationale - 🧠ANSWER ✔✔To ensure high reliability
across the intended environments, the application must be tested under as
many environments as possible
4 Challenges in testing web applications - 🧠ANSWER ✔✔1. Loosely
coupled
2. Dynamic Content
3. Control Flow
4. Dynamic Integration
Loosely coupled - 🧠ANSWER ✔✔Modules that are relatively independent,
so we don't know what modules will call what.
Dynamic Content - 🧠ANSWER ✔✔Parts of the program are generated
dynamically
Control Flow - 🧠ANSWER ✔✔Users can make unexpected changes to the
flow of control Ex: Back buttons, refreshing, caching, forward button, URL
hacking