1. A computer system consisting of 64 GB main memory and 32 MB cache memory. The cache uses 128-bits word and the memory system is organized in bytes. a. Determine the format of the main memory address using the direct mapping. Show the calculation. b. Determine the format of the main memory address using the associative mapping. Show the calculation. c. Determine the format of the main memory address using 4-way set associative mapping. Show the calculation. 1. Suppose an 8-bit data word stored in memory is 11001100, while data read from memory is 11011100. a. Using formula 2K - 1 > M+K, determine how many check bits would be stored in the memory together with the data bits. Starts with K=1. b. Using the Hamming algorithm, determine what check bits would be stored in memory. Using the Hamming algorithm, determine what check bits would be read in memory. d. Find the bit position error for the data word read from the memory. 1. Suppose a computer has 500 Mbytes memory for user programs, three jobs are submitted at the same time with the attributes listed below: Type of job duration Memory required Need disk Need printer Job1 Heavy compute 10 min 180 M No No Job2 Heavy I/O 25 min 290 M Yes No Job3 Heavy I/O 15 min 170 M No Yes Compute the Throughput per hour and per day and the Elapsed time if the jobs run under uniprogramming and under multiprogramming system? 2. In a batch operating system, three jobs J1, J2 and J3 are submitted for execution. Each job involves an 1/0 activity, a CPU time, and another 1/0 activity. Job 1 requires a total of 23 ms, with 3 ms CPU time. J2 requires 29 ms total time with 5 ms CPU time. J3 requires 14 ms total time with 4 ms CPU time. Illustrate their execution and find CPU utilization for uniprogramming and multiprogramming? 3. A process references five pages, A, B, C, D, and E, in the following order: A; B; C; D; A; B;E; A; B; C; D; E Assume that the replacement algorithm is first-in-first-out (FIFO) and find the number of page transfers during this sequence of references starting with an empty main memory with three page frames. (12 Marks) Chapter 12: Instruction Sets 1. Convert the following expressions to postfix notation. a) x = (X * Y + W * 2) + V *W b) x = (W * X) +W* (U * V + 2) x= (A + B) C* D - E 2. Refer to the above equation, please answer all questions below. a) Translate the expression to postfix expression and write a program with zero-address instructions (instruction and comment). b) Write a program with one-address instructions (instruction and comment). c) Write a program with two-address instructions (instruction and comment). d) Write a program with three-address instructions (instruction and comment)