Koofers

Past Exam for CMSC 132 - OBJECT-ORIENTED PROG II at Maryland (UMD)

Exam Information

Material Type:Mid-Term
Professor:Staff
Class:CMSC 132 - OBJECT-ORIENTED PROG II
Subject:Computer Science
University:University of Maryland
Term:Fall 2006
Keywords:
  • Possible Classes
  • Problem Description
  • Software Development
  • Relationship
  • Initialization
  • Descriptions
  • Design-Build
  • Development
  • Hierarchical
  • Following Problem
Login / Sign Up to View Document
Preview Page 1Preview Page 2Preview Page 3Preview Page 4Preview Page 5Preview Page 6

Sample Document Text

CMSC132 Fall 2006 Midterm #2 – Key 1. (22 pts) Trees, Search Trees, Heaps a. b. c. d. e. f. g. h. i. j. k. Trees are hierarchical data structures A tree node can have multiple children A tree node can have multiple parents A leaf node can have up to 2 children A binary tree node can have up to 2 children A binary tree is balanced if most interior nodes have 2 children A binary tree is degenerate if more than 100 nodes have only 1 child A binary tree is perfect if no node has only 1 child A tree traversal visits every node in the tree Preorder traversals are faster than postorder traversals Breadth-first traversals are slower than depth-first traversals 1 pt each T or F T or F T or F T or F T or F T or F T or F T or F T or F T or F T or F T or F T or F T or F T or F T or F T or F T or F T or F T or F T or F T or F For a binary search tree: l. The value of a node is always greater than the values of its children m. The left child’s value is always smaller than the value of the right child n. The # of steps...

Related Documents

Possible Classes Exam
Possible Classes Exam
Unauthorized Exam
Unauthorized Exam
Alpha Testing Exam
Unauthorized Exam
String Course Exam
Java Statement Exam
Asymptotic Worst-Case Time Exam
Branching Questions Notes
Provided That Exam
Project Delivery Notes
Worth 20 Pts Exam
Aggregation Exam
Design-Build Quiz
Unauthorized Exam
155, "/var/app/current/tmp/"