Foundations of Computer
Science: Final 2026 | Study
Guide, Practice Questions,
Answers, Rationales &
Exam Review | Complete
Ethics Study Guide
Updated 2026 Questions and Answers
100% Verified Exam Prep and Comprehensive
Rationales
Included
,The first slide rule appeared around ____. 1622
FORTRAN and COBOL, the first high-level ("English-like") false
programming languages, appeared during the first
generation of computing
jacquard's loom was considered the first "computing programmable
device" because it was _______ and had memory where
information was stored in a machine-readable form.
in 1672, a french philosopher and mathematician designed pascaline
and built one of the first mechanical calculators named the
__________ that could do addition and subtraction.
one of the most fundamentally important virtues of a(n) algorithm
__________ is that if we can specify one to solve a
problem, then we can automate the solution.
All conceivable problems can be solved algorithmically. false
ultra-large-scale integrated circuits are _________ - fifth
generation innovation in computing.
unlike the _________, leibniz's wheel could carry out pascaline
addition, subtraction, multiplication, and division
in computer science terminology, the machine, robot, computing agent
person, or thing carrying out the steps of the algorithm is
called a(n) ________.
the first electronic programmable computer, ENIAC, was true
completed just after World War II.
integrated circuits, built on silicon chips, were introduced third
during the _____ generation of computing.
the evolution of computer science began before the true
development of the first computer system.
, in computer science, it is not simply the construction of a program
high-quality __________ that is important but also the
methods it embodies.
when an operation is unambiguous, we call it a primitive true
operation, or simply a primitive of the computing agent
carrying out the algorithm.
during the ________ generation of computing, the desktop fourth
machine shrunk to the size of a typewriter.
what is wrong with the following algorithm? it does not halt in a finite amount of time
1. set x to be 1
2. increment x
3. print x
4. if x > 0, repeat from 2
an algorithm may be too ________ to be of any use. inefficient
the _______ revolution enabled us to implement computer
algorithms that automated the drudgery of repetitive
mental tasks.
in babbage's analytical engine, a mill was most like the logic unit
________ of modern-day computers.
the pascaline and leibnitz's wheel are examples of early false
computers.
in 1614, john napier invented ________ as a way to logarithms
simplify difficult mathematical computations.
_________ operations are the "looping" instructions of an looping
algorithm.
Science: Final 2026 | Study
Guide, Practice Questions,
Answers, Rationales &
Exam Review | Complete
Ethics Study Guide
Updated 2026 Questions and Answers
100% Verified Exam Prep and Comprehensive
Rationales
Included
,The first slide rule appeared around ____. 1622
FORTRAN and COBOL, the first high-level ("English-like") false
programming languages, appeared during the first
generation of computing
jacquard's loom was considered the first "computing programmable
device" because it was _______ and had memory where
information was stored in a machine-readable form.
in 1672, a french philosopher and mathematician designed pascaline
and built one of the first mechanical calculators named the
__________ that could do addition and subtraction.
one of the most fundamentally important virtues of a(n) algorithm
__________ is that if we can specify one to solve a
problem, then we can automate the solution.
All conceivable problems can be solved algorithmically. false
ultra-large-scale integrated circuits are _________ - fifth
generation innovation in computing.
unlike the _________, leibniz's wheel could carry out pascaline
addition, subtraction, multiplication, and division
in computer science terminology, the machine, robot, computing agent
person, or thing carrying out the steps of the algorithm is
called a(n) ________.
the first electronic programmable computer, ENIAC, was true
completed just after World War II.
integrated circuits, built on silicon chips, were introduced third
during the _____ generation of computing.
the evolution of computer science began before the true
development of the first computer system.
, in computer science, it is not simply the construction of a program
high-quality __________ that is important but also the
methods it embodies.
when an operation is unambiguous, we call it a primitive true
operation, or simply a primitive of the computing agent
carrying out the algorithm.
during the ________ generation of computing, the desktop fourth
machine shrunk to the size of a typewriter.
what is wrong with the following algorithm? it does not halt in a finite amount of time
1. set x to be 1
2. increment x
3. print x
4. if x > 0, repeat from 2
an algorithm may be too ________ to be of any use. inefficient
the _______ revolution enabled us to implement computer
algorithms that automated the drudgery of repetitive
mental tasks.
in babbage's analytical engine, a mill was most like the logic unit
________ of modern-day computers.
the pascaline and leibnitz's wheel are examples of early false
computers.
in 1614, john napier invented ________ as a way to logarithms
simplify difficult mathematical computations.
_________ operations are the "looping" instructions of an looping
algorithm.
