Need Help ?

Expert Answers

(Solved): . 10. 130 marks] Write a program that obtains the execution ...


. 10. 130 marks] Write a program that obtains the execution times for the following three code segments with the different m code I x-i code 2: for {int i 0; i cena i++) for (int -ni+4 code 3: for (inti-0: for (int-0 n + Please record the execution time of the following tasks, Code when n-100, 1000, n 5,000, n 10,000, n100,000, n-1000,000, n 2,000,000, and n-10,000,000 Code 2 wbcn t-100, ?-1,000. ?-5,D00.?-10,000..-100,000, and n-200,000 Code 3 when n-10, m-50, n-100, n-500, and n- ,000 You can fill a table like this n-10 l n-50 1 n 100 n2001 n10001… Code 1 Code 2 Code 3 Plotting the execution time of Code 1, Code 2 and Code 3. You may want to execute Codel, Code2 and Code 3 with more n values to plot You can use the following code templase to obtain the execution time. include ciostrean: inelude cetin for time funet ion include <chrono> vold get tine codel (int using clock chronoisteady clock elock:stime point start-clock: snOWDGet start tine perform the task Code 1 which you want to analyze the // execution ine int 0 elock:stime point end- elock: snow/Get end tine clock:sduration tine span - end -start double ns-double(tine span.count ) clock:sperLod: snun / clock: :perlod:sdenYou can use the Sollowing code templatie to obeain the execution time include ciostrea include <etine i tor tine tunet on inelude cchrono void get tine code1 (int n) using clock- chronosssteady clocka clockistine point start-clockz snow)/Get start tine // perforn the task Code 1 which you want to analyze the // exeeutson tme nt0 for (int -0i -1 clock:stine point end- clocks snow: //Get end tine clock;:4uration time-span-end-#tart; double ns double ttime span.count ) clockssperiod: num clock::period: sdenz cout << Code 1 execution time for n-<<n i <ns seconds endl You ean put all functions in the le alglospp Please submit the peogram alg10.cpp, a seript file algl0zesult cetaining result, and the plot of execution time. 10. 130 marks] Write a program that obtains the execution times for the following three code segments with the different m code I x-i code 2: for {int i " 0; i cena i++) for (int -ni+4 code 3: for (inti-0: for (int-0 n + Please record the execution time of the following tasks, Code when n-100, 1000, n 5,000, n 10,000, n100,000, n-1000,000, n 2,000,000, and n-10,000,000 Code 2 wbcn t-100, ?-1,000. ?-5,D00.?-10,000..-100,000, and n-200,000 Code 3 when n-10, m-50, n-100, n-500, and n- ,000 You can fill a table like this n-10 l n-50 1 n" 100 n"2001 n"10001… Code 1 Code 2 Code 3 Plotting the execution time of Code 1, Code 2 and Code 3. You may want to execute Codel, Code2 and Code 3 with more n values to plot You can use the following code templase to obtain the execution time. include ciostrean: inelude cetin for time funet ion include <chrono> vold get tine codel (int using clock chronoisteady clock elock:stime point start-clock: snOWDGet start tine perform the task Code 1 which you want to analyze the // execution ine int 0 elock:stime point end- elock: snow/Get end tine clock:sduration tine span - end -start double ns-double(tine span.count ) clock:sperLod: snun / clock: :perlod:sden You can use the Sollowing code templatie to obeain the execution time include ciostrea include <etine i tor tine tunet on inelude cchrono void get tine code1 (int n) using clock- chronosssteady clocka clockistine point start-clockz snow)/Get start tine // perforn the task Code 1 which you want to analyze the // exeeutson tme nt0 for (int -0i -1 clock:stine point end- clocks snow: //Get end tine clock;:4uration time-span-end-#tart; double ns double ttime span.count ) clockssperiod: num clock::period: sdenz cout << "Code 1 execution time for n-<<n i <ns seconds" endl You ean put all functions in the le alglospp Please submit the peogram alg10.cpp, a seript file algl0zesult cetaining result, and the plot of execution time Show transcribed image text . 10. 130 marks] Write a program that obtains the execution times for the following three code segments with the different m code I x-i code 2: for {int i " 0; i cena i++) for (int -ni+4 code 3: for (inti-0: for (int-0 n + Please record the execution time of the following tasks, Code when n-100, 1000, n 5,000, n 10,000, n100,000, n-1000,000, n 2,000,000, and n-10,000,000 Code 2 wbcn t-100, ?-1,000. ?-5,D00.?-10,000..-100,000, and n-200,000 Code 3 when n-10, m-50, n-100, n-500, and n- ,000 You can fill a table like this n-10 l n-50 1 n" 100 n"2001 n"10001… Code 1 Code 2 Code 3 Plotting the execution time of Code 1, Code 2 and Code 3. You may want to execute Codel, Code2 and Code 3 with more n values to plot You can use the following code templase to obtain the execution time. include ciostrean: inelude cetin for time funet ion include vold get tine codel (int using clock chronoisteady clock elock:stime point start-clock: snOWDGet start tine perform the task Code 1 which you want to analyze the // execution ine int 0 elock:stime point end- elock: snow/Get end tine clock:sduration tine span - end -start double ns-double(tine span.count ) clock:sperLod: snun / clock: :perlod:sden
You can use the Sollowing code templatie to obeain the execution time include ciostrea include

(Solved): . (10pts) Here is a series of address references given as wo...

. (10pts) Here is a series of address references given as word addresses: 1, 20,9, 4, 17,9, 11,4, 920, 17 Assume a direct-mapped cache with 8 one-word blocks that initially empty, label each memory reference in the list as a hit or a miss and complete the cache table below. Assume memory address is 6-bit long (given in parenthesis). What is the hit rate? Cache Valid Block bit Tag Data Reference Hit or miss 1 (000001) 20 (010100) 9 (001001) 4 (000100) 17 (010001) 9 (001001) 11 (00101) 4 (000100) 9 (001001) 20 (010100) 17 (010001) hit rate

. (10pts) Here is a series of address references given as word addresses: 1, 20,9, 4, 17,9, 11,4, 920, 17 Assume a direct-mapped cache with 8 one-word blocks that initially empty, label each memory reference in the list as a hit or a miss and complete the cache table below. Assume memory address is 6-bit long (given in parenthesis). What is the hit rate? Cache Valid Block bit Tag Data Reference Hit or miss 1 (000001) 20 (010100) 9 (001001) 4 (000100) 17 (010001) 9 (001001) 11 (00101) 4 (000100) 9 (001001) 20 (010100) 17 (010001) hit rate Show transcribed image text . (10pts) Here is a series of address references given as word addresses: 1, 20,9, 4, 17,9, 11,4, 920, 17 Assume a direct-mapped cache with 8 one-word blocks that initially empty, label each memory reference in the list as a hit or a miss and complete the cache table below. Assume memory address is 6-bit long (given in parenthesis). What is the hit rate? Cache Valid Block bit Tag Data Reference Hit or miss 1 (000001) 20 (010100) 9 (001001) 4 (000100) 17 (010001) 9 (001001) 11 (00101) 4 (000100) 9 (001001) 20 (010100) 17 (010001) hit rate

(Solved): i. Draw the block diagram from the gates up for a dual-port ...

i. Draw the block diagram from the gates up for a dual-port register file with four 8- bit registers implemented using D-latches. You can draw one gate-level version of the D-latch, and then re-use it as a block. The same goes for other repeated gate level structures, such as a register, decoder, or multiplexor. ii. Calculate the number of AND, OR, NOT, and tristate buffers.

i. Draw the block diagram from the gates up for a dual-port register file with four 8- bit registers implemented using D-latches. You can draw one gate-level version of the D-latch, and then re-use it as a block. The same goes for other repeated gate level structures, such as a register, decoder, or multiplexor. ii. Calculate the number of AND, OR, NOT, and tristate buffers. Show transcribed image text i. Draw the block diagram from the gates up for a dual-port register file with four 8- bit registers implemented using D-latches. You can draw one gate-level version of the D-latch, and then re-use it as a block. The same goes for other repeated gate level structures, such as a register, decoder, or multiplexor. ii. Calculate the number of AND, OR, NOT, and tristate buffers.

(Solved): a. Convert the number 752 in base-9 representation into base...

a. Convert the number 752 in base-9 representation into base 3representation.

752nine = ( )three

b. Represent the decimal number -1/3 in IEEE 754 floating-pointbinary representation (single and double precision).

(Solved): a. Explain some of the most rapidly advancing technologiescu...

  1. a. Explain some of the most rapidly advancing technologiescustomers are seeking out. - and  b. Find an article thatdiscusses the topic of customer service. Summarize your findings.PLEASE DO NOT COPY FROM ANOTHER ANSWER ON HERE. THANK YOU

(Solved): a. Find the general flow pattern of the network shown in the...

a. Find the general flow pattern of the network shown in the figure 30 30 b. Assuming that the flow must be in the directions indicated, find the minimum flows in the branches X100 *6 denoted by x2,3.4, andxs 60 20 40

a. Find the general flow pattern of the network shown in the figure 30 30 b. Assuming that the flow must be in the directions indicated, find the minimum flows in the branches X100 *6 denoted by x2,3.4, andxs 60 20 40 Show transcribed image text a. Find the general flow pattern of the network shown in the figure 30 30 b. Assuming that the flow must be in the directions indicated, find the minimum flows in the branches X100 *6 denoted by x2,3.4, andxs 60 20 40

(Solved): Engineering application program. Fall in the blanks oe the r...

Engineering application program
. Fall in the blanks oe the right so both code fragments are logicaly idetical Left code fragment Right code fragne quot a dividend/divisor Ese Magd Ovision by 2ero is not alowed. End End It 2. Shown here is a function named sEven that roturms True if te iut Long valu is an even number. Otherwise the function returms False (when ode Function isEven kinput as Lon as Boolean Complete the function below by naming it sod. The function should neum True if the npu is edd, otherwise return False (when even) Then 3. Look at the code fragment and fill in the blank with the comroct ansower by llowig (tracing) the logic Dim x an Long x 11 ( xx11)Then MsgBoxl The inal value of -1. Fall in the blanks oe the right so both code fragments are logicaly idetical Left code fragment Right code fragne quot a dividend/divisor Ese Magd Ovision by 2ero is not alowed. End End It 2. Shown here is a function named sEven that roturms True if te iut Long valu is an even number. Otherwise the function returms False (when ode Function isEven kinput as Lon as Boolean Complete the function below by naming it sod. The function should neum True if the npu is edd, otherwise return False (when even) Then 3. Look at the code fragment and fill in the blank with the comroct ansower by llowig (tracing) the logic Dim x an Long x 11 ( xx"11)Then MsgBoxl The inal value of -1 Show transcribed image text . Fall in the blanks oe the right so both code fragments are logicaly idetical Left code fragment Right code fragne quot a dividend/divisor Ese Magd Ovision by 2ero is not alowed. End End It 2. Shown here is a function named sEven that roturms True if te iut Long valu is an even number. Otherwise the function returms False (when ode Function isEven kinput as Lon as Boolean Complete the function below by naming it sod. The function should neum True if the npu is edd, otherwise return False (when even) Then 3. Look at the code fragment and fill in the blank with the comroct ansower by llowig (tracing) the logic Dim x an Long x 11 ( xx"11)Then MsgBoxl The inal value of -1

(Solved): . The following table gives a series of memory address refer...


. The following table gives a series of memory address references. Assuming a direct-ma 16 one-word blocks that is initially empty, label each memory reference in the list as a show the final contents of the cache (valid bit, tag and data) by filling memory address is 5-bit long. What is the miss rate of the cache? hit or miss and the following two tables. Assume Reference Hit or miss Cache Valid Indexbit Tag Data 2 19 7 10 17 31 12 13 15 Miss ratemedia%2F752%2F752bc604-d9d5-4499-860b-53. The following table gives a series of memory address references. Assuming a direct-ma 16 one-word blocks that is initially empty, label each memory reference in the list as a show the final contents of the cache (valid bit, tag and data) by filling memory address is 5-bit long. What is the miss rate of the cache? hit or miss and the following two tables. Assume Reference Hit or miss Cache Valid Indexbit Tag Data 2 19 7 10 17 31 12 13 15 Miss rate We were unable to transcribe this imageShow transcribed image text . The following table gives a series of memory address references. Assuming a direct-ma 16 one-word blocks that is initially empty, label each memory reference in the list as a show the final contents of the cache (valid bit, tag and data) by filling memory address is 5-bit long. What is the miss rate of the cache? hit or miss and the following two tables. Assume Reference Hit or miss Cache Valid Indexbit Tag Data 2 19 7 10 17 31 12 13 15 Miss rate

(Solved): I. Give a DFA for each of the following languages defined ov...

I. Give a DFA for each of the following languages defined over the alphabet ? = 0 1 : a) (3 points) Lw contains the substring 010 b) (3 points) L={ w | w ends in 001 } c) (4 points) L={ u tv has a 0 in its 2nd last position, if such a position exists)

I. Give a DFA for each of the following languages defined over the alphabet ? = 0 1 : a) (3 points) Lw contains the substring 010 b) (3 points) L={ w | w ends in 001 } c) (4 points) L={ u tv has a 0 in its 2nd last position, if such a position exists) Show transcribed image text I. Give a DFA for each of the following languages defined over the alphabet ? = 0 1 : a) (3 points) Lw contains the substring 010 b) (3 points) L={ w | w ends in 001 } c) (4 points) L={ u tv has a 0 in its 2nd last position, if such a position exists)

(Solved): . Go back to computer 10.10.10.1, then put Default Gateway w...


. Go back to computer 10.10.10.1, then put Default Gateway with an IP address which is DIFFERENT from the address of directly connected router. Put the ip address 10.10.10.100 as the Default Gateway. Now try and ping 40.40.40.1 again. Dont paste the output but write why is the pring still timing out. Also write how to fix the default gateway so the ping command is successful.. Go back to computer 10.10.10.1, then put Default Gateway with an IP address which is DIFFERENT from the address of directly connected router. Put the ip address 10.10.10.100 as the Default Gateway. Now try and ping 40.40.40.1 again. Don't paste the output but write why is the pring still timing out. Also write how to fix the default gateway so the ping command is successful. Show transcribed image text . Go back to computer 10.10.10.1, then put Default Gateway with an IP address which is DIFFERENT from the address of directly connected router. Put the ip address 10.10.10.100 as the Default Gateway. Now try and ping 40.40.40.1 again. Don't paste the output but write why is the pring still timing out. Also write how to fix the default gateway so the ping command is successful.