Midterm Solutions Winter 2010

First-page document preview for Midterm Solutions Winter 2010 in COE 428: Engineering Algorithms and Data Structures at Toronto Metropolitan University (TMU). Inspect the first page below or request the complete PDF study document for free.

Independent study archive Learn more

Materials are uploaded by users for self-study purposes. PwnHero is an independent platform, not affiliated with, sponsored by, or endorsed by any university or institution.

University Toronto Metropolitan University (TMU) Course COE 428: Engineering Algorithms and Data Structures

Format Midterm Exam

Year 2010

First page preview of Midterm Solutions Winter 2010 for Engineering Algorithms and Data Structures at Toronto Metropolitan University (TMU)

Access Full Study Resource

You are viewing page 1 of Midterm Solutions Winter 2010 for COE 428: Engineering Algorithms and Data Structures at Toronto Metropolitan University (TMU). Request the complete multi-page PDF document directly via PwnHero or our student community channels.

University: Toronto Metropolitan University (TMU)
Course: COE 428: Engineering Algorithms and Data Structures
Resource Type: Midterm Exam
Academic Period: 2010
Last Verified: 2026-11-09

Request Full Document ← Back to COE 428: Engineering Algorithms and Data Structures Catalog

Page 1 Key Topics & Excerpt

🔍 Text Transcript

First page excerpt for quick study reference. Complete formulas, diagrams, and subsequent pages are available in the full document.

PwnHero Q1: 45 Seconds Q2: n i i n lg 0 ) (lg Lower Bound: d = ½ Upper Bound: d= 1 Q3: False True False False True True False False True True Q4: a) aaAbBA Balanced b) aaabbBABAA Error: Not-Balance c) abBbaABABa Error: Not-Balance Q5: Lower Bound Guess: T (n) ≥ cn (log7 n + 1) = Ω (n lgn) Upper Bound Guess: T (n) ≤ O (n lgn) T (n) = Θ (n lgn) PwnHero.com