#include int num, answer; int divide (int numer, int denom ) { int quotient, remain; remain = numer; quotient = 0; while ( remain >= denom ) { remain -= denom; quotient++; } // end for return quotient; } // end of divide() int modulus (int n, int d ) { int quot, rem; rem = n; quot = 0; while (rem >= d ) { rem -= d; quot++; } // end for return rem; } // end of modulus( ) int main() { printf("? "); scanf("%d", &num); answer = divide (num, 20); printf("%d/ 20 = %d\n", num, answer); answer = modulus (num, 20); printf("%d mod 20 = %d\n", num, answer); answer = divide (num, 35); printf("%d/ 35 = %d\n", num, answer); answer modulus (num, 35); printf("%d mod 35 = %d\n", num, answer); return 0; } // end of main

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
icon
Related questions
Question

translate the following c program into pep/9 assembly language 

 

#include <stdio.h>
int num, answer;
int divide ( int numer, int denom ) {
int quotient, remain;
remain = numer;
quotient = 0;
while ( remain >= denom ) {
remain -= denom;
quotient++;
} // end for
return quotient;
} // end of divide()
int modulus (int n, int d ) {
int quot, rem;
rem = n;
quot = 0;
while (rem >= d ) {
rem -= d;
quot++;
} // end for
return rem;
} // end of modulus()
int main() {
printf("? ");
scanf("%d", &num);
answer = divide (num, 20);
printf("%d / 20 = %d\n", num, answer);
answer = modulus (num, 20);
printf("%d mod 20 = %d\n", num, answer);
answer divide (num, 35);
printf("%d / 35 = %d\n", num, answer);
answer = modulus(num, 35);
printf("%d mod 35 = %d\n", num, answer);
return 0;
} // end of main
Transcribed Image Text:#include <stdio.h> int num, answer; int divide ( int numer, int denom ) { int quotient, remain; remain = numer; quotient = 0; while ( remain >= denom ) { remain -= denom; quotient++; } // end for return quotient; } // end of divide() int modulus (int n, int d ) { int quot, rem; rem = n; quot = 0; while (rem >= d ) { rem -= d; quot++; } // end for return rem; } // end of modulus() int main() { printf("? "); scanf("%d", &num); answer = divide (num, 20); printf("%d / 20 = %d\n", num, answer); answer = modulus (num, 20); printf("%d mod 20 = %d\n", num, answer); answer divide (num, 35); printf("%d / 35 = %d\n", num, answer); answer = modulus(num, 35); printf("%d mod 35 = %d\n", num, answer); return 0; } // end of main
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 4 images

Blurred answer
Knowledge Booster
Array
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.
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education