Wright CEG 860 - CEG 860 Classes (22 pages)

Previewing pages 1, 2, 21, 22 of 22 page document View the full content.
View Full Document

CEG 860 Classes



Previewing pages 1, 2, 21, 22 of actual document.

View the full content.
View Full Document
View Full Document

CEG 860 Classes

15 views

Other


Pages:
22
School:
Wright State University
Course:
Ceg 860 - Object-Oriented Programming
Object-Oriented Programming Documents

Unformatted text preview:

Classes ceg860 Prasad L7Class 1 Class Instance Object Static structure vs Run time structure Analogy a statue Lincoln Memorial Class Abstract Data Type A class is an ADT equipped with a possibly partial implementation Class Metaclass A metaclass is a class whose instances are classes Useful for manipulating class representations at run time by interpreters browsers etc ceg860 Prasad L7Class 2 Abstraction Equivalence Relations Computability Recursive vs Non recursive Semantics Behavioral Equivalence Resource independent interchangeability Performance aspect irrelevant for correctness E g Groups Fields Sorting UNIX etc Complexity Algorithms Time and Space requirements Big Oh Worst case Analysis NP hard vs Polynomial time ceg860 Prasad L7Class 3 Specification of Data Types Motivation Precise and unambiguous description Sound and complete description Avoids over specification Spec Flexible enough to accommodate all possible implementations Impl Constraining enough to exploit representation details for efficiency ceg860 Prasad L7Class 4 Specification of Data Types Details Type Values Operations Specify Syntax Semantics Signature of Ops Meaning of Ops Model based Description in terms of standard primitive data types ceg860 Prasad L7Class Axiomatic Algebraic Give axioms satisfied by the operations 5 ADT Table symbol table directory empty Table update Key x Info x Table Table lookUp Key x Table nfo lookUp K empty error Use of variable Alternative Use of Preconditions lookUp K update Ki I T if K Ki then I else lookUp K T last update overrides the others ceg860 Prasad L7Class 6 Implementations Array based LinearList based Tree based Binary Search Trees AVL Trees B Trees etc HashTable based These exhibit a common Table behavior but differ in performance aspects Correctness of a client program is assured even when the implementation is changed ceg860 Prasad L7Class 7 Java approach to metaclass benefits To make available certain features to all classes Java defines a root class



View Full Document

Access the best Study Guides, Lecture Notes and Practice Exams

Loading Unlocking...
Login

Join to view CEG 860 Classes and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view CEG 860 Classes and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?