Consider a complete binary tree of n levels, with the root node at level 0. How

Question

Consider a complete binary tree of n levels, with the root node at level 0. How many nodes are present in level n-2 (the level before the last level) of such a binary tree? Choose one answer. Question2 Marks: 1 Marks: 1 Which one of these functions has the fastest asymptotic growth? Choose one answer. Question3 Marks: 1 Marks: 1 Which one of the following functions growths the fastest? Choose one answer. Question4 Marks: 1 Marks: 1 Choose one answer. Question5 Marks: 1 Marks: 1 Choose one answer. Question6 Marks: 1 Marks: 1 Choose one answer. Question7 Marks: 1 Marks: 1 What is the time complexity of the merge sort algorithm? Choose one answer. Question8 Marks: 1 Marks: 1 What is the time complexity to merge two sorted arrays having m and n elements respectively? Choose one answer. Question9 Marks: 1 Marks: 1 Choose one answer. Question10 Marks: 1 Marks: 1 A Rubik's cube cosists of a 3x3x3 cube with colored sides. The goal is the twist the cube such that each of the 6 sides of the cube consist of only one color. What is the time complexity to solve a Rubik's cube? Choose one answer. a. b. c. d.

Explanation / Answer

1. d)

2. d)

3. d)

4. a)

5. a)

6. a)

7. c)

8. a)

9. a)

10. c)

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.