Jobs By Abekus

Algorithms Questions Set 5:

Quiz Mode

T(n) = 4T(n/2) + n²√n, then T(n) =?

Θ(n³√n)

Θ(n²)

Θ(n²√n)

Θ(n√n)

Solution:

Which is the fastest sorting algorithm to sort a list?

Quick sort

Bubble sort

Binary sort

Linear sort

Solution:

What is the worst-case time complexity of inserting and searching in a binary search tree?

O(n)

O(log(n))

O(n*n)

O(√n)

Solution:

G is undirected graph with n vertices and 25 edges such that each vertex has degree at least 3. Then the maximum possible value of n is

Solution:

How many different insertion sequences of the key values using the hash function h(k) = k mod 10 and linear probing will result in the hash table shown below?

Solution:

The string "ab" is a string of length 2.

whose reversal is not the same as the given one

whose reversal is the same as the given one

whose reversal may or may not the same as the given one

None of the above

Solution:

Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are:
Note: The height of a tree with a single node is 0.

4 and 15 respectively

3 and 14 respectively

4 and 14 respectively

3 and 15 respectively

Solution:

What additional requirement is placed on an array for binary search to be used to locate an entry?

The array elements must form a heap

The array must have at least 2 entries

The array must be sorted

The array's size must be a power of two

Solution:

In which of the following cases would jump search be preferred over exponential search?

When jumping backwards takes significantly more time than jumping forward

When jumping forward takes significantly more time than jumping backwards

When the given array is very large in size

When the given array is very small in size

Solution:

Let G be a connected undirected weighted graph. Consider the following two statements.
S1 : There exists a minimum weight edge in G which is present in every minimum spanning tree of G.
S2 : If every edge in G has distinct weight, then G has a unique minimum spanning tree.
Which one of the following options is correct?

Both S1 and S2 are true

S1 is true and S2 is false

S1 is false and S2 is true

Both S1 and S2 are false

Algorithms Questions Set 5:

T(n) = 4T(n/2) + n²√n, then T(n) =?

Solution:

Which is the fastest sorting algorithm to sort a list?

Solution:

What is the worst-case time complexity of inserting and searching in a binary search tree?

Solution:

G is undirected graph with n vertices and 25 edges such that each vertex has degree at least 3. Then the maximum possible value of n is

Solution:

How many different insertion sequences of the key values using the hash function h(k) = k mod 10 and linear probing will result in the hash table shown below?

Solution:

The string "ab" is a string of length 2.

Solution:

Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are:
Note: The height of a tree with a single node is 0.

Solution:

What additional requirement is placed on an array for binary search to be used to locate an entry?

Solution:

In which of the following cases would jump search be preferred over exponential search?

Solution:

Solution:

Related Question Sets:

Related Topics:

Algorithms Questions Set 5:

T(n) = 4T(n/2) + n2√n, then T(n) =?

Solution:

Which is the fastest sorting algorithm to sort a list?

Solution:

What is the worst-case time complexity of inserting and searching in a binary search tree?

Solution:

G is undirected graph with n vertices and 25 edges such that each vertex has degree at least 3. Then the maximum possible value of n is

Solution:

How many different insertion sequences of the key values using the hash function h(k) = k mod 10 and linear probing will result in the hash table shown below?

Solution:

The string "ab" is a string of length 2.

Solution:

Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are:﻿Note: The height of a tree with a single node is 0.

Solution:

What additional requirement is placed on an array for binary search to be used to locate an entry?

Solution:

In which of the following cases would jump search be preferred over exponential search?

Solution:

Solution:

Related Question Sets:

Related Topics:

T(n) = 4T(n/2) + n²√n, then T(n) =?

Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are:
Note: The height of a tree with a single node is 0.