Theory Homework 1
Honor Data Structures and Algorithms in JAVA (3137)
Shlomo Hershkop
Department of Computer Science
Columbia University
Fall 2013
Out: Monday Sept 16
Due: Monday, Sept 30 (11 pm).
Goal: review recursion, running time, analysis, linked lis
Programming Homework 1
Data Structures and Algorithms in JAVA (3137)
Shlomo Hershkop
Department of Computer Science
Columbia University
Fall 2013
Out: Tue Sept 17, 2013
Due: Sunday, Oct 6 (11pm).
Programming Assignment 1 (100 points)
We will programming a
1. The has table is: 1, 3, 3, 9, 4, 9, 9
a) Separate chaining hash:
1
3
3
4
9
9
9
b) Open addressing hash table using linear probing
cfw_1 , 3, 9, 4, 3, 9, 9
Each new element is added on to the array at the end using a linear distance from
the last filled
3137 Honors Data Structures and
Algorithms
Shlomo Hershkop
Lecture 1
Sept 4, 2013
1
Overview
Today:
Basic overview of the course and objectives
Programming Environment Basics
DS/Java Intro
Goal:
Thing are much easier if everyone knows why they are here,
a
Programming Homework 3 (120 points)
Data Structures and Algorithms in Java
Shlomo Hershkop
Department of Computer Science
Columbia University
Fall 2013
START EARLYDue Dec 9
!
This assignment can be done in a group of 2, but you need to sketch out EXACTLY
Programming HW 2!
Fall 2013!
Shlomo Hershkop!
3137 Honors Data Structure!
!
!
Out: Oct 30!
Due: Nov 26th (roughly)!
!
Programming Section (50 points)
This project involves the use of a hash table to identify a unknown program whether it is
malicious or no
Theory Homework 2
Data Structures and Algorithms in JAVA
Shlomo Hershkop
Department of Computer Science
Columbia University
Fall 2013
Out: Oct 9 2013
Due: Sunday Oct 20, 11pm.
Goal: review stack, list, and trees
1. Suppose you have a linked list with head
Theory Homework 3
Data Structures and Algorithms in JAVA
Shlomo Hershkop
Department of Computer Science
Columbia University
Fall 2013
Out: Oct 9 2013
Due: Oct 27 11pm
1) (12 points) Given input cfw_3471, 3123, 1673, 1499, 3444, 6979, 8989 and a hash
funct
Theory Homework 4
3137 - Data Structures and Algorithms in JAVA
Shlomo Hershkop
Department of Computer Science
Columbia University
Fall 2013
!
Out: Oct 30, 2013
Due: Nov 14, midnight.
!
!
1) Columbia Airlines wants to give first-class upgrades to their to
Theory Homework 5
3137 - Data Structures and Algorithms in JAVA
Shlomo Hershkop
Department of Computer Science
Columbia University
Fall 2013
!
Out: Oct 30, 2013
Due: Nov 21, midnight.
!
!
!
!
1) (10) Show the execution of Dijkstra's algorithm from node A
Sample MIDTERM
Honor Data Structures and Algorithms in JAVA
Shlomo Hershkop
Department of Computer Science
Columbia University
Fall 2013
1
DEFINE. Use minimum complete sentences.
1) AVL Property
2) Big O
3) Theta bound
4) ADT
5) Queue
6) Tail Recursion
2
Data Structures Review
Session 1
Ramakrishna, PhD student.
Grading Assistant for this course
CS 307 Fundamentals of Computer Science
1
Java exercises
For the following program, what are the possible
outputs ?
Public class WhatIsX
cfw_
public static void
Priority Queues
Priority queue
A stack is first in, last out
A queue is first in, first out
A priority queue is least-first-out
The smallest element is the first one removed
(You could also define a largest-first-out priority queue)
The definition of smal
Priority Queues
Priority queue
A stack is first in, last out
A queue is first in, first out
A priority queue is least-first-out
The smallest element is the first one removed
(You could also define a largest-first-out priority queue)
The definition of smal
3137 Data Structures and Algorithms
Spring 2013 - Shlomo Hershkop
Lecture 7
Feb 12
Announcements
Reading:
Stacks/Queues
Trees
BST
AVl Trees
2
From last time
stacks
operations
runtimes
queues
operations
runtimes
Applications
math checker
reverse polish not
Homework 4
3137 - Data Structures and Algorithms in JAVA
Shlomo Hershkop
Department of Computer Science
Columbia University
Fall 2012
Out: Dec 5, 2012
Due: Dec 12, midnight.
Theory
1) (10) Show the execution of Dijkstra's algorithm from node A in the foll
Programming Homework 2 (60 points)
Data Structures and Algorithms in JAVA
Shlomo Hershkop
Department of Computer Science
Columbia University
Fall 2012
Out Sept 30, 2012
Due: Oct 29, 2012 midnight.
This project
3134 Data Structures
Spring 2013 - Shlomo Hershkop
Lecture 9
Feb 19
Announcements
Reading:
expression trees
BST
AVl Trees
Next time:
Splay trees
Btree
Huffman trees
2
Goal
be comfortable with binary search tree
algorithms
start to think about avl trees
wi
Engineering E2261: Introduction to Accounting and Finance
COLUMBIA UNIVERSITY, School of Engineering and Applied Science
Homework 0.75 Readings and More
0. Understanding the E2261Policies:
Please read these E2261 Policies, then sign below and return this
Theory Homework 1
Data Structures in JAVA (3134)
Shlomo Hershkop
Department of Computer Science
Columbia University
Spring 2013
Out: Thursday Jan 31, 2013
Due: Thursday , Feb 14 (11 pm).
Goal: review recursion, running time, analysis, linked lists.
Theory
3134 Data Structures and Algorithms
Shlomo Hershkop
Lecture 1
Jan 22, 2013
Overview
Today:
Basic overview of the course and objectives
Programming Environment Basics
DS/Java Intro
Goal:
Thing are much easier if everyone knows why they are here,
and what w
3137 Data Structures and Algorithms
Spring 2013 - Shlomo Hershkop
Lecture 2
Jan 24
Announcements
The TAs will be running a recitation on
java review end of next week
if you have questions, please let me
know.I cant teach if you cant ask
questions
Today
Ba
3137 Data Structures and Algorithms
Spring 2013 - Shlomo Hershkop
Lecture 3
Jan 29
Today
Java Wrapup
Exceptions
Interface
iterator
Recursion
Runtime analysis
Reading:
Chapter 1.3 recursion
Chapter 2 Algorithm Analysis
From Last Time
Spam Engine System
pos
3137 Data Structures and Algorithms
Spring 2013 - Shlomo Hershkop
Jan 31
Lecture 4
Announcements
Recursive programming
ADT
Lists
Reading:
Runtime topics in Chapter 2
Chapter 3.1 - 3.3
2
from last time
we discussed a simplied model to
estimate running time
3137 Data Structures and Algorithms
Spring 2013 - Shlomo Hershkop
Lecture 5
Feb 5
Announcements
Make sure you are making progress on hw
Please come speak to myself/TA if you need a
push
will x posted slides with background issue
Reading:
3.3 - 3.5 (list i
3137 Data Structures and Algorithms
Spring 2013 - Shlomo Hershkop
Lecture 6
Feb 7
Announcements
Reading subjects:
Stacks (3.6) Queues (3.7)
Next Week:
Trees (4.1,4.2,4.3.1)
2
Topics
Wrap up LL
example with iterators
Queues
circular arrays
Stack Applicatio
Practice FINAL
Data Structures in Java
Shlomo Hershkop
Department of Computer Science
Columbia University
Fall 2012
Topics which will be covered on the final:
Hashtables, Bloom Filters, Disjointed Sets, Shell sort, Merge Sort, Quick Sort, Graphs
DS, Short