← 4 Alice vocabulary Export Options Alphabetize Word-Def Delimiter Tab Comma Custom Def-Word Delimiter New Line Semicolon Custom Data Copy and paste the text below. It is read-only. Select All binary branching The occurrence of a branching routine in an algorithm where the path or flow of the algorithm's sequential logic splits into exactly two possible paths. binary bypass A binary branching routine in which an instruction or set of instructions is either executed or bypassed. binary choice A binary branching routine in which one of two instructions (or one of two sets of instructions), but not both, is executed. branch A path or flow of sequential logic in an algorithm. A branching routine, which is sometimes called simply branching, occurs whenever the path or flow of sequential logic in an algorithm splits into two or more paths. branching routine This occurs whenever the path or flow of sequential logic in an algorithm splits into two or more paths. Branching routines are also known as selection sequences or selection structures. concurrency This is the process of running multiple threads of an algorithm at the same time. A thread is simply part of an algorithm that may be executed at the same time as other parts of an algorithm, or at the same time as another copy of itself. Algorithms that allow concurrency are known as parallel algorithms. control variable A variable whose value controls whether or not a particular path in a selection sequence or in a repetition sequence will be executed. count-controlled loop An element of logical structure in an algorithm in which a process is repeated a specific number of times. In a count-controlled loop, the control variable is a called a counter. We need to know the initial value, the final value, and the increment for the counter.