Week 9

Impression of Week 8:

     I spent a large majority of week 8 focusing on finishing the second computer programming assignment with my group, to the detriment of my health, our other courses and the content covered within lecture. Thankfully, the content for this week was rather simple to grasp, although my understanding could be insufficient depending on the mark I receive for the last midterm we wrote.

     Week 8 lecture and lab content covered linked lists which is a linear sequence of nodes with corresponding attributes front (pointing to the beginning of the list), back (pointing to the end of the list) and size (the size of the linked list). Each node within the list contains its own value along with a reference to the next node within the sequence. Therefore a linked list class can represent either an empty list (represented as None) or a node with corresponding data that references a linked list. This recursive data structure allows us to walk through the list until a certain condition has been met in order to find, insert or remove elements of the list without disturbing its entire structure. Slicing can also be used to target specific sections of the list however, we very briefly skimmed over this method in class.