Answered: Translate the following C program into…

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

Related questions

Question

Translate the following C program into NASM.

#include <stdio.h>

int main()

{

int x = 0;

char sent[20];

printf("Enter sentence: ");

scanf("%[^\n]s", sent);

while (sent [x] != '\0') {

if (sent[x] >= 'a' && sent[x] <= 'z') {

sent[x] = sent[x] & 0xDF;

}

x++;

}

printf("%s \n", sent);

}

Use indexing (the [ebx] form). You can use the following pseudocode in the “bss” to allocate the array:

slen equ 20

sent resb slen

Note: the scanf format string of “%[^\n]s” keeps reading characters until the newline (otherwise it would end at the first space).

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Translate the following C program into NASM. #include <stdio.h> int ary[] = {12, 40, -2, 89, 35, -7, 6}; int main() { int sum = 0; int highest = 0; for (int x = 0; x < 7; x++) { if (highest < ary[x]) highest = ary[x]; sum += ary[x]; } printf("Sum is %d\n", sum); printf("Highest value is %d\n", highest); } Use indexing (the [ebx+esi] or [ebx+edi] form). You can have several “dw” values on the same line. Use the “loop” command.
Given the C++ code: // toh.cpp#include <iostream>#include <vector>using namespace std; int main() { vector<int> t[3]; int n; cout << "Enter the number of rings: "; cin >> n; int from = 0; int candidate = 1; int to, move = 0; if ( n % 2 == 0) to = 2; // (from + to)%mod3, counter clockwise else to = 1; // (from + to)%mod3, clockwise for ( int i = n + 1 ; i >= 1; i-- ) t[0].push_back(i); t[1].push_back(n+1); t[2].push_back(n+1); if ( n % 2 == 0 ) { while ( t[1].size() < (n+1) ) { cout << "move " << ++move << ":" << " Move candidate " << candidate; cout << " from tower " << (char) (from + 'A'); cout << " to tower " << (char)(to + 'A') << endl; t[to].push_back(t[from].back()); t[from].pop_back(); if (t[(to+2)%3].back() < t[(to+1)%3].back()) from =…
task7.c Compare 2 strings function cmp will print out > if s1 is "bigger" than s2, < if s1 is "smaller than s2, = if s1 is "equal" to s2. */ #include <stdio.h> #include <string.h> void cmp(char *s1, char *s2){ return; } int main() { char *string1 = "UNIX rules!"; char *string2 = "Windows drools!"; cmp(string1,string2); return 0; } Start with task7.c, implement the cmp() function. The goal of this function is to compare two strings using the sum of the ASCII value of all the characters in each string. Output of your program should look like this: UNIX rules! is smaller than Windows drools!

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS

Translate the following C program into NASM. #include int main() { int x = 0; char sent[20]; printf("Enter sentence: "); scanf("%[^\n]s", sent); while (sent [x] != '\0') { if (sent[x] >= 'a' && sent[x] <= 'z') { sent[x] = sent[x] & 0xDF; } x++; } printf("%s \n", sent); }