CSE 214 Lecture Notes - Lecture 1: Addison-Wesley, Backtracking, Big O Notation
28 Nov 2016
School
Department
Course
Professor
Document Summary
Office hours - 12:00 pm - 1:00 pm. Data abstraction and problem solving with java, walls, and mirrors. Policy: up to one week after homework is graded or exam is returned. Special rule : if all grades are above the respective class averages, you"re guaranteed to receive a c or higher in this class. 3. design of solution for each task (algorithim): implementation of a solution (coding, testing and debugging, documentation and maintenance. Specifications of a method( task: short introduction/ summary, description of parameters, preconditions, postconditions or returns (or side effects, exceptions thrown, special notes on usage. Returns the area of the circle with the given radius. Resources (input/output such as a disk i. o) 4 operations? (load a, load b, add, store c) For (x=1; x<=n; x++) c= a + b; Big o expresses this function as a simplified function of n (input size). O (n^2) - a function of n^2.
