exam2Answers - CSE 331 Section 1 Analysis Exam 2 answers...

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

View Full Document Right Arrow Icon
CSE 331 Section 1 Exam 2 answers and analysis Analysis The good news is that the class average went up from 71.5 for exam1 to 75.0 for this exam and that several students improved even 10 to 20 points. The bad news is that some students declined from exam1. Given that the material is harder in exam2, those who stayed the same or better have made good progress. grade range below 50 50-59 60-69 70-79 80-89 90 and up number 1 3 11 13 13 4 The exam was designed with different types of questions -- recall, proofs, examples of algorithms, and design; also short answer versus written. All of these types of responses will be needed in the graduate's career. Students should keep in mind that proofs and definitions are needed to understand and to create requirements/specs and to properly test programs. Answers 1) O(N^2) is the number of edges in a complete graph with N vertices. The exact number is N take 2, or N(N-1)/(1*2). 2) O(2^N) The number of leaf nodes is 2^N if N is the height of the tree, so the
Background image of page 1

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

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

Page1 / 2

exam2Answers - CSE 331 Section 1 Analysis Exam 2 answers...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online