Answer Posted / harshita gangwar

<STACK>
stack is a linear kind of data structure .it works on "LIFO"
,LIFO stands for last in first out. in stack we perform two
operations i.e. insertion & deletion & these operations
performs only at one end i.e called "TOP".
for eg: a stack of books..etc
there are two operations performs-
(1) push (2) pop
there are also two conditions occures in case of stack i.e.
i.e. (i)underflow (ii)overflow
/*ALGO FOR PUSH OPERATION*/
PUSH( stack[],TOP,item, len)
1) set TOP=-1
2) if TOP==len-1, then
print stack is overflow.
3) else
set TOP=TOP+1
set stack[TOP]=item
4) EXIT.
In the PUSH operation the overflow condition generates.
/*ALGO FOR POP OPERATION*/
POP(stack[],TOP,item,len)
1) set TOP=len-1
2) if TOP==-1, then
print stack is underflow.
3) else
set item=stack[TOP]
set TOP=TOP-1
4) EXIT.
In the POP operation the underflow condition generates.
OTHER EGS OF STACK:-
(I)a stack of disks.
(II)a common model of a stack is plates in a party
where fresh plates are "PUSHED"(inserting) on to the TOP &
"POPED"(deleting) from the TOP.

What are benefits of oop?

1082

---

What is encapsulation in oops?

958

---

What is polymorphism and its types?

1007

---

Write a program to sort the number with different sorts in one program ??

2324

---

Can enum be null?

963

---

How is class defined?

1071

---

Is abstract thinking intelligence?

979

---

Is data hiding and abstraction same?

968

---

What makes a language oop?

1007

---

What is the example of polymorphism?

1024

---

What does and I oop mean in text?

1120

---

Why do we use oops?

960

---

What is object in oop?

1061

---

What is difference between polymorphism and inheritance?

1020

---

What is debug class?what is trace class? What differences are between them? With examples.

2134

---