Design-by-Contract (DbC) Readings: OOSC2 Chapter 11 EECS3311 A: Software Design Winter 2020 CHEN-WEI WANG What This Course Is About for your design suffices. ● Focus is design ○ Architecture: (many) inter-related modules ○ Specification: precise (functional) interface of each module ● For this course, having a prototypical, working implementation ● A later refinement into more […]
Design Pattern: Iterator EECS3311 A & E: Software Design Fall 2020 CHEN-WEI WANG What are design patterns? ● Solutions to recurring problems that arise when software is being developed within a particular context. ○ Heuristics for structuring your code so that it can be systematically maintained and extended. ○ Caveat : A pattern is only
程序代写代做代考 data structure Design Pattern: Iterator Read More »
Recursion EECS2030: Advanced Object Oriented Programming Fall 2017 CHEN-WEI WANG Recursion: Principle ● is useful in expressing solutions to problems that can be defined: ○ Base Cases: Small problem instances immediately solvable. ○ Recursive Cases: Large problem instances not immediately solvable. Solve by reusing solution(s) to strictly smaller problem instances. ● Similar idea learnt in
程序代写代做代考 data structure Java C html Haskell Recursion Read More »
Wrap-Up EECS3311: Software Design Fall 2017 CHEN-WEI WANG What You Learned Design Principles: X Abstraction [ contracts, architecture, math models ] Think above the code level X Information Hiding X Single Choice Principle X Open-Closed Principle X Uniform Access Principle Design Patterns: X Singleton X Iterator X State X Composite X Visitor X Observer X
程序代写代做代考 data structure Java graph Wrap-Up Read More »
Design-by-Contract (DbC) Readings: OOSC2 Chapter 11 EECS3311 A: Software Design Fall 2019 CHEN-WEI WANG Motivation: Catching Defects – When? ● To minimize development costs , minimize software defects. ● Software Development Cycle: Requirements → Design → Implementation → Release Q. Design or Implementation Phase? Catch defects as early as possible . ∵ The cost of
Wrap-Up EECS2030 B: Advanced Object Oriented Programming Fall 2018 CHEN-WEI WANG What You Learned (2) ● Object-Oriented Programming in Java ○ classes, attributes, encapsulation, objects, reference data types 3 of 8 ○ methods: constructors, accessors, mutators, helper ○ dot notation, context objects ○ aliasing ○ inheritance: ● codereuse ● expectations ● staticvs.dynamictypes ● rulesofsubstitutions ●
程序代写代做代考 data structure junit algorithm Java html Wrap-Up Read More »
Asymptotic Analysis of Algorithms EECS2030 B: Advanced Object Oriented Programming Fall 2019 CHEN-WEI WANG Measuring “Goodness” of an Algorithm 1. Correctness : ○ Does the algorithm produce the expected output? ○ Use JUnit to ensure this. 2. Efficiency: ○ Time Complexity: processor time required to complete ○ Space Complexity: memory space required to store data
Chapter 1 The Story Of Bridging ‘Challenge-and-response’ is a formula describing the free play of forces that provokes new departures in individual and social life. An effective challenge stimulates men to creative action . . . — Arnold Toynbee This set of notes is organized around a description of the history of bridges. This chapter
Wrap-Up EECS2030: Advanced Object Oriented Programming Fall 2017 CHEN-WEI WANG What You Learned (1) Procedural Programming in Java X Utilities classes X Recursion (implementation, running time, correctness) Data Structures X Arrays X Maps and Hash Tables X Singly-Linked Lists X Stacks and Queues X Binary Trees 2 of 8 What You Learned (2) Object-Oriented Programming
程序代写代做代考 data structure junit algorithm Java html Wrap-Up Read More »
Asymptotic Analysis of Algorithms EECS2030 B: Advanced Object Oriented Programming Fall 2018 CHEN-WEI WANG Algorithm and Data Structure ● A ○ A systematic way to store and organize data in order to facilitate access and modifications ○ Never suitable for all purposes: it is important to know its strengths and limitations ● A well-specified computational