Interested to Buy Any Domain ? << Click Here >> for more details...
main()
{
if ((1||0) && (0||1))
{
printf("OK I am done.");
}
else
{
printf("OK I am gone.");
}
}
a. OK I am done
b. OK I am gone
c. compile error
d. none of the above
- 5 Answers
- 13609 Views
- HCL, I also Faced
- E-Mail Answers
Answer Posted / naveen kumar
ok i am gone...because in this case the condition if((1||0)
&&(0||1)
always remain true. hence the answer is ok i am done...i.e.
(a
| Is This Answer Correct ? | 1 Yes | 1 No |
Post New Answer View All Answers
why do you use macros? Explain a situation where you had to incorporate macros in your proc report? use a simple instream data example with code ?
Design an implement of the inputs functions for event mode
3) Int Matrix of certain size was given, We had few valu= es in it like this. =97=97=97=97=97=97=97=97=97=97=97 1 = | 4 | | 5 | &= nbsp; | 45 =97=97=97=97=97=97=97=97=97=97=97 &n= bsp; | 3 | 3 | 5 | = | 4 =97=97=97=97=97=97=97=97=97=97=97 34 |&nbs= p; 3 | 3 | | 12 | &= nbsp; =97=97=97=97=97=97=97=97=97=97=97 3 | &nbs= p; | 3 | 4 | = | 3 =97=97=97=97=97=97=97=97=97=97=97 3 | = ; | | | = ; 3 | =97=97=97=97=97=97=97=97=97=97=97 &= nbsp; | | 4 | = ; | 4 | 3 We w= ere supposed to move back all the spaces in it at the end. Note: = If implemented this prog using recursion, would get higher preference.
write a simple calculator c program to perform addition, subtraction, mul and div.
What is full form of PEPSI
Develop a routine to reflect an object about an arbitrarily selected plane
What is the match merge ? compare data step match merge with proc sql merge - how many types are there ? data step vs proc sql
Given a spherical surface, write bump-mapping procedure to generate the bumpy surface of an orange
What is the difference between proc means and proc tabulate ? explain with a simple example when you have to use means or tabulate?
Can you send Code for Run Length Encoding Of BMP Image in C Language in linux(i.e Compression and Decompression) ?
How can you relate the function with the structure? Explain with an appropriate example.
why nlogn is the lower limit of any sort algorithm?
To Write a C program to remove the repeated characters in the entered expression or in entered characters(i.e) removing duplicates. String contains only lowercase characters ['a'-'z']
write a function to give demostrate the functionality of 3d in 1d. function prototye: change(int value,int indexX,int indexY,int indexZ, int [] 1dArray); value=what is the date; indexX=x-asix indexY=y-axis indexZ=z-axis and 1dArray=in which and where the value is stored??
#include
