Exam 7: Software Engineering

Which of the following is a LIFO structure?

The table below represents a portion of a computer's main memory containing a linked list. Each entry consists of two cells, the first being data, the second being a pointer to the next entry. If the nil pointer is represented by 00 and the list's head pointer contains 52, modify the memory cells so the data at address 56 is inserted at the end of the list.

What is the distinction between a user-defined data type and an abstract data type?

The nodes in which of the trees below will be printed in alphabetical order by the following recursive procedure?

In which direction does an unchecked queue crawl through memory (in the direction of its head or in the direction of its tail)? ________________

In a machine language, what advantage does indirect addressing offer over immediate and direct addressing?

Two special forms of lists are the LIFO structures known as _______________ , in which entries are inserted and removed from the ______________ , and FIFO structures known as ________________ , in which entries are removed from the ________________ and inserted at the ________________ .

Which of the following is a FIFO structure?

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?

In a machine language, the technique in which an instruction contains the location of a pointer to the data to be manipulated is called

Which of the following is not a means of locating an entry in a linked storage structure?

In a machine language, the technique in which the data to be manipulated by an instruction is included within the instruction itself is called

Which of the following is not used when determining the location of an entry in a two-dimensional homogeneous array stored in row-major order?

If the number of nodes in a binary tree is 2ⁿ (where n is a positive integer), then the entire tree would contain at least

The table below represents a portion of a computer's main memory containing a linked list. Each entry consists of two cells, the first being data, the second being a pointer to the next entry. If the nil pointer is represented by 00 and the list's head pointer contains 52, modify the memory cells so the data at address 50 replaces the second entry in the list.

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. Draw a picture of 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?

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?

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?

What condition indicates that a linked list is empty?