Answer Posted / vignesh1988i

we know that stack is a data structure where the
highest priority will be given to the last element that is
pushed inside and the priority will decrease respectively to
the next consecutive elements........ so we are going to
implement in singly list .... so we are going to insert the
node to the left side of a reference node....... operations
performed in stack are : PUSH & POP..... PUSH here means we
are going to insert a element only at last ..... and POP
means displaying the node from first........


thank u

write a C program: To recognize date of any format even formats like "feb-02-2003","02-february-2003",mm/dd/yy, dd/mm/yy and display it as mm/dd/yy.

3816

---

What is main return c?

980

---

In C language, the variables NAME, name, and Name are all the same. TRUE or FALSE?

1214

---

#include int main(){ int i=10; int *ptr=&i; *ptr=(int *)20; printf("%d",i); return 0; } Output: 20 can anyone explain how came the output is 20

1705

---

What is the best organizational structure?

1110

---

Write a program to print fibonacci series without using recursion?

1112

---

How was c created?

1035

---

Explain what are run-time errors?

1070

---

What are predefined functions in c?

1075

---

What is indirection? How many levels of pointers can you have?

1117

---

Why do we use namespace feature?

1037

---

What is cohesion in c?

966

---

Explain is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?

1203

---

In c programming, explain how do you insert quote characters (? And ?) Into the output screen?

1226

---

What is difference between arrays and pointers?

1051

---