You are building a system around a single-issue in-order processor running at 1 ghz and the processor has a base cpi of 1 if all memory accesses are hits. the only instructions that read or write data from memory are loads (20% of all instructions) and stores (5% of all instructions). the memory system for this computer is composed of a split l1 cache that imposes no penalty on hits. both the i-cache and d-cache are direct mapped and hold 32kb each. you may assume the caches use write-allocate and write-back policies. the l1 i-cache has a 2% miss rate and the l1 d-cache has a 5% miss rate. also, 50% of all blocks replaced from l1 d-cache are dirty. the 512kb write-back, unified l2 cache has an access time of 10ns. of all memory references sent to the l2 cache in this system, 80% are satisfied without going to main memory. also 25% of all blocks replaced are dirty. the main memory has an access latency of 60ns.
a. what is the overall cpi, including memory accesses?
b. you are considering replacing the 1 ghz cpu with one that runs at 2 ghz, but is otherwise identical. how much faster does the system run with a faster processor? assume the l1 cache still has no hit penalty, and that the speeds of the l2 cache, and main memory remain the same in absolute terms (e. g. the l2 cache still has a 10 ns access time).

Write code using c . (take input from user) calculate the size of a given file in kbs. in this task you will complete the function with the following prototype: float get_file_size(char * filename); the function takes the file name (address to the start of a null terminated character array) as input. the function should then open the file and find the number of bytes it contains till eof. the number of bytes divided by 1024 will give the size in kbs. if the file cannot be opened the function should return -1.

For this assignment you have to write a c program that will take an infix expression as input and display the postfix expression of the input. after converting to the postfix expression, the program should evaluate the expression from the postfix and display the result. what should you submit? write all the code in a single file and upload the .c file. compliance with rules: ucf golden rules apply towards this assignment and submission. assignment rules mentioned in syllabus, are also applied in this submission. the ta and instructor can call any students for explaining any part of the code in order to better assess your authorship and for further clarification if needed. problem: we as humans write math expression in infix notation, e.g. 5 + 2 (the operators are written in-between the operands). in computer's language, however, it is preferred to have the operators on the right side of the operands, ie. 5 2 +. for more complex expressions that include parenthesis and multiple operators, a compiler has to convert the expression into postfix first and then evaluate the resulting postfix write a program that takes an "infix" expression as input, uses stacks to convert it into postfix expression, and finally evaluates it. it must support the following operations: + - / * ^ % ( example infix expression: (7-3)/(2+2) postfix expression: 7 3 2 2 result: rubric: 1) if code does not compile in eustis server: 0. 2) checking the balance of the parenthesis: 2 points 3) incorrect postfix expression per test case: -2 points 4) correct postfix but incorrect evaluation per test case: -i points 5) handling single digit inputs: maximum 11 points 6) handling two-digit inputs: 100 percent (if pass all test cases)

Quick pl which one of the following is considered a peripheral? a software b mouse c usb connector d motherboard