. ପ୍ରାଚ୍ୟ ଶିକ୍ଷା ମନ୍ଦିର

ଗୋପୀନାଥ ମହାନ୍ତି

. ଶ୍ୟାମବନ୍ଧୁଙ୍କ ଆଦର୍ଶ

 ଡୋକ୍ରାକଣ୍ଢେଇ

. ପୁରୁଷୋତ୍ତମଚେତନା

ଗ. ଆଧୁନିକତା

ଖ. ସହଜସାଧନା ତତ୍ତ୍ବ

କ. ମାଦଳାପାଞ୍ଜି

Q8. Explain DFS and BDS Graph traversal algorithms with the help of a suitable example.

 Apply Kruskal's Algorithm on the following graph to find minimum cost spanning tree

) Merge sort

Binary search

 Binary sort

Insertion sort

Solve the following recurrence Using Recursion tree method

(i) T(n) = 3T(n/3) + n

(ii) T(n) = 2T(n/2) + n²

(iii) T(n) = T(n/2) + T(n/4) + T(n/8) + n

. For the function defined by f(n) = 2n³ + 3n² + 1 and g(n) = 2n² +3, show that

(i) f(n) = Ω(g(n))

(ii) g(n) != Ω(f(n))

(iii) n³ = Ω(g(n))

(iv) f(n) != Ω(n⁴)

 Prove the following proposition using induction:

P(n): 1² + 2² + 3² + 4² + ... ... ... ... . + n² = n(n+1)(2n+1) / 6

Travel and accommodation options

Food arrangements

Local sightseeing options

Total cost per person

Availability of packages in December

Objectives and content of the workshop

Sessions and hands-on activities

Usefulness of the training

Suggestions for improvement

 Define the various types of communication styles: Assertive, Aggressive, Passive, and Passive-Aggressive. Which one do you identify with and why?