Data Structures and algorithms Test Questions and
Answers Rated A
What term refers to a template for creating an A. Linear
object? B. Divide-and-conquer
A. Application C. Greedy
B. Class D. Quicksort - ANSWER -Linear
C. Method
D. Algorithm - ANSWER -Class
What is a high-level consideration in an
algorithm's design?
Which characteristic of an algorithm is A. Simplicity
independent in nature? B. Database type
A. Uses Python to implement the algorithm C. Finiteness
B. uses MySQL for the database needs of the D. Browser Type - ANSWER -Simplicity
algorithm's application
C. Uses Windows to install the application
D. Uses an agnostic code repository - What is the primary method used to search for an
ANSWER -Uses an agnostic code item in a sorted array?
repository A. Binary search
B. Jump Search
C. Exponential search
What is referred to as a data structure that stores D. Linear Search - ANSWER -Binary
subitems? Search
A. Array
B. Matrix
C. Record Which review of an algorithm happens after
D. Graph - ANSWER -Record implementation?
* Binary search
* A posteriori analysis
Which factor takes the ability to easily update an * A priori analysis
algorithm into consideration? * Linear search - ANSWER -A posteriori
A. Scalability analysis
B. Feasability
C. Maintainability
D. Modularity - ANSWER -Maintainability Which factor helps measure the reusability of an
algorithm?
* User adoption
What is a component of an algorithm that * Correctness
specifies a stopping point? * Extensibility
A. Sequencing * Flowchart - ANSWER -Extensibility
B. Finiteness
C. Iteration
D. Looping - ANSWER -Finiteness Which search algorithm utilizes the divide-and-
conquer strategy?
* Insertion search
Which term refers to a type of search algorithm? * Bubble search
1/7
, Data Structures and algorithms Test Questions and
Answers Rated A
* Linear search
* Binary search - ANSWER -Binary Search What is x in the following block of logic?
x=28
If x >= 10 and x < 20
Which algorithm requires data sorting as its first x = 20
step? elif x <= 30
* Recursive x = 25
* Linear elif x >= 50
* Binary x = 100
* Merge - ANSWER -Binary else
x = 500 - ANSWER -x = 25
What does a time complexity analysis of an
algorithm include? What is an if statement inside of an if statement
* Memory usage referred to as?
* Efficiency analysis * Nested
* Screen load times * Internal
* Worst case - ANSWER -Worst case * Double if
* Subscript - ANSWER -Nested
Which data type do heap sorts work with?
* Tree-based data structure Which search algorithm functions by continually
* Array dividing the data set in half until the sought item
* String is found or the data set is exhausted?
* Number - ANSWER -Tree-based data * Sequential search
structure * Binary search
* Jump search
* Linear search - ANSWER -Binary Search
Which function is used in conjunction with a
merge sort algorithm?
* For loop Which search algorithm has the best
* If statement performance when the data set is sorted?
* Do while loop * Sequential search
* Recursive - ANSWER -Recursive * List search
* Interval search
* Linear search - ANSWER -Interval Search
Which attribute of a recursive function makes it
unique?
* Calls itself Which term describes a way of organizing,
* Calls another function storing, and performing operations on data?
* Uses for loops * Data structure
* Uses case statements - ANSWER -Calls * Vertex
itself * Record
* Graph - ANSWER -Data Structure
2/7
Answers Rated A
What term refers to a template for creating an A. Linear
object? B. Divide-and-conquer
A. Application C. Greedy
B. Class D. Quicksort - ANSWER -Linear
C. Method
D. Algorithm - ANSWER -Class
What is a high-level consideration in an
algorithm's design?
Which characteristic of an algorithm is A. Simplicity
independent in nature? B. Database type
A. Uses Python to implement the algorithm C. Finiteness
B. uses MySQL for the database needs of the D. Browser Type - ANSWER -Simplicity
algorithm's application
C. Uses Windows to install the application
D. Uses an agnostic code repository - What is the primary method used to search for an
ANSWER -Uses an agnostic code item in a sorted array?
repository A. Binary search
B. Jump Search
C. Exponential search
What is referred to as a data structure that stores D. Linear Search - ANSWER -Binary
subitems? Search
A. Array
B. Matrix
C. Record Which review of an algorithm happens after
D. Graph - ANSWER -Record implementation?
* Binary search
* A posteriori analysis
Which factor takes the ability to easily update an * A priori analysis
algorithm into consideration? * Linear search - ANSWER -A posteriori
A. Scalability analysis
B. Feasability
C. Maintainability
D. Modularity - ANSWER -Maintainability Which factor helps measure the reusability of an
algorithm?
* User adoption
What is a component of an algorithm that * Correctness
specifies a stopping point? * Extensibility
A. Sequencing * Flowchart - ANSWER -Extensibility
B. Finiteness
C. Iteration
D. Looping - ANSWER -Finiteness Which search algorithm utilizes the divide-and-
conquer strategy?
* Insertion search
Which term refers to a type of search algorithm? * Bubble search
1/7
, Data Structures and algorithms Test Questions and
Answers Rated A
* Linear search
* Binary search - ANSWER -Binary Search What is x in the following block of logic?
x=28
If x >= 10 and x < 20
Which algorithm requires data sorting as its first x = 20
step? elif x <= 30
* Recursive x = 25
* Linear elif x >= 50
* Binary x = 100
* Merge - ANSWER -Binary else
x = 500 - ANSWER -x = 25
What does a time complexity analysis of an
algorithm include? What is an if statement inside of an if statement
* Memory usage referred to as?
* Efficiency analysis * Nested
* Screen load times * Internal
* Worst case - ANSWER -Worst case * Double if
* Subscript - ANSWER -Nested
Which data type do heap sorts work with?
* Tree-based data structure Which search algorithm functions by continually
* Array dividing the data set in half until the sought item
* String is found or the data set is exhausted?
* Number - ANSWER -Tree-based data * Sequential search
structure * Binary search
* Jump search
* Linear search - ANSWER -Binary Search
Which function is used in conjunction with a
merge sort algorithm?
* For loop Which search algorithm has the best
* If statement performance when the data set is sorted?
* Do while loop * Sequential search
* Recursive - ANSWER -Recursive * List search
* Interval search
* Linear search - ANSWER -Interval Search
Which attribute of a recursive function makes it
unique?
* Calls itself Which term describes a way of organizing,
* Calls another function storing, and performing operations on data?
* Uses for loops * Data structure
* Uses case statements - ANSWER -Calls * Vertex
itself * Record
* Graph - ANSWER -Data Structure
2/7
