| Other C Interview Questions |
| |
| Question | Asked @ | Answers |
| |
| c programming of binary addition of two binary numbers
| | 1 |
| Binary tree traversing | Qualcomm | 1 |
| can we access one file to one directory? | | 1 |
| for example user gives input as " 20 or 20.0 or rs 20.0 or
20.00 or rs20 and so .. on " and the output should be
stored as " rs.20.00 " in a variable | | 2 |
| a.One Cannot Take the address of a Bit Field
b.bit fields cannot be arrayed
c.Bit-Fields are machine Dependant
d.Bit-fields cannot be declared as static
Which of the Following Statements are true w.r.t Bit-Fields
A)a,b&c B)Only a & b C)Only c D)All
| Accenture | 2 |
| char ch="{'H','I',0};printf("%s",ch);what is output | Accenture | 9 |
| 1
232
34543
4567654
can anyone tell me how to slove this c question | | 3 |
| 7. Identify the correct argument for the function call
fflush() in ANSI C:
A)stdout
B)stdin
C)stderr
D)All the above
| Accenture | 8 |
| Why doesn't C have nested functions? | | 2 |
| C program to perform stack operation using singly linked list | | 3 |
| Write code for finding depth of tree | Adobe | 1 |
| how many argument we can pas in in a function | CTS | 20 |
| what does exit() do? | Cadence | 3 |
| how to find string length wihtout using c function? | | 4 |
| Write a program for deleting duplicate elements in an array | Subex | 3 |
| what are two categories of clint-server application
development ? | | 1 |
| what is the output of the following program?
main()
{
int c[]={2,8,3,4,4,6,7,5};
int j,*p=c,*q=c;
for(j=0;j<5;j++)
{
printf("%d",*c);
++q;
}
for(j=0;j<5;j++)
{
printf("%d",*p);
++p;
}
} | | 4 |
| We can draw a box in cprogram by using only one printf();&
without using graphic.h header file? | NIIT | 3 |
| What is true about the following
C Functions
a.Need not return any value
b.Should always return an integer
c.Should always return a float
d.Should always return more than one value.
| TCS | 7 |
| what is the difference between entry control and exit
control statement? | | 2 |
| |
| For more C Interview Questions Click Here |