cmpt225_final_review

cmpt225_final_review - ! 

Info iconThis preview shows page 1. Sign up to view the full content.

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

Unformatted text preview: !  Monday,
April
19,
7‐10pm
in
HCC
1520
 !  Similar
in
style
to
midterm
exam
 !  A
bit
more
than
twice
as
long
as
midterm
 !  See
sample
final
via
email
 !  Final
exam
is
cumulative
 !  Closed‐book,
etc.
 !  More
weight
on
latter
half
 !  Exam
will
cover
all
material
in
assignments
 and
labs
 !  Exam
will
cover
almost
all
material
in
lecture
 slides
 !  Details
of
exceptions
to
follow
 !  Software
development
/
lifecycle
 !  Abstract
Data
Types
 !  Data
Structures
 !  Stacks
 !  Queues
 !  Dynamic
(heap)
versus
Static
(stack)
memory
 !  Array
and
Linked
List
implementations
 !  Object‐oriented
design
principles
 !  Basics
of
C++/Java
classes
 !  NOT
"advanced"
object
oriented
concepts:
inheritance,
 class
hierarchies,
polymorphism,
static/dynamic
binding
 (the
latter
part
of
cmpt225objects)
 !  Pointers
 !  Memory
management
 !  Dangling
pointers
 !  Memory
leaks
 !  Thinking
recursively
 !  Formulating
recursive
solutions
to
problems
 !  Writing
recursive
functions
 !  Efficiency
of
recursive
functions
 !  MergeSort
 !  Methods
for
analyzing
time
efficiency
 !  O‐notation
 !  And
others
 !  Best,
worst,
average
case
 !  Sorting
 !  Insertion
sort
 !  Selection
sort
 !  Quicksort
 !  Definitions
 !  Trees,
perfect
trees,
complete
trees
 !  Tree
traversals
 !  Binary
search
tree
 !  In‐order,
pre‐order,
post‐order
 !  Insertion,
deletion,
search
algorithms
 !  Balanced
trees
 !  Definition
of
red‐black
tree
 !  Properties
of
red‐black
trees
 ▪  No
proofs,
but
you
should
have
intuitive
understanding
 !  Tree
rotations
 !  Red‐black
tree
algorithms
 !  Don’t
need
full
algorithm
in
your
head,
but
you
 should
be
able
to
follow
the
examples
in
the
slides
 !  Hash
tables
 !  Hash
functions
 !  Resolving
collisions
 !  Open
addressing
 ▪  Linear
probing,
quadratic
probing,
double
hashing
 !  Separate
chaining
 !  ADT
priority
queue
 !  Heap
data
structure
 !  Heap
algorithms
 !  Insertion,
removal
 !  BubbleUp
and
BubbleDown
 !  Heap
implementation
using
an
array
 !  Heapsort
 !  Disk
access
versus
memory
access
 !  Algorithms
focus
on
minimizing
disk
accesses
 !  External
sorting
 !  Mergesort
 !  Why
are
other
algorithms
slow?
 !  NOT:
M‐way
trees,
B‐trees
 !  NOT
ON
EXAM
 !  Thanks
for
all
your
hard
work
this
term!
 !  Good
luck
on
Monday’s
exam
 ...
View Full Document

This note was uploaded on 04/17/2010 for the course CMPT 11151 taught by Professor Gregorymori during the Spring '10 term at Simon Fraser.

Ask a homework question - tutors are online