Explain the statements present in assembly language, Operating System

Assignment Help:

Explain the Statements Present in Assembly Language

An assembly program consists of subsequent three types of statements:

a. Imperative statements: this point out an action to be carried out during execution of the assembled program. Every imperative statement usually translates into one machine instruction.

b. Declaration statements: The syntax of declaration statements is like this:

        [Label]      DS
        [Label]      DC ‘

The DS statement reserves areas of memory and links names with them.
The DC statement constructs memory words containing constants.

c. Assembler directives: These instruct the assembler to carry out specific actions during the assembly of a program. For instance 
START directive points out that the first word of the target program generated by the assembler should be placed in the memory word along with address .


Related Discussions:- Explain the statements present in assembly language

What is busy waiting, What is busy waiting? The repeated implementation...

What is busy waiting? The repeated implementation of a loop of code while waiting for an event to happen is known as busy-waiting. The CPU is not engaged in any actual producti

Lock revenue variable, Demonstrate that your program (include the program o...

Demonstrate that your program (include the program output as part of the final report) can produce the correct output with the following parameters. For each case comment if the ou

Explain additional-reference-bits algorithm, Additional-reference-bits algo...

Additional-reference-bits algorithm We can keep an 8-bit byte for every page in a table in memory. The operating system shifts the reference bits right 1 bit, discarding the lo

Implementation of lru, 1. On every access, mark the page with a timestamp. ...

1. On every access, mark the page with a timestamp. Whenever we need to evict a page, we search through memory for the oldest page, the least-recently used page. But we need memory

Define a election algorithm, Consider a setting where processors are not as...

Consider a setting where processors are not associated with unique identifiers but the total number of processors is known and the processors are organized along a bidirectional ri

Explain general graph directory structure, General Graph Directory A s...

General Graph Directory A serious trouble with using an acyclic graph structure is making sure that there are no cycles. When links are further added to an existing tree struc

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd