Question 1

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?

Accepted Answer

A)  The number of nodes in the tree is always at least the number of nodes on the longest path in the tree. 
B)  The number of NIL pointers in the tree is always greater than the number of nodes in the tree. 
C)  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. 
D)  Both the left child and right child pointers of every terminal node are NIL.

Question 2

What is the distinction between direct addressing and indirect addressing?

Accepted Answer

The answer of What is the distinction between direct addressing...

Question 3

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?

Accepted Answer

A)  w, x, r 
B)  y, z, r 
C)  r, y, z 
D)  r, w, x

Question 4

Define each of the following:
A. Primitive data type
B. User-defined data type
C. Abstract data type

Accepted Answer

The answer of Define each of the following:
A. Primitive data...

Question 5

Which of the following is static in the sense that it does not change size or shape as information is stored and retrieved?

Accepted Answer

A)  Array 
B)  Stack 
C)  Queue 
D)  Tree

Question 6

If the variable named Box had the user-defined type RectangleType defined by  What expression would be used to reference the length of Box?
_________________

Accepted Answer

The answer of If the variable named Box had the...

Question 7

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 nil pointer is represented by 00 and the tree's root pointer contains 53, draw a picture of the tree showing the data in each node?

Accepted Answer

The answer of The table below represents a portion of...

Question 8

Why is a queue normally implemented as a circular queue?

Accepted Answer

The answer of Why is a queue normally implemented as...

Question 9

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?

Accepted Answer

A)  The entry X[1,2] would appear before X[2,1]. 
B)  The entry X[1,2] would appear after X[2,1]. 
C)  The entry X[1,2] would be in the same location as X[2,1]. 
D)  None of the above

Question 10

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 nil pointer is represented by 00 and the tree's root pointer contains 50, which of the following is a picture of the tree?

Accepted Answer

A)  
B)  
C)

Question 11

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 parent of the node Z?

Accepted Answer

A)  T 
B)  U 
C)  V 
D)  Y

Question 12

What is the distinction between a type and an instance of that type?

Accepted Answer

The answer of What is the distinction between a type...

Question 13

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?

Accepted Answer

A)  Traditional linked list 
B)  Stack 
C)  Queue 
D)  Tree

Question 14

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?

Accepted Answer

A)  One 
B)  Two 
C)  Three 
D)  Undetermined

Exam 7: Software Engineering