3 votes
1 answer
31
One one evening sita and gita were sitting in a park with there back facing each other sita was able to see her shadow on left at what direction was gita sitting ?A) Nort...
2 votes
1 answer
32
If root of equation f(x) is 0 ar x= -3 and X= 3 then root of equation f(x+3) will be at ?A) X= 0 and X=6B) X=-3 and X=3C) X=-6 and X=0;D) X=-6 and X= 6
1 votes
2 answers
33
2 votes
1 answer
34
Which of the following tell us which day is on 14th of a particular monthI) 17th is on 3rd SaturdayII) the last date of the month is on WednesdayA) Only 1 is sufficientB)...
1 votes
1 answer
35
Which of the statement is sufficient to determine children of x1) Q and U are brothers of T2) P is the sister of U and S3) P and T are daughters of XA) 1 and 2B) 1,2 and ...
1 votes
1 answer
36
Consider Undirected Graph Ghaving vertex V {A,B,C,D,E}and edge pair as E {AB BD BE AC CE CD}A) Given graph is disconnectedB) Given graph is completeC) Given graph has ver...
5 votes
2 answers
37
Given an array of n elements, where each element is at most k away from its target position, which algorithm is best suitable for sorting and what will be time complexity...
0 votes
1 answer
38
Consider function f: N $\rightarrow$ N, where N is a natural number, which of the following function is not one to one but ontoA) f(1)=f(2)=1 f(n)=n-1 B) 2nC) $n^{2}$
0 votes
2 answers
40
Which of the following statement is true?1) Exactly one of the statement is false2) Exactly two statements are false 3) Exactly three statements are false 4) Exactly fo...
2 votes
1 answer
41
Use the recursion tree to determine a good asymptotic upper bound on the recurrence T(n)=T(n-1)+T($\frac{n}{2}$)+n. Use substitution method to verify the answer.
1 votes
2 answers
43
From 10 married couples, we want to select group of 6 that is not allowed to contain a married couple. How many choices are there?
2 votes
1 answer
44
Prove$\binom{m+n}{r}$ = $\binom{n}{0}\binom{m}{r}+\binom{n}{1}\binom{m}{r-1}+... +\binom{n}{r}\binom{m}{0}$
0 votes
0 answers
45
Determine the number of vectors $\{x_{1}...x_{n}\}$, such that each $x_{i}$ is either $0$ or $1$ and$\displaystyle{\sum_{i=1}^{n}x_{i}\geq k}$