E 2248 (Pages 1 2) 10. 11, 12. 13, M4. 16. Sen ae ew B.Sc/B.C.A. DEGREE (C.B.C.S.S.) EXAMINATION, MAY 2015 Second Somester Coro Course - DATA STRUCTURES (For B.Se. Computer Applications and B.C.A.) (2018 Admission onwards] : Three Hours Maximum : 80 Marks Part A (Short Answer Questions) Answer all questions. 1 mark each, ‘The way a card game player arranges his cards as he picks them up one by one is an example of which sort method? . How many number of elements are in array A {-1 : 25]? ‘What will be the postfix equivalent of the prefix expression »-ab—cd? In which type queue insertion and deletion of items can be done form any position? Linked list is a collection of, listis a linked representation with one or more da ‘What is the number of possjble binary trees with 3 nodes? item fields and multiple link fields. What is the average successful search time for sequential search on n items? Hash tables are ideal for data structures for. is collection of fields, (10x 1 = 10) Part B (Brief Answer Questions) Answer any eight questions, 2 marks each, What is ADT? Define data structure, What is meant by sorting? What is a Circular Queue? What is deque? Turn over Scanned with CamScanner16. 1. 18. 19. 20. 21, 24, 25. 26. 27. 28, 29. 30. 31. 32. 33, 35. 2 2248 Mention the disadvantages of circular list, Define Pointer, What is the maximum number of nodes on level i of a binary tree? What is meant by level order traversal? ‘What is a sequential file? Differentiate between primary key and secondary key. What is rehashing? (8x 2 = 16) Part C (Descriptive/Short Essay Type Questions) Answer any six questions. 4A marks each, ‘Write the procedure for linear search. Explain how array is represented in memory. : Write an algorithm to convert infix expression to postfix expression. ‘Write about the applications of stack and queue. Write short notes on garbage collection, Explain recursion with an exaniple. Briefly explain about different types of binary tree. ‘What are the operations that can be performed on a file? ‘How collisions are handled in linear probing? . (6x4=24) Part D (Long Essay) Answer any two questions. 15 marks each. Write the algorithm for Selection Sort and trace bubble sort algorithm on the list L = (29, 91, 88, 67, 56, 90, 17, 52, 68, 82, 19} Explain the different operations performed on a circular queue with suitable algorithm and example. Discuss in detail about doubly linked list. Explain in detail about binary tree traversals. (2x 15 = 30) Scanned with CamScanner