DSA #01

Principle of Stack

• LILO

• FILO

• LIFO

• FIFO

Queue follows

• FIFO

• LIFO

• FILO

• LILO

ADT means

• Abstract Define Type

• Abstract Data Term

• Additive Data Technique

• Abstract Data Type

Convert the following infix into post fix. (a + b) * (c - d)

• ab+*cd-

• ab+cd*-

• ab+cd-*

• ab+cd*-

Convert the following infix into prefix. a+b/d

• +/abd

• a+/bd

• +a/bd

• /+abd

convert the following infix into post fix. (a+b/e)*(d+f)

• */+abe+df

• *+abe/+df

• ab+e/df+*

• abe+/df+*

what happens next?

push 2; push -1; push 54; pop; push 71; pop; push 100; pop

• -1, 2

• 2, -1

• empty

• full

Process of inserting an element in stack is called ____________

• Create

• Push

• Pop

• Top

What is the value of the postfix expression 6 3 2 4 + – *:

• 1

• 14

• 74

• -18

To represent hierarchical relationship between elements, Which data structure is suitable?

• Queue

• Tree

• Graph

• Priority