(date posted)
(23 Jan) Welcome to Data Structures.
(23 Jan) Intro/Complexity Power Point Slides
(25 Jan) List with Max Length Power Point Slides
(30 Jan) List with No Size Limit Power Point Slides
(1 Feb) Stack Power Point Slides
(6 Feb) Queue Power Point Slides
(8 Feb) Binary Search Tree Power Point Slides
(13 Feb) AVL Tree Power Point Slides
(20 Feb) Heap Power Point Slides
(22 Feb) Hash Power Point Slides
(27 Feb) Python -> Java One
(27 Feb) The test will be next week on 5 Mar. It will be closed book, closed notes, and no computer/calculator. It will cover all the abstract data types that we discussed in class (List, Stack, Queue, BST, AVL Tree, Heap, Hash, and Graph), including Big O running time, plus recursion. If you worked at your homework, paid attention and understood what was going on in class, and spent significant time reviewing the material, you should do fine. In addition, if you have been keeping a Data Structures Notebook, that would help as well.
(27 Feb)
Programming assignment grading guidelines:
1. If it's on time and working, start with 10 points.
2. If it's late one class and working, start with 8. Then 7, with 6 after that.
3. If it doesn't work, start with 3.
4. From the starting point, take off points for:
a. Comments at the top should include the name of the program/class definition, a brief description, the programmers' names, and date.
b. Minimal comments in the body are OK as long as it's clear what the methods, etc are doing.
c. Should have good method/variable names and if they do, it will probably be clear what's going on in the body.
d. Proper naming: classes capital first letter, variables and methods lower case first letter, constants all caps.
e. No variables listed as instance variables except ones needed for the objects. Any others, such as temp, should be local variables.
f. Indentation consistent and reasonable.
g. Spacing between methods consistent and reasonable.
h. Placement of curly brackets consistent and reasonable.
Typically, these should not result in more than a full grade drop (such as from 10 to 9), although possibly in some cases.
(29 Feb) Python -> Java Two
(7 Mar) The optional Data Structures Notebooks are due at 11:30am on 15 May. The main part of the notebook should be to give an explanation for each of the data structures covered (List, Stack, Queue, BST, AVL Tree, Heap, Hash, and Graph) along with their methods. You should put together a notebook that would explain to anybody who has taken COM110 all about the data structures that we have covered. In your explanation of each of the data structures covered, make sure you discuss alternative implementations and compare them with respect to performance. In addition, think of an possible application for each data structure.
The writing of this notebook is to be done individually, but you are free to discuss it with others (students, teaching assistants, professor) as desired. It is also fine if you look up information in books. However, the use of online services (such as ChatGPT and Google) copy and past text or figures is not permissable. The notebook is to be typed, except figures can be hand drawn (do not copy and paste from my power point slides). It is to be emailed to me before the end of finals. I'm assuming that everyone will have these all correct since the answers were covered in class and you can converse with others concerning them. The point is to force you to make sure that the data structures concepts are clear in your mind and give you a short summary of data structures for future use.
(16 Apr) I plan to introduce the Final Project on 23 Apr. This will be a team project with 3 or 4 students per team. In very rare cases, I will allow teams of 5 students. If you have a preference for who you would like to have on your team, send me an email by 19 Apr. You can send me subteams with 2 students and I will combine subteams to make a full team.
(25 Apr) Serialization Power Point Slides
Example Java file:
Example.java