What bit string repersents April 1, 2024? Examples: Date: 00111 (year) 1100 (month) 10010 (day) 00111 = 18, 1100 = 12, 10010 = 30, 1980 + 30 = 2010 = 2010 Dec 18 mov ax, 00111110010010b ; 2010 Dec 10 ; 30 12 18 DAY: mov dx, ax and dx, 0000000000011111b mov day, dl (18) ; 00111 Month: mov dx, ax and dx, 00000001111000000b shr dx, 5 ; 000000000000 1100 (12) mov month, dl Year: mov dx, ax shr dx, 9 ; 011110 and dx, 0000000001111111b mov year, dl (30) 10010

What bit string repersents April 1, 2024? Examples: Date: 00111 (year) 1100 (month) 10010 (day) 00111 = 18, 1100 = 12, 10010 = 30, 1980 + 30 = 2010 = 2010 Dec 18 mov ax, 00111110010010b ; 2010 Dec 10 ; 30 12 18 DAY: mov dx, ax and dx, 0000000000011111b mov day, dl (18) ; 00111 Month: mov dx, ax and dx, 00000001111000000b shr dx, 5 ; 000000000000 1100 (12) mov month, dl Year: mov dx, ax shr dx, 9 ; 011110 and dx, 0000000001111111b mov year, dl (30) 10010

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 3VE

See similar textbooks

Similar questions

