logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

write Algorithm and Java program. Write the algorithm on plain paper by hand

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Choose any one Question below.

For this question, write Algorithm and Java program. Write the algorithm on plain paper by hand. Then do the program in Moovit.vit.ac.in. After that, write the program also by hand on the paper. Submit the handwritten one as answer to Test 1 on VTOP.

Question 1: (Higher difficulty)

A shoe shop sells some types of shoes and some types of socks. Each type may have different price. A customer comes and wants to buy one pair of shoes and one pair of socks with a total money of Rs.2000. The selection is done as below:

• Select any pair of shoe and any pair of socks. Find the sum of prices.

·

Do the above for every possible combination of shoe and socks.

· Find the set which has the sum of prices that is less than or equal to 2000 and is closest to 2000. That is the selected set.

Example: suppose that there are 3 pairs of shoe and 3 pairs of socks. Their prices are (1)1000, (2)1500 and (3)1800; and (1a) 300, (2a) 400 and (3a)500. The selected set is (2),(3a) which has total of 2000.

Write a Java program which achieves the above task. Create separate arrays for shoe and socks and take inputs. To find the set with closest price, find total price of each pair and find the difference from 2,000. Find the minimum of those. Store the option numbers of SHOE and SOCKS for the set in a temporary array of two elements.

Question 2: (Lower difficulty)

Marks for N students are available. Normalized marks need to be calculated.

Normalized marks= marks obtained/highest marks of all students.

Write a Java program that takes input for marks of N students and stores in an array. Then the program calculates the normalized marks and stores in another array and prints that array.

 

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

517 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

611 Answers

Hire Me
expert
Husnain SaeedComputer science

681 Answers

Hire Me
expert
Atharva PatilComputer science

609 Answers

Hire Me
June
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30