CNIT 176 ACTUAL 2026 STUDY GUIDE EXAM QUESTIONS
AND SOLUTIONS RATED A+
✔✔Abstract Step v. Concrete Step - ✔✔abstract step
-an algorithmic step containing unspecified details
concrete step
-an algorithmic step in which all details are specified
✔✔Control Structure (if then, loops) - ✔✔an instruction that determines the order in
which other instructions in a program are executed
✔✔Array length versus index of last item - ✔✔index of the last item is the length of the
array minus 1
✔✔Sequential Search - ✔✔examines each item in turn and compares it to the one we
are searching
if it matches, we have found the item. if not, we look at the next item in the array
✔✔Record v. Array - ✔✔records
- a named heterogeneous collection of items in which individual items are accessed by
name
arrays
- a named homogeneous collection of items in which individual items are accessed by it
position (index) within the collection
✔✔T/F: An algorithm is a set of unambiguous instructions for solving a problem or
subproblem in an infinite amount of time using a infinite amount of data. - ✔✔False.
finite amount of time using a finite amount of data.
✔✔T/F: Algorithms can be made of abstract and concrete steps. - ✔✔True
✔✔T/F: Loops are an example of a control flow statement. - ✔✔True
✔✔T/F: A record is a homogeneous collection of items - ✔✔False
heterogeneous
✔✔T/F: Items in records can be accessed by position (index). - ✔✔False
can be accessed by name
, ✔✔T/F: an item in an array can be accessed by position (index). - ✔✔True
✔✔T/F: arrays are homogeneous collection of items - ✔✔True
✔✔T/F: The index of the last item in an array is the length of the array minus 1. -
✔✔True
✔✔T/F: Sequential searches of sorted arrays can be stopped once the position where
the item would be located has been passed or the item has been found. - ✔✔True
✔✔T/F: Sequential searches of unsorted arrays can only be stopped once the item has
been found. - ✔✔False
It can also be stopped when you reach the end of the array.
✔✔T/F: Machine language is the only programming language understood by a
computer. - ✔✔True
✔✔T/F: Machine language is an abstraction over assembly language. - ✔✔False
✔✔T/F: Compilers work in six phases which include lexical, semantic, and syntax
analysis. - ✔✔True
✔✔T/F: Interpreters produce static machine code. - ✔✔False
✔✔T/F: Pseudocode can easily be translated into assembly language - ✔✔False
Assembly language is too complex. This is true for programming languages such as
Java.
✔✔T/F: There are no grammar rules in pseudocode - ✔✔True
✔✔T/F: Testing code while viewing code execution directly is referred to as black-box
testing - ✔✔False
✔✔T/F: a test plan is a written document containing cases for using the code. - ✔✔True
✔✔T/F: a loader moves code into memory so it can be executed. - ✔✔True
✔✔T/F: A machine language instruction carries out tasks such as sorting and
computing square roots - ✔✔False
Machine language instructions handle very simple tasks.
AND SOLUTIONS RATED A+
✔✔Abstract Step v. Concrete Step - ✔✔abstract step
-an algorithmic step containing unspecified details
concrete step
-an algorithmic step in which all details are specified
✔✔Control Structure (if then, loops) - ✔✔an instruction that determines the order in
which other instructions in a program are executed
✔✔Array length versus index of last item - ✔✔index of the last item is the length of the
array minus 1
✔✔Sequential Search - ✔✔examines each item in turn and compares it to the one we
are searching
if it matches, we have found the item. if not, we look at the next item in the array
✔✔Record v. Array - ✔✔records
- a named heterogeneous collection of items in which individual items are accessed by
name
arrays
- a named homogeneous collection of items in which individual items are accessed by it
position (index) within the collection
✔✔T/F: An algorithm is a set of unambiguous instructions for solving a problem or
subproblem in an infinite amount of time using a infinite amount of data. - ✔✔False.
finite amount of time using a finite amount of data.
✔✔T/F: Algorithms can be made of abstract and concrete steps. - ✔✔True
✔✔T/F: Loops are an example of a control flow statement. - ✔✔True
✔✔T/F: A record is a homogeneous collection of items - ✔✔False
heterogeneous
✔✔T/F: Items in records can be accessed by position (index). - ✔✔False
can be accessed by name
, ✔✔T/F: an item in an array can be accessed by position (index). - ✔✔True
✔✔T/F: arrays are homogeneous collection of items - ✔✔True
✔✔T/F: The index of the last item in an array is the length of the array minus 1. -
✔✔True
✔✔T/F: Sequential searches of sorted arrays can be stopped once the position where
the item would be located has been passed or the item has been found. - ✔✔True
✔✔T/F: Sequential searches of unsorted arrays can only be stopped once the item has
been found. - ✔✔False
It can also be stopped when you reach the end of the array.
✔✔T/F: Machine language is the only programming language understood by a
computer. - ✔✔True
✔✔T/F: Machine language is an abstraction over assembly language. - ✔✔False
✔✔T/F: Compilers work in six phases which include lexical, semantic, and syntax
analysis. - ✔✔True
✔✔T/F: Interpreters produce static machine code. - ✔✔False
✔✔T/F: Pseudocode can easily be translated into assembly language - ✔✔False
Assembly language is too complex. This is true for programming languages such as
Java.
✔✔T/F: There are no grammar rules in pseudocode - ✔✔True
✔✔T/F: Testing code while viewing code execution directly is referred to as black-box
testing - ✔✔False
✔✔T/F: a test plan is a written document containing cases for using the code. - ✔✔True
✔✔T/F: a loader moves code into memory so it can be executed. - ✔✔True
✔✔T/F: A machine language instruction carries out tasks such as sorting and
computing square roots - ✔✔False
Machine language instructions handle very simple tasks.
