TSKafli8

1. 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?

Y

X

Z

W

2. Which of the following is a LIFO structure?

Stack

Queue

Tree

Array

3. Which of the following is a FIFO Structure?

Array

Queue

Stack

Tree

4. If the longest path in a binary tree contained exactly four nodes, what is the maximum number of nodes that could be in that entier tree?

31

7

15

4

5. If the two-dimensional array X were stored in row-major order, then in the block of main mermory containing X, which of the following would be true?

The entry X[1,2] would be in the same location as X[2,1]

The entry X[1,2] would be appear before X[2,1]

The entry X[1,2] would appear after X[2,1]

None of the above

6. 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 retrived. Which of the following would be the best structure in which to store the items?

Traditional linked list

Stack

Tree

Queue

7. If a stack contained the entries w,x, y, z (from top to bottom), which of the following would be the contents after two enteries were removed and the the entry r was inserted?

R, y, z

R, w, x

W, x, r

Y, z, r

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

2^n+1 -1 nodes

2^n+1 nodes

2^n+2 nodes

2^2n nodes

9.

A.

B.

C.

None of the above

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

Direct adressing

Indirect adressing

Immediate addressing

11. The nodes in which of the trees below will be printed in alphabetical order by the following recursive procedure? procedure printTree (Tree) if(Tree is not empty) then (apply the procedure printTree to the left subtree of Tree; apply the procedure printTree to the right subtree of Tree; print the root node) Veldu eitt:

A)

B)

C)

12. Which of the following is not used when determining the location of an entry in a two-dimentional homogeneous array stored in row-major orderd?

Number of rows in the array

Number of columns in the array

Indices

Address polynomial

13. Bamboleo...

Address polynomial

Pointer

Queue

Abstraction

Array

List

Tree

Stack

Submit

Tskafli8

1. 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?

2.

What first name or nickname would you like us to use?

2. Which of the following is a LIFO structure?

3. Which of the following is a FIFO Structure?

4. If the longest path in a binary tree contained exactly four nodes, what is the maximum number of nodes that could be in that entier tree?

5. If the two-dimensional array X were stored in row-major order, then in the block of main mermory containing X, which of the following would be true?

6. 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 retrived. Which of the following would be the best structure in which to store the items?

7. If a stack contained the entries w,x, y, z (from top to bottom), which of the following would be the contents after two enteries were removed and the the entry r was inserted?

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

9.

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

12. Which of the following is not used when determining the location of an entry in a two-dimentional homogeneous array stored in row-major orderd?

13. Bamboleo...