Question 1: write an assembly program using NASM that outputs the timetables from 1 to 13. The output should be: 1 2 3 4 5 6 7 8 9 10 11 12 13 1 1 2 3 4 5 6 7 8 9 10 11 12 13 2 4 6 2 8 10 12 14 16 18 20 22 24 26 3 6 9. 12 15 18 21 24 27 30 33 36 39 4 4 12 16 20 24 28 32 36 40 44 48 52 10 15 20 25 30 35 40 45 50 55 60 65 6. 6. 12 18 24 30 36 42 48 54 60 66 72 78 7 7 14 21 28 35 42 49 56 63 70 77 84 91 8. 8. 16 24 32 40 48 56 64 72 80 88 96 104 9. 9 18 27 36 45 54 63 72 81 90 99 108 117 10 10 20 30 40 50 60 70 80 90 100 110 120 130 11 11 22 33 44 55 66 77 88 99 110 121 132 143 12 12 24 36 48 60 72 84 96 108 120 132 144 156 13 13 26 39 52 65 78 91 104 117 130 143 156 169 Code requirements: • Your assembly code must calculate each timetable value. That is, to output the value of 10 * 7 your program must undertake that calculation. Simply printing a stored string of results will provide a mark of 0. Your assembly code must use nam as an assembler. Not doing so will result in a mark of

Question 1: write an assembly program using NASM that outputs the timetables from 1 to 13. The output should be: 1 2 3 4 5 6 7 8 9 10 11 12 13 1 1 2 3 4 5 6 7 8 9 10 11 12 13 2 4 6 2 8 10 12 14 16 18 20 22 24 26 3 6 9. 12 15 18 21 24 27 30 33 36 39 4 4 12 16 20 24 28 32 36 40 44 48 52 10 15 20 25 30 35 40 45 50 55 60 65 6. 6. 12 18 24 30 36 42 48 54 60 66 72 78 7 7 14 21 28 35 42 49 56 63 70 77 84 91 8. 8. 16 24 32 40 48 56 64 72 80 88 96 104 9. 9 18 27 36 45 54 63 72 81 90 99 108 117 10 10 20 30 40 50 60 70 80 90 100 110 120 130 11 11 22 33 44 55 66 77 88 99 110 121 132 143 12 12 24 36 48 60 72 84 96 108 120 132 144 156 13 13 26 39 52 65 78 91 104 117 130 143 156 169 Code requirements: • Your assembly code must calculate each timetable value. That is, to output the value of 10 * 7 your program must undertake that calculation. Simply printing a stored string of results will provide a mark of 0. Your assembly code must use nam as an assembler. Not doing so will result in a mark of

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

