Exam 7: Software Engineering

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?

What is the distinction between direct addressing and indirect addressing?

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?

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

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

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

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?

Why is a queue normally implemented as a circular 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?

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?

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?

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

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?

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?