Sookshmas | Recent Posts

A spherical ball of mass 10-6 kg hits a wall 1000 times per second normally with a velocity of 1000 m/s and rebounds with same velocity along the initial direction. The force experienced by the wall is

Posted on November 22,2022 at 09:29 PM by Gaurav kumar

Engineering Entrance Exams

Medical Entrance Exams

Physics

Physics Numericals

72Score(s)

1Comment(s)

148View(s)

Predict the output:

#includestdio.h
int main() {
    int m=10;
    while(m0){
    printf("%d",m);
    
}
    return 0;
}

Posted on November 22,2022 at 09:17 PM by Madhu Bharadwaj

38Score(s)

1Comment(s)

98View(s)

भारत मे न्यायपालिका के कार्यपालिका से पृथक्करण किससे व्यादेशीत है
a) संविधान की उद्देशिका द्वारा
b)राज्य के नीति निर्देशक तत्व द्वारा
c)सातवीं अनुसूची द्वारा
d)परंपरागत व्यावहार द्वारा

Posted on November 22,2022 at 09:14 PM by Asheesh yadav

Civil Services Entrance Exams-Medium-Hindi

Polity

14Score(s)

1Comment(s)

31View(s)

What is the output of the following code?

#includestdio.hint main()
{
int a=3;
while(a=5)
{
printf("Hello ");
break ;
} 
printf("know program");
return 0;
}

Posted on November 22,2022 at 09:00 PM by Nagaveni E.B

24Score(s)

1Comment(s)

38View(s)

Predict the output:

public class Sookshmas
{
     public static void main(String args[])        {
            char chars[] = {'s', 'o', 'k'};
            String sc = new String(chars);
            System.out.println(sc);
        }
}

Posted on November 22,2022 at 08:55 PM by Shreya B

34Score(s)

1Comment(s)

74View(s)

What is the time complexity of the given code?


int timecomplexity = 0;
for (i = 0; i N; i++) {
    for (j = N; j i; j--) {
        if(timecomplexity==0)
continue;
    }
}

Posted on November 22,2022 at 08:47 PM by Abhishek Belagavi

0Score(s)

1Comment(s)

2View(s)

Find the value of A[1] after execution of the following .

int[] A = {0,2,4,1,3};
for(int i = 0; i  a.length; i++){
    a[i] = a[(a[i] + 3) % a.length];
}

Posted on November 22,2022 at 08:46 PM by sanjana k

32Score(s)

0Comment(s)

43View(s)

what is the output?

#includestdio.h
int main()
{
 char str1[] = {'S', 'O', 'O','K','S','H'}; 
 char str2[] = {'S', 'O', 'O','K','S','H'};
 if (strcmp(str1, str2))
 {
  printf("strings are not equal");
 }
 else
 {
  printf("strings are equal");		
 }
 return 0;
}

Posted on November 22,2022 at 08:46 PM by Khushi Patil

32Score(s)

1Comment(s)

63View(s)

Figure below is a balanced binary tree. If a node inserted as child of the node R, how many nodes will become unbalanced?

L
/. \
P. M
/ \
R. T

Posted on November 22,2022 at 08:45 PM by Abhishek Belagavi

28Score(s)

1Comment(s)

64View(s)

include stdio.h
#include string.h

int main(){
printf("String 01 ");
printf("String 02 ");
printf("String 03 \n");

printf("String 01 \n");
printf("String 02 \n");
return 0;
}

Posted on November 22,2022 at 08:33 PM by Priyanka S

0Score(s)

0Comment(s)

17View(s)

Recent Posts

A spherical ball of mass 10-6 kg hits a wall 1000 times per second normally with a velocity of 1000 m/s and rebounds with same velocity along the initial direction. The force experienced by the wall is

Predict the output:
#includestdio.h

int main() {
int m=10;
while(m0){
printf("%d",m);

}
return 0;
}

What is the output of the following code?
#includestdio.h
int main()
{
int a=3;
while(a=5)
{
printf("Hello ");
break ;
}
printf("know program");
return 0;
}

Predict the output:

public class Sookshmas
{
public static void main(String args[])
{
char chars[] = {'s', 'o', 'k'};
String sc = new String(chars);
System.out.println(sc);
}
}

What is the time complexity of the given code?

int timecomplexity = 0;
for (i = 0; i N; i++) {
for (j = N; j i; j--) {
if(timecomplexity==0)
continue;
}
}

Find the value of A[1] after execution of the following .
int[] A = {0,2,4,1,3};
for(int i = 0; i a.length; i++){
a[i] = a[(a[i] + 3) % a.length];
}

what is the output?

#includestdio.h
int main()
{
char str1[] = {'S', 'O', 'O','K','S','H'};
char str2[] = {'S', 'O', 'O','K','S','H'};
if (strcmp(str1, str2))
{
printf("strings are not equal");
}
else
{
printf("strings are equal");
}
return 0;
}

Figure below is a balanced binary tree. If a node inserted as child of the node R, how many nodes will become unbalanced?

L
/. \
P. M
/ \
R. T

include stdio.h
#include string.h

int main(){
printf("String 01 ");
printf("String 02 ");
printf("String 03 \n");

printf("String 01 \n");
printf("String 02 \n");
return 0;
}