Académique Documents
Professionnel Documents
Culture Documents
14)csma/cd is used in
ans)ethernet
15)what is used for knowing its own ip address
ans)rarp
16)no signalling is needded to establish connection in
ans ) ip
17)a simple problem, on newton rapshon method
18)(A-B)U(B-A)U(AnB)=
ANS)AUB
19)
if a number is choosen between 100 and 999 includeing these
numberrs what is the provbabilty that the number selected
does not contain a 7 is
ans)workitout
20)a packet trabvelling in the internet forever can be
controlled by having the field
ans)time to live (ttl)
21)c code with the follwing choices
a)call with value
b)call with address
c)call with value result
ans)call with value result
22) when the following sequence is inserted in the binary
search tree no of nodes int left subtree and right sub tree
is
ans )7,4
23)simple problem in recurssion
x(x(5))
ans)17
24)study about reentrant code reusable code recursive code
25)given edges nodes and components of a graph find out its
rank
DESHAW 97
PART 1 TIME:20 MIN
* 20 QUESTIONS , EACH QUESTION CARRIES 2 MARKS
2. THERE WERE 750 PEOPLE WHEN THE FIRST SONG WAS SUNG.
AFTER EACH
SONG 50 PEOPLE ARE LEAVING THE HALL. HOWMANY SONGS ARE SUNG
TO MAKE
THEM ZERO?
ANS:16
1 TO 10 -2 ZEROS
21 TO 30 -3 ZEROS : BECAUSE 25 = 5*5
22 *5
24 *5
ANS:6000
ANS: 86
ANS:25 MIN
ANS: 25%
ANS: 30
AMAR : IAM NOT BOBBY`S SON ; THE CHIEF WEARS RED SHIRT
BOBBY : IAM AMARS FATHER ; CHARLES IS THE CHIEF
CHARLES : THE CHIEF IS ONE AMONG US; IAM THE CHIEF
1. typedef struct{
char *;
nodeptr next;
} * nodeptr;
what does nodeptr stand for?
#include<stdio.h>
main()
{
int a[] ={ 1,2,3,4,5,6,7};
char c[] = {' a','x','h','o','k'};
printf("%d\t %d ", (&a[3]-&a[0]),(&c[3]-&c[0]));
}
ans : 3 3
#include<stdio.h>
main()
{
struct s1 {int i; };
struct s2 {int i; };
struct s1 st1;
struct s2 st2;
st1.i =5;
st2 = st1;
printf(" %d " , st2.i);
}
#include<stdio.h>
main()
{
int i,j;
int mat[3][3] ={1,2,3,4,5,6,7,8,9};
for (i=2;i>=0;i--)
for ( j=2;j>=0;j--)
printf("%d" , *(*(mat+j)+i));
}
ans : 9 6 3 8 5 2 7 4 1
5.
fun(n);
}
int fun( int n)
{
int i;
for(i=0;i<=n;i++)
fun(n-i);
printf(" well done");
}
howmany times is the printf statement executed for n=10?
ans: zero
expl: Befire reaching to printf statement it will goes to
infinite loop.
main()
{
struct emp{
char emp[];
int empno;
float sal;
};
struct emp member = { "TIGER"};
printf(" %d %f", member.empno,member.sal);
ans: error. In struct variable emp[], we have to give array
size.
If array size given
ans is 0, 0.00
ans: none
expl: infiniteloop in main ends with ";" . so loop will not
reach end;
and the DONE also will not print.
main()
{
int a=2, b=3;
printf(" %d ", a+++b);
}
ans:5
expl: here it evaluates as a++ + b.
main()
{
int x=1, y=2;
print(max(x++,y),x,y);
print(max(x++,y),x,y);
}
ans: 3 4 2
int *ptr[][100];
which of the following correctly allocates memory
for ptr?
ans: ptr = (int *)(malloc(100* sizeof(int));
SECTION-A
SECTION-B
GUIDELINES:
the interview is very tough he is asking to do the
problems in
front of him. he is also giving some new problems to
solve before
him.
you should have a very good funda of C language.
Guest
a^=b^=a^=b
Shirish