Homework 1
Hyeon Jin Cho
Data Structures
Due date: 2/5/15
Review Question 9 on page 55: What is the advantage of specifying an abstract data type as
an interface instead of just going ahead and implementing it
Sci HULL (m ,2)!
600.226 Data Structures
Fall 2011 -- Written Assignment 1
Due Thursday, 9/22 in class
70 points
The>main purpose of this assignment is to get experience wih the analysis tools we will be using throughout
the semester. You only need to
Syllabus - 605.202 Data Structures
Instructor Contact
Farhana Shah
Scott Cost
Eleanor Chlan
[email protected].edu
202-316-4545
[email protected]
443-778-1137
[email protected]
443-955-9319
In general, we will respond to emails within 24 hours. Your emails should contai
600.226, Data Structures
Summer 2015
Lecture 7
Lecturer: Anwar Mamat
Disclaimer: These notes may be distributed outside this class only with the permission of the Instructor.
7.1
Doubly Linked List
Like a singly linked list, a doubly-linked list is a link
600.226, Data Structures
Summer 2015
Lecture 4
Lecturer: Anwar Mamat
Disclaimer: These notes may be distributed outside this class only with the permission of the Instructor.
4.1
Comparable and Comparator
Listing 1: Date Class
1
2
3
4
5
6
7
8
9
10
11
12
1
600.226, Data Structures
Summer 2015
Lecture 1
Lecturer: Anwar Mamat
Disclaimer: These notes may be distributed outside this class only with the permission of the Instructor.
1.1
Course Introduction
Check the course website for the syllabus and course int
600.226, Data Structures
Summer 2015
Lecture 3
Lecturer: Anwar Mamat
Disclaimer: These notes may be distributed outside this class only with the permission of the Instructor.
3.1
Array Based Collections
Listing 1: Bag Class
1
2
3
4
5
6
7
8
9
10
11
12
13
1
600.226, Data Structures
Summer 2015
Lecture 2
Lecturer: Anwar Mamat
Disclaimer: These notes may be distributed outside this class only with the permission of the Instructor.
2.0.1
Code Examples: Shape Class
In this section, we will introduce abstract cla
600.226, Data Structures
Summer 2015
Lecture 6
Lecturer: Anwar Mamat
Disclaimer: These notes may be distributed outside this class only with the permission of the Instructor.
6.1
Singly Linked List
A linked list is a data structure consisting of a group o
600.226, Data Structures
Summer 2015
Lecture 5
Lecturer: Anwar Mamat
Disclaimer: These notes may be distributed outside this class only with the permission of the Instructor.
As we learned from the previous lecture, the time complexity of contains method
Homework 8
Hyeon Jin Cho
Data Structures
Due Date: 4/30/2015
Review Questions 2, 4 on page 534, and Self Check 2, 3 on page 588
Question 2: Show the AVL tree that would be formed by inserting the month nam
Homework 2
Hyeon Jin Cho
Data Structures
Due Date: 2/12/15
Review Question 5 and 7 on page 144, and the 2 problems in the attached file:
Question 5: If a loop processes n items and n changes from 1024 t
Homework 4 & 5
Hyeon Jin Cho
Data Structures
Due Date: 3/5/2015
Programming Question 5 on page 291, and Review Questions 1, 2, 3 on page 356:
Question 5: As discussed in Chapter 3, a palindrome is a word t
Homework 7
Hyeon Jin Cho
Data Structures
Due Date: 4/16/15
Review Question 4, 6, 7 on page 467
Question 4: For the following array [30, 40, 20, 15, 60, 80, 75, 4, 20] show the new array
after each pass o
Homework 3
Hyeon Jin Cho
Data Structures
Due Date: 2/19/15
Review Question 6 on page 191, and the 2 problems in the attached file:
Question 6: Write a client that removes all negative numbers from a stack
Dijkstras algorithm (shortest path): start from a point and
write down all the possible visits from that point. Choose the
shortest distance point and write down all the possible visits
from that point. Repeat until all the point has the final weight
De
Computational complexity:
a) for (int i = 0; i < n; i+)
for (int j = 0; j < n; j+)
sum+;
O(n^2)
b) for (int i = 0; i < n; i+)
sum+;
for (int j = 0; j < n; j+)
sum+;
O(n)
c) for (int i = 0; i < n; i+)
for (int j = 0; j < n*n; j+)
sum+;
O(n^3)
d) for (in
3/6/17
Recap of Week 5:
lists and trees - more position based data structures
multiple tree implementation approaches
Tree Implementations
Fully recursive
treat each node as the root of its own subtree
implements Position itself
con: tracking size
FT
Algorithms and Data Structures
Lecture Notes for 600.226
D
RA
Peter H. Frohlich
[email protected]
January 29, 2017
FT
RA
D
c 20122017 by Peter H. Frohlich.
Copyright
All rights reserved.
2
FT
Preface
Peter initially wrote these notes on Piazza for the Su
Course Outline
This outline provides an overview of the course and assignments by week. Please remember to check the calendar for
specific due dates.
Module Dates
Title
Readings
Deliverables
Module
0
8/29
9/2
Introduction
Module
1
8/31
9/6
Chapters 6.1
References
Alternative Textbooks
These are former textbooks for the course. These all cover the material, but each book has its own
perspective. They may be helpful if your primary experience lies in a different language than Java or if the
textbook does
605.202 Discussion Rubric
Points
0
1
Relevance/
Understanding
Postings contribute no new
ideas, have minimal depth &
detail. Rehashes or
summarizes others. Unclear
if student grasps topic.
Mostly agrees or asks
questions.
Contributes few new
ideas. Postin
10/8/11 3:50 PM
600.226 Data Structures
Fall 2011 - Written Assignment 3 - ANSWERS
Due Tuesday, 10/4, 2:45pm
25 points
The main purpose of this assignment is to get experience with stacks, queues and deques. Please type up your
answers in a plain text fil
Malvi Hemani
Data Structures
October 8, 2011
For the following tree identify: [14]
the root [1]: A
all the leaves [3]: G, H, E, I, J, K, L, M, N
the height of the tree [1]: 3
the depth of node E [1]: 2
the depth of node O [1]: 2
the height of node C [1]:
10/8/11 3:51 PM
600.226 Data Structures
Fall 2011 - Written Assignment 2
Due Tuesday, 9/27, 2:45pm
44 points total
The main purpose of this assignment is to gain understanding of and experience with containers, iterators and linked lists in the Java API.
11/10/11
w7.html
600.226 Data Structures
Fall 2011 - Written Assignment 7 - SOLUTION
Due Tuesday 11/8, 2:45p
25 points
The main purpose of this assignment is to gain practice with priority queues and heaps (read Chapter 6).
Please type or hand-write your