No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
inr main () { int x=3,y=4,z=4; printf("%d",z>=y>=x), } the answer is zero ..how?? 
|
|
|
I have a final coming up and the professor has hinted in class that there would be a question on how to make the primitive min operation in Big-O(1). I know that its capable of and how it works in Big-O(log n). I have idea that it will involve the … 
|
|
|
void swap(int *x,int *y) { static int *temp; temp=x; x=y; y=temp; } void printab() { static int i,a=-3,b=-6; i=0; while(i<=4) { if((i++)%2==1) continue; a=a+i; b=b+i; } swap(&a,&b); printf("a=%d b=%d out side rec\n",a,b); } main() { printab(); printf("end of output 1"); printab(); } out put for the first printab() is 6 …
|
|
|
consider a token ring topology with N stations , running token ring protocol where the stations are equally spaced .when a station gets the token it is allowed to send one frame of fixed size . 1) the max utilization of the ring if the transmission delay is 5ms and … |
|
|
can any one suggest me to sort million numbers(distinct)
|
|
|
designing a pushdown automata for the language a^n b c^(n+2), n>0 I have been asked to implement the automata for the above language .. please help? I tried popping a 2 (c)s everytime I push an (a) on to the stack but it seems not to work with odd number …
|