{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Data Structures

Data Structures - CSSE 250 Data Structures Exam I Fall 2006...

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

View Full Document Right Arrow Icon
CSSE 250 Data Structures Exam I, Fall 2006 NAME:______________________ SCORE:________________________ Note: 40 points in total. Please be reminded that both sides on the paper may have questions. Part I: Multiple Choices [12 pts with 2 pts each] (1) Suppose T is a binary tree with 14 nodes. What is the minimum possible height of T ? A. 0 B. 3 C. 4 D. 5 (2) Select the one FALSE statement about binary trees: A. Every binary tree has at least one node. B. Every non-empty tree has exactly one root node. C. Every node has at most two children. D. Every non-root node has exactly one parent. (3) Given the BST below. Suppose we remove node 11, what node can be used to replace it? 8 / \ A. 6 B. 10 C. 40 D. 14 4 11 / \ / \ 2 6 10 40 / / 9 30 (4) Suppose that the foo class does not have an overloaded assignment operator. What happens when an assignment a = b ; is given for two foo objects? A. The default assignment operator is used B. The copy constructor is used C. Compiler error D. Run-time error
Background image of page 1

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

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

{[ snackBarMessage ]}

Page1 / 4

Data Structures - CSSE 250 Data Structures Exam I Fall 2006...

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

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