37. Consider the following code segment and search method. (52,10,22,99,41,37,69,75,80); int[] list = System.out.println(search(list,41)); public static int search(int[] list, int target) { } boolean found = false; int n = 0; while (!found) { int rnd = (int) (Math.random() * 9); if (list[rnd] == target) found = true; else n++; } return n; I. The search item will always be found, even if it takes many iterations. The search item, if it exists, will eventually be found. II. III. If the search item is not in the list, a continuous loop results. 37. Which of the following is true about the search method? I only O II only III only I and III only O II and III only
37. Consider the following code segment and search method. (52,10,22,99,41,37,69,75,80); int[] list = System.out.println(search(list,41)); public static int search(int[] list, int target) { } boolean found = false; int n = 0; while (!found) { int rnd = (int) (Math.random() * 9); if (list[rnd] == target) found = true; else n++; } return n; I. The search item will always be found, even if it takes many iterations. The search item, if it exists, will eventually be found. II. III. If the search item is not in the list, a continuous loop results. 37. Which of the following is true about the search method? I only O II only III only I and III only O II and III only
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
all questions are in the pics. thanks!
![37. Consider the following code segment and search method.
int[] list = (52,10,22,99,41,37,69,75,80);
System.out.println(search(list,41));
public static int search(int[] list, int target)
{
}
I.
II.
III.
boolean found = false;
int n = 0;
while (!found)
{
int rnd = (int) (Math.random() * 9);
if (list[rnd] == target)
found = true;
else
n++;
}
return n;
The search item will always be found, even if it takes many iterations.
The search item, if it exists, will eventually be found.
If the search item is not in the list, a continuous loop results.
37. Which of the following is true about the search method?
I only
II only
III only
I and III only
O II and III only](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F13373a09-98e2-4628-97cc-1360719410b9%2Fe2072e61-6b4b-4c6d-89d7-862005fefab9%2Fj60xtze_processed.png&w=3840&q=75)
Transcribed Image Text:37. Consider the following code segment and search method.
int[] list = (52,10,22,99,41,37,69,75,80);
System.out.println(search(list,41));
public static int search(int[] list, int target)
{
}
I.
II.
III.
boolean found = false;
int n = 0;
while (!found)
{
int rnd = (int) (Math.random() * 9);
if (list[rnd] == target)
found = true;
else
n++;
}
return n;
The search item will always be found, even if it takes many iterations.
The search item, if it exists, will eventually be found.
If the search item is not in the list, a continuous loop results.
37. Which of the following is true about the search method?
I only
II only
III only
I and III only
O II and III only
![36. Consider the following code segment and search method.
int[] list = {52,10,22,99,41,37,69,75,80);
System.out.println(search(list,41));
public static int search(int[] list, int target)
{
boolean found = false;
int n = 0;
while (!found)
{
int rnd = (int) (Math.random() * 9);
if (list[rnd] == target)
found = true;
else
n++;
}
return n;
36. What is printed when the program is executed?
true, after the search item is found.
41
The number of iterations it took to find the search number.
true, followed by the number of iterations it took to find the search number.
O Nothing, the program will be stuck in a continuous loop.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F13373a09-98e2-4628-97cc-1360719410b9%2Fe2072e61-6b4b-4c6d-89d7-862005fefab9%2Ffhjt7af_processed.png&w=3840&q=75)
Transcribed Image Text:36. Consider the following code segment and search method.
int[] list = {52,10,22,99,41,37,69,75,80);
System.out.println(search(list,41));
public static int search(int[] list, int target)
{
boolean found = false;
int n = 0;
while (!found)
{
int rnd = (int) (Math.random() * 9);
if (list[rnd] == target)
found = true;
else
n++;
}
return n;
36. What is printed when the program is executed?
true, after the search item is found.
41
The number of iterations it took to find the search number.
true, followed by the number of iterations it took to find the search number.
O Nothing, the program will be stuck in a continuous loop.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education