Q1. Illustrate the meaning of buddy system memory allocator? Write down its drawbacks?
Q2. Describe first fit and best fit approaches of the memory management. Write down an algorithm for best fit approach.
Q3. What do you mean by scheduling problem?
Q4. Write down a program to reverse a singly linked list devoid of using any more memory.
Q5. Illustrate the meaning of Huffman trees? Write down the algorithm for the same. Sketch Huffman tree for the set of weights
{1, 2, 3, 3, 4}.
Q6. Describe in detail the depth first traversal algorithm of a graph.
Q7. What do you mean by AVL tree? Explain why height balancing is needed? For the given sequence, make AVL tree (show each and every step with all rotations)
H, I, J, B, A, E, C, F, D