Scribd
Upload
4 views1 page

Algorithm Analysis and Problem Solving

The document outlines a series of problems related to algorithms and data structures, including time complexity analysis, sorting algorithms, shortest path problems, and optimization techniques. It includes specific tasks such as proving a function's complexity, applying merge sort, and constructing optimal schedules and binary search trees. The submission deadline for these problems is set for December 24, 2024.

Uploaded by

Shashank Pendyala
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
4 views1 page

Algorithm Analysis and Problem Solving

The document outlines a series of problems related to algorithms and data structures, including time complexity analysis, sorting algorithms, shortest path problems, and optimization techniques. It includes specific tasks such as proving a function's complexity, applying merge sort, and constructing optimal schedules and binary search trees. The submission deadline for these problems is set for December 24, 2024.

Uploaded by

Shashank Pendyala
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd

S.

No Date Problem
1 16-10-2024 Prove that f(n) = 6 * 2n + n2 will be equal to O(2n).
Analyze the time complexity of following function fun ( )? Explain.
int fun (int n)
{
for (int i = 1; i<=n; i++)
2 16-10-2024
for (int j = 1; j < n; j +=i)
Sum = Sum + i*j;
return (Sum);
}
Apply Merge sort Algorithm, sort the following elements:
3 23-10-2024
310, 285, 179, 652, 351, 423, 861, 254, 450, 520
Analyze the computing time complexity of binary search
4 30-10-2024
algorithm.
Find the Shortest Path using single source shortest path problem
in Greedy method

5 06-11-2024

Construct optimal schedule for the following jobs n=8,


6 13-11-2024 (p1,p2,p3,p4,p5,p6,p7,p8)=(40,100,50,30,4,7,12,11) and
(d1,d2,d3,d4,d5,d6,d7,d8)=(1,4,2,3,3,2,2,1)
Construct OBST to compute w(i,j), r(i, j), and c(i, j), 0 ≤ i < j ≤ 4,
for the identifier set (a1, a2, a3, a4) = (do, if, int, while) with p(1 :
7 20-11-2024
4) = (3, 3, 1, 1) and q(0:4)=(2,3,1,1,1). Using the r(i, j)’s construct
the optimal binary search tree.
Explain a function to compute lengths of shortest paths between
all pairs of nodes for the given adjacency matrix
8 27-11-2024

9 04-12-2024 Construct state space tree for placing 4-Queen’s.


Solve the given instance of sum of subset problem s={3,5,6,7}
10 04-12-2024
and d=15. Construct a state space tree
Give the formulation of modified knapsack problem using branch
and bound and find the optimal solution using Least Cost Branch
11 11-12-2024
and Bound (LCBB) with n=4, m=15, (p1…p4) = (15,15,17,23),
(w1…w4) = (3,5,6,9)
Find the minimum no of operating required for the following chain
12 18-12-2024 matrix multiplication using dynamic programming.
A(20,30)*B(30,10)*C(10,5)*D(5,15).

Submit on or before 24-12-2024 (Tuesday)

You might also like