Learn more about our help with Assignments: Algorithms
Search & Filtering
Algorithms
Let T(n) = 7T(n/2) + 3n2 + 2.
Using Master Theorem and the Limits approach, show that T(n) = O(n3)
Using Master Theorem and the Limits approach, show that T(n) = O(n3)
Algorithms
Let T(n) = 3T(n/4) + nlogn. Solve the recurrence using Master Theorem.
Algorithms
Solve the following recurrence relation (without using Master Theorem)
C(n/2) + logn, for n > 1. C(1) = 0
C(n/2) + logn, for n > 1. C(1) = 0
Algorithms
Solve the following recurrence relation (without using Master Theorem)
C(n) = C(n/2) + logn, for n > 1. C(1) = 0
C(n) = C(n/2) + logn, for n > 1. C(1) = 0
Algorithms
Consider an array of prime integers in the range [1...20] with the entries randomly distributed. Find the average number of comparisons for a sequential search in the array.
Algorithms
COMPARE THE MERITS AND DEMERITS OF MACHINE LEVEL LANGUAGE AND ASSEMBLY LANGUAGE
Algorithms
DISCUSS THE ADVANTAGES AND DEMERITS OF THE TECHNOLOGICAL ADVANCES IN THE COMMUNICATION TECHNOLOGY
Algorithms
. Consider an array of prime integers in the range [1...20] with the entries randomly distributed. Find the average number of comparisons for a sequential search in the array.
Algorithms
Consider the following two variants of the pseudo code for the Insertion Sort algorithm. Using each variant, sort the array: 51 52 53 54 55. Note that 51, 52, ..., 55 are five different instants of integer 5 and need to be treated as separate elements (that are of the same numerical value). Determine the number of comparisons encountered with each of the two variants of the algorithm to sort the above array and what is the final sorted array (include the suffixes of the elements throughout your work).
Pseudo Code - I Pseudo Code - II
Pseudo Code - I Pseudo Code - II
Algorithms
Two pairs of integers (a, b) and (c, d) are said to be symmetric if b = c and a = d. For example, given an array of pairs { {31, 57}, {80, 90}, {25, 70}, {90, 80}, {70, 25}, {11, 20}, {10, 5}, {30, 40} }, the symmetric pairs are:
{80, 90} and {90, 80}
{25, 70} and {70, 25}
Design a hash table-based algorithm of time complexity ϴ(n) to identify the symmetric pairs in an array of 'n' pairs.
Show the working of your algorithm for the above array of pairs with a hash function H(K) = K mod 7.
What would this be
{80, 90} and {90, 80}
{25, 70} and {70, 25}
Design a hash table-based algorithm of time complexity ϴ(n) to identify the symmetric pairs in an array of 'n' pairs.
Show the working of your algorithm for the above array of pairs with a hash function H(K) = K mod 7.
What would this be
