Answer Posted / pradeep

prashant answer is wrong suppose add two similar numbers
prashant answers will fail because addtion of two similar
bits according to the bitwise xor fails.

Write a program to display all the prime nos from 1 to 1000000, your code should not take time more than a minute to display all the nos.

2021

---

What is #define in c?

999

---

#include show(int t,va_list ptr1) { int a,x,i; a=va_arg(ptr1,int) printf(" %d",a) } display(char) { int x; listptr; va_star(otr,s); n=va_arg(ptr,int); show(x,ptr); } main() { display("hello",4,12,13,14,44); }

1255

---

What is the purpose of main() function?

1196

---

What do you understand by normalization of pointers?

1016

---

Explain enumerated types.

991

---

Explain the difference between call by value and call by reference in c language?

1070

---

a number whose only prime factors are 2,3,5, and 7 is call humble number,,write a program to find and display the nth element in this sequence.. sample input : 2,3,4,11,12,13, and 100.. sample output : the 2nd humble number is 2,the 3rd humble number is 3,the 4th humble number is ,the 11th humble number is 12, the 12th humble number is 14, the 13th humble number is 15, the 100th humble number is 450.

5024

---

Differentiate between full, complete & perfect binary trees.

1063

---

Which is an example of a structural homology?

1274

---

What is a #include preprocessor?

1098

---

Explain how can type-insensitive macros be created?

961

---

provide an example of the Group by clause, when would you use this clause

2141

---

How can I rethow can I return a sequence of random numbers which dont repeat at all?

1160

---

How to compare array with pointer in c?

1069

---