; file1.eal X: B A B B C = . - X D = 3 EXT A EXT B INT C INT DConsider the following additional piece of code in the same language:
; file2.eal INT A INT B EXT C EXT D X: B C Y: B D A = 0 B = Y - XIf we assemble file1.eal to make file1.obj, and we assemble file2.eal to make file2.obj, and then we link file1.obj and file2.obj and load the result into memory starting at location zero, what is loaded in memory?
What is the value of each identifier in the symbol table resulting from the assembly of each source file?
a) Suggest a set of 8-bit interface registers for the touch screen device device.
b) Propose a format for touch messages, assuming that touch messages are delivered to the user as a stream of characters using the interface defined in Figure 9.3.
c) Suggest code for the real-time-clock interrupt handler that would work with your answers to parts a and b to satisfy this specification.
a) How long will it take to read the following sequence of disk addresses, from the start of data transfer for the first read to the end of data transfer for the last.
transfer number cyl surf sect 1 0 0 0 2 0 1 0 3 1 2 3 4 5 3 4 5 4 5 5 6 0 6 3 7 0 7 5b) How long will it take to read the same sectors in the optimal order, using a disk scheduler.
Each i-node holds the file size, in bytes, plus pointers to the first 10 sectors of the file. Directory entries give the file name and i-number of the i-node describing the file. The root directory of the file system is described by i-node 0 in the i-table. The root directory occupies only one data sector (it only holds 12 items). One item in the root directory is a directory called etc. This directory contains 200 items, with each directory entry occupying 16 bytes. One file in /etc is called passwd. The file /etc/passwd contains 100 lines averaging 50 characters each.
Enumerate all of the disk accesses it takes to read the file /etc/passwd, assuming that this disk has never been accessed since the system was started. Assume that the system never needs to read a sector twice -- that is, that it has sufficient buffer capacity to hold copies of all recently read sectors in RAM.
How many data sectors get read? How many index sectors get read? How many i-nodes get read? Break this list down by the file or directory being referenced. Are there any other disk accesses not accounted for by the questions in this paragraph?