Drawing a Design Diagram using the Business Object Notation (BON) EECS3311 A: Software Design Fall 2019 CHEN-WEI WANG Why a Design Diagram? SOURCE CODE is not an appropriate form for communication. Use a DESIGN DIAGRAM showing selective sets of important: X clusters X classes X architectural relations X features (queries and commands) (i.e., packages) [ […]
程序代写代做代考 database Java C Drawing a Design Diagram Read More »
Exceptions EECS2030 B: Advanced Object Oriented Programming Fall 2019 CHEN-WEI WANG Error Reporting via Consoles: Circles (1) 1 2 3 4 5 6 7 8 9 class Circle { double radius; Circle() { /* radius defaults to 0 */ } void setRadius(double r) { if ( r < 0 ) { System.out.println( "Invalid radius." );
程序代写代做代考 go Java chain C Exceptions Read More »
Generics EECS3311 A: Software Design Fall 2018 CHEN-WEI WANG Motivating Example: A Book of Any Objects class BOOK names: ARRAY[STRING] records: ARRAY[ANY] — Create an empty book make do … end — Add a name-record pair to the book add (name: STRING; record: ANY) do … end — Return the record associated with a given
程序代写代做代考 database Java Generics Read More »
Inheritance Readings: OOSCS2 Chapters 14 – 16 EECS3311 A: Software Design Fall 2019 CHEN-WEI WANG Aspects of Inheritance Code Reuse Substitutability X Polymorphism and Dynamic Binding X Sub-contracting [ compile-time type checks ] [ runtime behaviour checks ] 2 of 62 Why Inheritance: A Motivating Example Problem: A student management system stores data about students.
程序代写代做代考 android compiler IOS C Java Inheritance Readings: OOSCS2 Chapters 14 – 16 Read More »
Syntax of Eiffel: a Brief Overview EECS3311: Software Design Fall 2017 CHEN-WEI WANG Commands, and Queries, and Features ● In a Java class: ○ Attributes: Data ○ Mutators: Methods that change attributes without returning ○ Accessors: Methods that access attribute values and returning ● In an Eiffel class: ○ Everything can be called a feature.
程序代写代做代考 data structure Java Syntax of Eiffel: a Brief Overview Read More »
#I CMPSC 461: Programming Language Concepts Instructor: Danfeng Zhang W369 Westgate Building TAs and LAs Teaching Assistants: • Zeyu Ding (Head TA, dxd437@psu.edu) • Ashish Kumar (azk640@psu.edu) • Madhav Deshpande (mzd574@psu.edu) • Namitha Nambiar (nmn5265@psu.edu) Learning Assistants: • Liang Leo (hql5432@psu.edu) • Jianyu He (jvh6056@psu.edu) Office hours will be announced before next week Course Mode:
Recursion EECS2030 B: Advanced Object Oriented Programming Fall 2018 CHEN-WEI WANG Recursion: Principle ● is useful in expressing solutions to problems that can be defined: Recursion recursively ○ Base Cases: Small problem instances immediately solvable. ○ Recursive Cases: ● Largeprobleminstancesnotimmediatelysolvable. ● Solvebyreusingsolution(s)tostrictlysmallerprobleminstances. ● Similar idea learnt in high school: [ mathematical induction ] ● Recursion
程序代写代做代考 data structure Java C html Haskell Recursion Read More »
Loops EECS2030: Advanced Object Oriented Programming Fall 2017 CHEN-WEI WANG Motivation of Loops • We may want to repeat the similar action(s) for a (bounded) number of times. e.g., Print the “Hello World” message for 100 times e.g., To find out the maximum value in a list of numbers • We may want to repeat
程序代写代做代考 data structure go Java algorithm html Loops Read More »
Monday Jan . 2 2 Lecture 3 h:eaded ¥* t #⇒ ftp.t.IE#Ya*. 5 if – statement branch ¥d#f . ifstatements Ms D ‘t { , 2 if C- ) { 3 (→{ #-) gseay else if ⇒ C- ) { # a if . M¥iff: { e{se . cfc jf cfc ){ .-. { .
程序代写代做代考 Java C Monday Read More »
Design-by-Contract (DbC) Readings: OOSC2 Chapters 6, 7, 8, 11 EECS3311 A & E: Software Design Fall 2020 CHEN-WEI WANG Learning Objectives Upon completing this lecture, you are expected to understand: 1. ( DbC ): Motivation & Terminology 2. Supporting (Java vs. Eiffel): Preconditions, Postconditions, Class Invariants 3. Runtime Assertion Checking of Contracts 2 of 72