A sequence of instructions, in a computer language, to get the desired result, is known as______________?
A. Program
B. Algorithm
C. Decision Table
D. All of the above
A. Program
B. Algorithm
C. Decision Table
D. All of the above
A. A greater degree of machine independence
B. Improved debugging capability, and superior documentation
C. Fewer people, less management and shorter transition in learning time
D. All of the above
A. many functions do not have to be implemented twice
B. more flexibility is available to the programmer in which he/she may use all the features of the assembler in conjunction with macros
C. Functions are combined and it is not necessary to create intermediate files as output from the macro processor and input to the assembler
D. All of the above
A. ASRA
B. ADDA h#01FE, i
C. LOADA h#OD4E, i
D. STOREA h#014B, d
A. F8
B. 03 16
C. 0111EF
D. 42 65 61 72
A. serially reusable
B. recursive module
C. reenterable module
D. non-reusable module
A. lexical analysis
B. syntax analysis
C. general syntax analysis
D. interpretation analysis