srinath1

inr main () { int x=3,y=4,z=4; printf("%d",z>=y>=x), } the answer is zero ..how??

Its very obvious that IN MIN HEAP , the smallest element will sit at the top of the tree ,hence to search the smallest element in the heap , it takes constant time i.e O(1)

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)

for all a's and b's push onto the stack , then for first two c's pop b and for the remaining c's pop a's .hence solved1