CS211 Assignment 2 Page 1 of 2 CS211: Computer Organisation Semester 1, 2010 Assignment #2 Due:00pm, Friday 14th May 2010 Solve the following...

CS211 Assignment 2 Page 1 of 2CS211: Computer OrganisationSemester 1, 2010Assignment #2Due: 5:00pm, Friday 14th May 2010Solve the following problems. Show all working where applicable.1. Simplify the following Boolean expression in its simplest form. You may need toexpand expressions at times with the aim to simplifying it in later steps. Ensure thateach simplification step is shown clearly before you arrive at your final answer.(x + y) (x + y ) ( x + z)2. Simplify the following Boolean expression in its simplest form. In this question, youare also required to state any Boolean identities you have used in each simplificationstep. Selected Boolean identities can be found in your lecture notes and textbook.(x + y) ( x + y )3. Given below is a timing diagram of a synchronous bus (Figure a) and some criticaltiming constraints (Figure b). Assume each bus cycle is 36 nsec and memory readstake 24 nsec. Using the diagrams, determine how much time the memory will have onthe worst case, to get the data onto the bus (data bus) after MREQ and RD have beenasserted. Explain your answer.4. You want to execute the following C++ statement on Mic1:A = (B + C) – D;What would be the minimum time (in nsec) taken to execute the above statement ifMic1 runs on a 300 MHz clock, assuming each microinstruction takes one clock cycleto complete? (Hint: you may first need to determine the corresponding IJVM code.)CS211 Assignment 2 Page 2 of 25. You have seen the IJVM POP instruction and microcode in Mic1. Write microcode(microinstructions) for POP2, an instruction that removes the top two words from thestack.6. Currently there are no IJVM instructions to multiply two numbers. You can howeveruse existing instructions to multiply top two numbers on stack. Assume that twopositive numbers are placed on the stack. Write IJVM code that will remove these toptwo words, multiply and put their product back on the stack. You are allowed to useexisting IJVM instructions only. Include appropriate comments in your code.7. Assume the factorial function is defined as:0 for n < 0n! = 1 for n = 0n × (n-1) × (n-2) × … × 1 for n ≥ 1Write an IJVM code segment that takes an integer value, n, provided on the stack andcalculates the factorial of that value as shown above. The factorial calculated shouldbe left on the stack. Assume IMULT instruction (that pops top two words off the stackand pushes its product back on the stack) also exists together with the standard IJVMinstructions which you can use. Include appropriate comments in your code.