CS 200 Midterm: CS 200 CSU F07Midterm2

36 views7 pages
15 Feb 2019
School
Course
Professor

Document Summary

100: generics/programming [10 points, [4 points] why is it important to create a tostring method in a new data structure implementation, [6 points] spot the bugs in the following code. Underline each problem and suggest a fix for it. Make clear which problem is being fixed by which modification. Integer first = morenums. get(0): trees [35 points, [7 points] circle t or f for true or false for the following statements. T f a preorder traversal of a binary search tree produces a lexicographic ordering of the vertices. T f a full (rosen"s definition) 3-ary tree with 49 vertices has 32 leaves. T f a full (either definition) binary tree with 64 leaves has 63 internal vertices. T f a preorder traversal of a heap produces a lexicographic ordering of the vertices. T f a binary tree with 256 vertices has a maximum height of 8. T f a balanced tree is a complete tree: [15 points] programming.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers

Related Documents