Documents Found!
As seen in
Less Work, Better Grades
Join
Course Hero
Access
best resources
Ace
your classes
Ace your courses with Course Hero!

Submit your homework question or assignment here:
352 Tutors are online
 
*  Attach Assignment (optional):
 
Study Smarter, Score Higher
 
Document Content (unformatted)
Course Hero has millions of student submitted documents similar to the one below including study guides, homework solutions, papers, exam answer keys and textbook solutions.
ri cs1.5 va e Ja ent in Gnen a po av Com J ey K A 432 C MS C C pts once Ge ralizing C ction C s ne olle lasse Using Ge rics with othe Java 1.5 Fe ne r ature s I nte gration of Ge rics with Pre ne vious Re ase le s Use built ge ric classe r ne s 2 What AreGe rics? ne ne r s Ge rics abstract ove Type lasse rface and Me s thods can be C s, Inte Param te d by Type e rize s ne ase adability and typesafe ty Ge rics provideincre d re 3 Java Ge ric Program ing ne m ct Java has class Obje upe ct s S rtypeof all obje type orphism " This allows "subtypepolym an ration on class T to any subclass S<: T C apply ope m s Java 1.0 1.4 do not havete plate e orphism No param tric polym r st ficie Many conside this thebigge de ncy of Java m s t at Java typesyste doe not le you che an rtypeto subtype C cast fromsupe ast cke e C is che d at run tim 4 Exam ge ric construct: S ple ne tack tacks possiblefor any typeof obje ct S For any typet, can havetypestack_of_t rations push, pop work for any type Ope ++, ne I n C would writege ric stack class template <type t> class Stack { private: t data; Stack<t> * next; public: void push (t* x) { ... } t* pop ( ) { ... } }; What can wedo in Java? 5 S pleExam Using I nte im ple rface s inte rfaceList<E> { void add(E x); I te rator<E> ite rator(); } inte rfaceIte rator<E> { E ne xt(); boole hasNe an xt(); } 6 What Ge rics AreNot ne ne m s Ge rics arenot te plate ++, ne clarations are UnlikeC ge ric de che d pile e Type cke at com tim ne pile Ge rics arecom d onceand for all ne xpose to use d r Ge ric sourcecodenot e No bloat Thetypeche cking with Java 1.5 Ge rics ne change theway oneprogram s s (as thene fe slide show) xt w s 7 Java 1.0 class S tack { void push(Obje o) { ... } ct Obje pop() { ... } ct ...} S tring s = "He llo"; S tack st = ne S w tack(); ... st.push(s); ... s = (S tring) st.pop(); vs Ge rics ne class S tack<A> { void push(A a) { ... } A pop() { ... } ...} S tring s = "He llo"; S tack<S tring> st = ne S w tack<S tring>(); st.push(s); ... s = st.pop(); 8 Java ge rics aretypeche d ne cke ne ay rations on obje of a param te cts e r A ge ric class m useope type ple ue Exam : PriorityQue <T> ... if x.le ss(y) the ... n Two possiblesolutions ++: e rations can bere solve d C Link and se if all ope ck pile ne Java: Typeche and com ge rics w/o linking quire program e to giveinform s mr ation about typeparam te e r This re ple ue xte Exam : PriorityQue <T e nds ...> 9 How to UseGe rics ne List<I nte r> xs = ne Linke ge w dList<I nte r>(); ge xs.add(ne I nte r(0)); w ge I nte r x = xs.ite ge rator.ne xt(); C parewith om List xs = ne Linke w dList(); xs.add(ne I nte r(0)); w ge I nte r x = (I nte r)xs.ite ge ge rator.ne xt(); 10 C ction C Exam olle lass ple HashMap<I ntge Double hm= r, > ne HashMap<I ntge Double (); w r, > // NoteAuto-boxing from15. hm (1,2.0); .put doublecoe = hm t(1); ff .ge 11 List Usage Without Ge rics : ne List ys = ne Linke w dList(); ys.add("ze ro"); List yss; yss = ne Linke w dList(); yss.add(ys); S tring y = (S tring) ((List)yss.ite rator().ne xt()).ite rator().ne xt(); // Evil run-tim e e rror I nte r z = (I nte r)ys.ite ge ge rator().ne xt(); 12 List Usage With Ge rics : ne List<S tring> ys = ne Linke w dList<S tring>(); ys.add("ze ro"); List<List<S tring>> yss; yss = ne Linke w dList<List<S tring>>(); yss.add(ys); S tring y = yss.ite rator().ne xt().ite rator().ne xt(); // C pile ee m be r! om -tim rror uch tte I nte r z = ys.ite ge rator().ne xt(); 13 List I m m ntation w/o Ge rics ple e ne class Linke dList im m nts List { ple e I nne C r lass prote d class Node{ cte Re e be the ? m m r se Object elt; Nodene xt; Node (Object elt){e = e ne = null;} lt ; xt } prote d Nodeh, t; cte public Linke dList() {h = ne Node w (null); t = h;} public void add(Object elt){ t.ne = ne Node lt); xt w (e t = t.ne xt; } } 14 List I m m ntation With Ge rics ple e ne class Linke dList<E >im m nts List<E> ple e prote d class Node{ cte Ee lt; Nodene xt; Node e lt = e ne = null;} } (E lt){e ; xt prote d Nodeh, t; cte public Linke dList() {h = ne Node w (null); t = h;} public void add(E e lt){ t.ne = ne Node lt); xt w (e t = t.ne xt; } // ... } 15 Re theI nte call rator I nte rface class Linke dList<E >im m nts List<E> ple e // ... public Ite rator<E> ite rator(){ re turn ne I te w rator<E>(){ prote d Nodep = h.ne cte xt; public boole hasNe an xt(){re turn p != null;} public E ne xt(){ E e= p.e lt; p = p.ne xt; re turn e ; } } } } Anonym I nne C ous r lass (se S e wing scribblee ple xam ) 16 Me thods C BeGe ric Also an ne inte rfaceFunction<A,B>{ B value arg);} (A inte rfaceNtuple <T> { <S Ntuple > m > <S ap(Function<T,S f); > } Ntuple nte r> nti = ....; <I ge nti.m (ne Function<I nte r, I nte r> { ap w ge ge I nte r value nte r i) { ge (I ge re turn ne I nte r(i.intValue w ge ()*2); } } ); 17 Exam : Ge rics and I nhe nce ple ne rite What dange lurk he ? rs re 1 conside this codew/o Ge rics r ne 18 C onside what happe (and whe r ns n) List xs = ne Linke w dList(); xs.add(ne Byte w (0)); Bytex = (Byte ListUtilitie ax(xs); ) s.m List ys = ne Linke w dList(); ys.add(ne Boole w an(false )); // Evil run-tim e e rror Boole y = (Boole ListUtilitie ax(ys); an an) s.m 19 With Ge rics WeGe C pileC ck ne t om he List<Byte xs = ne Linke > w dList<Byte >(); xs.add(ne Byte w (0)); Bytex = ListUtilitie ax(xs); s.m List<Boole ys = ne Linke an> w dList<Boole an>(); ys.add(ne Boole w an(false )); // C pile ee om -tim rror Boole y = ListUtilitie ax(ys); an s.m 20 Ge rics and I nhe nce ne rite upposeyou want to re strict thetypeparam te to e ss e r xpre S som re striction e on thetypeparam te e r s This can bedonewith a notion of subtype ubtype (we s akly construe can bee sse in Java using d) xpre d S inhe nce rite o bination to com inhe ncewith bine rite S it's a natural com ge rics ne w xam s A fe e ple follow 21 Priority Que Exam ue ple inte rfaceC parable > { boole le om <I an ssThan(I ); } class PriorityQue <T e nds C parable ue xte om <T>> { T que [ ] ; ... ue void inse t) { rt(T ... if ( t.le ssThan(que [i]) ) ... ue } T re ove { ... } m () S to bebounde aid d ... } 22 Bounde Param te d Type d e rize s xte be e The<E e nds Num r> syntax m ans that thetype param te of MathBox m bea subclass of theNum r e r ust be class e r d Wesay that thetypeparam te is bounde new MathBox<Integer>(5); //Legal new MathBox<Double>(32.1); //Legal new MathBox<String>("No good!");//Illegal 23 Bounde Param te d Type d e rize s e rize e r rve . I nsidea param te d class, thetypeparam te se s as a valid type S thefollowing is valid. o public class OuterClass<T> { private class InnerClass<E extends T> { ... } ... } Syntax note: The <A extends B> syntax is valid even if B is an interface. 24 Bounde Param te d Type d e rize s ultipleinhe ritancein theformof im m nting m ple e ultiple Java allows m inte rface so m s, ultiplebounds m bene ssary to spe a type ay ce cify param te Thefollowing syntax is use the e r. d n: <T extends A & B & C & ...> Example interface A {...} interface B {...} class MultiBounds<T extends A & B> { ... } 25 Anothe e ple... r xam inte rfaceLe ssAndEqual<I > { boole le an ssThan(I); boole e an qual(I); } class Re lations<Ce nds Le xte ssAndEqual<C e nds C{ >> xte boole gre rThan(Re an ate lations<C a) { > re turn a.le ssThan(this); } boole gre rEqual(Re an ate lations<C> a) { re turn gre rThan(a) | | e ate qual(a); } boole notEqual(Re an lations<C> a) { ... } boole le an ssEqual(Re lations<C> a) { ... } ... } 26 Generics and Subtyping t gal? Is thefollowing codesnippe le List<S tring> ls = ne ArrayList<S w tring>(); //1 List<Obje lo = ls; //2 ct> Line1 is ce rtainly le What about line2? I s a List of S gal. trings a List of Obje ct. Intuitiveanswe for m is "sure But wait! r ost !". Thefollowing code(if line2 we allowe would atte pt to assign an Obje to a re d) m ct S tring! lo.add(ne Obje w ct()); // 3 S tring s = ls.ge // 4: t(0); For all type P and C (i.eCis a subtypeof P) s S ubtype ) !=> S (P,C ubtype ne (Ge ric<P>,Ge ric<C>) ne 27 S ubclassing a ge ric class ne im java.awt.C port olor; public class S ubclass e nds MyC xte lass<C olor> { // You alm always ne d to supply a constructor ost e public S ubclass(C color) { olor supe r(color); } public static void m ain(S tring[ ] args) { S ubclass sc = ne S w ubclass(C olor.GREEN); sc.print(C olor.WHI TE); } 28 } Wildcards onside theproble of writing codethat prints out all the r m C e m nts in a colle le e ction be 1.5. fore void printC ction(C ction c) { olle olle I te rator i = c.ite rator(); for (k = 0; k < c.size k++) { S m (); yste .out.println(i.ne xt()); } } 29 1st Na veTry w/ Ge rics ne void printC ction(C ction<Obje c) { olle olle ct> for (Obje e: c) { ct S m yste .out.println(e ); } } m w rsion is m le use than theold uch ss ful Theproble is that this ne ve one . d ction as a param te e r, Theold codecould becalle with any kind of colle w s olle ct>, Thene codeonly take C ction<Obje which, as isnot a supe rtype all kinds of colle of ctions! 30 C ct way UseWildcards orre S what is thesupe o rtypeof all kinds of colle ctions? Pronounce "colle d ction of unknown" and de d C ction<?>, note olle A colle ction whosee m nt typem le e atche anything. s I t's calle a wildcard typefor obvious re d asons. void printC ction(C ction<?> c) { olle olle for (Obje e: c) { ct S m yste .out.println(e ); } } 31 Using Wildcards Again public class C nsus { e public static void addRe gistry(Map<S tring, ? extends Pe rson> re gistry) { ...} }... // Assum Drive area subtypeof Pe ing rs rson Map<S tring, Drive allDrive = ...; r> rs C nsus.addRe e gistry(allDrive rs); 32 I m m nting Ge rics ple e ne rasure Typee om -tim cking use ge rics s ne C pile etypeche om r lim s ne rasing the m C pile e inate ge rics by e om ct, rt C pileList<T> to List, T to Obje inse casts ne m s" "Ge rics arenot te plate ne clarations aretype cke che d Ge ric de ne pile Ge rics arecom d onceand for all No instantiation No "codebloat" ... 33 How Do Ge rics Affe My C ? ne ct ode y xce ! The don't e pt for theway you'll code ne ne s; Non-ge ric codecan usege ric librarie xam , xisting codewill run unchange with d For e ple e ge ric C ction library ne olle 34 Erasure rase ne e ation at Erasuree s all ge rics typeargum nt inform com pilation phase . tring> is conve d to List rte E.g. List<S tring t = stringlist.ite rator().ne is conve d to S xt() rte tring t = E.g. S (S tring) stringlist.ite rator().ne xt() pile ap ve As part of its translation, a com r will m e ry param te d typeto its typee e rize rasure . 35 Erasure tring> l1 = ne ArrayList<S w tring>(); List <S ge w ge List<I nte r> l2 = ne ArrayList<I nte r>(); yste .out.println(l1.ge lass() == tC S m l2.ge lass()); tC 36 Que stions? Wrap Up Re re s fe nce du/class/cs242/slide s/2004/java.ppt http://www.stanford.e ne m , Adding Ge rics to theJavaTM Program ing Language Gilad Bracha.Talk TS -2733Java OneC re 2001 onfe nce ne m . Gilad Bracha. Ge rics in theJava Program ing Language http://java.sun.com /1.5/pdf/ge rics-tutorial.pdf /j2se ne bstuff/Me taProgram ingJavaKalvot.pdf m http://www.cs.tut.fi/~kk/we .it/corsi/lsp1/dispe /LS nse P1-S ucci-3.ppt http://www.lips.dist.unige 38
Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more. Course Hero has millions of course related materials that will enable you to learn better, faster and get an A in all your courses.
Below is a small sample set of documents:

