Operating Systems and Networking Coursework Example | Topics and Well Written Essays - 1250 words

Operating Systems and Networking - Coursework Example the following fields: opcode: 8 bits ra: 6 bits rb: 6 bits rc: 6 bits rd: 6 bits where ra, rb, rc, specify three input registers and rd specifies one destination register. If there is a single register file to store the identifications of all registers, how many registers could there be in that register file? 1.3. A processor has 24 registers, uses 8-bit immediate, and has 36 different instructions (corresponding to 36 operation codes) in its instruction set. These 36 instructions are classified into 4 types as listed below: Assume that the ISA requires that all instructions be multiple of 8 bits (1 byte) in length, and the operation codes (opcodes) are fixed length. Answer the following questions and write down the calculation steps involved. Type C: 6 bits of the operation code, 5 bits for the source register, 8 bits of the immediate, and 5 bits of the destination register. This totals to 19 bits. These are rounded up again to 24 bits. 24 bits are equivalent to 3 bytes. Therefore 3 bytes are required to encode type c instruction. The pipelining diagram is used to show the execution of a series or a sequence of instructions of processes of a computer. In the diagram, the sequence of instructions is shown vertically; that is from the top to the bottom. As for the clock cycles, they are often shown in the horizontal; that is from the left to the right. Each and every instruction is divided into its component stages. There are 3 instructions. Suppose a non-pipelining processor took 50 Nano seconds to process one instruction, and then it would take 3 * 50 = 150 Nano seconds to complete all the instructions. However when pipelining is used, we instead have 4 segment pipeline with a clock cycle that takes at least 10 Nano seconds approximately. 2.2. Suppose we have a slightly more complex program with data dependency and branches. Assume that in the case of branching, the instruction following a branch is always executed. Note that a conditional branch

Applying Counting Method Speech or Presentation Example | Topics and Well Written Essays - 500 words

Applying Counting Method - Speech or Presentation Example At first we had 5 choices, then 4, and then 3.The total number of options was 5*4*3=60. We had to pick three pupils out of the five. To do this, we had to start with all the 5 options, then4, and, lastly, 3 when we ran out of the top three positions. The factorial for this is: 5! =5.4.3.2.1, but we only need 5*4*3 .So how do we get rid of 2*1? If we do 5!/2!, we get this: 5!/2!=5.4.3.2.1/2.1=5.4.3we used 2, because this is what remained after picking the top three positions. This can further be expressed as: 5! / (5-3)! This means that we use the first three numbers of 5! On the other hand, combination is very simple, since the order does not matter. Dog, cat, and a goat. Let’s figure out how many different ways these animals can be rearranged. We have 3 choices for the first animal, 2 for the second animal, and 1 for the last one. Therefore, we have 3*2*1 ways to rearrange the animals. Since there are 30 runners for the qualifier, the first run can be ran by all of them, the 2nd by 29, the 3rd by 28, the 4th by 27, and so on until the remaining individual is one in the track. Hence, the answer is 30