N +15 (N - Positive Integer)
N +15 (N - Positive Integer)
N +15 (N - Positive Integer)
one third of mass of the original. Asteroids 20 kg are shattered into dust by
the laser. How many laser blasts would be required to reduce a 2000kg
asteroid to dust?
o 365
o 364
o 244
o 243
4) Function :
f(0)=1;
f(2n)=f(n);
f(2n+1)=f(n)+1;
f(2018)=?
5) P(1 child) = ¼;
P( 2 child) = ½;
P (3 child) = ¼;
P( 4 grand children) =?
6) f(x)>=1 for all x.
F(2)=1;
F(3)=2;
F(5)=?
7) There are four integers in the input (N=4).the number in the sequence are
1,2,3,4. The sequence is in the increasing order and hence cannot have a
down part of the sequence.and there is no maximal up and down
subsequence, the result is 0.
Input:
4
-1,2,3,4
Output:
0
for{i=0;i<0;i++}
A)for {i=0;
B)for{
C)for{
D)for{
If N is the size of input (positive),which function is most efficient from the
time point of view?
o A
o B
o C
o D
10) All the digits 2,4,7,8 and 9 are placed in the grid, one in each cell , to form
two three digits numbers that are squares. Which digit is placed in the center
of the grid?
a)
b)
c)
d)
15) Sam walks total 6 steps.sam allowed to take 6 steps.either step forward or
backward.each time probability for a step is ½.
What is the probability of returning to the same position?
18)value 1-9
Alphabet A-I QUESTION: (A+I)+2*(B+G)+3*(C+F)+4*(D+H)+5*E
A<H<I<C
O>B>I>H>E
C<G<A
A>B>E>A
19) int fun(struct*node)
If (root->left==null)
Return 0;
If (root->right==null)
Return0;
Return 1+fun((root->left)(root->right))
}
Count node
Count
20)
if x,y,z,a,b,c are non zero
numbers.xyz(a+b)(b+c)(c+a)/abc(x+y)(y+z)(z+x)=?
If (first==null)return null;
If(first.next==null)return first;
Node second=first.next;
Node rest=reverse(second);
Second.next=first;
First.next=null;
Return rest.next;
However,she did not get the correct result.in which line number did she make a
mistake?please give the answer in the blank line.
23)The greatest common divisor (gcd) of two position integers is the largest
positive integer that divides both integers without leaving a remainder.As 1 is an
integer that always divides both integers,this always exists for any two numbers.
The one way of finding the gcd of two numbers is the Euclidean algorithm.This
goes as follows.
Consider the set of polynomials whose coefficient are the integers modulo
13(0,1,….,12).Multiplication and addition of the coefficient are done modulo
13.Examples are
X3+11x2+11x+10
X2+8x+6
24) The following code given one part of a position paper on collaborative
learning. Please read the passage and identify which of that indicated technologies
would be useful based on the passage. Note that more than one
technology may be applicable.
Please write the appropriate technology labels (a, b and so on) separated by