Crowdly

Додати до Chrome

Questions Bank (1441087 total)

What is the time complexity of the recursive solution for Fibonacci Sequence?

Переглянути це питання

What is the complexity of nested 2 loops with the different array length?

Переглянути це питання

What is the purpose of heapify in a heap?

To delete an element from the heap

To calculate the heap's height

To insert an element into the heap

To ensure the heap property is maintained

Переглянути це питання

What is the time complexity of a binary search algorithm?

Переглянути це питання

What is the purpose of a load factor in a hash table?

To decide when to resize the table

To calculate collisions

To determine the hash function

To map keys to buckets

Переглянути це питання

What is the Big-O of the following cycle: for (int number:arr) {System.out.println(number);}

Переглянути це питання

What is the main advantage of a heap data structure?

Requires less memory than a binary search tree.

Allows quick access to the maximum or minimum element.

Avoids the need for balancing.

Provides constant time for all operations.

Переглянути це питання

What is the complexity of extracting the largest element from the max-heap?

Переглянути це питання

What is the base case in recursion?

The maximum depth of recursion.

The case where the function calls itself.

The part of a function where recursion stops.

The starting point of recursion.

Переглянути це питання

Which of the following is a valid property of a binary search tree?

Each path from the root to a leaf has the same length.

Each node must have exactly two children.

All levels of the tree must be filled.

The left subtree contains values smaller than the root, and the right subtree contains values larger than the root.

Переглянути це питання

Попередня
1
141572
141573
141574
141575
141576
144109
Наступна

Telegram Instagram TikTok Question Bank

Умови використання Зв'яжіться з нами

Додати до Chrome