CS100 Test 1 Question and answers
correctly solved 2025
Computer science is the study of computers. T/F - correct answers False
Computer science is the study of how to write computer programs. T/F -
correct answers False
Algorithms are exclusive to the field of computer science. T/F - correct
answers False
All conceivable problems can be solved algorithmically. T/F - correct answers
False
One of the most fundamentally important virtues of a(n) _______________ is
that if we can specify one to solve a problem then we can automate the
solution. - correct answers Algorithm
_______________ is one of the most common applications of computers. -
correct answers Searching a list
In computer science terminology, the machine, robot, person, or thing carrying
out the steps of the algorithm is called a(n) _______________. - correct
answers Computing agent
An algorithm is essentially useless when _______________. - correct
answers It takes too long to execute
, A(n) _______________ is a well-ordered collection of unambiguous and
effectively computable operations that, when executed, produces a result and
halts in a finite amount of time. - correct answers Algorithm
An operation that is unambiguous is called a(n) _______________ operation
of the computing agent carrying out the algorithm. - correct answers Primitive
A(n) _______________ instruction carries out a single well-defined task. -
correct answers Sequential
The _______________ was the first fully electronic general-purpose
programmable computer. - correct answers ENIAC
_______________ statements are the "question-asking" operations of the
algorithm. - correct answers Conditional
A(n) _______________ is a named storage location that can hold a data
value. - correct answers Variable
Having an infinite loop in an algorithm is an error. T/F - correct answers True
______________ operations send results from the computing agent to the
outside world. - correct answers Output
A(n) _______________ is a collection of useful, pre-written algorithms -
correct answers Library
An algorithm can fall into an infinite loop when _______________. - correct
answers The continuation condition of the loop never becomes false
correctly solved 2025
Computer science is the study of computers. T/F - correct answers False
Computer science is the study of how to write computer programs. T/F -
correct answers False
Algorithms are exclusive to the field of computer science. T/F - correct
answers False
All conceivable problems can be solved algorithmically. T/F - correct answers
False
One of the most fundamentally important virtues of a(n) _______________ is
that if we can specify one to solve a problem then we can automate the
solution. - correct answers Algorithm
_______________ is one of the most common applications of computers. -
correct answers Searching a list
In computer science terminology, the machine, robot, person, or thing carrying
out the steps of the algorithm is called a(n) _______________. - correct
answers Computing agent
An algorithm is essentially useless when _______________. - correct
answers It takes too long to execute
, A(n) _______________ is a well-ordered collection of unambiguous and
effectively computable operations that, when executed, produces a result and
halts in a finite amount of time. - correct answers Algorithm
An operation that is unambiguous is called a(n) _______________ operation
of the computing agent carrying out the algorithm. - correct answers Primitive
A(n) _______________ instruction carries out a single well-defined task. -
correct answers Sequential
The _______________ was the first fully electronic general-purpose
programmable computer. - correct answers ENIAC
_______________ statements are the "question-asking" operations of the
algorithm. - correct answers Conditional
A(n) _______________ is a named storage location that can hold a data
value. - correct answers Variable
Having an infinite loop in an algorithm is an error. T/F - correct answers True
______________ operations send results from the computing agent to the
outside world. - correct answers Output
A(n) _______________ is a collection of useful, pre-written algorithms -
correct answers Library
An algorithm can fall into an infinite loop when _______________. - correct
answers The continuation condition of the loop never becomes false
