Answer:
Option d pretest
Explanation:
Given the pseudocode:
- do stepA
- do stepB
- if conditionC is true
- then do stepD
- else
- do stepE
- end if
- while conditionF is true
- do stepG
- end while
The pseudocode above shows that there is a pretest before some codes are executed. For example, line 3 check if condition is true then only execute stepD otherwise execute stepE. Line 8 check if conditionF is true then repeatedly execute stepG. These are examples of pretest a condition will must be met (pretest passed) before a block of codes can be executed. This pretest can be seen in if-else statements and also the while condition.
Answer:
Information
Explanation:
Good decisions are normally based on facts which are tangible information that can be analysed to show trends of key figures such as sales, income, production that are so critical in business. A well-designed and accurate database captures and stores these figures in an organised way which will enable the information or data to be analysed to make informed decisions.
<span>Sizing handles are used in Microsoft Word to resize an object.</span>
Answer:
Worst case time of Heapsort is better than worst case time of Quicksort.
Explanation:
Worstcase of Heapsort is nlog(n). Worstcase time of Quicksort is (n^2). Heapsort is comparison based sorting algorithm. Heapsort divides input into sorting. It is a selection sort in which we send maximum inputs for maximum elements at end. Quicksort is divide and conquer algorithm. It is considered as efficient sourcing algorithm.
I'll create new ones because just for me, its so hassle
