Deck 8: Algorithms
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/18
Play
Full screen (f)
Deck 8: Algorithms
1
The _______ construct uses a set of actions one after another.
A) sequence
B) decision
C) repetition
D) flow
A) sequence
B) decision
C) repetition
D) flow
A
2
The _______ construct handles repeated actions.
A) sequence
B) decision
C) repetition
D) flow
A) sequence
B) decision
C) repetition
D) flow
C
3
We use a _______ search for an ordered list.
A) sequential
B) binary
C) bubble
D) insertion
A) sequential
B) binary
C) bubble
D) insertion
B
4
In ______ sort, the smallest item moves to the beginning of the unsorted list. There is no one-to-one swapping.
A) selection
B) bubble
C) insertion
D) every
A) selection
B) bubble
C) insertion
D) every
Unlock Deck
Unlock for access to all 18 flashcards in this deck.
Unlock Deck
k this deck
5
_______ is a pictorial representation of an algorithm.
A) A UML diagram
B) A program
C) Pseudocode
D) An algorithm
A) A UML diagram
B) A program
C) Pseudocode
D) An algorithm
Unlock Deck
Unlock for access to all 18 flashcards in this deck.
Unlock Deck
k this deck
6
_______ is a basic algorithm that multiplies a list of numbers.
A) Summation
B) Product
C) Smallest
D) Largest
A) Summation
B) Product
C) Smallest
D) Largest
Unlock Deck
Unlock for access to all 18 flashcards in this deck.
Unlock Deck
k this deck
7
_______ is a step-by-step method for solving a problem or doing a task.
A) A construct
B) A recursion
C) An iteration
D) An algorithm
A) A construct
B) A recursion
C) An iteration
D) An algorithm
Unlock Deck
Unlock for access to all 18 flashcards in this deck.
Unlock Deck
k this deck
8
There are ______ basic constructs in computer -science.
A) one
B) two
C) three
D) four
A) one
B) two
C) three
D) four
Unlock Deck
Unlock for access to all 18 flashcards in this deck.
Unlock Deck
k this deck
9
_______ is a basic algorithm that adds a list of numbers.
A) Summation
B) Product
C) Smallest
D) Largest
A) Summation
B) Product
C) Smallest
D) Largest
Unlock Deck
Unlock for access to all 18 flashcards in this deck.
Unlock Deck
k this deck
10
We use a _______ search for an unordered list.
A) sequential
B) binary
C) bubble
D) insertion
A) sequential
B) binary
C) bubble
D) insertion
Unlock Deck
Unlock for access to all 18 flashcards in this deck.
Unlock Deck
k this deck
11
In _______ sort, the smallest item from the unsorted list is swapped with the item at the beginning of the unsorted list.
A) selection
B) bubble
C) insertion
D) every
A) selection
B) bubble
C) insertion
D) every
Unlock Deck
Unlock for access to all 18 flashcards in this deck.
Unlock Deck
k this deck
12
In _______ sort, the item that goes into the sorted list is always the first item in the unsorted list.
A) selection
B) bubble
C) insertion
D) every
A) selection
B) bubble
C) insertion
D) every
Unlock Deck
Unlock for access to all 18 flashcards in this deck.
Unlock Deck
k this deck
13
_______ is a basic algorithm in which we want to find the location of a target in a list of items.
A) Sorting
B) Searching
C) Product
D) Summation
A) Sorting
B) Searching
C) Product
D) Summation
Unlock Deck
Unlock for access to all 18 flashcards in this deck.
Unlock Deck
k this deck
14
The items are divided into two lists (sorted and unsorted) _____ sort.
A) only in a selection
B) only in a bubble
C) only in an insertion
D) in selection, bubble, or insertion
A) only in a selection
B) only in a bubble
C) only in an insertion
D) in selection, bubble, or insertion
Unlock Deck
Unlock for access to all 18 flashcards in this deck.
Unlock Deck
k this deck
15
_______ is an English-language-like representation of code.
A) A UML diagram
B) A program
C) Pseudocode
D) An algorithm
A) A UML diagram
B) A program
C) Pseudocode
D) An algorithm
Unlock Deck
Unlock for access to all 18 flashcards in this deck.
Unlock Deck
k this deck
16
_______ is a basic algorithm that arranges data according to its value.
A) Inquiry
B) Sorting
C) Searching
D) Recursion
A) Inquiry
B) Sorting
C) Searching
D) Recursion
Unlock Deck
Unlock for access to all 18 flashcards in this deck.
Unlock Deck
k this deck
17
The _______construct tests a condition.
A) sequence
B) decision
C) repetition
D) flow
A) sequence
B) decision
C) repetition
D) flow
Unlock Deck
Unlock for access to all 18 flashcards in this deck.
Unlock Deck
k this deck
18
_______ is a process in which an algorithm calls itself.
A) Insertion
B) Searching
C) Recursion
D) Iteration
A) Insertion
B) Searching
C) Recursion
D) Iteration
Unlock Deck
Unlock for access to all 18 flashcards in this deck.
Unlock Deck
k this deck