Jobs By Abekus

Algorithms Questions Set 1:

Quiz Mode

If T(x) = T(x/2) + 1, then T(x) is equal to:

O(log x)

O(2 log x)

O(x log x)

O(x^2)

Solution:

Which sorting algorithm is the fastest?

Binary Sort

Quick Sort

Merge Sort

Insertion Sort

Solution:

The number of possible min-heaps containing each value from {1, 2, 3, 4, 5, 6, 7} exactly once is

Solution:

In an undirected connected planar graph G, there are eight vertices and five faces. The number of edges in G is

Solution:

Which of the following concepts make extensive use of arrays?

Binary trees

Caching

Spatial locality

Scheduling of processes

Solution:

Which of the following sorting algorithms has the lowest worst-case time complexity?

Bubble Sort

Quick Sort

Merge Sort

Selection Sort

Solution:

The last step in solving a problem using an algorithm is

Evaluate the Solution

Identify the Problem

None of these

Understand the Problem

Solution:

Under the first case of the Master's theorem, which sorting algorithm's recurrence relation falls?

Merge sort

Quick sort

Bubble sort

Stooge sort

Solution:

Which of the following is not an inherent application of stack?

a) Reversing a string

b) Evaluation of postfix expression

c) both a and b

d) job scheduling

Solution:

What is the main advantage of selection sort over other sorting techniques?

It is scalable

It is faster than any other sorting technique

It requires no additional storage space

It works best for inputs which are already sorted

Algorithms Questions Set 1:

If T(x) = T(x/2) + 1, then T(x) is equal to:

Solution:

Which sorting algorithm is the fastest?

Solution:

The number of possible min-heaps containing each value from {1, 2, 3, 4, 5, 6, 7} exactly once is

Solution:

In an undirected connected planar graph G, there are eight vertices and five faces. The number of edges in G is

Solution:

Which of the following concepts make extensive use of arrays?

Solution:

Which of the following sorting algorithms has the lowest worst-case time complexity?

Solution:

The last step in solving a problem using an algorithm is

Solution:

Under the first case of the Master's theorem, which sorting algorithm's recurrence relation falls?

Solution:

Which of the following is not an inherent application of stack?

Solution:

What is the main advantage of selection sort over other sorting techniques?

Solution:

Related Question Sets:

Related Topics: