write a program to compare 2 numbers without using logical
operators?
Answers were Sorted based on User's Feedback
Answer / bashu
main()
{
int x,y;
sf("%d,%d",&x,&y);
if(x^y)
pf("not equal");
else
pf("equal");
}
| Is This Answer Correct ? | 39 Yes | 22 No |
Answer / faceless
main()
{
int result, sign_bit_num;
unsigned int x, y;
sign_bit_num = sizeof(int)*8 ;
result = x-y;
if (result) {
result = result >> (sign_bit_num-1);
if (result) {
printf("x less than y");
} else {
printf("x greater than y");
}
} else {
printf("equal");
}
| Is This Answer Correct ? | 14 Yes | 8 No |
Answer / rishabh
#include<stdio.h>
#include<limits.h>
int sign(int number)
{
return (unsigned) number / (unsigned) INT_MIN;
}
int main(int argc, char *argv[])
{
int a = atoi(argv[1]);
int b = atoi(argv[2]);
int dif = a - b;
int sb1 = sign(dif);
int sb2 = sign(dif - 1) - sb1;
int ptr = 2 * sb2 + sb1;
char *messages[3] =
{
"%d is greater than %d",
"%d is less than %d",
"%d is equal to %d" };
printf(messages[ptr], a, b);
}
}
| Is This Answer Correct ? | 3 Yes | 4 No |
Answer / jj
unsigned int is_same(unsigned int a, unsigned int b)
{
return (a / b);
}
int main()
{
unsigned int a, b;
a = 40, b = 40;
if ( is_same(a,b) == 1 )?
cout << "Equal" << endl
:
cout << "Not equal" << endl;
return 0;
}
| Is This Answer Correct ? | 0 Yes | 5 No |
Answer / r.aruna
#include<stdio.h>
#include<conio.h>
void main()
{
int a;
int b;
clrscr();
printf("enter the a value=");
scanf("%d",&a);
printf("enter the b value=");
scanf("%d",&b);
if(a==b)
{
printf("a is greater");
}
else
{
printf("b is greater");
}
getch();
}
| Is This Answer Correct ? | 4 Yes | 15 No |
can we write a program in c for printf and scanf without using header file stdio.h
what is the difference between declaration and definition of a variable or function ?
what information does the header files contain?
6 Answers BSNL, Cisco, GDA Technologies,
C program to perform stack operation using singly linked list
Given an array A[n+m] of n+m numbers, where A[1] ... A[n] is sorted and A[n+1] ... A[n+m] is sorted. Design a linear time algorithm to obtain A[1...n+m] sorted using only O(1) extra space. Time Complexity of your algorithm should be O(n) and Space Complexity O(1).
WAP to convert text into its ASCII Code and also write a function to decode the text given?
diff. between *p and **p
What is extern keyword in c?
What the advantages of using Unions?
Explain what is the concatenation operator?
wt is diference between int and int pointer as same as float and float pointer and char and char pointer
Draw a diagram showing how the operating system relates to users, application programs, and the computer hardware ?