Write a function to search through an array “X” of “N” words to find the minimum and maximum values. The parameters &X and N are passed to the function on the stack, and the minimum and maximum values are returned on the stack. (Show how MinMax is called)
6.2 Search (&X, N, V, L)
Write a function to sequentially search an array X of N bytes for the relative location L of a value V. The parameters &X, N, and V are passed to the function on the stack, and the relative location L (a number ranging from 1 to N) is returned on the stack. If the value V is not found, the value -1 is returned for L.
6.3 Scan (&X, N, U, L, D)
Write a function to scan an array “X” of “N” bytes counting how many bytes are ASCII codes for:
a. upper case letters - U
b. lower case letters - L
c. decimal digits - D
Return the counts on the stack. The address of the array and the number of bytes N will be passed to the function on the stack. Write a short main program to test this function.
6.4 Hypotenuse (A, B, H)
This is an exercise in calling nested functions and passing parameters on the stack. Write a function to find the length of the hypotenuse of a right triangle whose sides are of length A and B. Assume that a math library function
“sqr(V, R)” is available, which will compute the square root of any positive value V, and return the square root result R. Write a main program to test this function.
6.5 AVA (&X, &Y, &Z, N, status)
Write a function to perform an absolute value vector addition. Use the stack to pass parameters. The parameters are the starting address of three different word arrays (vectors) : X, Y, Z, and an integer value N specifying the size of the vectors. If overflow ever occurs when executing this function, an error status of “1” should be returned and the function aborts any further processing. Otherwise, return the value “0” for status. The function will perform the vector addition:
Xi = | Yi | + | Zi | ; with i going from 0 to N - 1.
Also write a main program to test this function.
6.6 Fibonacci (N, E)
Write a function to return the N th element in the Fibonacci sequence. A value N is passed to the function on the stack, and the N th Fibonacci number E is returned on the stack. If N is greater than 46 overflow will occur, so return a value of 0 if N is greater than 46. Also show an example of calling this function to return the 10th element in the sequence. The first few numbers in the Fibonacci sequence are: 0, 1, 1, 2, 3, 5 . . . .
6.7 BubSort (&X, N)
Write a function to sort an array “X” of “N” words into ascending order using the bubble sort algorithm. The address of the array and the value N will be passed to the function on the stack. Show how the sort function is called.
6.8 RipSort (&X, N)
Write a function to sort an array “X” of “N” words into ascending order using the ripple sort algorithm. The address of the array and the value N will be passed to the function on the stack.
6.9 Roots (a, b, c, Status, R1, R2)
This is an exercise in nested function calls and passing parameters on the stack.
Write a function to calculate the roots of any quadratic equation of the form
y = ax2 + bx + c where the integer values a, b, and c are passed to the function on the stack. Status should indicate the nature of the results returned as indicated below:
0 : 2 real roots R1 & R2
1 : 1 real root in R1= -a/b
2 : 2 complex roots of the form (R1 + i R2)
3 : no roots computed (error)
Assume a math library function “sqrt” is available, that will compute the square root of a positive argument.
Why did the scientist install a knocker on his door?
To win the no bell prize.
It is important that all shared operating system functions and library functions on a multi-tasking computer system be reentrant. One example of a multi-tasking system would be a time-sharing system. A time-sharing system is one where multiple users are sharing the computer’s resources. These users are given the illusion that the computer is immediately responsive to every keystroke they make at their keyboards. In reality, every active user is given a slice of time to utilize the computer’s resources. This is accomplished by having a real-time clock generator connected to the interrupt system. If the real-time clock produces an interrupt every one hundredth of a second, then 100 completely different tasks could be running on the machine with each task running for one hundredth of a second every second. If this is a computer that executes one million instructions per second, then every task could theoretically be executing nearly ten thousand instructions per second. It may appear that 100 different tasks are running “simultaneously,” but in reality each task is running for a fraction of a second every second. When the real-time clock produces an interrupt the current address in the Program Counter (PC) is saved in a special register called EPC and then the Program Counter is loaded with the address of the interrupt processing routine. The first thing this routine does is to save the contents of any registers it will be using to handle the interrupt. Before returning back to this same user these register are restored to their original values. See Chapter 8 for more details.
Let’s suppose that fifty users of a time-share system are all using the same compiler or text-editor “simultaneously.” Does this mean that fifty separate copies of the text-editor must be loaded into memory, or only one copy? The answer is only one copy, if the developers of the compiler and the text-editor insured that the code was reentrant.