Not too easy. Not too difficult.
Saelee is an amazing professor who is able to clearly explain complex concepts with easy. The class discuss many of the data structures and algorithms that are essential to understanding of the field of Computer Science as a whole. The class is pretty intensive covering content on simple data structures such as lists to more complex data structures such as Balance Binary Trees. This is why taking the class with Saelee helps a lot in retaining the most you can from this class.
Queues were a very fun concept that we discussed in this class. Basically queues are data structure that imitate the behavior of a line. New data enters through the back of the line and old data leaves from the front. The underlining concept behind queues is FIFO or first in first out, meaning that the first data to come in is the first to be let out. This kind of data structure is used in printers to process printing jobs.
Hours per week:
Advice for students:
In order to succeed in this course you have to make sure you go to all the classes. This is because some of the concept are hard to grasp without a visual or audio aid to help in explaining them.