(1) A binary search tree is a special form of ( a) list (b) queue (c) binary tre
ID: 3770592 • Letter: #
Question
(1) A binary search tree is a special form of
( a) list
(b) queue
(c) binary tree
(d) hash table
(2) Which of the following functions grows fastest?
(a) n
(b) n log n
(c) log n
(d ) n2
(3) Which of the following is not a dynamic data structure?
(a) Binary tree
(b) Linked list
(c) Stack (based on linked list)
(d) Array
(4) Consider the following function:
void test_a(int n)
{
cout << n << " ";
if (n>0)
test_a(n-2);
}
What is printed by the call test_a(4)?
(a) 2 4
(b) 4 2
(c) 0 2 4
(d) 4 2 0
(5) Which of the following models an IS-A relationship?
(a) friendship
(b) public inheritance
(c) class defined as a member type of another class.
(d) template classes
Explanation / Answer
1. C
2. D
3. D
4. B
5. B
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.