0% found this document useful (0 votes)
14 views9 pages

Coding Question 1 Test 1

The document outlines several coding challenges involving different scenarios such as managing a candy jar, recording oxygen levels for trainees, estimating washing machine times based on weight, implementing a Caesar cipher, and calculating bus fares in a circular route. Each challenge includes specific input and output requirements, along with constraints and examples. The tasks require implementing functions to handle user inputs, validate them, and produce the expected outputs while adhering to the given conditions.

Uploaded by

ramtandan1982
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
14 views9 pages

Coding Question 1 Test 1

The document outlines several coding challenges involving different scenarios such as managing a candy jar, recording oxygen levels for trainees, estimating washing machine times based on weight, implementing a Caesar cipher, and calculating bus fares in a circular route. Each challenge includes specific input and output requirements, along with constraints and examples. The tasks require implementing functions to handle user inputs, validate them, and produce the expected outputs while adhering to the given conditions.

Uploaded by

ramtandan1982
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

CODING

There is a JAR full of candies for sale at a mall counter. JAR has the
capacity N,

that is JAR can contain maximum N candies when JAR is full. At any point
of time.

JAR can have M number of Candies where M<=N. Candies are served to
the

customers. JAR is never remain empty as when last k candies are left. JAR
if

refilled with new candies in such a way that JAR get full.

Write a code to implement above scenario. Display JAR at counter with


available

number of candies. Input should be the number of candies one customer


can order

at point of time. Update the JAR after each purchase and display JAR at
Counter.

Output should give number of Candies sold and updated number of


Candies in

JAR.

If Input is more than candies in JAR, return: ―INVALID INPUT‖

Given,

N=10, where N is NUMBER OF CANDIES AVAILABLE

K =< 5, where k is number of minimum candies that must be inside JAR


ever.

Example 1:(N = 10, k =< 5)

Input Value

Output Value

NUMBER OF CANDIES SOLD : 3

NUMBER OF CANDIES AVAILABLE : 7

Example : (N=10, k<=5)

Input Value
0

Output Value

INVALID INPUT

NUMBER OF CANDIES LEFT : 10

Question 2

Selection of MPCS exams include a fitness test which is conducted on


ground.

There will be a batch of 3 trainees, appearing for running test in track for
3 rounds.

You need to record their oxygen level after every round. After trainee are
finished

with all rounds, calculate for each trainee his average oxygen level over
the 3

rounds and select one with highest oxygen level as the most fit trainee. If
more

than one trainee attains the same highest average level, they all need to
be

selected.

Display the most fit trainee (or trainees) and the highest average oxygen
level.

Note:

1. The oxygen value entered should not be accepted if it is not in the


range

between 1 and 100.

2. If the calculated maximum average oxygen value of trainees is below


70 then

declare the trainees as unfit with meaningful message as ―All trainees


are

unfit‖

3. Average Oxygen Values should be rounded.

Example 1:
INPUT VALUES

95

92

95

92

90

92

90

92

90

OUTPUT VALUES

Trainee Number : 1

Trainee Number : 3

Note:

Input should be 9 integer values representing oxygen levels entered in


order as

Round 1

Oxygen value of trainee 1

Oxygen value of trainee 2

Oxygen value of trainee 3

Round 2

Oxygen value of trainee 1

Oxygen value of trainee 2

Oxygen value of trainee 3

Round 3

Oxygen value of trainee 1

Oxygen value of trainee 2

Oxygen value of trainee 3

Output must be in given format as in above example. For any


wrong input
final output should display “INVALID INPUT”

Question 3

CODING:

Q1. WASHING MACHINE A Washing Machine works on the principle of a


Fuzzy

system, the weight of clothes put inside it for wash is uncertain. But based
on

weight measured by sensors, it decides time and water levels which can
be changed

by menus given on the machine control area. For low Water level, time
estimate is

25 minutes, where approximate weight is 2000 grams or any non-zero


positive

number below that.

For Medium Water level, time estimated is 35minutes, where approximate


weight is

between 2001 grams and 4000 grams. For High Water level, time
estimated is 45

Minutes, where approximate weight is above 4000 grams. Assume the


Capacity of

the Machine is maximum 7000 grams. Where the approximate weight is


zero, the
time estimate is 0 minutes. Write a function which takes numeric weight in
the

range [0,7000] as input and produces estimated time as output; if input is


