CAN SOMEONE CONVERT THIS CODE TO C++ OR JAVAthis is assemnly codemain:push rbpmov rbp, rspmov DWORD PTR [rbp-12], Ojmp .L2.L4:mov eax, DWORD PTR [rbp-8]and eax, 1test eax, eахje .L3mov eax, DWORD PTR [rbp-4]add DWORD PTR [rbp-12], eax.L3:sal DWORD PTR [rbp-4]sar DWORD PTR [rbp-8].L2:cmp DWORD PTR [rbp-8], 0jne .L4mov eax, 0pop rbpret

CAN SOMEONE CONVERT THIS CODE TO C++ OR JAVA this is assemnly code main: push rbp mov rbp, rsp mov DWORD PTR [rbp-12], 0 jmp .L2 .L4: mov eax, DWORD PTR [rbp-8] and eax, 1 test eax, eaх je .L3 mov eax, DWORD PTR [rbp-4] add DWORD PTR [rbp-12], eax .L3: sal DWORD PTR [rbp-4] sar DWORD PTR [rbp-8] .L2: cmp DWORD PTR [rbp-8], O jne .L4 mov eax, 0 pop rbp ret

CAN SOMEONE CONVERT THIS CODE TO C++ OR JAVA this is assemnly code main: push rbp mov rbp, rsp mov DWORD PTR [rbp-12], 0 jmp .L2 .L4: mov eax, DWORD PTR [rbp-8] and eax, 1 test eax, eaх je .L3 mov eax, DWORD PTR [rbp-4] add DWORD PTR [rbp-12], eax .L3: sal DWORD PTR [rbp-4] sar DWORD PTR [rbp-8] .L2: cmp DWORD PTR [rbp-8], O jne .L4 mov eax, 0 pop rbp ret

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

Use the following skeleton code to write a C program (NOT C++) which filters out words from input which can be typed entirely with either the left hand (QAZWSXEDCRFVTGB) or right hand (YHNUJMIKOLP) #include "general.h" int main(void){int pipe1[2];/*pipe for child 1 and 2 to share*/int pipe2[2];/*pipe for child 2 and 3 to share*/int status; /*setup pipe 1*//*Fork and call child 1 process. /*parent closes pipe ends it no longer needs*/ /*set 2nd pipe*/ /*Fork and call child 2 process. Don't forget to close any fds you will not want open in the childbefore you call the child routine */ /*parent closes pipe ends it no longer needs*/ /*Fork and call child 3 process.*/ /*parent closes. rest of pipe ends*/ /*wait for all 3 children*/ return(0);}
public static long fallingPower(int n, int k) (please use Java to solve) Python has the integer exponentation operator ** conveniently built in the language, whereas Java unfortunately does not offer that operator that would be mostly useless anyway in a language with fixed size integers that silently hide the overflows easily produced by integer exponentiation. (In both languages, the caret character ^ denotes the bitwise exclusive or operation that has bupkis to do with integer exponentiation.) In the related operation of falling power that is useful in many combinatorial formulas and denoted syntactically by underlining the exponent, each term that gets multiplied into the product is always one less than the previous term. For example, the falling power 83 is computed as 8 * 7 * 6 = 336. Similarly, the falling power 105 equals 10 * 9 * 8 * 7 * 6 = 30240. Nothing essential changes even if the base n is negative; the falling power (-4)5 is computed as -4 * -5 * -6 * -7 * -8 = -6720.…
Using C Language, what is the output of this code? #include<stdio.h> #include<conio.h> #define r 3 #define c 4 int z[r][c] = {1,2,3,4,5,6,7,8,9,10,11,12}; main() { int a, b, c = 999; clrscr(); for(a=0;a<r;++a) for(b=0;b<c;++b if(z[a][b]<c) c=z[a][b]; printf(“%d”,c); getch(); return 1; )
Write a C++ program that would implement the function called filterString which accepts a string s that contains numbers and letters mixed up. The function must return an integer corresponding to the numbers in s in the order that they appear. If there are no numbers in s, the function should return 0. TEST CASES: filterString(‘123’) = 123 filterString(‘abc’’) = 0 filterString(‘aa 112 3dd’) = 1123 ASSUMPTIONS Assume that all the inputs are strings (no need for try-catch method) Please take note of test cases and assumption. Thank you!
Write a C++ program that would implement the function called filterString which accepts a string s that contains numbers and letters mixed up. The function must return an integer corresponding to the numbers in s in the order that they appear. If there are no numbers in s, the function should return 0. TEST CASES:filterString(‘123’) = 123 filterString(‘abc’’) = 0 filterString(‘aa 112 3dd’) = 1123 ASSUMPTIONS: Assume that all the inputs are strings (no need for try-catch method)
Write output of the following c++ code by completing it with explanation of all iterations. Code #include<iostream> Using namespace std; int fun(int x) { if(x<5) for(int i=1;i<4;i++) cout<<i; return 0; } int main() { int x=8; fun(x); x--; fun(x); }
Write a program in C language that implements a simple hand calculator. The followings arithmetic functions are available on the calculator: addition, subtraction, multiplication, division, cosine, sine and tangent. The result of the function must have the same number of digits of precision as the highest precision operand of the function. An example of the program behavior is shown below. > 8.91 + 1 = 9.91 > 9.61*3.11 = 29.8871 > cos(3.14152759) = 0.99849715
Write output of the following c++ code by completing it with explanation of all iterations Need explanation of code line by line how it will execute. Code #include <iostream> Using namespace std; int fun1(int); int fun(float); int fun1(int n){ if(n<=1) return 1; else return n*fun(n-1); } int fun(float n){ if(n<=1) return 1; else return n*fun(n-1); } int main(){ int n=5; cout<<fun1(n); cout<<fun(4.3); return 0; }
can someone help me understand what does those two haskell function do myFun1::[a] -> (b -> a -> b) -> b -> [b] myFun1 [] f b = [b] myFun1 (x:xs) f b = (b):myFun3 xs f (f b x) myFun2::[a] -> [b] -> (a -> c) -> (b -> c) -> [(c,c)] myFun2 [] _ f g = [] myFun2 _ [] f g = [] myFun2 (x:xs) (y:ys) f g = (f x, g y):myFun2 xs ys f g
Write a C function strEven() that takes two strings (say s1, s2) as parameters, stores into s2 the even indexed (0th, 2nd, 4th, ...) characters of s1. s2 must be null character terminated. Example: if s1 is "Abcde1234", the function will make s2 as "Ace24" Prototype: void strEven(char s1[], char s2[]);
Write a Lex program to accept a C program that counts the IDs and intimates the un-terminated string constants in the input C program (Constants beginning with double quotes and extending for more than one line). Give the Compilation and the Runtime screen. Use thefollowing sample C program for testing purposes.#include<stdio.h>#include<conio.h>#include<string.h>void main(){ }Note:int a,b,h;a=a+b;char d[20]="d", h[67]="yu ;char c[10]="msrit";a=a+/b+h;strlen("msrit");strlen("msr);strcpy(c,"Hello World);b=b+*; }
Write an assembly function called positiveASCII() that takes a single 2-digit ascii string as a parameterand returns that associated positive value. Write a simple C program that calls yourassembly function. Comment each line and again, state any assumptions Examples: “50” would return 50 , “04” returns 4, "b6” returns 0 , “12” returns 12; “-1” returns 0, etc. Please comment on code(still learning assembly)