Programming Problem (Selection)

Given: To locate the nearest numbered cross street for a given avenue address, the following algorithm can be used: cancel the last diget of the address, divide by 2, and add or subtract the number given in the following abbreviated table: 1st Ave. add 3 2nd Ave. add 3 3rd Ave. add 10 4th Ave. add 8 5th Ave. up to 200 add 13 5th Ave. up to 400 add 16 6th Ave. (Ave. of the Americas) Subtract 12 7th Ave. add 12 8th Ave. add 10 10 Ave. ... click for more

Programming Problems (Selection)

Write a function convertLength() that receives a real value and two strings inUnits and outUnits, then converts the value given in inUnits to the equivalent metric value in outUnits and displays this value. The function should carry out the following conversions: inUnits outUnits I c (inches to centimeters; 1 in. = 2.54001 cm) F c (feet to centimeters; 1 ft = 30.4801cm) F m (feet to meters; 1 ft = 0.304801 m) Y m (yards to meters; 1 yd = 0.914402 m) M k (miles to kilometers; 1 mi = 1.60935 km) Also wri... click for more

Programming Problem (Selection)

An airline vice president in charge of operations needs to determine whether the current estimates of flight times are accurate. because there is a larger possiblity of variations due to wether and air traffic in the longer flights, he allows a larger error in the time estimates for them. He compares an actual flight time with the estimated flight time and considers the estimate to be too large, acceptable, or too small, depending on the following table of acceptable error margins: Estimated flight time in minutes Acceptable error margin in minutes 0-29 1 30-59 2 60-89 ... click for more

Assembly Language Programming

Write a program using the mov instruction to produce the following results. Assemble and debug the problem. 1. Move the contents of register AX to registers BX, SI, and DS. 2. Move the word contents of memory location DS:1234h to memory location DS:5678h. 3. Store the number 5678h in memory location DS:2000h using indirect addressing only. 4. Store the number 1234h in absolute memory address 60000h.

Procedures

Create a stack area at 1000h. Push 10h bytes, located at data memory addresses 60000h to 6000fh, on the stack using indirect addressing. Then pop the stack to memory addresses 62000h to 6200fh using indirect addressing. Load unique data into the 10h bytes in order to test the program.