My Report

Data Structure I Practice Test 8


Correct Answer: 2 points | Wrong: -1 point
Grades: A* (100% score) | A (80%-99%) | B (60%-80%) | C (40%-60%) | D (0%-40%)
advertisement

1. Should leaves in ternary heap be distributed from left to right.

2. In what time can a leftist heap be built?

3. What is the fundamental operation performed in skew heaps?

4. How much space does construction of suffix tree takes?

5. What is a time complexity for finding all the tandem repeats?

6. Pointer manipulation is generally more time-consuming than multiplication and division.

7. What is a time complexity for x pattern occurrence of length n?

8. Which node contains a pointer to its parent?

9. What is the reason for the efficiency of a pairing heap?

10. Which type of data structure is a ternary heap?


 

Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.