EECS 233 Programming Assignment #1
100 points
Due February 13, 2014 (23:59:59 EST)
In last HW, you specified a generic PhoneBook class, presumably using either an array or a linked list to store the
i
EECS 233 Programming Assignment #1
100 points
Due Thursday, Sept. 26, 2013 (23:59:59 EST)
For this and other programming assignments, it is helpful if you write out (as in hand-written) a
design and t
EXAM 2
Lecture 14: Hashing
Vocab
- Key: unique attribute of object
- Index: position of object in array
- Unsorted arrays: indexes independent of keys; searching is dumb and inefficient
- Sorted array
EECS 233: Introduction to
Algorithms & Data Structures
Fall 2014
Course Information
Instructor
Dr. Michael Lewicki
Associate Professor
Electrical Engineering and Computer Science Dept.
Case Western Re
EECS 233 / Summer 2006 Homework 1c Design Document Benjamin Horstman The assignment was to implement an integer data array of size exactly 9. I used eclipse & java compiler compliance level 5.0. I imp
EECS 233 Programming Assignment #1
100 points
Due February 14, 2013 (23:59:59 EST)
In last HW, you specified a generic PhoneBook class, presumably using either an array or a linked list to store the
i
EECS 233 Written Assignment #3
1. Let f1(n), f2(n), g1(n) and g2(n) be positive functions. Prove from the definition of big-O that if f1(n) =
O(g1(n) and f2(n) = O(g2(n) then f1(n) * f2(n) = O(g1(n)*g
EECS 233 Written Assignment #2
Akshaya Annavajhala
Due Feb 21, 2008 (midnight, 23:59:59) 1. (a) Let Node p refer to an element in a list. Write a helper method that swaps p and the subsequent element
EECS 233 Written Assignment #4
Due April, 25 (23:59:59 EST)
The following problems are from either textbook. 1. What is the running time of quicksort for:
(a) Sorted input (2 points) Depends on pivot
EECS 233 Introduction to Algorithms and Data Structures
Fall 2014, Written Assignment 1 (W1)
Due: Thursday September 11 in class (or by 1:15 pm if submitted electronically)
Total Points: 70 + 12 extra
EECS 233: Introduction to
Algorithms & Data Structures
Fall 2014
Course Information
Instructor
Dr. Michael Lewicki
Associate Professor
Electrical Engineering and Computer Science Dept.
Case Western Re
EECS 233 Written Assignment #4
Due April, 30 1:15pm
Please submit electronically (scanning hand-written work if needed) to blackboard.
NO SUNSET PERIOD: ASSIGNMENTS NOT ACCEPED ONCE SOLUTIONS ARE
POST
EECS 233 Written Assignment #3
1. Let c1 and n1 be the constants in the big-O definition for f1(n) = O(g1(n) , and c2 and n2 be these
constants for f2(n) = O(g2(n). The constants cm = max(c1, c2) and
EECS 233 Written Assignment #4
1.
What is the running time of quicksort for:
(a) Sorted input (2 points)
(b) Reverse-ordered input (2 points)
Solution:
For both (a) and (b), it is O(N log N) because t
EECS 233 Written Assignment #4
!
!
!
1.
!
2.
!
3.
!
!
!
Due Tuesday, Dec 3 at 1:15 pm
15 points + 5 extra credit
What is the running time of quicksort (with the middle element of the input array used
Chapter 2
Probability
2.1 Introduction
Probability refers to the study of
randomness and uncertainty.
In this chapter, some fundamental
terminologies and rules of probability
will be introduced.
2.2 P
Exercise 4 Solution
Chapter 4 Economic Efficiency, Government Price Setting, and Taxes
4.1 Consumer Surplus and Producer Surplus
1) The difference between the highest price a consumer is willing to pa
EECS 233
Introduction to Data
Structures
MichaelRabinovich
WelcometoEECS233
AnintroductoryCScourseincomputerscience.
Primaryobjective:
Anintroductiontovariousmethodsoforganizinglargeamountsof
data
EECS 233
1. Hashing: separate chaining
2. Hashing: linear probing
3. Hashing: quadratic probing
4. Hashing: double hashing
5.
Comments About String Hashing
Not required (hard to do examples by hand)
EECS 233: Introduction to Data Structures
Instructor: Dr. Chris Fietkiewicz
Email: Use TA email address listed on the Blackboard gradecenter
Instructor Office Hours: Immediately after lectures and by
More Linked List Operations
EECS233
SanityCheck
head
f
o
x
null
classStringNodecfw_
privatecharch;
privateStringNodenext;
ImplementsList?
publicclassLLStringcfw_
privateStringNodehead;
privateinttheS
Traversal of a Binary Tree
By Chris Fietkiewicz
Traversal Types
Pre-order
In-order
Post-order
Key point: Data structure is always the same!
Example
root
Animal kingdom
Chordata
human
Invertebrates
pig
EECS 233
1. Stacks (Ch 3)
2. Queues (Ch 3)
3. Return Exams
4.
Stacks
Textbook: The fact that most modern machines have stack
operations as part of the instruction set enforces the idea that the
stack
EECS 233
HW 4
1. Consider a connected undirected graph with N nodes.
a. What is the smallest possible number of edges in a connected graph with N nodes?
Prove that such a graph has to be acyclic.
Smal
EECS 233
HW3
1. F(n) = O(g(n)+c) is true for monotonically increasing functions, but for monotonically
NON increasing functions, it is not necessarily true. If a function is not increasing. If c
and f