C and data structure question pls help.....??

Which of the following cannot be implemented efficiently in Linear Linked List :


1.quicksort


2. Radix Sort


3. Polynomials


4. Insertion Sort


5. Binary Search





2. In binary search tree , n=nodes, h=height of tree.


What's complexity?


1. o(h)


2. o(n*h)


3. o(nLogn)


4. o(n*n)


5. None








C Programs


1. Printf("%d%d",i++,i++);


1. Compiler Dependent


2. 4 4


3. 4 3


4. 3 4


5. None of Above





3. what does it do?


void f(int n)


{


if(n%26gt;0)


{


if(A[i]%26gt;A[j])


swap();


}


else


f(n-1);


}


1. Swap


2. Sort in Ascending order


3. Sort in Descending order


4. Computes permutation





4. Given a Fibonacci function


f1=1;f2=1


fn=f(n-1)+f(n-2) which of the following is t is true?


1. Every Second element is even


2. Every third element is odd


3. The series increases monotonally


4. For n%26gt;2, fn=ceiling(1.6 * f(n-1))


5. None





Operating System


Where the root dir should be located?


1.Anywhere on System disk


2.Anywhe on Disk


3.In Main memory


4.At a fixed location on Disk

C and data structure question pls help.....??
1)--5


2)--4


- I think it's another question but i'm not sure so can't answer.


3)--1


4)--5


5)--3





Hope I helped.