Department of IT Sub name: DATA STRUCTURES AND
Sub code: CD3291 ALGORITHMS
Sub name: DATA STRUCTURES AND
ALGORITHMS Part A
1.what is the advantage of linked list over arrays?
Part A 2. what is ststic linked list? State any two application of
1.what is the advantage of linked list over arrays? it.
2. what is ststic linked list? State any two application of 3. write any two application of stack.
it. 4. Evaluate the following expression using
3. write any two application of stack. stack 5 6 2+ * 8 4 / -.
4. Evaluate the following expression using 5.what is dequeue?
stack 5 6 2+ * 8 4 / -. Part B
5.what is dequeue? 1.show the simulation using for the following expression
Part B to convert infix to postfix : p*q+(r-s/t).
1.show the simulation using for the following expression 2. simulate the conversion of infix to postfix expression
to convert infix to postfix : p*q+(r-s/t). using stack for the following expression : 3- (4/2) +
2. simulate the conversion of infix to postfix expression (1*5) + 6.
using stack for the following expression : 3- (4/2) + Department of IT
(1*5) + 6. Sub code: CD3291
Sub name: DATA STRUCTURES AND
Department of IT ALGORITHMS
Sub code: CD3291
Sub name: DATA STRUCTURES AND Part A
ALGORITHMS 1.what is the advantage of linked list over arrays?
2. what is ststic linked list? State any two application of
Part A it.
1.what is the advantage of linked list over arrays? 3. write any two application of stack.
2. what is ststic linked list? State any two application of 4. Evaluate the following expression using
it. stack 5 6 2+ * 8 4 / -.
3. write any two application of stack. 5.what is dequeue?
4. Evaluate the following expression using Part B
stack 5 6 2+ * 8 4 / -. 1.show the simulation using for the following expression
5.what is dequeue? to convert infix to postfix : p*q+(r-s/t).
Part B 2. simulate the conversion of infix to postfix expression
1.show the simulation using for the following expression using stack for the following expression : 3- (4/2) +
to convert infix to postfix : p*q+(r-s/t). (1*5) + 6.
2. simulate the conversion of infix to postfix expression Department of IT
using stack for the following expression : 3- (4/2) + Sub code: CD3291
(1*5) + 6. Sub name: DATA STRUCTURES AND
Department of IT ALGORITHMS
Sub code: CD3291
Sub name: DATA STRUCTURES AND Part A
ALGORITHMS 1.what is the advantage of linked list over arrays?
2. what is ststic linked list? State any two application of
Part A it.
1.what is the advantage of linked list over arrays? 3. write any two application of stack.
2. what is ststic linked list? State any two application of 4. Evaluate the following expression using
it. stack 5 6 2+ * 8 4 / -.
3. write any two application of stack. 5.what is dequeue?
4. Evaluate the following expression using Part B
stack 5 6 2+ * 8 4 / -. 1.show the simulation using for the following expression
5.what is dequeue? to convert infix to postfix : p*q+(r-s/t).
Part B 2. simulate the conversion of infix to postfix expression
1.show the simulation using for the following expression using stack for the following expression : 3- (4/2) +
to convert infix to postfix : p*q+(r-s/t). (1*5) + 6.
2. simulate the conversion of infix to postfix expression
using stack for the following expression : 3- (4/2) +
(1*5) + 6.
Department of IT
Sub code: CD3291
