This preview shows page 1. Sign up to view the full content.
Unformatted text preview: recursive algorithms (big-O analysis) 4. Convert infix expressions into postfix format. For example: y = ( a * b ) + ( c / d) y = a + b * c - d / f + (f-g) 5. Compute or evaluate Postfix Expressions - for example: 3 6 2 - * value = 12 5 3 2 1 + * 4 - + value = 10 6. Review order of magnitude problems from previous exams....
View Full Document
This note was uploaded on 04/29/2008 for the course COSC 2325 taught by Professor Baker during the Spring '08 term at St. Edwards.
- Spring '08