CSCE 2100 EXAM LATEST
Which if the following are all internal nodes in this tree?
A. None of these
B. 1, 3, 5, 7
C. 1, 2, 4, 6, 8
D. 1, 4, 6, 8
B. 1, 3, 5, 7
What is the chromatic number of the tree?
A. 3
B. 2
C. 1
D. None of these
B. 2
What is the maximum number of nodes in a full, binary tree of height 8?
A. None of these
B. 1023
C. 17
D. 511
D. 511
END OF
PAGE
1
, CSCE 2100 EXAM LATEST
Which if the following represents the preorder traversal, assuming a left
child preference, of the tree?
A. 0, 1, 3, 4, 5, 6, 7, 8
B. None of these
C. 5, 3, 7, 1, 4, 6, 8, 0
D. 0, 1, 4, 3, 6, 8, 7, 5
B. None of these
Which of the following represents the postorder traversal, assuming a
left child preference, of the tree?
A. 5, 3, 7, 1, 4, 6, 8
B. 1, 3, 4, 5, 6, 7, 8
C. None of these
D. 5, 3, 1, 4, 7, 6, 8
C. None of these
Which of the following represents the ignorer traversal, assuming a left
child preference, of the tree?
A. None of these
B. 5, 3, 1, 0, 2, 4, 7, 6, 8
C. 0, 2, 1, 4, 3, 6, 8, 7, 5
D. 0, 1, 2, 3, 4, 5, 6, 7, 8
END OF
PAGE
2
, CSCE 2100 EXAM LATEST
D. 0, 1, 2, 3, 4, 5, 6, 7, 8
Which of the following represents the level order traversal, assuming a
left child preference, of the tree?
A. 0, 1, 3, 4, 5, 6, 7, 8
B. 0, 1, 4, 3, 6, 8, 7, 5
C. 5, 3, 7, 1, 4, 6, 8, 0
D. None of these
C. 5, 3, 7, 1, 4, 6, 8, 0
Which of the following represents the level order traversal, assuming a
left child preference, of the tree?
A. 5, 3, 1, 4, 7, 6, 8
B. None of these
C. 1, 3, 4, 5, 6, 7, 8
D. 5, 3, 7, 1, 4, 6, 8
D. 5, 3, 7, 1, 4, 6, 8
Which of the following represents the level order traversal, assuming a
left child preference, of the tree?
A. 0, 2, 1, 4, 3, 6, 8, 7, 5
B. None of these
C. 5, 3, 1, 0, 2, 4, 7, 6, 8
END OF
PAGE
3
, CSCE 2100 EXAM LATEST
D. 0, 1, 2, 3, 4, 5, 6, 7, 8
B. None of these
Given the FSM above, what is Q?
A. None of these
B. {a,b,c}
C. {q4}
D. {q0,q1,q2,q3}
A. None of these
Given the FSM above, what is Σ?
A. {a,b,c}
B. {q0,q1,q2,q3}
C. None of these
D. {q1,q2,q3}
A. {a,b,c}
END OF
PAGE
4
Which if the following are all internal nodes in this tree?
A. None of these
B. 1, 3, 5, 7
C. 1, 2, 4, 6, 8
D. 1, 4, 6, 8
B. 1, 3, 5, 7
What is the chromatic number of the tree?
A. 3
B. 2
C. 1
D. None of these
B. 2
What is the maximum number of nodes in a full, binary tree of height 8?
A. None of these
B. 1023
C. 17
D. 511
D. 511
END OF
PAGE
1
, CSCE 2100 EXAM LATEST
Which if the following represents the preorder traversal, assuming a left
child preference, of the tree?
A. 0, 1, 3, 4, 5, 6, 7, 8
B. None of these
C. 5, 3, 7, 1, 4, 6, 8, 0
D. 0, 1, 4, 3, 6, 8, 7, 5
B. None of these
Which of the following represents the postorder traversal, assuming a
left child preference, of the tree?
A. 5, 3, 7, 1, 4, 6, 8
B. 1, 3, 4, 5, 6, 7, 8
C. None of these
D. 5, 3, 1, 4, 7, 6, 8
C. None of these
Which of the following represents the ignorer traversal, assuming a left
child preference, of the tree?
A. None of these
B. 5, 3, 1, 0, 2, 4, 7, 6, 8
C. 0, 2, 1, 4, 3, 6, 8, 7, 5
D. 0, 1, 2, 3, 4, 5, 6, 7, 8
END OF
PAGE
2
, CSCE 2100 EXAM LATEST
D. 0, 1, 2, 3, 4, 5, 6, 7, 8
Which of the following represents the level order traversal, assuming a
left child preference, of the tree?
A. 0, 1, 3, 4, 5, 6, 7, 8
B. 0, 1, 4, 3, 6, 8, 7, 5
C. 5, 3, 7, 1, 4, 6, 8, 0
D. None of these
C. 5, 3, 7, 1, 4, 6, 8, 0
Which of the following represents the level order traversal, assuming a
left child preference, of the tree?
A. 5, 3, 1, 4, 7, 6, 8
B. None of these
C. 1, 3, 4, 5, 6, 7, 8
D. 5, 3, 7, 1, 4, 6, 8
D. 5, 3, 7, 1, 4, 6, 8
Which of the following represents the level order traversal, assuming a
left child preference, of the tree?
A. 0, 2, 1, 4, 3, 6, 8, 7, 5
B. None of these
C. 5, 3, 1, 0, 2, 4, 7, 6, 8
END OF
PAGE
3
, CSCE 2100 EXAM LATEST
D. 0, 1, 2, 3, 4, 5, 6, 7, 8
B. None of these
Given the FSM above, what is Q?
A. None of these
B. {a,b,c}
C. {q4}
D. {q0,q1,q2,q3}
A. None of these
Given the FSM above, what is Σ?
A. {a,b,c}
B. {q0,q1,q2,q3}
C. None of these
D. {q1,q2,q3}
A. {a,b,c}
END OF
PAGE
4
