fe212_sp07 - Department of Computer Science Data Structures...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Department of Computer Science Data Structures (CSC211) Final Exam (2 nd Semester 2006-07) Date: 21/5/1428H Time: 3 hours Marks: 100 Question 1 (15 marks) Consider the following situations and choose the most suitable ADT that can be used from the choices given. (a) You have to store information about books in a library (of 500,000 books). [AVL tree, B+-tree, hashtable, list] (b) You have to maintain information about a group of 100 students. No student leaves or enters the group. You often access the information about a student. Each student has unique id number. [AVL-tree, BST, hashtable, stack] (c) You have to maintain information about ‘father’ and ‘mother’ relations in a large family or a tribe of 200 people. Given a key for a person you should be able to find information about the person’s father and mother. Draw a graphical representation of the ADT you choose, labeling it clearly. [BST, AVL-tree, binary tree, B+-tree] Question 2. (15 marks) Using the operations in the specification of ADT List write a static method in the
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

fe212_sp07 - Department of Computer Science Data Structures...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online