midterm22 - Comp Sci 1MD3 Mid-Term II 2005 Dr. Jacques...

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

View Full Document Right Arrow Icon
Comp Sci 1MD3 Mid-Term II 2005 Dr. Jacques Carette Name: Student No.: Duration : 50 minutes This midterm contains 15 questions on 7 pages This midterm will be marked out of 50. There are 60 total marks available. Answer the question in the space provided. Do not separate the pages. Make sure that you do not get stuck on one question; use your time wisely.
Background image of page 1

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

View Full DocumentRight Arrow Icon
1. Which of the following data structures has the drawback of “creeping forward” in memory during normal use ? [1] (a) an array (b) a queue (c) a circular stack (d) a doubly linked list 2. Which of the following methods to resolve collisions in a hash table result in primary clustering? [2] (a) double hashing (b) extend buckets with a linked list (c) put the elements in the next available slot (d) put the elements in the next available slot, looking at slots ( h ( k ) + i 2 ) mod m 3. Given a hash table of size m where collisions resolution is done via linked list, what does the statement “this hash table currently has a load factor of 4” mean? [2] (a) only four more elements can be stored in the hash table
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 7

midterm22 - Comp Sci 1MD3 Mid-Term II 2005 Dr. Jacques...

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

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