UMBC >> USERPAGES >> 432 (Fall, 2009)
Reflection Mini-Lectures CMSC 432 Mini-Lectures Mini-Lectures Introduction Run Time Class ID Java Reflection 101 Other Java Reflection Classes and Code What Can Be Done With Java Reflection? 2 More Mini-Lectures Using Reflection with Design P...
UMBC >> OLD >> 432 (Fall, 2009)
UMBC Introduction to Applets CMSC 432 Shon Vick 1 UMBC Basic Ideas An applet is a kind of mini-application designed to be run by a browser Applets do not have a main() method, or other single entry point from which the program starts run...
UMBC >> USERPAGES >> 345 (Fall, 2009)
UMBC ObjectOriented Application Frameworks Frameworks CMSC 345 1 UMBC Motivation Computing power and network bandwidth have greatly increased but complex software remains expensive and errorprone to develop Much of the cost and effort stem...
UMBC >> USERPAGES >> 345 (Fall, 2009)
UMBC Visitor De Patte sign rn CMS 431 C S Vick hon UMBC Why Visitors? rn ong any sign rns TheVisitor patte is oneam m de patte aim d at m e aking obje ct-orie d syste s m fle nte m ore xible sse rn Theissueaddre d by theVisitor patte is the m ...
UMBC >> USERPAGES >> 101 (Fall, 2009)
Harris/English 101 Anika Fraser ASSIGNMENT POINTS Process paper =100 Nuclear memories paper =100 Midterm paper =100 Cause/effect = 100 Final inclass essay = 100 Research paper proposal = 25 Annotated bibliography = 25 Outline = 25 Rough draft = 25 ...
UMBC >> CSEE >> 0101 (Fall, 2009)
Lists in Lisp and Scheme Lists in Lisp and Scheme Lists are Lisp\'s fundamental data structures. However, it is not the only data structure. There are arrays, characters, strings, etc. Common Lisp has moved on from being merely a LISt Processo...
UMBC >> CSEE >> 0101 (Fall, 2009)
Scheme in Scheme Why implement Scheme in Scheme Implementing a language is aa good way to learn more about programming languages Interpreters are easier to implement than compilers, in genera Scheme is a simple language, but also a powerful one ...
Arizona >> DLIST >> 1116 (Fall, 2009)
Examining the Role of Website Information in Facilitating Different Citizen-Government Relationships: A Case Study of State Chronic Wasting Disease Websites Kristin R. Eschenfelder, School of Library and Information Studies, University of WisconsinMa...
Arizona >> DLIST >> 2457 (Fall, 2009)
Chronological Organization of Schools and Styles of Art Rebecca Green Assistant Editor, Dewey Decimal Classification Subject tags: chronological organization, art styles, Dewey Decimal Classification Abstract Chronological arrangement plays an import...
Arizona >> DLIST >> 1115 (Fall, 2009)
1 What Information Should State Wildlife Agencies Provide on Their CWD Websites? Kristin R. Eschenfelder School of Library & Information Studies University of Wisconsin-Madison State wildlife agencies have little guidance about what Chronic Wasting D...
UMBC >> CSEE >> 331 (Fall, 2009)
Scheme in Scheme Why implement Scheme in Scheme Implementing a language is aa good way to learn more about programming languages Interpreters are easier to implement than compilers, in genera Scheme is a simple language, but also a powerful one ...
UMBC >> CSEE >> 104 (Spring, 2001)
The switch Statement Topics Multiple Selection switch Statement char Data Type and getchar( ) EOF constant Reading Section 4.7, 4.12 Multiple Selection So far, we have only seen binary selection. if ( age >= 18 ) { printf(\"Vote!\ \") ; } } e...
UMBC >> CSEE >> 104 (Spring, 2001)
Machine Architecture and Number Systems Some material in this presentation is borrowed form Adrian Ilie From The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Aug-31-2005 CMSC 104, LECT-02 1 Topics Major Computer Components Bits, Bytes, and...
UMBC >> CSEE >> 104 (Spring, 2001)
Algorithms, Part 3 of 3 Topics In-Class Project: The Box In-Class Project:Drawing a Rectagle Reading None Writing Algorithms from Scratch Given a problem statement, we are going to write the corresponding generic algorithm for the solution. W...
UMBC >> CSEE >> 104 (Spring, 2001)
Variables in C Topics Naming Variables Declaring Variables Using Variables The Assignment Statement Reading Sections 2.3 - 2.4 Program Structure in C EACH complete C program is composed of: Comment statements Pre-processor directi...
UMBC >> CSEE >> 104 (Spring, 2001)
Algorithms, Part 1 of 3 Topics Definition of an Algorithm Algorithm Examples Syntax versus Semantics Reading Sections 3.1 - 3.3 Problem Solving Problem solving is the process of transforming the description of a problem into the solution of t...
UMBC >> CSEE >> 104 (Spring, 2001)
Arrays, Part 2 of 2 Topics Array Names Hold Address How Indexing Works Call by Value Call by Reference Grades Program Revised Reading Section 5.8 Sections 6.1 - 6.5 Array Declarations Revisited int numbers[5] ; This declaration sets as...
UMBC >> CSEE >> 104 (Spring, 2001)
Functions, Part 3 of 3 Topics: Coding Practice In-Class Project: The Box In-Class Project: Drawing a Rectangle Reading: None 1 Coding Practice Let\'s take the algorithms that we developed in \"Algorithms, Part 3 of 3\", modularize them, and ...
UMBC >> CSEE >> 104 (Spring, 2001)
Relational and Logical Operators Topics Relational Operators and Expressions The if Statement The if-else Statement Nesting of if-else Statements Logical Operators and Expressions Truth Tables Reading Sections 2.6, 4.10, 4.11 Relational Op...
UMBC >> CSEE >> 202 (Spring, 2001)
CMSC 202 Classes and Objects Static Methods Topics Static methods Static instance variables Math class Wrapper classes Character class 2 Static Methods So far, class methods required a calling object in order to be invoked. Date birthday = n...
UMBC >> CSEE >> 202 (Spring, 2001)
CMSC 202 Classes and Objects Object Creation Topics Constructors Memory allocation stack heap garbage collection Class variables Class parameters null Anonymous objects 2 July 21, 2008 Object Creation Objects are created by using the o...
UMBC >> CSEE >> 202 (Spring, 2001)
CMSC 202 Interfaces Classes and Methods When a class defines its methods as public, it describes how the class user interacts with the method. These public methods form the class\' interface . An abstract class contains one or more methods with...
UMBC >> CSEE >> 202 (Spring, 2001)
CMSC 202 Polymorphism Topics Binding (early and late) Upcasting and downcasting Extensibility The final modifier with methods classes Aug 6, 2007 2 Introduction to Polymorphism Object-oriented programming mechanisms Encapsulation -...
UMBC >> CSEE >> 202 (Spring, 2001)
CMSC 202 Classes and Objects Reusing Classes with Composition Topics Composition Person class example Class invariant Copy constructor Privacy leaks July 21, 2008 2 Code Reuse Effective software development relies on reusing existing code ...
UMBC >> CSEE >> 202 (Spring, 2001)
CMSC 202 Java Primer A Sample Java Application July 24, 2007 Copyright 2008 Pearson AddisonWesley 2 Java Program Basics All programs start with main System.out.println( ) outputs to the screen and advances to the next line July 24, 2007 ...
UMBC >> CSEE >> 345 (Fall, 2009)
Ethics in Software Engineering The source of questions marked with [Pfleeger] is Software Engineering, by Shari Pfleeger, 1998. CMSC 345, Fall 2002 1 ethic - 1. A system of moral standards or values. 2. A particular moral standard or value. ethica...
UMBC >> CSEE >> 345 (Fall, 2009)
CMSC 345 Requirements Expression Definition and specification x Requirements definition Customer-oriented descriptions of the system\'s functions and constraints on its operation Precise and detailed descriptions of the system\'s functionality and c...
UMBC >> CSEE >> 345 (Fall, 2009)
Function-oriented Design x Design with functional units which transform inputs to outputs Ian Sommerville 1995 Software Engineering, 5th edition. Chapter 15 Slide 1 Topics Covered x x x Data flow design Structural decomposition Detailed design ...
UMBC >> CSEE >> 104 (Spring, 2001)
Algorithms, Part 2 of 3 Topics Problem Solving Examples Pseudocode Control Structures 1 Problem Solving Decode this sentence: Pdeo eo pda yknnayp wjosan. We have just come up with a specific solution to a problem. Can this solution be gen...
UMBC >> CSEE >> 104 (Spring, 2001)
Operating Systems and Using Linux Topics What is an Operating System? Linux Overview Frequently Used Linux Commands 1 What is an Operating System? A computer program that: Controls how the CPU, memory and I/O devices work together to execute p...
UMBC >> CSEE >> 104 (Spring, 2001)
Variables and Arithmetic Operators in JavaScript Wednesday October 17th and Thursday October 18th 1 Topics Naming Variables Declaring Variables Using Variables The Assignment Statement Arithmetic Operators 2 What Are Variables in JavaScript...
UMBC >> CSEE >> 104 (Spring, 2001)
Introduction to Web & HTML Wednesday October 3rd and Thursday October 4th Topics Web Terminology HTML What is HTML Parts of an HTML Document HTML Tags Required Common 2 Internet vs. WWW Most people use the two terms interchangeably ...
UMBC >> CSEE >> 0101 (Fall, 2009)
Chapter 4 Lexical analysis CMSC 331, Some material 1998 by Addison Wesley Longman, Inc. 1 Scanner Main task: identify tokens Basic building blocks of programs E.g. keywords, identifiers, numbers, punctuation marks Desk calculator language exa...
UMBC >> CSEE >> 0101 (Fall, 2009)
Introduction to ML CS 331 Principles of Programming Languages revised Spring 2003 Features of ML A pure functional language serious programs can be written without using variables Widely accepted reasonable performance (claimed) can be compile...
UMBC >> CSEE >> 0101 (Fall, 2009)
Chapter 4 Bottom Up Parsing CMSC 331, Some material 1998 by Addison Wesley Longman, Inc. 1 Right Sentential Forms Recall the definition of a derivation and a rightmost derivation. Each of the lines is a (right) sentential form The parsing probl...
UMBC >> CSEE >> 0101 (Fall, 2009)
CS 331, Principles of Programming Languages Introduction Objectives To introduce several different paradigms of programming But isn\'t one language pretty much like another? No! To gain experience with these paradigms by using example programming...
UMBC >> CSEE >> 0101 (Fall, 2009)
Data Types Chapter 6 CMSC331. Some material 1998 by Addison Wesley Longman, Inc. 1 Introductio This chapter introduces the concept of a data type n and discusses: Characteristics of the common primitive data types Character strings User-defined...
UMBC >> CSEE >> 104 (Spring, 2001)
A crash course in HTML www.techrepublic.com Introduction So you\'re in charge of setting up a Web site. While this might sound simple, it isn\'t quite as easy as it seems. In order to create a Web page, you need to know how to write...
UMBC >> CSEE >> 104 (Spring, 2001)
main( ) instructions( ) readSalary( ) outOfRange( ) newSalary( ) ...
UMBC >> CSEE >> 621 (Fall, 2009)
Ch 9 Distributed Filesystem Reading Assignment Summary due 10/18 (CODA paper) Goals Network Transparency you don\'t know where in the system the file is. High Availability Users should get same filesystem irrespective of location, and maintena...
UMBC >> CSEE >> 631 (Fall, 2009)
History COBOL (Common Business Oriented Language) was one of the earliest high-level programming languages. COBOL was first proposed in 1959 by the Conference on Data Systems Languages (CODASYL). Three ANSI standards for COBOL have been produced i...
UMBC >> CSEE >> 631 (Fall, 2009)
Python K. Naik, M. Raju and S. Bhatkar December 3, 2002 CMSC 631 1 Outline Introduction Installation and Use Distinct Features Python basics A detail example Comparison with other languages Areas of application References 2 Introdu...
UMBC >> CSEE >> 631 (Fall, 2009)
Eiffel Programming Language By David Riley and Jason Thorpe December 3, 2002 Eiffel Overview Object-oriented Motivation designed to avoid some of the pitfalls of older OOP languages Introduced in 1985 Created by Bertrand Meyer Developed by his...
UMBC >> CSEE >> 631 (Fall, 2009)
Slides to accompany Ullman\'s Functional Programming with ML CS 631 Principles of Programming Languages Features of ML A pure functional language serious programs can be written without using variables Widely accepted reasonable performance (cla...
UMBC >> CSEE >> 631 (Fall, 2009)
Eiffel Sorting Example class ARRAY_EXAMPLE; creation start feature store:ARRAY[INTEGER]; fill_array is - fills array with integers entered from keyboard local index:INTEGER; do from index = store.lower -1 until index = store.upper loop index := index...
Arizona >> OPTICS >> 523 (Spring, 2009)
How to transfer files from Zemax into Solidworks 1) Open a Zemax file. Ex) Petzval.zmx 2) Export the data with IGES format. IGES - Initial Graphics Exchange Specification 3) Open a Solidworks window. 4) Load the IGES file which was exported from Zema...
Arizona >> FILES >> 523 (Spring, 2009)
How to transfer files from Zemax into Solidworks 1) Open a Zemax file. Ex) Petzval.zmx 2) Export the data with IGES format. IGES - Initial Graphics Exchange Specification 3) Open a Solidworks window. 4) Load the IGES file which was exported from Zema...
UMBC >> CSEE >> 693 (Fall, 2009)
Before 1995, I wrote guidelines for the course CMSC-693: Master\'s Research Project (whose official name was unfortunately \"Research and Writing Skills\"). In addition, I created a simple sample Latex template for the title and abstract pages. By re...
San Jose State >> CMPE >> 202 (Spring, 2008)
http:/www.coma.nu/ Peter Rittgen, PhD School of Business and Informatics University College of Bors S-501 90 Bors Sweden Phone: +46 761 074 103 Fax: +46 33 435 4007 Email: peter.rittgen@hb.se URL: http:/www.adm.hb.se/~PRI/ The collaborative nature of...
UMBC >> CSEE >> 411 (Spring, 2009)
B-SqLogic 3 46 44 0 121 15 Generic Library22 8 4 1 0 111 69 26 0 0.000000 0 0 0 0.000000 0 0 0 1 255 0 0 1 0.000000 0 0 0 0.000000 0 0 0 1 255 0 0 2 0.000000 0 0 0 0.000000 0 0 0 1 255 0 0 3 0.000000 0 0 0 0.000000 0 0 0 1 255 0 0 4 0.000000 ...
UMBC >> CSEE >> 341 (Fall, 1999)
CMSC-341 Fall 2008 Staff Office Hours Instructors: Mr. Edelman\'s office is ITE-218 Mr. Hood\'s office is ITE-211 Mr. Bergeron\'s office is Dr. Oates\' office is ITE-336 TAs: Krishnamurthy Koduvayur\'s office is ITE-240 Vivek Relan\'s...
Wisconsin >> CS >> 736 (Spring, 2000)
Oldest Newest Dat a Dat a Dat a Dat a at Figur e : point er16oKency of esponding ent ra he ot tM B 350file. file. a and a Ser vicee : t hesequent ial r eadsof t 350 he Mfile.M list . When an ent r y is accessed t he list node is moved t o t he bac F...
San Jose State >> CMPE >> 202 (Spring, 2008)
Architectural Design Ian Sommerville 2004 Software Engineering, 7th edition. Chapter 11 Slide 1 Objectives q q q q To introduce architectural design and to discuss its importance To explain the architectural design decisions that have to be m...
San Jose State >> CMPE >> 202 (Spring, 2008)
Lecture Slides Lecture 6: Object-Oriented Heuristics-1 Object-Oriented Heuristics-2 Architectural Design Sommerville 2004 Object-Oriented Design Sommerville 2004 User Interface Design - Sommerville 2004 ...
San Jose State >> CMPE >> 202 (Spring, 2008)
Software System Engineering Dr. M.E. Fayad, Professor Computer Engineering Department, Room #283I College of Engineering San Jos State University One Washington Square San Jos, CA 95192-0180 http:/www.engr.sjsu.edu/~fayad M.E. Fayad 1997-2006 SJSU...
San Jose State >> CMPE >> 202 (Spring, 2008)
Software System Engineering Dr. M.E. Fayad, Professor Computer Engineering Department, Room #283I College of Engineering San Jos State University One Washington Square San Jos, CA 95192-0180 http:/www.engr.sjsu.edu/~fayad M.E. Fayad 1996-2006 SJSU...
San Jose State >> CMPE >> 202 (Spring, 2008)
Software Reuse Ian Sommerville 2004 Software Engineering, 7th edition. Chapter 18 Slide 1 Objectives q q q q q To explain the benefits of software reuse and some reuse problems To discuss several different ways to implement software reuse To ...
San Jose State >> CMPE >> 202 (Spring, 2008)
Lecture Slides Lecture 8: Software Testing Sommerville 2004 ...
San Jose State >> CMPE >> 202 (Spring, 2008)
Knowledge Map* of \"Subject/Topic\" Extra Assignment #1 \"Your Name\" Course Subject/Topic\" assigned to you. Domain Name is \"Subject/Topic\": * Identify EBTs and BOs of the \"Subje...
San Jose State >> CMPE >> 202 (Spring, 2008)
CmpE 202 Software Systems Engineering Extra Assignment #2: Due Date: Due Date will be assigned when the extra assignment is offered. Major Tasks: 1. Sign up for a subject/topic with the Instructor 2. Use the AniPattern Template to document Three to ...
San Jose State >> CMPE >> 202 (Spring, 2008)
Software System Engineering Dr. M.E. Fayad, Professor Computer Engineering Department, Room #283I College of Engineering San Jos State University One Washington Square San Jos, CA 95192-0180 http:/www.engr.sjsu.edu/~fayad M.E. Fayad 2000 - 2006 SJ...
St. Mary MD >> CDF >> 001 (Fall, 2009)
File: /server/02/IPIX/DATA/Dartmouth/netcdf/ohgr0013/19931107_160214_starea.cdf % Variables: RF_frequency = 9.39 GHz Pulse_length = 200 nanoseconds PRF = 1000 Hertz Unambig_velo...
San Jose State >> CMPE >> 202 (Spring, 2008)
Software System Engineering Dr. M.E. Fayad, Professor Computer Engineering Department, Room #283I College of Engineering San Jos State University One Washington Square San Jos, CA 95192-0180 http:/www.engr.sjsu.edu/~fayad M.E. Fayad 2000 - 2006 SJ...
St. Mary MD >> CDF >> 001 (Fall, 2009)
File: /server/02/IPIX/DATA/Dartmouth/netcdf/ohgr0013/19931106_003838_surv.cdf % Variables: RF_frequency = 9.39 GHz Pulse_length = 200 nanoseconds PRF = 799.9999 Hertz Unambig_veloci...
St. Mary MD >> CDF >> 001 (Fall, 2009)
File: /server/02/IPIX/DATA/Dartmouth/netcdf/ohgr0013/19931106_153016_surv.cdf % Variables: RF_frequency = 9.39 GHz Pulse_length = 200 nanoseconds PRF = 800 Hertz Unambig_veloci...
St. Mary MD >> CDF >> 001 (Fall, 2009)
File: /server/02/IPIX/DATA/Dartmouth/netcdf/ohgr0013/19931107_133200_surv.cdf % Variables: RF_frequency = 9.39 GHz Pulse_length = 200 nanoseconds PRF = 799.9999 Hertz Unambig_veloci...
San Jose State >> CMPE >> 202 (Spring, 2008)
Software System Engineering Dr. M.E. Fayad, Professor Computer Engineering Department, Room #283I College of Engineering San Jos State University One Washington Square San Jos, CA 95192-0180 http:/www.engr.sjsu.edu/~fayad 1999 2006 M.E. Fayad SJSU...
St. Mary MD >> CDF >> 001 (Fall, 2009)
File: /server/02/IPIX/DATA/Dartmouth/netcdf/ohgr0013/19931109_230442_stare40ns.cdf % Variables: RF_frequency = 9.39 GHz Pulse_length = 40 nanoseconds PRF = 1000 Hertz Unambig_v...
San Jose State >> CMPE >> 202 (Spring, 2008)
Software System Engineering Dr. M.E. Fayad, Professor Computer Engineering Department, Room #283I College of Engineering San Jos State University One Washington Square San Jos, CA 95192-0180 http:/www.engr.sjsu.edu/~fayad M.E. Fayad 2000-2006 SJSU...
St. Mary MD >> CDF >> 251 (Fall, 2009)
File: /server/02/IPIX/DATA/Dartmouth/netcdf/ohgr0020/19931118_035438_stareE0000.cdf % Variables: RF_frequency = 9.442 GHz Pulse_length = 200 nanoseconds PRF = 7250 Hertz Unambig_...
What are you waiting for?