Write the MIPS assembly code which calculate the grades of student according to the criteria: When the mark is greater or equal to 90, it will return the value 4 if the mark is greater or equal to 80 but less than 90, it will return the value 3 if the mark is greater or equal to 70 but less than 80, it will return the value 2 if the mark is greater or equal to 60 but less than 70, it will return the value 1 if the mark is less than 60, it will return the value 0
Write an assembly (8085) code to check if a number is even or odd. The number will be stored in a memory location 0211. The number can be anything. So your code has to be dynamic that works for any number. If the number is even then store 1 in memory location 0222, otherwise store 0 in 0222.
This is Computer Machine Architecture! this is Hamming code in MIPS assembly language 1. when I input a 154 (the example in the book). It should have given an output of 0x72A. the assignment: This assignment is to create a MIPS programs that the determines what the ECC code should given number (an 8-bit byte). The codes you create are to work for 8-bit positive numbers as these are simpler to work with than larger numbers. The program is to request the user to enter a byte of data (a positive integer in the range of 0 to 255 in decimal) and then create the 12-bit Hamming code as described in your text (see above). The program is to then output this (with an appropriate label) in hex. Make sure that you have lots of comments in your code as this is in MIPS. Also make the code neat: line up the instruction columns, the register columns, and the comment fields like the format below
Write an LC-3 assembly language program that counts the number of 1s in the value stored in R0 and stores the result in R1. For example, if R0 contains 0001001101110000 (x1370), then after the program executes, the value stored in R1 would be 0000000000000110 (decimal 6) Here are some hints ORIG x3000 AND R5, R5, #0 ADD R5, R5, #1 ;R5 will act as a mask AND R1, R1, #0 ;zero out the result register AND R2, R2, #0 ;R2 will act as a counter LD R3, NegSixt MskLoop AND R4, R0, R5 ;mask off the bit Add code here... if you want more than a 0 Solicit the number to be inspected via the keyboard. 10 points for a single digit (e.g. 5) decimal number, which must be converted to binary. 20 points for a two digit (e.g. 55) decimal number, which must be converted to binary.
Must run on JsSpim online assembler and simulator: https://shawnzhong.github.io/JsSpim/ Write a counting program in MIPS assembly. The program should print the first sixteen powers of 2 beginning with 2^0 with a space between each value. The output of the program should be exactly as follows: 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 Additional requirements for this problem: You must use a logical shift operation in your implementation. You must use a loop (i.e., a conditional branch that causes program instructions to repeat).
Assignment for Computer Architecture The assignment is to create a MIPS program that demonstrates that the associative law fails in addition for floating point numbers (single or double precision). You only need to demonstrate it for single precision. Remember the associative law is a + (b + c) = (a + b) + c. The program’s output should look something like the following where the xxx’s are the numbers you chose. The resulting numbers may be different than mine depending on your choice of a, b, and c. Using a = xxx, b = xxx, and c = xxx a + (b + c) = 0 (a + b) + c = 1 The key is to have two of the number large (one positively and one negatively but equal in magnitude) floating point numbers and the third floating point number very small in comparison. As a side note, the associative law will also fail for multiplication for floating point numbers, but you do not need to demonstrate that. Please don't forget to include comments in this code
E In the following code block(Reference:Q11), you will a set of assembly instructions with corresponding line numbers (line numbers are for informational purpose only and they are not part of the source code). 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 mov edx, 5 dec ecx jmp LABEL1 mov eax, 1 LABEL1: mul edx jmp ecx mov edx, 0678h sub edx, eax jmp DWORD PTR [edx] neg ebx add ecx, ebx mov eax, 0 For each of the conditions/scenario listed below, indicate the corresponding line number (that cause or is associated with the condition/scenario). Enter 0 (Zero) if the condition is not caused by the block of code. 1) Memory indirect jump: type your answer... type your answer... type your answer... type your answer... 2) Register indirect jump: 3) Relative short jump: type your answer... 5) Two's complement type your answer... 4) Relative near jump: 6) Unreachable code
Write a code (assembly language programing of 8086) to print the following dynamic pattern. Where the user inputs size of the pattern N. (You must use INDEC/OUTDEC to INPUT/OUTPUT any digit) Sample Input: Sample Input: N = 4 N = 3 Sample Output: Sample Output: 1 1 5 3 1 531 97531 975 31 11 9 7 5 3 1
Write a counting program in MIPS assembly. The program should print the first sixteen powers of 2 beginning with 20 with a space between each value. The output of the program should be exactly as follows: 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 Additional requirements for this problem: You must use a logical shift operation in your implementation. You must use a loop (i.e., a conditional branch that causes program instructions to repeat).
Write a program in MARS MIPS assembly language that asks the user to enter an unsigned number and read it. Then swap the bits at odd positions with those at even positions and display the resulting number. For example, if the user enters the number 9, which has binary representation of 1001, then bit 0 is swapped with bit 1, and bit 2 is swapped with bit 3, resulting in the binary number 0110. Thus, the program should display 6.
Amdahl’s Law My speedup factor is 6. My new execution time after speedup is 5 seconds. What was my old or original execution time in seconds?
Using the Assembly Language Programming of 8086, write and simulate a program that adds two data 0010h and 0010h, and would only stop adding when it gets a result of 0100h. Go over each line of the code. Write your explanation of what each line does as a comment after the line