FinalExam102 - • Programming questions – Lists, Stacks,...

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

View Full Document Right Arrow Icon
Final Exam Thursday, May 6 th 4:00 to 5:50 PM in CIWW room 109 (Warren Weaver Hall)
Background image of page 1

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

View Full DocumentRight Arrow Icon
Material Covered Linked Lists Stacks Queues Trees Expression Trees Binary Search Tree No AVL trees Heap B-trees Huffman coding
Background image of page 2
Material Covered (cont) Sorts Selection Insertion Bubble Merge Quick No Heap (only binary heap) Hashing Separate Chaining Linear probing No quadratic probing or double hashing
Background image of page 3

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

View Full DocumentRight Arrow Icon
Types of Questions
Background image of page 4
Background image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: • Programming questions – Lists, Stacks, Queues – Binary Search Tree • No programming AVL trees – No Heap – No Sort Types of Questions (cont) • Show results of operations – Items from programming plus • B Tree • Huffman Coding • Hashing • Sort • Heap • Short answer – Everything listed in programming and "show results" plus • Big Oh • No Java Collections...
View Full Document

This note was uploaded on 05/06/2010 for the course COMPUTER S 101 taught by Professor Sanaodeh during the Spring '08 term at NYU.

Page1 / 5

FinalExam102 - • Programming questions – Lists, Stacks,...

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

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