D 130041 Total Pages:3

PART ©
(11111101 ALL Questions)

8. What is a circular queuc? How it is different from normal queue? (3)
9. Free memory blocks of sive 60K, 25K, 1214, 20K, 35K, 45K and 40K are available in this

order. Show the memory allocation for a sequence of job requests of size 22%. 10%, 42K,

and 31K (in this order) in First Fit, Best Fit and Worst Fit allocation strategics, (3)
10. How a stack can be implemented using linked list? (31
| |. Write an algonthm to perform concatenation of ۶۸0 strings. (3)

PART D

(Answer Any Two Questions)

12. Write an algorithm for evaluating a postfix expression and evaluate the following postfix
expression using the algorithm ABHCD/AD-EAA+* where A 2,1 7,C 9, 0 3, 5
(9)

13. List the properties of binary search tree, Write an algorithm to search an clement from a
binary search tree. [೪]
14. a) Write the non recursive preorder 1215/82 19011, (4.5)

b) What is the output obtained “atter ज्ञाएजदएा, അസ്ന and postorder traversal of the

following tree. (4.3)

PART E

(Answer Any Four Questions)

15. Write an algorithm for merge sort technique. ധ്യ with an example. Give its

complexity, (10)

Page 2 of 3