Question 1(in brief): question on when the binary search tree is better than sorted array to find value Then some Dbms questions about indexing DSA question: You are a teacher with n students Circulate as many answers before

One student at most one answer from you Student only convey answer received from you, not from other students and can only convey to the neighbors. Now a special answer is the one which every student can solve , find the total number of special answers given number of students n , and adjacency matrix. Expected Time complexity wasnt told. (mine was n*(3^n)) Hint- Greedy doesnt work think of subsets.

You are given a circle with n points , you need to connect 2 points together such that no chords intersect , find the total number of ways possible for n points First try with n=6 points Then basic OS Whats the difference between a thread and a process