Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
2. Write the following program: If the last digit of your unique real Kean ID is even, implement a program that randomly generates 10 integers from -100 to 100, stores them in an 1D array and finds their minimum value. Calculate the execution time of finding a minimum. Repeat the test for 10,000 and 10,000,000 numbers. Provide your results in the form of a table below and provide a small summary. If the last digit of your unique real Kean ID is odd, implement a program that randomly generates 10 integers from -100 to 100, stores them in an 1D array and find a number (count) of even numbers. Calculate the execution time of counting even numbers. Repeat the test for 10,000 and 10,000,000 numbers. Provide your results in the form of a table below and provide a small summary. Provide source code, screenshot of at least one successful run and summary of the results in the following form (this table can be autogenerated or created manually) Array size time 10 10,000 10,000,000 Hint: You can use the following statements to calculate execution time. long begin, end, time; // we will measure time it took begin = System.nanoTime();//we measure in nanoseconds. end = System.nanoTime(); time = end-begin; Hint: You can use the following to generate random numbers: (int)(Math.random() * 101 * (Math.random() > 0.5 ? 1: -1)); Sample run: It took 1600 nanoseconds to find a minimum in the array of 10 elements. The minimum is: -83 It took 1600 nanoseconds to count even numbers in the aray of 10 elements. There are 6 of them.

2. Write the following program: If the last digit of your unique real Kean ID is even, implement a program that randomly generates 10 integers from -100 to 100, stores them in an 1D array and finds their minimum value. Calculate the execution time of finding a minimum. Repeat the test for 10,000 and 10,000,000 numbers. Provide your results in the form of a table below and provide a small summary. If the last digit of your unique real Kean ID is odd, implement a program that randomly generates 10 integers from -100 to 100, stores them in an 1D array and find a number (count) of even numbers. Calculate the execution time of counting even numbers. Repeat the test for 10,000 and 10,000,000 numbers. Provide your results in the form of a table below and provide a small summary. Provide source code, screenshot of at least one successful run and summary of the results in the following form (this table can be autogenerated or created manually) Array size time 10 10,000 10,000,000 Hint: You can use the following statements to calculate execution time. long begin, end, time; // we will measure time it took begin = System.nanoTime();//we measure in nanoseconds. end = System.nanoTime(); time = end-begin; Hint: You can use the following to generate random numbers: (int)(Math.random() * 101 * (Math.random() > 0.5 ? 1: -1)); Sample run: It took 1600 nanoseconds to find a minimum in the array of 10 elements. The minimum is: -83 It took 1600 nanoseconds to count even numbers in the aray of 10 elements. There are 6 of them.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
2. Write the following program: If the last digit of your unique real Kean ID is even, implement a program that randomly generates 10 integers from -100 to 100, stores them in an 1D array and finds their minimum value. Calculate the execution time of finding a minimum. Repeat the test for 10,000 and 10,000,000 numbers. Provide your results in the form of a table below and provide a small summary. If the last digit of your unique real Kean ID is odd, implement a program that randomly generates 10 integers from -100 to 100, stores them in an 1D array and find a number (count) of even numbers. Calculate the execution time of counting even numbers. Repeat the test for 10,000 and 10,000,000 numbers. Provide your results in the form of a table below and provide a small summary. Provide source code, screenshot of at least one successful run and summary of the results in the following form (this table can be autogenerated or created manually) Array size time 10 10,000 10,000,000 Hint: You can use the following statements to calculate execution time. long begin, end, time; // we will measure time it took begin = System.nanoTime();//we measure in nanoseconds. end = System.nanoTime(); time = end-begin; Hint: You can use the following to generate random numbers: (int)(Math.random() * 101 * (Math.random() > 0.5 ? 1: -1)); Sample run: It took 1600 nanoseconds to find a minimum in the array of 10 elements. The minimum is: -83 It took 1600 nanoseconds to count even numbers in the array of 10 elements. There are 6 of them.
Transcribed Image Text:2. Write the following program: If the last digit of your unique real Kean ID is even, implement a program that randomly generates 10 integers from -100 to 100, stores them in an 1D array and finds their minimum value. Calculate the execution time of finding a minimum. Repeat the test for 10,000 and 10,000,000 numbers. Provide your results in the form of a table below and provide a small summary. If the last digit of your unique real Kean ID is odd, implement a program that randomly generates 10 integers from -100 to 100, stores them in an 1D array and find a number (count) of even numbers. Calculate the execution time of counting even numbers. Repeat the test for 10,000 and 10,000,000 numbers. Provide your results in the form of a table below and provide a small summary. Provide source code, screenshot of at least one successful run and summary of the results in the following form (this table can be autogenerated or created manually) Array size time 10 10,000 10,000,000 Hint: You can use the following statements to calculate execution time. long begin, end, time; // we will measure time it took begin = System.nanoTime();//we measure in nanoseconds. end = System.nanoTime(); time = end-begin; Hint: You can use the following to generate random numbers: (int)(Math.random() * 101 * (Math.random() > 0.5 ? 1: -1)); Sample run: It took 1600 nanoseconds to find a minimum in the array of 10 elements. The minimum is: -83 It took 1600 nanoseconds to count even numbers in the array of 10 elements. There are 6 of them.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 4 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS