1|Page
CS160 FINAL EXAM LATEST 2026-2027 ACTUAL EXAM WITH
COMPLETE QUESTIONS AND CORRECT DETAILED ANSWERS (100%
VERIFIED ANSWERS) |ALREADY GRADED A+| ||PROFESSOR
VERIFIED|| ||BRANDNEW!!!||
Which of the following is not used when determining the location
of an entry in a two-dimensional array stored in row-major order?
- ANSWER-Number of rows in the array
Suppose a binary tree contained the nodes W, X, Y, and Z. If W
and X were children of Y, and Z had no children, which node
would be the root? - ANSWER-Y
If a stack contained the entries w, x, y, z (from top to bottom),
which of the following would be the contents after two entries
were removed and the entry r was inserted? - ANSWER-r, y, z
Most modern programming languages include a way to allocate
memory, as the program runs, to store new data items. Which of
the following statements is most true? - ANSWER-not This should
not be allowed. The programmer should know how much data is
to be processed and allocate sufficient memory when the program
is written.
,2|Page
The nodes in which of the trees below will be printed in
alphabetical order by the following recursive procedure? -
ANSWER-not c
The table below represents a portion of a computer's main
memory containing a binary tree. Each node consists of three
cells, the first being data, the second being a pointer to the node's
left child, and the third being a pointer to the node's right child. If
the null pointer is represented by 00 and the tree's root pointer
contains 50, which of the following is a picture of the tree? -
ANSWER-not a
The table below represents a portion of a computer's main
memory containing a binary tree stored row by row in a
contiguous block as described in the chapter. What is the left child
of the node V? - ANSWER-Y
The table below represents a portion of a computer's main
memory containing a binary tree stored row by row in a
,3|Page
contiguous block as described in the chapter. What is the parent
of the node Z? - ANSWER-V
Suppose you were going to retrieve items of data that you would
later need to process in the opposite order from that in which they
were retrieved. Which of the following would be the best structure
in which to store the items? - ANSWER-Stack
Which of the following is a FIFO structure? - ANSWER-Queue
If the two-dimensional array X were stored in row-major order,
then in the block of main memory containing X, which of the
following would be true? - ANSWER-The entry X[1,2] would
appear before X[2,1].
Suppose a binary tree contained the nodes W, X, Y, and Z, and
each node had at most one child. How many terminal nodes
would be in the tree? - ANSWER-One
, 4|Page
Which of the following is not a means of locating an entry in a
linked storage structure? - ANSWER-null pointer
If a queue contained the entries w, x, y, z (from head to tail),
which of the following would be the contents after two entries
were removed and the entry r was inserted? - ANSWER-y, z, r
Suppose a binary tree is implemented as a linked structure in
which each node contains both a left child pointer and a right child
pointer. Which of the following statements is false? - ANSWER-
Each terminal node in the tree is always at the end of a path that
is as least as long as any other path in the tree.
If the longest path in a binary tree contained exactly four nodes,
what is the maximum number of nodes that could be in the entire
tree? - ANSWER-15
In a machine language, the technique in which the data to be
manipulated by an instruction is included within the instruction
itself is called - ANSWER-Immediate addressing
CS160 FINAL EXAM LATEST 2026-2027 ACTUAL EXAM WITH
COMPLETE QUESTIONS AND CORRECT DETAILED ANSWERS (100%
VERIFIED ANSWERS) |ALREADY GRADED A+| ||PROFESSOR
VERIFIED|| ||BRANDNEW!!!||
Which of the following is not used when determining the location
of an entry in a two-dimensional array stored in row-major order?
- ANSWER-Number of rows in the array
Suppose a binary tree contained the nodes W, X, Y, and Z. If W
and X were children of Y, and Z had no children, which node
would be the root? - ANSWER-Y
If a stack contained the entries w, x, y, z (from top to bottom),
which of the following would be the contents after two entries
were removed and the entry r was inserted? - ANSWER-r, y, z
Most modern programming languages include a way to allocate
memory, as the program runs, to store new data items. Which of
the following statements is most true? - ANSWER-not This should
not be allowed. The programmer should know how much data is
to be processed and allocate sufficient memory when the program
is written.
,2|Page
The nodes in which of the trees below will be printed in
alphabetical order by the following recursive procedure? -
ANSWER-not c
The table below represents a portion of a computer's main
memory containing a binary tree. Each node consists of three
cells, the first being data, the second being a pointer to the node's
left child, and the third being a pointer to the node's right child. If
the null pointer is represented by 00 and the tree's root pointer
contains 50, which of the following is a picture of the tree? -
ANSWER-not a
The table below represents a portion of a computer's main
memory containing a binary tree stored row by row in a
contiguous block as described in the chapter. What is the left child
of the node V? - ANSWER-Y
The table below represents a portion of a computer's main
memory containing a binary tree stored row by row in a
,3|Page
contiguous block as described in the chapter. What is the parent
of the node Z? - ANSWER-V
Suppose you were going to retrieve items of data that you would
later need to process in the opposite order from that in which they
were retrieved. Which of the following would be the best structure
in which to store the items? - ANSWER-Stack
Which of the following is a FIFO structure? - ANSWER-Queue
If the two-dimensional array X were stored in row-major order,
then in the block of main memory containing X, which of the
following would be true? - ANSWER-The entry X[1,2] would
appear before X[2,1].
Suppose a binary tree contained the nodes W, X, Y, and Z, and
each node had at most one child. How many terminal nodes
would be in the tree? - ANSWER-One
, 4|Page
Which of the following is not a means of locating an entry in a
linked storage structure? - ANSWER-null pointer
If a queue contained the entries w, x, y, z (from head to tail),
which of the following would be the contents after two entries
were removed and the entry r was inserted? - ANSWER-y, z, r
Suppose a binary tree is implemented as a linked structure in
which each node contains both a left child pointer and a right child
pointer. Which of the following statements is false? - ANSWER-
Each terminal node in the tree is always at the end of a path that
is as least as long as any other path in the tree.
If the longest path in a binary tree contained exactly four nodes,
what is the maximum number of nodes that could be in the entire
tree? - ANSWER-15
In a machine language, the technique in which the data to be
manipulated by an instruction is included within the instruction
itself is called - ANSWER-Immediate addressing
