nm (CMSA(HN)-04-A. West Bengal State University B.A./B.Sc./B.Com. ( Honours, Major, General ) Examinations, 2013 PART - II COMPUTER SCIENCE — HONOURS Paper-IV(A) Duration : 2 Hours | [ Full Marks : 50 The figures in the margin indicate full marks, Answer Question No. 1 and any three questions from the rest, taking at least one from each Group. 1. Answer any jour questions = 442-8 a) b) 3) dj °) § gh hy) 2 al i) ¢ a) by ° Discuss the advantages of threaded binary tree. What do you mean by good and bad hash function ? What is demand paging ? What is a Test and Set Lock (PSL) instruction ? What is the height of a complete binary tree comprising n vertices ? Define ane exemplify stable sorting Distinguish between a Process and a Program What is Kernel or Supervisory Mode ? GROUP -A What is AVL ee ? Why is it important ? Consider the following letters and insert them one after another, and obtain an AVL tree after each insertion : BWM RDS OKYP Prove that ny =n, +1, where ny is the number of leaf vertices and n, is the number of vertices of degree 2 of a non-empty binary tree. Write a non-recursive algorithm for post-order traversal in a binary tree (it lj+e+2e4 Define sorting and give an example. Write a recursive function to sort @ set of data elements using quick sort method. Show how your function works for an assumed data set of 10 elements Why is quick sort so called ? Explain. What is the best case time complexity of this sorting method and when does it occur ? 1+(54+3)+(3+2)