Find the time complexities of the following questions

Q1.T(n)=T(n-1)+n
a)O(n2) b)O(n log n) c)O(n) d)O(log n)

Q2.T(n)=2T(n/2)+c
a) O(n2) b)O(n log n) c)O(n) d)O(log n)

Q3.T(n)= 2T(n/2)+n
a O(n2) b)O(n log n) c)O(n) d)O(log n)

Q4.T(n)=3T(n/4)+c(n2)
a)O(n2) b)O(n log n) c)O(n) d)O(log n)

Q5.T(n)=2T(n/2+17)+O(n)
a) O(n2) b)O(n log n) c)O(n) d)O(log n)

Q6.T(n)=T(n/3)+T(2n/3)+O(n)
a) O(n2) b)O(n log n) c)O(n) d)O(log n)

Q7.T(n)=9T(n/3)+n
a)O(n2) b)O(n log n) c)O(n) d)O(log n)

Q8.T(n)=3T(n/4)+nlogn
a) O(n2) b)O(n log n) c)O(n) d)O(log n)

Q9.T(n)=T(2n/3)+1
a)O(n) b)O(n log n) c)O(n) d)O(log n)

Q10.T(n)=3T(n/2)+nlogn
a) O(n2) b)O(nlog 3) c)O(n) d)O(log n)

Q11.T(n)=4T(n/2)+n2√n
a) O(n2√n) b)O(n log n) c)O(n) d)O(log n)

Q12.T(n)=2T(n/2)+n/logn
a) O(n2) b)O(n log n) c)O(n) d)O(nloglog n)

Q13.T(n)=T(n/2)+T(n/4)+T(n/8)+n
a) O(n2) b)O(n log n) c)O(n) d)O(log n)

Q14.T(n)=T(n-1)+1/n
a) O(n2) b)O(n log n) c)O(n) d)O(log n)

Q15.T(n)=T(n-1)+logn
a) O(n2) b)O(n log n) c)O(n) d)O(log n)
Q16.T(n)=T(n-2)+2logn
a) O(n2) b)O(nlog3) c)O(n) d)O(log n)

Q17.T(n)=2T(n-1)+1
a) O(n2) b)O(nlog3) c)O(2n) d)O(log n)

Q18.T(n)=2T(√n)+logn
a) O(n2) b)O(nlog3) c)O(lognloglogn) d)O(log n)

Q19.2T(n/2)+n2
a) O(n2) b)O(nlog3) c)O(2n) d)O(log n)

Q20. T(n)=T(n-1)+n+c
a) O(n2) b)O(nlog3) c)O(2n) d)O(log n)

Q21. The time required by Kruskal's algorithm is

a)O(|E|log|V|) b)O(VlogE) c)O(EV) d)O(log V)

Q22. The time required by Prim's algorithm is

a)O(|V|2) b)O(VlogE) c)O(EV) d)O(log V)

Q23.In Prim,s algorithm, it will be reduced to _________if heap is used to keep

a)O(|E|log|V|) b)O(VlogE) c)O(EV) d)O(log V)

Q24.T(n)=T(n/4)+2T(n)+n2
a) O(n2) b)O(nlog3) c)O(2n) d)O(log n)

Q25. T(n)=2T(√n)+nlogn+n
a) Ω(n2) bΩ(nlog3) c)Ω(2n) d)none of these

Answers
1.a 2.d 3.b 4.a 5.b 6.b 7.a 8.b 9.d 10.b 11.a 12.d
13.c 14.d 15.b 16.b 17.c 18.c 19.a 20.a 21.a 22.a 23.a 24.a
25. d