Convert the C to assembly. y's base address is in $t0. Variable i is in $t4.1 = 0;while (i <= 6) {y[i] = 1 + 5;i = 1 + 1;}addi vWhile: bgt VaddAfter:addaddSWU.Vj<<addi v>$t4$t4$t5$t5$t5$t6$t4<<>V While vFISzero ✓St1 V$t5VSt5 V$t5 V0 ( $t5St4VAfter$t5$t50St51VRegisters05000645000Szero$t0St1$12$13St4$15$16Data memory00050005004500850125016502050240000

Name: Convert the C to assembly. y's base address is in $t0. Variable i is
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Convert the C to assembly. y's base address is in $t0. Variable i is in $t4.1 = 0;while (i $t4$t4$t5$t5$t5$t6$t4 V While vFISzero ✓St1 V$t5VSt5 V$t5 V0 ( $t5St4VAfter$t

SOLUTION - The given C code is - i = 0 while )i <= 6) { y[i] = i + 5; i = i + 1; }

Engineering

Computer Science

Convert the C to assembly. y's base address is in $t0. Variable i is in $t4. 1 = 0; while (i <6) ( y[i] = 1 + 5; 1 = 1 + 1; } While: After: addi v $t4 bgt v $t4 add $t5 add v $t5 add v SW < j < addi v > $t5 $t6 St4 V < < < While v F " Szero St1 $t5 $t5 $t5 0( $t5 $t4 V < < > " 7 After v $t5 $t5 $t5 1 > > < Registers 0 5000 6 Szero $t0 St1 $12 $13 $14 $15 $16 4 5 0 0 0 Data memory 0 0 0 0 0 0 0 5000 5004 5008 5012 5016 5020 5024

Convert the C to assembly. y's base address is in $t0. Variable i is in $t4. 1 = 0; while (i <6) ( y[i] = 1 + 5; 1 = 1 + 1; } While: After: addi v $t4 bgt v $t4 add $t5 add v $t5 add v SW < j < addi v > $t5 $t6 St4 V < < < While v F " Szero St1 $t5 $t5 $t5 0( $t5 $t4 V < < > " 7 After v $t5 $t5 $t5 1 > > < Registers 0 5000 6 Szero $t0 St1 $12 $13 $14 $15 $16 4 5 0 0 0 Data memory 0 0 0 0 0 0 0 5000 5004 5008 5012 5016 5020 5024

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

// Program 4.4.1#include <iostream>using namespace std;int main (){ int var = 20; // actual variable declaration. int *ip; // pointer variable ip = &var; // store address of var in pointer variable cout << "Value of var variable: "; // print the variable value cout << var << endl<<endl; cout << "Address stored in ip variable: "; // print the address stored in ip pointer variable cout << ip << endl<<endl; cout << "Value of *ip variable: "; // access the value at the address available in pointer cout << *ip << endl; return 0;} TASK 1. Explain in details what the program does? 2. What is the output.
int i; float x[5], y[5]; [ lots of code deleted... ] for (i=0;i y[i]) x[i] = x[i] + y[i]; [ more code deleted... ] Translate to MIPS assembly language:
1. Given the following C code: short ARR [50]; // short is 2 bytes for (short i = 1; i<= 50; i++) ARR [i] = i * i; Convert this code into assembly. Write two versions of the code by using two different addressing modes.
1B. Write three address code and quadruple for the expression a[i] = -b * (a[k--]- y[ k--] /2)
C+++ #include <iostream>#include <pthread.h>#include <stdlib.h> #define TOTAL_THREADS 4 int count;pthread_mutex_t the_mutex; // phread mutex variable - initialize here if using the initializer macro void* myFunction(void* arg){int actual_arg = *((int*) arg);for(unsigned int i = 0; i < 10; ++i) {// TODO:// Use a Pthread mutex to control// access to the critical region. // Beginning of the critical regioncount++;std::cout << "Thread #" << actual_arg << " count = " << count << std::endl; // End of the critical region// TODO:// Relinquish access to the Pthread mutex// since critical region is complete. // Random wait - This code is just to ensure that the threads// show data sharing problemsint max = rand() % 100000;for (int x = 0; x < max; x++);// End of random wait code}pthread_exit(NULL);} int main(){int rc[TOTAL_THREADS];pthread_t ids[TOTAL_THREADS];int args[TOTAL_THREADS];// TODO: Initialize the pthread mutex here if using the…
Consider the following C code: 1: int main() { 2: 3: 4: 5: } int y = 5; // Return y times 4 return y* 4; What is removed during the preprocessing step of compilation? A. Line 1 B. Line 3 C. Line 5 D. Lines 3 and 5 E. Everything, since it will be assembly after the preprocessing step
3. The following program is an example of MIPS PC-relative addressing where i is translated from C++: While (save[i] == k) i = i + j; Loop: add $t1, $s3, $s3 # temp reg $t1 = 2 * i add $t1, $t1, $t1 # temp reg $t1 = 4 * i add $t1, $t1, $s6 # $tl = address of save[i] lw $t0, 0 ($t1) bne $t0, $s5, Exit # go to Exit if save[i] != k add $s3, $s3, $s4 # i = i +j j Loop # Temp reg $t0 = save[i] # go to Loop Exit: Complete the table below with the values of each instruction in decimal. The first part has been done for you. Address Instructions 80000 0. 19 19 6. 32 80004 80008 80012 80016 80020 80024
Provide simple explanation
Write the assembly code for the safe_input function in the C program given below. Name the file as safeinputfile.asm. #include <stdio.h> int safe_input(char *buffer, unsigned length ); int main(){ char buffer[32]; printf("Your name: "); fflush(stdout); safe_input(buffer,32); printf("Pleased to meet you, %s!\n",buffer); return 0;}
Please your code should be in mips assembly language
Recreate the following C program in x86-64 and aarch64 assembly manually: #include <stdio.h> typedef struct _v2d {long x;long y;} v2d_t; static long dot(v2d_t a, v2d_t b){return a.x * b.x + a.y * b.y;} static long dot_ptr(v2d_t *a, v2d_t *b){return a->x * b->x + a->y * b->y;} int main(void){v2d_t a, b; scanf("%ld %ld %ld %ld", &a.x, &a.y, &b.x, &b.y); long res1 = dot(a, b);printf("%ld\n", res1); long res2 = dot_ptr(&a, &b);printf("%ld\n", res2); return 0;}
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…