ADVANCED TOPICS IN COMPILER DESIGN
CODE GENERATION FOR OBJECT ORIENTED LANGUAGES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Put on socks, put on shoes, put on coat
|
|
|
Put on coat, put on shoes, put on socks
|
|
|
Put on socks, put on coat, put on shoes
|
|
|
None of the above
|
Detailed explanation-1: -An algorithm is a sequence of unambiguous instructions for solving a problem, i.e., for obtaining a required output for any legitimate input in a finite amount of time [Levitin, p.
Detailed explanation-2: -Sequencing is the specific order in which instructions are performed in an algorithm. For example, a very simple algorithm for brushing teeth might consist of these steps: put toothpaste on toothbrush. use toothbrush to clean teeth.
Detailed explanation-3: -Unambiguity: A perfect algorithm is defined as unambiguous, which means that its instructions should be clear and straightforward. Finiteness: An algorithm must be finite. Finiteness in this context means that the algorithm should have a limited number of instructions, i.e., the instructions should be countable.
Detailed explanation-4: -What are the inputs into the problem? What will be the outputs of the problem? In what order do instructions need to be carried out? What decisions need to be made in the problem? Are any areas of the problem repeated?