Not too easy. Not too difficult.
I would recommend this course because the material is easy to follow along and the professor is a caring and knowledgeable individual. The material you learn in this course (linked lists, stacks, queues) is quite useful in later courses.
Being able to to use recursion in Java to solve database problems, solidifying my understanding of linked lists and learning new types of linked lists, learned about stacks, queues and hash tables, their implementations in the real world and how to properly code these data types.
Hours per week:
Advice for students:
Need to have a basic understanding of the Java programming language. Knowing how to use recursion and linked lists/nodes is strongly recommended. Depending on the professor teaching this course, there may be no textbook (my course's textbook was optional). If that is the case, the professor may present an online alternative which is free. Wait for the first day of class to determine if a textbook is required. Highly recommend getting comfortable with writing code on paper without a computer since this is the format for the midterm and final exam. Need to know how to code the insertion, deletion, viewing and sorting in linked lists, stacks and queues (stacks and queues don't utilize sorting). The system libraries and classes are given as reference sheets on the midterm and final. Knowledge on O-notation and worst case running times would be an asset.