{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

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

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

View Full Document Right Arrow Icon
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
Image of page 1

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

View Full Document Right Arrow Icon
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 ) = Θ( 2. 4 marks: Consider the following priority queue implemented as a heap. Consider a reasonable algorithm that changes the prioity of a node. (Its input includes a pointer to the node). Give the resulting heap
Image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern