Q. The time that depends on the input: an already sorted sequence that is easier to sort.

View solution

Q. Which of the following is incorrect?

Algorithms can be represented:

View solution

Q. When an algorithm is written in the form of a programming language, it becomes a _________

View solution

Q. Any algorithm is a program.

View solution

Q. A system wherein items are added from one and removed from the other end.

View solution

Q. Another name for 1-D arrays.

View solution

Q. A data structure that follows the FIFO principle.

View solution

Q. In computer science, algorithm refers to a pictorial representation of a flowchart.

View solution

Q. The process of drawing a flowchart for an algorithm is called __________

View solution

Q. Actual instructions in flowcharting are represented in __________

View solution

Q. A box that can represent two different conditions.

View solution

Q. There should be certain set standards on the amount of details that should be provided in a flowchart.

View solution

Q. A detailed flowchart is called ______

View solution

Q. Which of the following is not an advantage of a flowchart?

View solution

Q. A flowchart that outlines the main segments of a program.

View solution

Q. A ______________ is diagram that depicts the flow of a program.

View solution

Q. Terminals are represented by diagonals in a flowchart.

View solution

Q. The operation represented by parallelograms.

View solution

Q. Which of the following is not a flowchart structure?

View solution

Q. The action performed by a ___________ structure must eventually cause the loop to terminate.

View solution