exam2-review - Types of Questions: 1) Writing and/or...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Exam Topics 1) Recursion 2) Sorting: Quick Sort 3) Linked Lists (Main operations and different implementations) 4) Stacks 5) Lab material How to study: 1. Look at the lecture notes. 2. Solve the questions in the old exam. 3. Review all of the programs assigned in class. 4. Skim over the text, looking for basic algorithmic ideas.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Types of Questions: 1) Writing and/or tracing recursive functions. 2) Tracing sorting algorithms. 3) Writing and/or tracing functions to manipulate linked lists. 4) Stacks: infix to postfix conversion, postfix evaluation, and tracing operations. Also different implementations of stacks. 5) Summations...
View Full Document

Ask a homework question - tutors are online