2010 final exam - Name: _ ID Number: _ UNIVERSITY OF...

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

View Full Document Right Arrow Icon
Name: __________________________________ ID Number: ______________________________ UNIVERSITY OF VICTORIA EXAMINATIONS- DECEMBER 2010 CSC 225 - Algorithms and Data Structures: I Section A01 (CRN 10849) Instructor: Wendy Myrvold Duration: 3 hours TO BEANSWERED ON THE PAPER. Instructions: Students MUST count the number of pages in this examination paper before begin- ning to write, and report anydiscrepancyimmediately to the invigilator. This exam has ten pages (the last page is blank in case you need extra space) plus the header page. Use only space provided on exam for answering questions. Closed book. No aids permitted. Question Value Mark 11 2 28 32 0 41 0 52 0 61 5 71 5 Total 100
Background image of page 1

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

View Full DocumentRight Arrow Icon
CSC 225- Page 1 of 10 1. Circle true or false for each question and justify your answer. No marks will be given unless thereisacorrect justification. (a) [3 marks] For a fixed integer k ,the sum S ( n ) = n i = 1 Σ i k is in O ( n k ). True False (b) [3 marks] A search for a data item in a binary search tree can take ( n )time in the worst case. False (c) [3 marks] It takes at least O ( n log 2 n )time in the worst case to build a heap because both bubble up and bubble down take (log 2 n )time in the worst case. False (d) [3 marks] Suppose singly linked lists are used to implement a queue. Then, adding to the queue should be done at the front of the list, and deletions from the queue should be taken from the rear of the list.
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 / 11

2010 final exam - Name: _ ID Number: _ UNIVERSITY OF...

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