Develop a program that, given a sequence S of integers as input, produces as output two sequences of positive integers, the first of which indicates all those positions in S at which S's minimum value occurs and the second of which indicates all those positions at which S's maximum value occurs. Positions are numbered starting at zero (0).

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...
icon
Related questions
Question

Please code in java and follow the instructions as it is.. Dont use very advanced methods. Refer the images provided for the scope and sample input and output

Develop a program that, given a sequence S of integers as input, produces as output two sequences of positive integers, the first of which indicates all those positions in S at which S's minimum value occurs and the second of which indicates all those positions at which S's maximum value occurs. Positions are numbered starting at zero (0).
Facts
Scanner has a method that returns a boolean indicating whether a next integer exists in its input stream ( hasNextInt () )
• Scanner objects can be initialized to to scan String data as input.
Input
The input will begin with a single line containing T, the number of test cases to follow. The remaining lines contain the T sequences, one line per sequence. Each of these lines contains the values in the sequence. Each such value is separated from the next by at least one space.
Output
For each sequence given as input, there should be four lines of output. The first line echos the given sequence. The second line indicates the positions at which the minimum value occurs.
The third line indicates the positions at which the maximum value occurs. The fourth line is blank.

Sample Input
3
36-14653
0000
-4 45 2 0 3 5 11 -7 854 25 3-74-3
Sample Output
36-1465 3
2
14
0000
0123
0123
-4 45 2 0 3 5 11 -7 854 25 3-74-3
711
8
Transcribed Image Text:Sample Input 3 36-14653 0000 -4 45 2 0 3 5 11 -7 854 25 3-74-3 Sample Output 36-1465 3 2 14 0000 0123 0123 -4 45 2 0 3 5 11 -7 854 25 3-74-3 711 8
P1 Concepts
P2 Solutions limited in scope to:
Selection statements
O
O
O
single selection
double selection
multi-selection
Repetition statements
O
counter controlled loops
sentinel controlled loops
Transcribed Image Text:P1 Concepts P2 Solutions limited in scope to: Selection statements O O O single selection double selection multi-selection Repetition statements O counter controlled loops sentinel controlled loops
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps

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