Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

public static int mystery ( int n ) { Random r = new Random ( ) ; int a = r . nextInt ( 3

public static int mystery(int n){
Random r = new Random();
int a = r.nextInt(3)+1;
int b =2;
// Point A
while (n > b){
// Point B
b = b + a;
if (a >1){
n--;
// Point C
a = r.nextInt(b)+1;
} else {
a = b +1;
// Point D
}
}
// Point E
return n;
}
Categorize each assertion at each point with ALWAYS, NEVER, or SOMETIMES:
n > b
a >1
b > a
Point A
Point B
Point C
Point D
Point E

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Systems Analysis And Synthesis Bridging Computer Science And Information Technology

Authors: Barry Dwyer

1st Edition

0128054492, 9780128054499

More Books

Students also viewed these Databases questions