Not too easy. Not too difficult.
This class covers a majority of everything involving data concepts. From pointers to linked lists to binary trees. Also, algorithms for searching/sorting trees were covered as well.
Understanding and having that moment of clarity as how pointers work with relations to linked lists and data in general was the best moment of this course!
Hours per week:
Advice for students:
Start early on projects given for the class. Running into issues or not knowing where to get started will just be harder the closer the deadline gets. This way you have more time to ask your professor questions and be able to refine your projects that are due.