Answer / 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

Answer / spandana

it is a datastructure which follows the principal of Last
in First order(LIFO) ie last inserted element will be
deleted first.hence both insertions and deletions takes
place at the same end.it can perform 2
operations "PUSH","POP". the special variable used in
stacks is "top"
stacks can be implemented using arrays,linked lists

what are the difference between ANSI C and Let Us c and Turbo C

4 Answers   LG Soft,

---

main() { enum _tag{ left=10, right, front=100, back}; printf("%d, %d, %d, %d", left, right, front, back); }

1 Answers   Accenture, Vector,

---

c programming of binary addition of two binary numbers

4 Answers  

---

Explain what are binary trees?

0 Answers  

---

What is volatile variable in c with example?

0 Answers  

---

p*=(++q)++*--p when p=q=1 while(q<=6)

0 Answers   KINPOE,

---

Describe the steps to insert data into a singly linked list.

0 Answers  

---

What is a char c?

0 Answers  

---

write a c program to remove all the duplicate characters in a string and replace with single character? ex:-input- AAABBBCCC output- ABC

2 Answers   HCL,

---

When should we use pointers in a c program?

0 Answers  

---

The % symbol has a special use in a printf statement. How would you place this character as part of the output on the screen?

0 Answers  

---

What is Full Form of C and Why We use C

23 Answers  

---