Assembly Language x86: (Micro Macro): templet: .386.model flat, stdcall.stack 4096ExitProcess PROTO, dwExitCode: DWORD.data .codemain PROC main ENDPINVOKE ExitProcess, 0END main Question: What are the reults (in decimal) of the following operations? A: 1111001000101111 multiplied by 0000001011010010 (these are signed numbers) B: 01011110110101101010010100101001 devided by 1111111111011010 (these are signed number)(hint: use idiv (signed), div (unsigned) ) Examples: Multiply: mul bx, 10000 mov ax, 355 mul bx, shl edx, 16 mov dx, ax Division:mov eax, 2000000 mov bx, 500mov edx, eax shr edx, 16 div bx,
Computer Science #include<cmath>#include<stdio.h>__global__voidprocess_kernel1(float *input1,float *input2,float *output,int datasize){int idx = threadIdx.x + blockIdx.x * blockDim.x;int idy = threadIdx.y + blockIdx.y * blockDim.y;int idz = threadIdx.z + blockIdx.z * blockDim.z;int index = idz * (gridDim.x * blockDim.x) * (gridDim.y*blockDim.y) + idy * (gridDim.x * blockDim.x) +idx;if(index<datasize)output[index] = sinf(input1[index]) + cosf(input2[index]);}__global__voidprocess_kernel2(float *input,float *output,int datasize){int idx = threadIdx.x + blockIdx.x * blockDim.x;int idy = threadIdx.y + blockIdx.y * blockDim.y;int idz = threadIdx.z + blockIdx.z * blockDim.z;int index = idz * (gridDim.x * blockDim.x) * (gridDim.y*blockDim.y) + idy * (gridDim.x * blockDim.x) +idx;if(index<datasize)output[index] = logf(input[index]);}_global__voidprocess_kernel3(float *input,float *output,int datasize){int idx = threadIdx.x + blockIdx.x *…
Computer Science 1. List all lines in all .c files in the current working directory that contain 'lookahead' andthen 'ID' later on the same line. Hint: don't forget the pattern for "stuff". 2. If you follow the translation steps in the multi-level paging, the first Page FrameNumber (PFN) gives the address of: a. virtual address space b. page table c. page directory
instruction is in the first picture please give me only implementation of int L1lookup(u_int32_t address) and int L2lookup(u_int32_t address) cacheSim.h #include<stdlib.h>#include<stdio.h>#define DRAM_SIZE 1048576typedef struct cb_struct {unsigned char data[16]; // One cache block is 16 bytes.u_int32_t tag;u_int32_t timeStamp; /// This is used to determine what to evict. You can update the timestamp using cycles.}cacheBlock;typedef struct access {int readWrite; // 0 for read, 1 for writeu_int32_t address;u_int32_t data; // If this is a read access, value here is 0}cacheAccess;// This is our dummy DRAM. You can initialize this in anyway you want to test.unsigned char * DRAM;cacheBlock L1_cache[2][2]; // Our 2-way, 64 byte cachecacheBlock L2_cache[4][4]; // Our 4-way, 256 byte cache// Trace points to a series of cache accesses.FILE *trace;long cycles;void init_DRAM();// This function print the content of the cache in the following format for an N-way cache with M Sets// Set 0…
Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. a) Suppose that the OS uses a two-level page table. Draw the page table. (Assume that frames 7 through 221 are free, so you can allocate space for the page table there.) In addition, suppose that the page-table directory storage comprises a whole number of consecutive full frames. (For examples: if the directory entry is 2 bytes, the entry’s storage comprises 1 frame; if the directory entry is 260 bytes, the entry’s storage comprises 2 consecutive frames.) b) What is the size of the two-level page table c) Now, translate the virtual addresses shown in question I(e) to physical addresses for the two-level page table. Show how you obtain your answers. 0x0389 0xDF78 0x0245 0x8012
(MAC) In the MAC address table, MAC addresses are stored in a dynamic RAM. Assume the table was 8000 bytes in size and the memory access time was 100 nanoseconds. What would be the worst-case look-up time if a binary search was employed to locate an address?
PLEASE ONLY USE 8051 MICROCONTROLLER (AT89C51 FOR EXAMPLE) AND ASSEMBLY LANGUAGE, NOT ANY OTHER MICROCONTROLLER OR LANGUAGE, THANKS. I ADDED MY TRY OF CODE (IT BASICALLY COUNTS FROM 11 TO 00.) I DONT WANT SOLUTION IN THIS CODE FORMAT: DISP MACRO MSG LEA DX , MSG MOV AH , 09H INT 21H END DATA SEGMENT MSG DB "THE REMAINING TIME IS: $" DATA ENDS CODE SEGMENT ASSUME DS:DATA , CS : CODE START:MOV AX , DATA MOV DS , AX DISP MSG MOV AH , 2CH INT 21H MOV AL , CH MOV BX , AX CALL SHOW MOV DL , ' : ' MOV AH , 02H SCREEN INT 21H MOV AL , CL .........
Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. Could you hand draw the page table, if possible a) Suppose that the OS uses a two-level page table. Draw the page table. (Assume that frames 7 through 221 are free, so you can allocate space for the page table there.) In addition, suppose that the page-table directory storage comprises a whole number of consecutive full frames. (For examples: if the directory entry is 2 bytes, the entry’s storage comprises 1 frame; if the directory entry is 260 bytes, the entry’s storage comprises 2 consecutive frames.) b) What is the size of the two-level page table
Write a C code to perform vector arithmetic: Define 3 vectors A[100], B[100], C[100]. Get n from as a command line argument. Example if n=10, then (./vector 10), and create n processes. (n will be one of Divisors of 100). Get operation from user: add, sub. Each process will create a number of threads. Number of threads per process = 100/(10 number of processes). Perform the operation on a chunk of the vector, for example, if n = 10, each process will create (100/10*10=1) 1 thread to add\sub 10 elements. Use execl to run the add or sub programs Parent should print A.B.C in a file. (yourname.txt) For example, n=5, operation sub Partition work equally to each process: PO create (100/10*5=2) 2 threads → Thread00 will executes A[0:9] B[0:9]-C [0:9] = Thread01 will executes A[10:19] B[10:19]-C[10:19] = PI create (100/10*5=2) 2 threads → Thread 10 will executes A[20:29] = B[20:29]-C [20:29] Thread11 will executes A[30:39] B[30:39]- C[30:39] = and so on. no…
Computer organization and assembly language I have to: 1. Write a line-by-line explanation of this program. 2. What does the program do? 3. What will be displayed? Code below: .model small .386 .stack 100h .data msgdb 13, 10, "W E L L D O N E !", "$"; astringvariable YU db 2 pppdb32h .code mainproc ; movax,@data movds,ax L: callky SHL PPP, 1 dec YU jnz L MOVAH,9 mov DX,offsetMSG INT21H mov ax, 4c00h int 21h ky proc m: movah, 1 int 21h cmp al, ppp jnzm incppp ret kyendp main endp end main
convert this code to java language /* OPERATING SYSTEMS LAB PROJECT* AKASH JAIN* 179303013* DESIGNING A VIRTUAL MEMORY MANAGER*/ #include<stdio.h>#include<stdlib.h>#include<string.h> const int VM_SIZE=256;const int PAGE_SIZE=256;const int TLB_SIZE=16;const int MM_SIZE=256; int main(int argc, char* argv[]){FILE *fd;if(argc<2){printf("NOT ENOUGH AGRUMENTS\n EXITING\n");return 0;}fd=fopen(argv[1],"r");if(fd==NULL){printf("ERROR OPENING FILE\n FILE FAILED TO OPEN\n");return 0;}char *value=NULL;size_t len=0;ssize_t read;long long page_no,offset,page_table,totalhits=0,fault=0,pages=0;int qp=0; //to maintain the queue positionint physicalad=0,frame,logicalad;int tlb[TLB_SIZE][2];int pagetable[PAGE_SIZE]; memset(tlb,-1,TLB_SIZE*2*sizeof(tlb[0][0]));memset(pagetable,-1,sizeof(pagetable));int mask=255,mask1=62580,i,hit;while((read=getline(&value,&len,fd))!=-1){pages++;//get page number and offset from logical…
The following data segment starts at memory address 1000h (hexadecimal) .data printString BYTE "ASSEMBLY IS FUN",0 moreBytes BYTE 25(DUP)0 dateIssued DWORD ? dueDate DWORD ? elapsedTime Word ? What is the hexadecimal address of dueDate ? a. 1045h b. 1029h c.1010h d. 102Dh