MARS
ROVER PROBLEM
A squad of robotic rovers are to be landed by NASA on a
plateau on Mars. This plateau, which is curiously rectangular, must be
navigated by the rovers so that their on-board cameras can get a complete view
of the surrounding terrain to send back to Earth. A rover’s position and
location is represented by a combination of x and y co-ordinates and a letter
representing one of the four cardinal compass points. The plateau is divided up
into a grid to simplify navigation. An example position might be 0, 0, N, which
means the rover is in the bottom left corner and facing North. In order to
control a rover, NASA sends a simple string of letters. The possible letters
are ‘L’, ‘R’ and ‘M’. ‘L’ and ‘R’ makes the rover spin 90 degrees left or right
respectively, without moving from its current spot. ‘M’ means move forward one
grid point, and maintain the same heading. Assume that the square directly
North from (x, y) is (x, y+1).
INPUT:
The first line of input is the upper-right coordinates of the plateau, the lower-left coordinates are assumed to be 0,0. The rest of the input is information pertaining to the rovers that have been deployed. Each rover has two lines of input. The first line gives the rover’s position, and the second line is a series of instructions telling the rover how to explore the plateau. The position is made up of two integers and a letter separated by spaces, corresponding to the x and y co-ordinates and the rover’s orientation. Each rover will be finished sequentially, which means that the second rover won’t start to move until the first one has finished moving.
The first line of input is the upper-right coordinates of the plateau, the lower-left coordinates are assumed to be 0,0. The rest of the input is information pertaining to the rovers that have been deployed. Each rover has two lines of input. The first line gives the rover’s position, and the second line is a series of instructions telling the rover how to explore the plateau. The position is made up of two integers and a letter separated by spaces, corresponding to the x and y co-ordinates and the rover’s orientation. Each rover will be finished sequentially, which means that the second rover won’t start to move until the first one has finished moving.
OUTPUT
The output for each rover should be its final co-ordinates and heading.
The output for each rover should be its final co-ordinates and heading.
INPUT AND OUTPUT
Test Input:
5 5
1 2 N
LMLMLMLMM
3 3 E
MMRMMRMRRM
5 5
1 2 N
LMLMLMLMM
3 3 E
MMRMMRMRRM
Expected Output:
1 3 N
5 1 E
==========
1 3 N
5 1 E
==========
GAME
OF LIFE PROBLEM
The universe of the Game of Life is an infinite two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, live or dead. Every cell interacts with its eight neighbours, which are the cells that are directly horizontally, vertically, or diagonally adjacent. At each step in time, the following transitions occur:
Any live cell with fewer than two live neighbours dies,
as if by loneliness.
Any live cell with more than three live neighbours dies,
as if by overcrowding.
Any live cell with two or three live neighbours lives,
unchanged, to the next generation.
Any dead cell with exactly three live neighbours comes to
life.
The initial pattern constitutes the 'seed' of the system.
The first generation is created by applying the above rules Simultaneously to
every cell in the seed — births and deaths happen simultaneously, and the
discrete moment at which this happens is sometimes called a tick. (In other
words, each generation is a pure function of the one before.) The rules
continue to be applied repeatedly to create further generations.
Problem:
The inputs below represent the cells in the universe as X or - . X is a alive cell. - is a dead cell or no cell. The below inputs provide the provide pattern or initial cells in the universe. The output is the state of the system in the next tick (one run of the application of all the rules), represented in the same format.
-------------------------------------------------------------------------------------------
Input A:
(Block pattern)
X X
X X
Output A:
X X
X X
-------------------------------------------------------------------------------------------
Input B
(Boat pattern)
X X -
X - X
- X -
Output B
X X -
X - X
- X -
-------------------------------------------------------------------------------------------
Input C
(Blinker pattern)
- X -
- X -
- X -
Output C
- - -
X X X
- - -
-------------------------------------------------------------------------------------------
Input D
(Toad pattern)
- X X X
X X X -
Output D
- - X -
X - - X
X - - X
- X - -
==============================================
Problem:
The inputs below represent the cells in the universe as X or - . X is a alive cell. - is a dead cell or no cell. The below inputs provide the provide pattern or initial cells in the universe. The output is the state of the system in the next tick (one run of the application of all the rules), represented in the same format.
-------------------------------------------------------------------------------------------
Input A:
(Block pattern)
X X
X X
Output A:
X X
X X
-------------------------------------------------------------------------------------------
Input B
(Boat pattern)
X X -
X - X
- X -
Output B
X X -
X - X
- X -
-------------------------------------------------------------------------------------------
Input C
(Blinker pattern)
- X -
- X -
- X -
Output C
- - -
X X X
- - -
-------------------------------------------------------------------------------------------
Input D
(Toad pattern)
- X X X
X X X -
Output D
- - X -
X - - X
X - - X
- X - -
==============================================
SALES TAXES PROBLEM
Basic sales tax is applicable at a rate of 10% on all
goods, except books, food, and medical products that
are exempt. Import duty is an additional sales tax
applicable on all imported goods at a rate of 5%, with
no exemptions.
When I purchase items I receive a receipt which lists the
name of all the items and their price (including
tax), finishing with the total cost of the items, and the
total amounts of sales taxes paid. The rounding
rules for sales tax are that for a tax rate of n%, a
shelf price of p contains (np/100 rounded up to the
nearest 0.05) amount of sales tax.
Write an application that prints out the receipt details
for these shopping baskets...
INPUT:
Input 1:
1 book at 12.49
1 music CD at 14.99
1 chocolate bar at 0.85
Input 2:
1 imported box of chocolates at 10.00
1 imported bottle of perfume at 47.50
Input 3:
1 imported bottle of perfume at 27.99
1 bottle of perfume at 18.99
1 packet of headache pills at 9.75
1 box of imported chocolates at 11.25
OUTPUT
Output 1:
1 book : 12.49
1 music CD: 16.49
1 chocolate bar: 0.85
Sales Taxes: 1.50
Total: 29.83
Output 2:
1 imported box of chocolates: 10.50
1 imported bottle of perfume: 54.65
Sales Taxes: 7.65
Total: 65.15
Output 3:
1 imported bottle of perfume: 32.19
1 bottle of perfume: 20.89
1 packet of headache pills: 9.75
1 imported box of chocolates: 11.85
Sales Taxes: 6.70
Total: 74.68