Exam2-V1

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: determine whether the list contains a given item Part b [4 marks] Briefly compare and contrast the differences in memory allocation strategies between an array ­based data structure (like the Bag we studied) and a link ­based structures (like a linked list). Mention whether allocation occurs in large or small chunks, frequently or infrequently, and whether such allocation is expensive or cheap. 3 [ CSE116 – EXAM 2 – VERSION 1 ] FALL 2011 Question 3 [10 marks] Suppose you know that t(n) = O(n2.5). For each of the following statements, indicate whether they (i) must be true, (ii) could be either true or false (depending on what the function t(n) really is), or (iii) must be false. t(n) = O(n log(n)) (i) must be true (ii) could be either true or false (iii) must be false t(n) = n2 (i) must be true (ii) could be either true or false (iii) must be false t(n) = O(n3) (i) must...
View Full Document

This note was uploaded on 08/19/2013 for the course CSE 1156 taught by Professor Alhonce during the Fall '11 term at SUNY Buffalo.

Ask a homework question - tutors are online