I’ve been a tutor for this past semester to students taking Introduction to Programming. Many who have come to my session are moving on to Data Structures next semester. They asked if they could have a primer as to what to expect.
I have some resources that I have found helpful both while taking the course and tutoring it in the past. It will take me a little bit to compile a good list of those, but for now, here is a bare-bones list of topics of topics you might expect to see for a data structures course:
– Running time of code segments (Big-O Notation)
– Abstract Data Type (ADT)
– Interfaces (when to use “implements”, cannot instantiate them, what inheritance is)
– Superclass, subclass, method overriding/overloading
– Abstract classes
– Binary Search Trees
– Stacks (and its four methods — push, pop, peek, empty)
– Linked list (single, double, circular)
– Prefix and postfix notation (compare to infix)
– Min/Max Heap
– Hash Tables – Open and closed hashing. How to insert into a hash table given a probe sequence.
– Binary Trees (AVL and Red/BLack)
– AVL Trees – how to construct one, worst case AVL-tree
– Red Black Trees
– B-Trees, especially deletion from one
– Know recursive code and how to trace it
Bear in mind, this is an incomplete list. The topics may be presented in different order as well. The “parts” are how I remember it and might not be accurate.
I’m not sure if I’ll be able to compile a complete list of resources, but here is probably the best one for visualizing data structures: https://www.cs.usfca.edu/~galles/visualization/Algorithms.html
Another one is CodingBat.com/java. This is especially helpful for learning recursive code. I don’t know if any of the other sections would be helpful, but they might be.
Best of luck! It will be tough, but you got it! Even if you know one or two topics from each part, you will have a leg up on learning this material.
From the blog Sam Bryan by and used with permission of the author. All other rights reserved by the author.