Homework6_Solution (1)

ADDRESS CODES

x = 4 and x = 8 **** and 3X is a two digit number, consider memory storage of a 64-bit word stored at memory word 3X in a byte-addressable memory (a) What is the byte address of memory word 3X? (b) What are the byte addresses that memory word 3X spans? (c) Draw the number 0XF1234567890ABCDE stored at word 3X in both big-endian and little-endian machines. Clearly label the byte address corresponding to each data byte value

By assuming that X is the last digit of your student number and 3X is a two digitnumber, consider memory storage of a 64-bit word stored at memory word 3X ina byte-addressable memory(a) What is the byte address of memory word 3X?(b) What are the byte addresses that memory word 3X spans?(c) Draw the number 0xF1234567890ABCDE stored at word 3X in both big-endianand little-endian machines. Clearly label the byte address corresponding to eachdata byte value.

Please refer to this textbook: “A. Silberschatz, P. B. Galvin and G. Gagne, “Operating System Principles,”7th Edition, John Wiley & Sons Inc., 2006.”   And answer the following questions: Question12: Which disk schedualing algorithm is most vulnerable to starvation (a) SCAN. (b) Shortest Seek Time First (SSTF). (c) LOOK. (d) First Come, First Served (FCFS)

By assuming that X is the last digit of your student number and 3X is a two digit number, consider memory storage of a 64-bit word stored at memory word 3X in a byte-addressable memory (a) What is the byte address of memory word 3X? (b) What are the byte addresses that memory word 3X spans? (c) Draw the number 0XF1234567890ABCDE stored at word 3X in both big-endian and little-endian machines. Clearly label the byte address corresponding to each data byte value.

Addressing Memory Suppose that there are 226 bytes in memory. In binary the lowest address is 00...00, and the highest address is 11...11. a. What is the lowest address (in decimal) if memory is byte addressable? b. What is the highest address (in decimal) if memory is byte addressable? c. Suppose that a word is 16-bits long.  What is the lowest address (in decimal) if memory is word addressable? d. Suppose that a word is 16-bits long.  What is the highest address (in decimal) if memory is word addressable? e. Suppose that a word is 32-bits long.  What is the lowest address (in decimal) if memory is word addressable? f. Suppose that a word is 32-bits long.  What is the highest address (in decimal) if memory is word addressable?

Please refer to this textbook: “A. Silberschatz, P. B. Galvin and G. Gagne, “Operating System Principles,”7th Edition, John Wiley & Sons Inc., 2006.”   And answer the following questions: Question: Which mutual exclusion algorithm requires, on average, the fewest messages in a group of 100 machines? centralized. Token-ring. Lamport' s . Ricart & Agrawala

Suppose a computer using direct mapped cache has 224 bytes of byte- addressable main memory and a cache size of 64K bytes, and each cache block contains 32 bytes. (Note: 64K = 26 * 210) a) How many blocks of main memory are there? b) What is the format of a memory address as seen by cache, i.e., what are the sizes of the tag, block, and offset fields?

Generate three address code for the given expression. Also provide different data structure representation of three address code.                                                                                                                                     ((x+y) *(z-y)) / (y/x)

An address space is specified by 24-bits and the corresponding memory space by 16-bits. (i) How many words are there in the address space? (ii) How many words are there in the memory space?

Describe the dirty read problem and its implications.

None

Features of Memory Consider the following array of memory cells (our logisim cells included the AND gate attached to the WE input in the cell subcircuit, but this is not relevant here). WE A 1100101011111110 1010111110101101 1010110110101101 1011111010101110 Fill in the correct output values (either 1 or 0) for the specified input values. a) What is the addressability (in bits) of this array? b) What is the address space of this array? c) What is hex(with an x)adecimal value with address 01?

Don't reject if you did not have knowledge. Assembly language. On sim8085 simulator

Part A For each byte sequence listed, determine the Y86 instruction sequence it encodes. If there is some invalid byte in the sequence, show the instruction sequence up to that point and indicate where the invalid value occurs. For each sequence, the starting address, then a colon, and then the byte sequence are shown. 0x100: 30f3fcfffff40630008000000000000 0x100: 30f3fcfffffff irmovq $-4,%rbx Ox10a: 40630008000000000000 | rrmovq %rsi,0×80A(%rcx) O0x115: 00 halt Ox100: 30f3fcffffffff irmovq $-4,%rbx Ox10a: 40630008000000000000 | rmmovq %rsi,0x800(%rbx) Ox114: 00 halt 0x100: 30f3fcfffffffff rrmovq $-8,%rbx Ox109: 40630008000000000000 | rmmovq %rsi,0x800(%rbx) 0x200: a06f800c020000000000000030f30a00000000000000 0x113: 00 halt 0x100: 30f3fcffffffffff irmovq $-4,%rbx 0x200: a06f pushq %rsi 0x10a: 40630008000000000000 | rmmovq %rsi,0x800(%rbx) Ox202: 800c02000000000000 call proc Ox116: 00 halt 0x20b: 00 halt 0x20c: proc: Submit Request Answer 0x20c: 30f30a00000000000000 | irmovq $10,%rbx…

Network computer

#4

Solve all please Q1) Give a short answer (Choose five branches): a) What is the meaning of the data encryption in communication system? b) Convert the Boolean expression to the standard SOP form: WXY + WXY c) What is the role of actuator in control system? d) What is mean by the transducer? e) The voltage resolutions of 8 bits A/D converter depend on? / f) What is the type of PLD's using minimum number of gates to implement Boolean expression?

Matlab:Please write the codes, I do not want a manual solution

If memory is 16-way interleaved, it means that memory is implemented using four banks (because 2 = 16).TRUE or FALSE. If false why.

NAND2TETRIS HARDWARE SIMULATOR HiLoMux - This has one 8-bit input bus, in, and one 4-bit output bus, out. Alsopresent is a sel input, which is used to select what appears on out. Ifsel is false, then out should contain the lower 4-bits of in (i.e. in[0],in[1], in[2], in[3]). If sel is true, then out should contain theupper 4-bits of in (i.e. in[4] mapped to out[0], in[5], mapped toout[1], etc.). In other words, the HiLoMux can be used to select anibble from a byte please use the skeleton program below CHIP HiLoMux{    IN in[8], sel;    OUT out[4]; PARTS:     }

Explain Principle, Merits and Demerits of MALDI-TOF ?  please answer at your own easy words. Answer should be to the point.