FINAL REVIEW CSC 1052
Review - CSC 1052 Some topics to review for Test Two:
This is not all of what will be covered. All slides on Queues, Stack, Linked Lists, all
homework, important methods in all of above - be able to describe. Be able to
implement, Add, Delete, Find in all of them plus do pseudocode for other methods
e.g. expand capacity in queue.
You should be able to write clear, concise descriptions of the following:
1. Any algorithm that we have discussed in class for Stacks or LinkedList, &
Queues:
1) Linked List - the Big O for the ADT and important methods – insert ,
remove, removeFirst, removeTail
2) Stacks - the Big O for the ADT and important methods – insert , delete . For
queues, just know Big O for add and remove
3) Stacks & Queues - array and linked list implementations
2. Review quiz, homeworks and slides and readings from text.
3. Be able to write important methods as we did in Stack & Queue homework for
adding and removing elements from a stack.
4. Be able to redraw linked lists without some items or insert new ones into the list
at any location or remove.
5. What does the acronym LIFO stand for? What does the acronym FIFO stand
for? Be able to describe a real world ( NOT A STACK OF PLATES and not from
slides) example of using a stack, queue - must be substantial.
6. When would using a LinkedList be superior to using an array in a stack or
queue.
7. Be able to describe the current TigerLily use of a stack - what it does and why it
does it so well. (Read the description in your handout and figure it out)
8. Be able to convert an infix expression to postfix and then solve the postfix
expression.
9. How to implement a Queue and how to expandCapacity for a Circular
ArrayQueue
8. A basic understanding of the Big O for all of the ADT” to date ArrayList,
LinkedList, Stack, Queue. This includes:
FINAL REVIEW CSC 1052
a. the Big O implementation for add, delete, and find(if applicable) methods
b. the linear(array) implementation for each ADT including supporting
methods, if applicable
c. This requires an understanding of which implementation - array or linked
list – provides the most efficient implementation for the queue or stack