MT-W05 - York University COSC 3101 Fall 2004 Midterm (Nov...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: York University COSC 3101 Fall 2004 Midterm (Nov 4) Instructor: Jeff Edmonds Family Name: Given Name: Student #: Email: Section to which to return the midterm (circle one): A: TR 17:30, C: TR 11:30 Problem 1: (18 marks) Problem 2: (4 marks) Problem 3: (6 marks) Problem 4: (8 marks) Problem 5: (20 marks) Problem 6: (10 marks) Problem 7: (21 marks) Problem 8: (13 marks) Total ( 100 marks) This test is closed book and lasts 90 minutes. 0.9 minutes per mark. You may not use any electronic/mechanical computation devices. There are 7 pages including the cover page. Keep your answers short and clear. 1 1. 2 9 = 18 marks: Compute the solution and tell which rules that you use. (a) n i =0 3 i i 8 = ( Type of sum: (b) n i =0 300 i 2 log 9 i + 7 i 3 log 2 i + 16 = ( Type of sum: (c) n i =0 n j =0 i 2 j 3 = ( (d) 7 2 3 n 5 = 3 ( n 5 ) True False (e) What is the formal definition of f ( n ) = n (1) ? (f) n 2- 100 n o ( n 2 ) True False (g) If T ( n ) = 8 T ( n 4 ) + ( n ). Then T ( n ) = ( (h) The solution of the recurrence T ( n ) = 5 T ( n 5 ) + n 2 log( n ) is T ( n ) = ( (i) If T ( n ) = 8 T ( n- 5). Then T ( n...
View Full Document

This note was uploaded on 12/11/2010 for the course CSE CSE 3101 taught by Professor A during the Winter '10 term at York University.

Page1 / 7

MT-W05 - York University COSC 3101 Fall 2004 Midterm (Nov...

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