FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 8: Data Abstractions

Show Answer

Share

---

All types

Filters

Study Flashcards

Question 1

Multiple Choice

Review LaterAdd Note

Review Later

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?

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

E) A) and C)
F) A) and B)

Correct Answer

verified

Show Answer

Question 2

Essay

Review LaterAdd Note

Review Later

What is the distinction between direct addressing and indirect addressing?

Correct Answer

verified

When using direct addressing,the address...

View Answer

Show Answer

Question 3

Short Answer

Review LaterAdd Note

Suppose a queue contained the entries A,B,C,D (from head to tail)and suppose that the entries were removed and pushed on a stack one at a time until the queue was empty.What would be the contents of the queue (again from head to tail)if the entries were then popped from the stack and inserted back in the queue one at a time.

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 null 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. $\begin{array} { c c } \text { Address } & \text { Content } \\50 & \mathrm { AA } \\51 & 00 \\52 & \mathrm { BB } \\53 & 58 \\54 & \mathrm { CC } \\55 & 00 \\56 & \mathrm { DD } \\57 & 00 \\58 & \mathrm { EE } \\59 & 54\end{array}$

The nodes in which of the trees below will be printed in alphabetical order by the following recursive procedure? def printTree (Tree) : If (Tree is not None) : PrintTree(Tree.Left) PrintTree (Tree.Right) Print(Tree.Value)

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?

What sequence of nodes from the tree would be printed if the following recursive procedure were applied to it? (The procedure uses a global stack called Stack that is assumed to begin empty.) def printTree(Tree): if (Tree is not None): Stack.push(Tree.Value) printTree(Tree.Right) if (not Stack.isEmpty()): print(Stack.pop())

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

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 the following questions in terms of the tree below. A. The root node is ________ . B. Three nodes that are siblings are _______ , ________, and ________ . C. The terminal nodes are _________________________________________ . D. The node with only one child is _________ .

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

If the type BananaSplit was defined by a statement such as struct BananaSplit { int Banana; int IceCream; int Chocolate; int WhippedCream; int Nuts; int Cherry } what statement would probably be used to declare the variable Desert to be an instance of that type?

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

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?

If the longest path in a binary tree contains five nodes,what is the maximum number of terminal nodes that could be in the tree?

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 53,how many nodes are on the longest path in the tree? $\begin{array} { c c } \text { Address } & \text { Contents } \\50 & \text { AA } \\51 & 56 \\52 & 00 \\53 & \mathrm { BB } \\54 & 00 \\55 & 50 \\56 & \mathrm { CC } \\57 & 00 \\58 & 00\end{array}$

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? $\begin{array} { c c } \text { Address } & \text { Conten } \\50 & \mathrm {~A} \\51 & 56 \\52 & 53 \\53 & \mathrm {~B} \\54 & 00 \\55 & 00 \\56 & \mathrm { C } \\57 & 00 \\58 & 00\end{array}$

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 not used when determining the location of an entry in a two-dimensional array stored in row-major order?

If the variable named Box had the user-defined type RectangleType defined by struct RectangleType { float length; float width; float height } What expression would be used to reference the length of Box?