COSC2325 Exam 3 Study Guide

COSC2325 Exam 3 Study Guide - recursive algorithms (big-O...

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

View Full Document Right Arrow Icon
Exam #3 Study Guide 1. Know basic methods for a Stack class - push, pop, peek, clear, isEmpty, size, and a default constructor 2. Know some simple swing components - such as a JButton, JLabel, JTextField, JFrame, basics of how to use, how they work. Know what a Thread is and what is required to create a new Thread. 3. Given a recursive function description, code it in Java. Draw a recursive descent tree from a call to a recursive method. Know basic idea of solving for 8 queens. Know cost of
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online