Functions and Modules A. Two Rockets: Write a program named two_rockets.py that generates the following three figures of output. Use functions to show structure and eliminate redundancy in your solution. Be sure to use a main) function and call it in your script. (The only line of code outside of a function that should be executed should be a call to the main function.) AA JUnited Istates JUnited states / / In particular, make sure that: 1. The main function contains no print statements except for blank lines 2. Any sequence of print statement(s) repeated are captured in a method that is called just once per sequence 3. The same print statement never appears in two places in the code Shoot a screenshot of your source code and paste it here Shoot a screenshot of your Python Shell showing the output and paste it here.

Functions and Modules A. Two Rockets: Write a program named two_rockets.py that generates the following three figures of output. Use functions to show structure and eliminate redundancy in your solution. Be sure to use a main) function and call it in your script. (The only line of code outside of a function that should be executed should be a call to the main function.) AA JUnited Istates JUnited states / / In particular, make sure that: 1. The main function contains no print statements except for blank lines 2. Any sequence of print statement(s) repeated are captured in a method that is called just once per sequence 3. The same print statement never appears in two places in the code Shoot a screenshot of your source code and paste it here Shoot a screenshot of your Python Shell showing the output and paste it here.

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

fhnffh
Write the purpose, algorithm and design a python program
Using the following C code and assembly code answer the following; C: long int nothingGreater(long int num) { if (num > 240) { return 240 - num; } else { return num; } } Assembly: 0x00000000004004ed <+0>: push %rbp 0x00000000004004ee <+1>: mov %rsp,%rbp 0x00000000004004f1 <+4>: mov %rdi,-0x8(%rbp) 0x00000000004004f5 <+8>: cmpq $0xf0,-0x8(%rbp) 0x00000000004004fd <+16>: jle 0x40050a <nothingGreater+29> 0x00000000004004ff <+18>: mov $0xf0,%eax 0x0000000000400504 <+23>: sub -0x8(%rbp),%rax 0x0000000000400508 <+27>: jmp 0x40050e <nothingGreater+33> 0x000000000040050a <+29>: mov -0x8(%rbp),%rax 0x000000000040050e <+33>: pop %rbp 0x000000000040050f <+34>: retq a. What's the starting address of nothingGreater in memory (specify in hex starting with 0x; you may omit leading zeroes)? b. What register is the argument stored in when the function starts (give the 3-letter abbreviation with a % beforehand)?
WRITE THE FOLLOWING PROGRAM IN HIGH LEVEL ASSEMBLY LANGUAGE (HLA)
Convert the following C++ program into an x86 assembly language program.Comment the start of each "code block" that performs one of the listed mathematical calculations.Comments go to the right of the actual code, all starting on the same column.Post ONLY your ASM file here to Blackboard when complete. // Global variableschar a = 5;char b = 6;char c = 7;char d = 8;char e = 2;char f = 3;char g = 1;char h = 4;// Codeint main(){ --h; c = g + h; d = e + 22 - c - b; g = -h; ++b; a = g + d - 15; b = a + 92 - b; h = d + (-f) - d; // Move a into the eax register // Move b into the ebx register // Move c into the ecx register // Move d into the edx register // Call the DumpRegs function // Move e into the eax register // Move f into the ebx register // Move g into the ecx register // Move h into the edx register // Call the DumpRegs function e = e - 6; g = 126; --a; b = 15 - e + f; c = -f; d = -h + g - a; e = a…
Suppose a C program is written to compute the workload of summing up 100 scalars and summing up a pair of 1000x1000 matrices. Assume the scalar calculation on 100 scalars must be sequential, but the matrix sum can be computed in parallel. What is the maximum speed up if you have 100 processors to compute the program in parallel? Choose one from the following options: None of the above 100 99 1000,000 10
Using the following C code and assembly code answer the following; C: long int nothingGreater(long int num) { if (num > 240) { return 240 - num; } else { return num; } } Assembly: 0x00000000004004ed <+0>: push %rbp 0x00000000004004ee <+1>: mov %rsp,%rbp 0x00000000004004f1 <+4>: mov %rdi,-0x8(%rbp) 0x00000000004004f5 <+8>: cmpq $0xf0,-0x8(%rbp) 0x00000000004004fd <+16>: jle 0x40050a <nothingGreater+29> 0x00000000004004ff <+18>: mov $0xf0,%eax 0x0000000000400504 <+23>: sub -0x8(%rbp),%rax 0x0000000000400508 <+27>: jmp 0x40050e <nothingGreater+33> 0x000000000040050a <+29>: mov -0x8(%rbp),%rax 0x000000000040050e <+33>: pop %rbp 0x000000000040050f <+34>: retq What are the memory addresses of the three statements that implement the if statement (provide hex addresses with 0x prefix and without leading zeroes)? The first two statements that work together: The third statement that skips the else code if the if…
Write on emu8086 platform a code that counts your name characters and department name characters and make the program display the summation of both, you are free to choose if you input your name an department or write it.
Your Question: Write a program in MARIE assembler to print “Hello World!” Define the message as a “C” style NULL terminated string. The program must implement a loop, like the pseudocode below. str =“Hello World!” index = 0 while str[index] != 0 output str[index] index = index + 1 ORG 100 START, LOAD STR STORE INDEXLOOP, LOAD INDEX ADD ONE STORE INDEX LOAD INDEX ADD STR STORE X LOAD X OUTPUT JUMP END JUMP LOOP END, HALT STR, HEX 0048 HEX 0065 HEX 006C HEX 006C HEX 006F HEX 0020 HEX 0057 HEX 006F HEX 0072 HEX 006C HEX 0064 HEX 0021 HEX 0000 INDEX, DEC 0ONE, DEC 1X, DEC 0 END START // it does not print anything, help pls
2. Write a 32-bit mode assembly language program that uses a LOOP to sum the elements of the following words array: arrayD WORD 100h, 200h, 300h, 400h
Suppose that a FSQRT function is responsible for 40% of the execution time of some application and all floating-point FP instructions (ALLFP) are responsible for 55%. To improve the performance of this application, the developers asked you to help them select the best of the following two choices: (Show all your calculations). • First choice: to speed up the function FSQRT by a factor of 10 • Second choice: execute ALLFP instructions 2x faster.
Implement the following pseudocode in assembly language program. while (val1 < val2){Val1++;Val2--; }