Which of the Following will define a type NODE that is a node in a Linked list? A)struct node {NODE*next;int x;};type def struct node NODE; B)typedef struct NODE {struct NODE *next;int x;}; C)typedef struct NODE {NODE *next;int x;}; D)typedef struct {NODE *next;int x;}NODE;

5 Answers   Accenture, TCS,

---

Which of the following is not a valid declaration for main ()? 1) int main() 2) int main(int argc, char *argv[]) 3) They both work

2 Answers  

---

write a program to find out number of on bits in a number?

17 Answers   Huawei, Microsoft,

---

write a program to add two numbers of any size.....(remember any size)

1 Answers  

---

character array A[12] can hold

5 Answers   Wipro,

---

What are the loops in c?

0 Answers  

---

What is difference between structure and union?

0 Answers  

---

#include<stdio.h> main() { int a[3]; int *I; a[0]=100;a[1]=200;a[2]=300; I=a; Printf(“%d\n”, ++*I); Printf(“%d\n”, *++I); Printf(“%d\n”, (*I)--); Printf(“%d\n”, *I); } what is the o/p a. 101,200,200,199 b. 200,201,201,100 c. 101,200,199,199 d. 200,300,200,100

1 Answers  

---

Write a program to generate the Fibinocci Series

0 Answers   TISL,

---

Differentiate between calloc and malloc.

0 Answers   Wipro,

---

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.

5 Answers   Yahoo,

---

What is structure of c program?

0 Answers  

---