• HOME
  • QUIZ
  • CONTACT US
EXAMIANS
  • COMPUTER
  • CURRENT AFFAIRS
  • ENGINEERING
    • Chemical Engineering
    • Civil Engineering
    • Computer Engineering
    • Electrical Engineering
    • Mechanical Engineering
  • ENGLISH GRAMMAR
  • GK
  • GUJARATI MCQ

Language Processors

Language Processors
Convert the ASLA assembly language instructions into hexadecimal machine language:

9000000000
DA000F
40
0111EF

ANSWER DOWNLOAD EXAMIANS APP

Language Processors
Convert the 080D4E machine language instructions into assembly language, assuming that they were not generated by pseudo-ops:

LOADA h#OD4E, i
STOREA h#014B, d
ADDA h#01FE, i
ASRA

ANSWER DOWNLOAD EXAMIANS APP

Language Processors
The advantage(s) inherent to using high level languages is/are:

All of these
Improved debugging capability, and superior documentation
Fewer people, less management and shorter transition in learning time
A greater degree of machine independence

ANSWER DOWNLOAD EXAMIANS APP

Language Processors
Advantage(s) of using assembly language rather than machine language is/are:

It is mnemonic and easy to read
Addresses any symbolic, not absolute
All of these
Introduction of data to program is easier

ANSWER DOWNLOAD EXAMIANS APP

Language Processors
In an absolute loading scheme, which loader function is accomplished by loader?

Loading
Reallocation
Linking
Allocation

ANSWER DOWNLOAD EXAMIANS APP

Language Processors
In what module, multiple instances of execution will yield the same result even if one instancy has not terminated before the next one has begun?

serially reusable
non-reusable module
reenterable module
recursive module

ANSWER DOWNLOAD EXAMIANS APP
MORE MCQ ON Language Processors

DOWNLOAD APP

  • APPLE
    from app store
  • ANDROID
    from play store

SEARCH

LOGIN HERE


  • GOOGLE

FIND US

  • 1.70K
    FOLLOW US
  • EXAMIANSSTUDY FOR YOUR DREAMS.
  • SUPPORT :SUPPORT EMAIL ACCOUNT : examians@yahoo.com

OTHER WEBSITES

  • GUJARATI MCQ
  • ACCOUNTIANS

QUICK LINKS

  • HOME
  • QUIZ
  • PRIVACY POLICY
  • DISCLAIMER
  • TERMS & CONDITIONS
  • CONTACT US
↑