| Other C Interview Questions |
| |
| Question | Asked @ | Answers |
| |
| enum colors {BLACK,BLUE,GREEN}
main()
{
printf("%d..%d..%d",BLACK,BLUE,GREEN);
return(1);
}
| ME | 2 |
| what are two categories of clint-server application
development ? | | 1 |
| Design a program using an array that lists even numbers and
odd numbers separately from the 12 numbers supplied by a user. | | 4 |
| what is the use of a array in c | | 4 |
| program to find a smallest number in an array | Microsoft | 2 |
| how to exchnage bits in a byte
b7<-->b0 b6<-->b1 b5<-->b2 b4<-->b3
please mail me the code if any one know to
rajeshmb4u@gmail.com | Honeywell | 3 |
| how do u find out the number of 1's in the binary
representation of a decimal number without converting it
into binary(i mean without dividing by 2 and finding out
the remainder)? three lines of c code s there it
seems...can anyone help | | 2 |
| what is object oriental programing? | | 1 |
| how to add numbers without using arithmetic operators. | | 6 |
| How the processor registers can be used in C ? | HP | 4 |
| what is the difference between const volatile int i
& volatile const int j; | HCL | 1 |
| main()
{
printf(5+"Vidyarthi Computers");
} | | 5 |
| #include<stdio.h>
main()
{
char s1[]="Ramco";
char s2[]="Systems";
s1=s2;
printf("%s",s1);
}
Find the output | CitiGroup | 4 |
| read the folllowing code
# define MAX 100
# define MIN 100
....
....
if(x>MAX)
x=1;
else if(x<MIN)
x=-1;
x=50;
if the initial value of x=200,what is the vlaue after
executing this code?
a.200
b.1
c.-1
d.50
| TCS | 2 |
| Write a program to exchange two variaables without temp | Geometric-Software | 5 |
| Which of the following sorts is quickest when sorting the
following set: 1 2 3 5 4
1) Quick Sort
2) Bubble Sort
3) Merge Sort
| | 3 |
| There is a 100-story building and you are given two eggs.
The eggs (and the building) have an interesting property
that if you throw the egg from a floor number less than X,
it will not break. And it will always brake if the floor
number is equal or greater than X. Assuming that you can
reuse the eggs which didn't broke; you got to find X in a
minimal number of throws. Give an algorithm to find X in
minimal number of throws. | | 2 |
| What are advantages and disadvantages of recursive
calling ? | HP | 6 |
| Difference between fopen() and open()? | Aricent | 1 |
| difference between function & structure | Verizon | 3 |
| |
| For more C Interview Questions Click Here |
To Refer this Site to Your Friends 
Site Map
