
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
What are the values of array elements in "list" after running the code below?
public static void main (String [] args)
{
final int LIMIT = 15, MULTIPLE = 10;
float[ ] list = new float[LIMIT];
for (int index = 0; index < LIMIT; index++)
list[index] = index * MULTIPLE;
list[5] = 999; // change one array value
}
}
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by stepSolved in 2 steps

Knowledge Booster
Similar questions
- #include <iostream>using namespace std;double median(int *, int);int get_mode(int *, int);int *create_array(int);void getinfo(int *, int);void sort(int [], int);double average(int *, int);int getrange(int *,int);int main(){ int *dyn_array; int students; int mode,i,range;float avrg;do{cout << "How many students will you enter? ";cin >> students;}while ( students <= 0 );dyn_array = create_array( students );getinfo(dyn_array, students);cout<<"\nThe array is:\n";for(i=0;i<students;i++)cout<<"student "<<i+1<<" saw "<<*(dyn_array+i)<<" movies.\n";sort(dyn_array, students);cout << "\nthe median is "<<median(dyn_array, students) << endl;cout << "the average is "<<average(dyn_array, students) << endl;mode = get_mode(dyn_array, students);if (mode == -1)cout << "no mode.\n";elsecout << "The mode is " << mode << endl;cout<<"The range of movies seen is…arrow_forwardvoid listEmployees (void) { for (int i=0; i 10000. Make a guess about why the comparison function takes 2 struct Employee parameters (as opposed to struct Employee *) **arrow_forwardint tryMe(int x[], int size); void main() { int list[75]; cout<< tryMe (list, 75); } valid invalidarrow_forward
- // pre: list != null, list.length > 0 // post: return index of minimum element of array public static int findMin(int[] list) { assert list != null && list.length > 0 : "failed precondition"; int indexOfMin = 0; for(int i = 1; i < list.length; i++) { if(list[i] < list[indexOfMin]) { indexOfMin = i; } } return indexOfMin; } Question: draw DFG from the code above find the all-def/c/p use paths. Generate test cases to test this function using JUnit! (to test all-def/c/p use path)arrow_forwardTEST23 If(j< array.length)return(array[j] + Test 23(array ; j+1) else return 0; } 6,11,2,7,3 What is returned by TEST23(array,0)?arrow_forward. Given the following parallel arrays: int[] arrProdNumber = new int[] { 100, 115, 125, 142, 163, 199, 205, 388 }; string[] arrProdDesc = new string[] { "Kitten", "Cat", "Bird", "Chicken", "Dog", "Puppy", "Aardvark", "Zebra" }; Write a C# program that includes these arrays. Your program should then read a product number from the user and search the product number array for that number. If it is found, then your program should report the product number they entered and the corresponding product description. If the product number they enter is not in the first array, then your program should indicate that item number was not found. Here’s a sample run: //first runEnter product number: 115Item #115's product description is Cat//second runEnter product number: 1963Item #1963 does not exist in your inventory Some Random Number Generation HintsRandom rndNumber = new Random();Console.WriteLine(rndNumber.Next()); //random integerConsole.WriteLine(rndNumber.Next(101)); //random integer…arrow_forward
- 23. What are the values of the elements in the array numbers after the following code is executed? int[] numbers = {10, 20, 30, 40, 50, 60, 70, 80, 90, 100}; for (int i =1, i < 10; 1++) { numbers[i] = numbers [i - 1]; }arrow_forward(a) Print the following List in the reversed order using lambda / arrow operator. var array = new List <int>{ 8,2,2,24,5,7,5,3,2,10}; (b) Print minimum, maximum and average values of the following List (5 points). var array = new List <int>{ 8,2,2,24,5,7,5,3,2,10 }; Please use Visual studioarrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY

Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON

Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning

Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning

Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education

Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY