CSIT-403 – Analysis & Design of Algorithm (ADA)

Write a recursive algorithm for computing the nth Fibonacci number.

A machine needs a minimum of 200 sec to sort 1000 elements by Quick sort. What is the minimum time needed to sort 200 elements will be approximately?

Write a recursive algorithm for computing the $n^{th}$ Fibonacci number.

A machine needs a minimum of 200 sec to sort 1000 elements by Quick sort. What is the minimum time needed to sort 200 elements will be approximately?

Generate recurrence relation from the recursive binary search algorithm.

Consider the problem of finding the smallest and largest elements in an array of numbers using divide and Conquer method.

Generate recurrence relation from the recursive binary search algorithm.

Consider the problem of finding the smallest and largest elements in an array of $n$ numbers using divide and Conquer method.

Find the time complexity of the recurrence relation T(n)=n+T(n/10)+T(7n/5).

Analyze the time complexity of Strassen's algorithm compared to conventional matrix multiplication.

Find the time complexity of the recurrence relation $T(n) = n - T(n/10) + T(7n/5)$.

Analyze the time complexity of Strassen's algorithm compared to conventional matrix multiplication.

What is Minimum Cost Spanning Tree? Explain Kruskal's Algorithm with the help of algorithm.

The recurrence T(n)=7T(n/2)+n² describe the running time of an algorithm A. A competing algorithm A has a running time of Γ(n)=aΓ(n/4)+n². What is the largest integer value for a A' is asymptotically faster than A?

What is Minimum Cost Spanning Tree? Explain Kruskal's Algorithm with the help of algorithm.

The recurrence $T(n) = 7T(n/2) + n^2$ describe the running time of an algorithm A. A competing algorithm B has a running time of $T'(n) = aT'(n/4) + n^2$. What is the largest integer value for $a$ A' is asymptotically faster than A?

Explain properties of Binomial Heap. Write an algorithm to perform uniting two Binomial Heaps. And also, to find Minimum Key.

Explain Backtracking. Let set S={1,3,4,5} and X=8, we have to find subset sum problem using backtracking approach.

Explain properties of Binomial Heap in. Write an algorithm for uniform uniting two Binomial Heaps. And also, to find Minimum Key.

Explain Backtracking. Let set $S = \{1, 3, 4, 5\}$ and $X = 8$, we have to find subset sum problem using backtracking approach.

What is stable sorting algorithm? Which of the sorting algorithms we have seen are stable and which are unstable? Give name with explanation.

Suppose character a, b, c, d, e, f has probabilities 0.07, 0.09, 0.12, 0.22, 0.23, 0.27 respectively. Find an optimal Huffman code and draw the Huffman tree. What is the average code length?

What is stable sorting algorithm? Which of the sorting algorithms we have seen are stable and which are unstable? Give name with explanation.

Suppose character a, b, c, d, e, f has probabilities 0.07, 0.09, 0.12, 0.22, 0.23, 0.27 respectively. Find an optional Huffman code and draw the Huffman tree. alt='' What is the average code length?

Write Merge sort algorithm and sort the following sequence {23, 11, 5, 15, 68, 31, 4, 17} using merge sort.

Explain B-Tree and its properties. Also write B-Tree deletion cases with example.

Write Merge sort algorithm and sort the following sequence $(23, 11, 5, 15, 68, 31, 4, 17)$ using merge sort.

Explain B-Tree and its properties. Also write B-Tree deletion cases with example.

For a binary tree T, the preorder and in-order traversal sequences are as follows: In order : BCAEGDHFIJ Preorder : ABCDEGFHIJ

i) Construct a binary Tree.

ii) What is its post-order traversal sequence?

Prove that if the weights on the edge of the connected undirected graph are distinct then there is a unique Minimum Spanning Tree. Give an example in this regard. Also discuss Kruskal's Minimum Spanning Tree in detail.

For a binary tree $T$, the preorder and in-order traversal sequences are as follows: Preorder : B C A E G D H F I J Inorder : A B C D E F G H I J

i) Construct a binary tree. alt=''

ii) What is its post-order traversal sequence?

Prove that if the weights on the edge of the connected undirected graph are distinct then there is a unique Minimum Spanning Tree. Give an example in this regard. Also discuss Kruskal's Minimum Spanning Tree in detail.