Jobs By Abekus

Algorithms Questions Set 4:

Quiz Mode

If T(n) = 4T(n/2) + n^2√n, then T(n) is equal to:

Θ(n^3√n)

Θ(n^2)

Θ(n^2√n)

Θ(n√n)

Solution:

What is the time complexity of the fractional knapsack problem?

O(n)

O(n*n)

O(n log n)

O(nW)

Solution:

Which of the following data structures are indexed data structures?

Linear arrays

Linked lists

Queue

Stack

Solution:

Which type of encryption uses matrix multiplication?

Playfair cipher

Monoalphabetic cipher

Transposition cipher

Additive cipher

Solution:

Under which case of the Master's theorem will the recurrence relation of merge sort fall?

quick sort

bubble sort

merge sort

selection sort

Solution:

What is the ciphered text for the input string "sand foundry" with the key string "code" using the keyword cipher?

SCMBNUMERY

SSCMBNUMERY

NIFO

NILO

Solution:

Which of the following recursive formulas can be used to find the factorial of a number?

fact(k) = k * fact(k)

fact(k) = k * fact(k+1)

fact(k) = k * fact(k-1)

fact(k) = k * fact(1)

Solution:

What are the notations used in the evaluation of arithmetic expressions using prefix and postfix forms?

Polish notation

None of these

Reverse Polish notation

Both Polish notation and Reverse Polish notation

Solution:

Let P be an array containing n integers. Let t be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary array of n elements. Which one of the following choices is correct?

t>2n−2

t>3⌈n/2⌉ and t≤2n−2

t>n and t≤3⌈n/2⌉

t>⌈log2(n)⌉ and t≤n

Solution:

There are n jobs. Each job has a deadline d_i > 0 and profit p_i > 0. The goal is to find the optimal solution that maximizes the total profit, where the jobs are completed by their deadlines. Given: n = 5, p = (100, 19, 27, 25, 15), and d = (2, 1, 2, 1, 3). Find the optimal solution with the maximum profit.

{2, 2, 3} & 142

{3, 2, 1} & 140

{2, 1, 3} & 143

{1, 2, 3} & 141

Algorithms Questions Set 4:

If T(n) = 4T(n/2) + n^2√n, then T(n) is equal to:

Solution:

What is the time complexity of the fractional knapsack problem?

Solution:

Which of the following data structures are indexed data structures?

Solution:

Which type of encryption uses matrix multiplication?

Solution:

Under which case of the Master's theorem will the recurrence relation of merge sort fall?

Solution:

What is the ciphered text for the input string "sand foundry" with the key string "code" using the keyword cipher?

Solution:

Which of the following recursive formulas can be used to find the factorial of a number?

Solution:

What are the notations used in the evaluation of arithmetic expressions using prefix and postfix forms?

Solution:

Let P be an array containing n integers. Let t be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary array of n elements. Which one of the following choices is correct?

Solution:

Solution:

Related Question Sets:

Related Topics: