Exam2Review - c. Traversals d. Definitions (height, etc.)...

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

View Full Document Right Arrow Icon
Exam #2 Review: Computer Science I Topics Covered I. Summations II. Order Notation “Problems” III. Analyzing Run Time of Code Segments IV. Recurrence Relations a. Iteration technique (again) b. Master Theorem V. Stacks a. Linked List Implementation b. Array Implementation (static and dynamic) c. Converting Infix Expressions to Postfix d. Evaluating Postfix Expressions VI. Queues a. Linked List Implementation b. Array Implementation (static and dynamic) VII. Binary Trees
Background image of page 1

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

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

Unformatted text preview: c. Traversals d. Definitions (height, etc.) e. Search Trees f. Search Function g. Insert Function h. Delete Function i. Tracing How to Study 1) Go over the class notes 2) Go over the last assignments 3) Go over the recitation exercises 4) Read the relevant portions of the book Exam Format 1) Multiple Choice 25 questions (4 points each) What to Bring 1) #2 Pencil 2) Two pages of notes 3) Raspberry Scantron...
View Full Document

Page1 / 3

Exam2Review - c. Traversals d. Definitions (height, etc.)...

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

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