Assignment #1
Due Date: Saturday, September 5 at 11:59pm
Submit:
eLearning
Late Policy: -10 points per hour late
Instructions: This is an individual assignment.
work.
Answers should be your own
Chapter 1
10 points
1) Suppose your calculator only did base
Chapter 2
Algorithm Analysis
Fall 2015
2015 by Greg Ozbirn, UT-Dallas, for use with
Data Structures book by Mark Allen Weiss
1
Algorithms
An algorithm is a set of steps to solve a
problem.
More than one algorithm may be written to
solve the same proble
Chapter 4
Trees
Fall 2015
2015 by Greg Ozbirn, UT-Dallas, for use with
Data Structures book by Mark Allen Weiss
1
Trees
Linked lists require O(N) time to traverse the list.
For large lists this is prohibitive.
A simple data structure called a tree can
Chapter 5
Hashing
Fall 2015
2015 by Greg Ozbirn, UT-Dallas, for use with
Data Structures book by Mark Allen Weiss
1
Hashing
Hashing is a technique that can perform
inserts, deletions, and finds in constant
average time.
It does not support some of the
Chapter 3
Lists, Stacks and Queues
Fall 2015
2015 by Greg Ozbirn, UT-Dallas, for use with Data
Structures book by Mark Allen Weiss
1
Abstract Data Types
An abstract data type is a set of objects with a set
of operations.
It is a mathematical abstractio
Red-Black Trees
Fall 2015
2015 by Greg Ozbirn, UT-Dallas, based on
Data Structures and Algorithms in Java by
Goodrich and Tamassia
Red-Black Trees
A Red-Black tree is a binary search tree with
these traits:
Every node is either red or black.
The root
Chapter 1
Introduction
Fall 2015
2015 by Greg Ozbirn, UT-Dallas, for use with Data
Structures book by Mark Allen Weiss
1
Objectives
This chapter reviews some pre-requisite
material we will need.
It is assumed you have already learned
much of this mater
Assignment #4
Due Dates: Monday, October 12 at 11:59pm
Submit:
eLearning
Late Policy:
-10 points per hour late
Instructions: This is an individual assignment.
work.
Answers should be your own
Chapter 4
6 points
1. Tree traversals.
Give the sequence of let
Assignment #3
Due Dates: Wednesday, September 23 at 11:59pm
Submit:
eLearning
Late Policy:
-10 points per hour late
Instructions: This is an individual assignment.
work.
Answers should be your own
Chapter 3
10 points
1. What are some advantages of a linke
Assignment #2
Due Date: Monday, September 14 at 11:59pm
Submit:
eLearning
Late Policy:
-10 points per hour late
Instructions: This is an individual assignment.
work.
Answers should be your own
Chapter 2
6 pts
1. In the definition of Big-O, why is the "for