Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
- write or correct assembly language program print value 1,2,3,4 using array
dosseg
.model small
.stack 100h
.data
arr DB 1,2,3,4
.code
main proc
mov ax, @data
mov ds, ax
mov si, offset arr
mov dx, [si]
mov ah,2
int 21h
Mov dx, [si+1]
mov ah,2
int 21h
Mov dx, [si+2]
mov ah,2
int 21h
Mov dx, [si+3]
mov ah,2
int 21h
mov ah,4ch
int 21h
main endp
- We have written some Assembly statements again and again, to avoid repetition we use
loop for example following program will print digits from 1 to 6 using loop
dosseg
.model small
.data
arr DB 1,2,3,4,5,6
.code
main proc
mov ax, @data
mov ds, ax
mov si, offset arr
mov cx,6
loopx:
mov dl, [si]
add dl,48
mov ah,2
int 21h
mov dl, 44
mov ah,2
int 21h
Inc si ; mov dx, [si+1]
loop loopx
mov ah,4ch
int 21h
main endp
end main
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by stepSolved in 2 steps
Knowledge Booster
Similar questions
- The improved algorithm for finding the occurrences of sequence P[1, . . . , m]in sequence T[1, . . . , n] can also be implemented in Perl in a straightforwardway, as shown in the following Perl script. Recall that the suffix array of thesequence T[1, . . . , n] will be a permutation of array positions 0, 1, . . . , n − 1,because Perl arrays do not start with position 1 but, rather, with position 0.arrow_forwardThe following Perl script demonstrates how the improved approach for detecting the occurrences of sequence P[1,..., m] in sequence T[1,..., n] may be easily implemented in Perl. Keep in mind that the suffix array of the sequence T[1,..., n] will be a permutation of array places 0, 1,...,., n 1, as opposed to position 1, as Perl arrays start at position 0.arrow_forwardWrite an Arm Assembly Program that does the following:•Stores on the stack a list of words of memory where the first element of the list is how manyremaining elements are in the list, and the rest of the elements in the list are initialized tosome random values.– Example:list: 6, -3, 4, 5, 9, 22, 99//stores a list of the 6 elements -3, 4, 5, 9, 22, 99•At the end of the program, register r0 should hold the sum of only the negative values in thearray (nonnegative elements are ignored).•Note that your program must work correctly even if the values stored in the list are changed.arrow_forward
- How to call sum function from main in LEGv8 assembly code: int f, g, y int sum (int a, int b) {return (a +b)} int main (void) {f=2;g=3;y= sum (f, g);return y;} Explain each line, and use only conventional commands. Is it possible to use stack in this example? First we push using SUBI and store them using STUR.arrow_forwardConsider a standard stack data structure with a push and popoperation. What would be the exact complexity (not Big O) to print alln items in some stack and return it to its original order when finished?arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY
Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON
Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education
Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY