Question 1: List and describe the four steps in Polya's How To Solve It List
Question 2: List the three phases of the computer problem-solving model
Question 3: Distinguish between information and data
Question 4: 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.
Address Contents
50 AA
51 00
52 BB
53 58
54 CC
55 00
56 DD
57 00
58 EE
59 54
Question 5: 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, how many terminal nodes are in the tree?
Address Contents
50 AA
51 56
52 00
53 BB
54 00
55 50
56 CC
57 00
58 00
Question 6: 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.
Address Contents
50 A
51 B
52 C
53 D
54 E
55 F
56 G
7 Distinguish between value and reference parameters.
8. How are arguments and parameters matched?
9. What is written by the following algorithm?
Push(myStack, 5)
Push(myStack, 4)
Push(myStack, 4)
Pop(myStack, item)
Pop(myStack, item)
Push(myStack, item)
WHILE (NOT IsEmtpy(myStack))
Pop(myStack, item)
Write item, ' '
10. What is written by the following algorithm?
Enqueue(myQueue, 5)
Enqueue(myQueue, 4)
Enqueue(myQueue, 4)
Dequeue(myQueue, item)
Dequeue(myQueue, item)
Enqueue(myQueue, item)
WHILE (NOT IsEmtpy(myQueue))
Dequeue(myQueue, item)
Write item, ' '