Given program fragment: if A = B then while C=X do X := X-1 else C:= 5. Give the prime program decomposition of this flowgraph. ______
Fill in the blank(s) with the appropriate word(s).
P1: X:=X+1
P2: C:=5
P3: While C=X do P1 else P2
P4: If A=B then P3
You might also like to view...
Java’s concurrency APIs include the fork/join framework, which helps programmers parallelize algorithms. The fork/join framework particularly well suited to divide-and-conquer-style algorithms, like the ________ sort.
a. insertion sort b. selection sort c. merge sort d. bubble sort
The fetch-and-execute cycle is also called the ________ cycle
A) processing B) control C) instruction D) management
Using a(n) ____ graphic in a Flash document is best when you are developing an advertisement or banner for a Web site for a business or professional organization.
A. vector B. indexed C. bitmap D. concatenated
When you build a linked list in the backward manner, a new node is always inserted at the end of the linked list.
Answer the following statement true (T) or false (F)