logo

CuriousTab

CuriousTab

Discussion


Home Computer Science Language Processors Comments

  • Question
  • Indicate whether the statement LDA B is a statement, in


  • Options
  • A. Machine language
  • B. Assembly language
  • C. High level language
  • D. All of the above

  • Correct Answer
  • Assembly language 


  • Language Processors problems


    Search Results


    • 1. The Process Manager has to keep track of:

    • Options
    • A. the status of each program
    • B. the priority of each program
    • C. the information management support to a programmer using the system
    • D. both (a) and (b)
    • Discuss
    • 2. Convert the CHARI h#000F, s assembly language instructions into hexadecimal machine language:

    • Options
    • A. 0111EF
    • B. 9001E6
    • C. DA000F
    • D. 40
    • Discuss
    • 3. A sequence of instructions, in a computer language, to get the desired result, is known as

    • Options
    • A. Algorithm
    • B. Decision Table
    • C. Program
    • D. All of the above
    • Discuss
    • 4. The task(s) of the Lexial analysis phase is/are:

    • Options
    • A. to parse the source program into the basic elements or tokens of the language
    • B. to build a literal table and an identifier table
    • C. to build a uniform symbol table
    • D. All of the above
    • Discuss
    • 5. When a computer is first turned on or restarted, a special type of absolute loader, called a ______ is executed

    • Options
    • A. loader
    • B. linker
    • C. bootstrap loader
    • D. None of the above
    • Discuss
    • 6. The function(s) of the Syntax phase is/ are:

    • Options
    • A. to recognize the major constructs of the language and to call the appropriate action routines that will generate the intermediate form or matrix for these constructs
    • B. to build a literal table and an identifier table
    • C. to build a uniform symbol table
    • D. to parse the source program into the basic elements or tokens of the language
    • Discuss
    • 7. Convert the 48 machine language instructions into assembly language, assuming that they were not generated by pseudo-ops:

    • Options
    • A. ASRA
    • B. LOADA h#OD4E, i
    • C. STOREA h#014B, d
    • D. ADDA h#01FE, i
    • Discuss
    • 8. Loaders that allow for program relocation are called

    • Options
    • A. relocating loaders
    • B. relative loaders
    • C. both (a) and (b)
    • D. None of the above
    • Discuss
    • 9. 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?

    • Options
    • A. non-reusable module
    • B. serially reusable
    • C. reenterable module
    • D. recursive module
    • Discuss
    • 10. In an absolute loading scheme, which loader function is accomplished by loader?

    • Options
    • A. Reallocation
    • B. Allocation
    • C. Linking
    • D. Loading
    • Discuss


    Comments

    There are no comments.

Enter a new Comment