more

than 7000, then output is: "OVERLOADED!", and for all other inputs, the
output

statement is "INVALID INPUT‖.

Input should be in the form of integer value –

<integer>

Output must have the following format - TimeEstimated: Minutes TCS

Example 1

Input Value

2000

Output Value

Time Estimated: 25 Minutes

Questionn 4
Q2. Caesar Cipher The Caesar cipher is a type of substitution cipher in
which each

alphabet in the plaintext or message is shifted by a number of places


down the

alphabet.

For example, with a shift of 1, P would be replaced by Q, Q would become


R, and so

on.

To pass an encrypted message from one person to another, it is first


necessary that
both parties have the 'key' for the cipher, so that the sender may encrypt
it and the

receiver may decrypt it.

the key is the number of OFFSETs to shift the cipher alphabet. Key can
have basic

shifts from 1 to 25 positions as there are 26 total alphabets.

As we are designing custom Caesar Cipher, in addition to alphabets, we


are

considering numeric digits from 0 to 9. Digits can also be shifted by key


places.

For example, if given plain text contains any digit with value 5 and key =
2, then 5

will be replaced by 7. ―-‖ (Minus sign) will remain as it is. Key value less
than 0

should result into "INVALID INPUT"

Example 1:

Input:

Enter your PlainText: All the Best

Enter the Key: 1

Output:

The encrypted Text is: Bmm uif Cftu

Write a function customCaesarCipher(int key, String message) which will


accept

plaintext and key as input parameters and returns its cipher text as
output.

Exterior walls

3. Surface Area of each Interior Wall in units of square feet

4. Surface Area of each Exterior Wall in units of square feet

If a user enters zero as the number of walls then skip Surface area values
as User

may don‘t want to paint that wall.


Calculate and display the total cost of painting the property

Example 1:

12.3

15.2

12.3

15.2

12.3

15.2

10.10

10.10

10.00

Total estimated Cost : 1847.4 INR

Note: Follow in input and output format as given in above example

Question 5
A City Bus is a Ring Route Bus which runs in circular fashion.That is, Bus
once

starts at the Source Bus Stop, halts at each Bus Stop in its Route and at
the end it
reaches the Source Bus Stop again.

If there are n number of Stops and if the bus starts at Bus Stop 1, then
after nth

Bus Stop, the next stop in the Route will be Bus Stop number 1 always.

If there are n stops, there will be n paths.One path connects two stops.
Distances

(in meters) for all paths in Ring Route is given in array Path[] as given
below:

Path = [800, 600, 750, 900, 1400, 1200, 1100, 1500]

Fare is determined based on the distance covered from source to


destination stop

as Distance between Input Source and Destination Stops can be measured


by

looking at values in array Path[] and fare can be calculated as per


following criteria:

If d =1000 metres, then fare=5 INR

(When calculating fare for others, the calculated fare containing any
fraction value

should be ceiled. For example, for distance 900n when fare initially
calculated is

4.5 which must be ceiled to 5)

Path is circular in function. Value at each index indicates distance till


current stop

from the previous one. And each index position can be mapped with
values at same

index in BusStops [] array, which is a string array holding abbreviation of


names

for all stops as-

―THANERAILWAYSTN‖ = ‖TH‖, ―GAONDEVI‖ = ―GA‖, ―ICEFACTROY‖ =


―IC‖,

―HARINIWASCIRCLE‖ = ―HA‖, ―TEENHATHNAKA‖ = ―TE‖, ―LUISWADI‖ =


―LU‖,

―NITINCOMPANYJUNCTION‖ = ―NI‖, ―CADBURRYJUNCTION‖ = ―CA‖


Given, n=8, where n is number of total BusStops.

BusStops = [ ―TH‖, ‖GA‖, ‖IC‖, ‖HA‖, ‖TE‖, ‖LU‖, ‖NI‖,‖CA‖ ]

Write a code with function getFare(String Source, String Destination)


which take

Input as source and destination stops(in the format containing first two
characters

of the Name of the Bus Stop) and calculate and return travel fare.

Example 1:

Input Values

ca

Ca

Output Values

INVALID OUTPUT

Example 2:

Input Values

NI

HA

Output Values

23.0 INR

Note: Input and Output should be in format given in example.

Input should not be case sensitive and output should be in the format
<FLOAT>

INR

Solution in Python:

You might also like