COMS W3134 Lecture Notes - Lecture 8: Polish Notation, Operand, Doubly Linked List
4 Oct 2016
School
Department
Course
Professor
Document Summary
Announcements: hw1 grades up soon, tas group up to grade each problem. Issues about score on certain problems, email the 2/3 tas who graded that problem. In grades section on canvas only see grade not comments, comments will be uploaded to the assignment section: detailed rubrics will be posted afterwards, hw2 due date pushed to 10/10. Lifo (last in first out), adding and removing elements from a list structure: push/pop/peek, doubly linked list, don"t care what side of list adding/removing from because same. In hw2 asked to implement a stack using linked list (composition) Singly linked list, would have to pick front. Linked list based stack: popping an empty stack can be referred to under-flowing a stack. If using an array, it is possible to overflow a stack (run out of space: stack with array. Idx 6: need an instance variable that stores index of the first free element of the array.
