FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 8: Data Abstractions

Show Answer

Share

---

All types

Filters

Study Flashcards

Question 31

Essay

Review LaterAdd Note

Review Later

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,draw a picture of the tree showing the data in each node? $\begin{array} { c c } \text { Address } & \text { Contents } \\50 & \mathrm { AA } \\51 & 56 \\52 & 00 \\53 & \mathrm { BB } \\54 & 00 \\55 & 50 \\56 & \mathrm { CC } \\57 & 00 \\58 & 00\end{array}$

Correct Answer

verified

Show Answer

Question 32

Multiple Choice

Review LaterAdd Note

Review Later

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) : Print(Tree.Value) PrintTree(Tree.Right) PrintTree(Tree.Left)

A)
B)
C)

D) B) and C)
E) All of the above

Correct Answer

verified

Show Answer

Question 33

Multiple Choice

Review LaterAdd Note

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?

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

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?

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?

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 56 is inserted at the end of 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}$

What sequence of nodes from the tree would be printed if the following recursive procedure were applied to it? def printTree(Tree): if (Tree is not None): print(Tree.Value) printTree(Tree.Right)

The table below represents a portion of a computer's main memory containing a linked list.Each list entry consists of two cells,the first being data and the second being a pointer to the next list entry.If the null pointer is represented by 00 and the list's head pointer contains 56,what are the data entries in the list? (List the entries in the order they occur in the list.) $\begin{array} { c c } \text { Address } & \text { Contents } \\50 & \text { AA } \\51 & 00 \\52 & \text { BB } \\53 & 58 \\54 & \text { CC } \\55 & 50 \\56 & \text { DD } \\57 & 54 \\58 & \text { EE } \\59 & 00\end{array}$

The following represents a portion of a computer's main memory. $\begin{array}{l}\text { Address}& \text { Contents }\\50 & 51 \\51 & 56 \\52 & 53 \\53 & 57 \\54 & 58 \\55 & 50 \\56 & 57 \\57 & 52 \\58 & 53\end{array}$ A.What would be stored at address 50 after executing the instruction "Copy the contents of the memory cell at address 54 to address 50"? B.What would be stored at address 50 after executing the instruction "Copy the contents of the memory cell pointed to by the cell at address 54 to address 50"?

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 56,what data is in the left child of the root node? $\begin{array} { c c } \text { Address } & \text { Contents } \\50 & \mathrm { AA } \\51 & 53 \\52 & 00 \\53 & \mathrm { BB } \\54 & 00 \\55 & 00 \\56 & \mathrm { CC } \\57 & 50 \\58 & 00\end{array}$

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