QUESTION 19 Which one of the following statements is NOT TRUE regarding pseudocode? 1. Pseudocode is...

Transcribed Image Text:

QUESTION 19 Which one of the following statements is NOT TRUE regarding pseudocode? 1. Pseudocode is an English-like representation of an algorithm. 2. A syntax like Pascal is often used in pseudocode. 3. Pseudocode is a pictorial representation of an algorithm. 4. There is no standard for pseudocode-some people use a lot of detail, others use less. QUESTION 20 Which one of the following statements is FALSE regarding the requirements for an algorithm? 1. An algorithm must be a well-defined, ordered set of instructions. 2. Each step in an algorithm must be clear and unambiguous. 3. An algorithm must terminate in finite time. 4. An algorithm need not necessarily produce a result. QUESTION 21 Which one of the following statements is TRUE regarding searching algorithms? 1. Binary search should be used if the list to be searched is unsorted. 2. The bigger the list to be sorted, the more efficient sequential search becomes. 3. A binary search starts by examining the element in the beginning of the list. 4. Binary search is quicker than sequential search. QUESTION 22 An assembler is used to translate code from (i) language. 1. (1) symbolic 2. (1) machine 3. (1) the English 4. () assembly (ii) assembly (ii) assembly (i) machine (ii) machine language into (ii) QUESTION 19 Which one of the following statements is NOT TRUE regarding pseudocode? 1. Pseudocode is an English-like representation of an algorithm. 2. A syntax like Pascal is often used in pseudocode. 3. Pseudocode is a pictorial representation of an algorithm. 4. There is no standard for pseudocode-some people use a lot of detail, others use less. QUESTION 20 Which one of the following statements is FALSE regarding the requirements for an algorithm? 1. An algorithm must be a well-defined, ordered set of instructions. 2. Each step in an algorithm must be clear and unambiguous. 3. An algorithm must terminate in finite time. 4. An algorithm need not necessarily produce a result. QUESTION 21 Which one of the following statements is TRUE regarding searching algorithms? 1. Binary search should be used if the list to be searched is unsorted. 2. The bigger the list to be sorted, the more efficient sequential search becomes. 3. A binary search starts by examining the element in the beginning of the list. 4. Binary search is quicker than sequential search. QUESTION 22 An assembler is used to translate code from (i) language. 1. (1) symbolic 2. (1) machine 3. (1) the English 4. () assembly (ii) assembly (ii) assembly (i) machine (ii) machine language into (ii)

Answer rating: 100% (QA)

Answer 19 3 Pseudocode is pictorial rep... View the full answer