Midterm Solutions Spring 2017

First-page document preview for Midterm Solutions Spring 2017 in COMS 3134: Data Structures and Algorithms at Columbia University. 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.

📄 Page 1 Preview
First page preview of Midterm Solutions Spring 2017 for Data Structures and Algorithms at Columbia University

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 COMS3134 Data Structures and Algorithms Spring 2017 Section 1 Midterm Solutions 1. Let k be the height of the perfect binary tree. Base case: if k = 0, N = 1. So the hypothesis holds true for our base case. Hypothesis: assume the claim holds true for some k0. Inductive step: we need to…

Related COMS Courses at Columbia University