Flowchart can contain:

Assume that Davis's Bit Hill Climbing, First Improvement Hill Climbing and Steepest Descent Hill Climbing algorithms are applied to a MAX-SAT problem instance resulting in average objective values of 12.4, 34.3 and 25.7, respectively, over 30 runs.

Which algorithm performs the best based on the average objective value on this problem instance?

graphical representation of program algorithm is called:

After applying the adjacent pairwise interchange operator three times at random to the candidate solution of "1-3-2-5-4-7-6", which of the following new candidate solutions could be produced?

Applying the bit-flip operator randomly for once to the candidate solution of "0101010", which of the following new candidate solutions could be produced?