Answer / vikram singh saini

Here is the link:
http://niitdeveloper.blogspot.com/2010/12/accept-integers-print-in-reverse-order.html

This code accepts integers or numbers from user and print
them in reverse order using linkedlist.

Answer / shruthirap

node *reverse(node *first)
{
node *temp = NULL;

if(first->next != NULL)
{
temp = reverse(first->next);
temp->next = first;
return first;
}
else
return first;
}
//The only catch is that the supposed to be first node after
reordering, has to be kept either in some global pointer or
passed back by function. That's it :)

how to check whether a linked list is circular.

11 Answers   Microsoft,

---

main() { int i=4,j=7; j = j || i++ && printf("YOU CAN"); printf("%d %d", i, j); }

1 Answers  

---

How to palindrom string in c language?

6 Answers   Google,

---

void func1(int (*a)[10]) { printf("Ok it works"); } void func2(int a[][10]) { printf("Will this work?"); } main() { int a[10][10]; func1(a); func2(a); } a. Ok it works b. Will this work? c. Ok it worksWill this work? d. None of the above

1 Answers   HCL,

---

main() { printf("%x",-1<<4); }

3 Answers   HCL, Sokrati, Zoho,

---

What are the files which are automatically opened when a C file is executed?

1 Answers  

---

How will u find whether a linked list has a loop or not?

8 Answers   Microsoft,

---

Program to find the largest sum of contiguous integers in the array. O(n)

11 Answers  

---

int i; main(){ int t; for ( t=4;scanf("%d",&i)-t;printf("%d\n",i)) printf("%d--",t--); } // If the inputs are 0,1,2,3 find the o/p

2 Answers  

---

main() { show(); } void show() { printf("I'm the greatest"); }

2 Answers  

---

main() { float me = 1.1; double you = 1.1; if(me==you) printf("I love U"); else printf("I hate U"); }

1 Answers  

---

#define assert(cond) if(!(cond)) \ (fprintf(stderr, "assertion failed: %s, file %s, line %d \n",#cond,\ __FILE__,__LINE__), abort()) void main() { int i = 10; if(i==0) assert(i < 100); else printf("This statement becomes else for if in assert macro"); }

1 Answers  

---