Digital Root  
DescriptionThe digital root of a number is obtained by summing its individual digits, summing those individual digits, and continuing the process until the final sum is a single digit (that is, less than 10). For example, the digital root of 1234 is 1. That result is calculated as: 1 + 2 + 3 + 4 = 10 1 + 0 = 1 Detail Requirements
Test Data


Line Up  
DescriptionA group of boys and girls line up by height in separate classrooms – boys in one room and girls in a different room. Eventually they must be merged into one line arranged by height with the shortest student first. You need to write an application that merges a list containing the heights of the girls with a list containing the heights of the boys. Detail Requirements
Test Data


I’m Out of Gas  
DescriptionA driver has run out of gas in a large city. Fortunately the city area is laid out in a grid and maps exactly to a Cartesian coordinate system. “Streets” run northsouth and “Avenues” run eastwest. Each block is exactly the same distance. Each street is numbered in order from the x axis with “West” indicating the street is west of the axis and “East” indicating it is east of the axis. The y axis is Main Street so West 9th Street is 9 blocks west of Main Street. Each Avenue is also numbered in order from the y axis with “North” indicating the avenue is north of the y axis and “South” indicating it is south of the y axis. The x axis is Main Avenue. So South 14th Avenue is 14 blocks south of Main Avenue. The city center is at the intersection of Main Street and Main Avenue. These are pedestrian walkways so there are no gas stations located on Main Street or Main Avenue. In addition the driver can never be stranded there because you can’t drive on these streets. The driver can always determine his closest street intersection by looking at the street signs. The driver also has a cell phone but it is not a smart phone (due to the expense). The driver can call directory assistance and get the phone numbers of gas stations in the area and then call the gas stations to get their nearest street intersection. Help the driver by finding the closer of two gas stations. Remember this is a city so you cannot walk diagonally through buildings. You must walk in straight lines east or west on Streets and north or south on Avenues. Detail Requirements
Test Data


Treasure Hunt  
DescriptionSearch an array to discover a hidden treasure. The clues for the location of the treasure are contained in the array. You are given a 5 by 5 array filled with integers. Each element in the array will contain an integer value between 11 and 55. Starting with the first cell (row 1, column 1), use the value found there to locate the next clue. The value in the cell is the next cell you should “visit”. The tens position of the value is the row and the ones position of the value is the column. A value of 35 would indicate the next clue is in row 3 column 5. Access that cell and look for another clue. Continue following the clues until the cell you visit has a value that is equal to its location in the array. For example, the cell at row 4 column 2 has a value 42. That is the cell with the treasure. Display the row and column for each cell you visit as well as the cell that has the treasure. Detail Requirements


Let’s Go Bowling!  
DescriptionProcess a stream of numbers representing the scores from a game of bowling. Scoring in bowling is done by counting the number of pins toppled with each roll of a ball. Bowling has 10 “frames” or opportunities to score ten points. Each frame starts with ten pins upright. The player has the opportunity to roll a ball twice per frame with the goal of knocking down the ten pins. The score for each frame is the number of pins knocked down. In addition the following scoring rules exist.
Failure to get a strike or a spare in a frame results in what is called an “open” frame. It is possible to throw a “gutter ball” knocking down zero pins and get a score of 0. Detail Requirements
Enter next score: 6
Test Data


Bananas  
DescriptionA group of passengers are shipwrecked on a deserted island. They immediately start gathering bananas for food. The plan is to share the bananas equally. During the first night on the island one of the passengers decides to take his share so he divides the bananas into equal piles based on the number of passengers. One banana was left over which he decided to give to a nearby monkey. He then hid his share of the bananas, put the other bananas back, and then went back to sleep. Shortly another passenger woke up and did the same thing. In fact, each passenger woke up and did the same thing. The next morning when everyone woke up, they divided the remaining bananas equally and had none left over. Assuming there were 25 bananas initially, we can find there were 3 shipwrecked passengers using the following process.
We know there could not be 4 passengers as the process would not leave exactly one banana for the monkey when the second passenger divides up the remaining 19 bananas. This is shown below.
In this problem you will be given the initial number of bananas collected. You have to determine the maximum number of passengers that could have been shipwrecked following the same procedure. Remember to include the bananas for the monkey. It is possible that no solution exists. In that case display “no solution exists”. Detail Requirements
Test Data


Spy Talk  
DescriptionOne of the little known strategies of covert CIA agents is that they can identify each other in the field using a secret strategy. When they meet each other, the first covert agent will say a greeting to the second, who must respond using words that contain only letters that appear in the original greeting. In this problem you will be given a greeting and a response. You must determine if the response identifies a CIA spy. Detail Requirements
Test Data


Broken Remote Control  
DescriptionThe TV remote control is broken. Only certain buttons work. You must write an application that determines the minimum number of button pushes necessary to move from one channel to the next. The TV channels go from 1 to 9999. The user will enter the starting channel and the ending channel as well as which buttons work. Detail Requirements
Test Data

William Gaught
Program Manager
Phone: 407.708.2447
Fax: 407.708.2322
Office: V102D