Pattern-Oriented Software Design (Fall 2012) Homework #2 (Due: 10/19/2012)
|
|
- Sheryl Bradford
- 6 years ago
- Views:
Transcription
1 Pattern-Oriented Software Design (Fall 2012) Homework #2 (Due: 10/19/2012) 1. Introduction In this homework, we will add new features to ADD. Command pattern will be applied to support redo/undo operations. The text-mode interface will be enhanced for users to delete glyphs. 2. Load activity diagram file In this homework, we will define a standard file format for storing (loading) an activity diagram, and ADD will support loading an activity diagram from such a file. Each activity diagram file contains two parts: the first part is the declaration of glyphs of the activity diagram, and the second part represents the connections between these glyphs. In the first part, each list describes the glyph type of glyph x and its text. The first character of the list denotes the glyph type (I: Initial node, F: Final node, A: Activity, E: Edge, D: Decision node) of x. In the connections part, each line implies one connection, which uses two numbers to denote the IDs of the two glyphs to be connected. Table 1 shows a sample activity diagram file (file1.add). The corresponding diagram is shown in Figure 1. Table 1 Sample file file1.add I E A, Go to a movie theater E D E, I like science fiction film A, See movie Inception E F E, I like animated film A, See movie WALL E E 0,1 1,2 2,3 3,4 4,5 5,6 6,7 7,8 4,9 9,10 10,11
2 Figure 1 The user interface is extended to support loading an activity diagram from a file. Table 2 shows the possible operation scenarios of loading files. Table 2 Load activity diagram file > 1 Please key in a file path: C:\ADD\file_not_exist.add File not found error!! > 1 Please key in a file path: C:\ADD\file1.add The activity diagram is displayed as follows:
3 E 1 A 2 Go to a movie theater E 3 D 4 E 5 I like science fiction film A 6 See movie Inception E 7 F 8 E 9 I like animated film A 10 See movie WALL E E Delete glyph In this homework, the text-mode interface will be enhanced for users to delete glyphs. An example is shown in Table 3. The user selects the Delete a glyph command, and enters the glyph ID to delete a glyph. When a user deletes a glyph, ADD deletes all connections that are
4 associated with the glyph. Note that, ADD should warn users if wrong IDs are entered. Each time after the user deletes a glyph, ADD shows all the glyphs and connections there are in the current diagram. Table 3 Delete glyphs > 4 The activity diagram is displayed as follows: A 2 The first activity F
5 > 6 Please enter the glyph ID > X The glyph ID you entered does not exist. Please enter a valid one again. > 2 The glyph 2 has been deleted F Apply Command pattern In this homework, you need to apply command pattern to support redo/undo operations. Table 4 lists the operations that are required to support redo and undo. Figure 2 gives a reference design. In Figure 2, a Command class encapsulates a request. For example, the AddGlyphCmd encapsulates the request of adding a new glyph to the activity diagram. ADD is
6 the receiver of the command. In order to implement redo/undo, two stacks are needed to store command history. Each time when an undo command is performed, the application gets the most recently execute operation from the undo stack (i.e., the top element in the undo stack), executes the unexecute() method to revert application s state to the previous state, and moves the command from the undo stack to the redo stack. When a user executes the redo command, the application retrieves the top element from the redo stack, and automatically executes the execute() method. Figure 3 is the reference class diagram for ADD when the command pattern is applied. Table 4 Operations that must support Undo/Redo Commands Add glyph Delete glyph Connect glyphs TextUi +displaymenu() +processcommand() Receiver ActivityDiagram -_Glyphs +addglyph(in type : int) +deleteglyph(in type : int) +connectglyphs(in fromid : int, in toid : int) +existpathbetween(in fromid : int, in toid : int) : bool CommandManager -_redocommands : stack<command*> -_undocommands : stack<command*> +execute(in cmd : Command*) : void +redo() : void +undo() : void Command Command +execute() : void +unexecute() : void Concrete Command AddGlyphCmd +execute() : void +unexecute() : void DeleteGlyphCmd +execute() : void +unexecute() : void ConnectGlyphsCmd +execute() : void +unexecute() : void Figure 2 Command pattern
7 Figure 3 Class diagram Table 5 shows the new text-mode interface enhanced for users to select redo/undo functionalities. After a user selects redo/undo command, ADD shows all glyphs and connections of the current activity diagram. In addition, ADD should show an error message if there are no commands to redo or undo. Table 5 Redo/Undo
8 > 2 What kind of glyph do you want to add? [I]Initial node [F]Final node [A]Activity [E]Edge [D]Decision node > F A glyph [Final node] has been added. ID: A 2 The first activity F 4 > 3 Please enter the first glyph ID > 3 Please enter the second glyph ID > 4 The glyph 3 has been connected to glyph 4.
9 > 7 Undo! A 2 The first activity F 4 1 2
10 > 7 Undo! A 2 The first activity 1 2 > 8
11 Redo! A 2 The first activity F > 8 Redo!
12 A 2 The first activity F Grading After completion, your program should provide the following features: 1. Applying Command pattern in the design of the ADD (20%) 2. New features of ADD (45%) i. Load activity diagram file (10%) ii. Delete a glyph (10%) iii. Undo (10%) iv. Redo (15%) 3. Draw a class diagram (5%) 4. Time Measurement (0%, but necessary) You are required to record your working time into a time log sheet (reference Table). The following work items should be noticed: i. Reading the requirement of the homework ii. The design of your implementation, including drawing UML diagrams iii. Coding iv. Testing v. Other work items that spend you a lot of time, e.g., reading GoF book. You must submit your time log; otherwise, your homework will not be graded. 5. Summary (0%, but necessary) Before start doing your homework, please estimate (guess) the time (in hours) that you will need to spend on the homework, and write the estimated hours in the homework summary file. In addition, you are required to turn in your time log
13 (the time in hours that you actually spent on the homework, including documentation, as precisely as possible). Please download the summary file template from the instructor s website. 6. Code Quality (30%) Please write a C++ program to perform the features described above. The efficiency of your program is not of concern in this homework. The grading of code quality will be based mainly on whether your programs have bad smells.
Pattern-Oriented Software Design (Fall 2012) Homework #1 (Due: 10/5/2012)
Pattern-Oriented Software Design (Fall 2012) Homework #1 (Due: 10/5/2012) 1. Introduction Activity diagrams are graphical representations of workflows of stepwise activities and actions with support for
More informationSoftware Construction
Lecture 11: Command Design Pattern Software Construction in Java for HSE Moscow Tom Verhoeff Eindhoven University of Technology Department of Mathematics & Computer Science Software Engineering & Technology
More informationEINDHOVEN UNIVERSITY OF TECHNOLOGY
EINDHOVEN UNIVERSITY OF TECHNOLOGY Department of Mathematics & Computer Science Exam Programming Methods, 2IP15, Wednesday 17 April 2013, 09:00 12:00 TU/e THIS IS THE EXAMINER S COPY WITH (POSSIBLY INCOMPLETE)
More informationDesign Patterns: Template Method, Strategy, State, Bridge
Design Patterns: Template Method, Strategy, State, Bridge [HFDP, Ch. 8] Say we have two classes whose code looks similar, but isn t identical. We can duplicate the code, but change it where changes are
More informationCommand Pattern. CS356 Object-Oriented Design and Programming November 13, 2014
Command Pattern CS356 Object-Oriented Design and Programming http://cs356.yusun.io November 13, 2014 Yu Sun, Ph.D. http://yusun.io yusun@csupomona.edu Command Encapsulate requests for service from an object
More informationCS3360 Design and Implementation of Programming Languages Final Exam May 16, pm to 12:45pm (2 hour and 40 minutes) NAME:
CS3360 Design and Implementation of Programming Languages Final Exam May 16, 2013 10pm to 12:45pm (2 hour and 40 minutes) NAME: GRADE = / 140 1. Choice of Programming Languages / 25 2. Programming languages:
More informationDesign Patterns (Part 2) CSCE Lecture 18-10/25/2016 (Partially adapted from Head First Design Patterns by Freeman, Bates, Sierra, and Robson)
Design Patterns (Part 2) CSCE 740 - Lecture 18-10/25/2016 (Partially adapted from Head First Design Patterns by Freeman, Bates, Sierra, and Robson) Objectives for Today The point of OO: Separate what changes
More informationCSE 70 Final Exam Fall 2009
Signature cs70f Name Student ID CSE 70 Final Exam Fall 2009 Page 1 (10 points) Page 2 (16 points) Page 3 (22 points) Page 4 (13 points) Page 5 (15 points) Page 6 (20 points) Page 7 (9 points) Page 8 (15
More informationTecniche di Progettazione: Design Patterns
Tecniche di Progettazione: Design Patterns GoF: Mediator Memento Prototype 1 Design patterns, Laura Semini, Università di Pisa, Dipartimento di Informatica. Mediator 2 Design patterns, Laura Semini, Università
More informationBugsquashing: Command - Pattern. Andreas Fetzer
Bugsquashing: Command - Pattern Andreas Fetzer Class structure Command: Abstract superclass of all commands. Concrete Command: Specifies a concrete comand. Has the execute method in which the corresponding
More informationLab 08 Command Pattern, Undo, Redo
Lab 08 Command Pattern, Undo, Redo Q0: Introduction I - How users use Undo and Redo II - An array as a static field Q1 - Q6 Maintenance of Employee records with undo-redo commands Q1 : The start-up version
More informationPrelim One Solution. CS211 Fall Name. NetID
Name NetID Prelim One Solution CS211 Fall 2005 Closed book; closed notes; no calculators. Write your name and netid above. Write your name clearly on each page of this exam. For partial credit, you must
More informationKing Abdulaziz University Faculty of Computing and Information Technology Computer Science Department
King Abdulaziz University Faculty of Computing and Information Technology Computer Science Department CPCS202, 1 st Term 2016 (Fall 2015) Program 5: FCIT Grade Management System Assigned: Thursday, December
More informationEECS168 Exam 3 Review
EECS168 Exam 3 Review Exam 3 Time: 2pm-2:50pm Monday Nov 5 Closed book, closed notes. Calculators or other electronic devices are not permitted or required. If you are unable to attend an exam for any
More informationYou must include this cover sheet. Either type up the assignment using theory3.tex, or print out this PDF.
15-122 Assignment 3 Page 1 of 12 15-122 : Principles of Imperative Computation Fall 2012 Assignment 3 (Theory Part) Due: Thursday, October 4 at the beginning of lecture. Name: Andrew ID: Recitation: The
More informationCheck out FilesAndExceptions from SVN. Exam 2 Review File I/O, Exceptions Vector Graphics Project
Check out FilesAndExceptions from SVN Exam 2 Review File I/O, Exceptions Vector Graphics Project Exam 2 review File I/O and Exceptions Vector Graphics project kickoff Exam is in class tomorrow Test on
More informationTecniche di Progettazione: Design Patterns
Tecniche di Progettazione: Design Patterns GoF: Bridge 1 The Bridge Pattern The Bridge Pattern permits to vary the implementation and abstraction by placing the two in seperate hierarchies. Decouple an
More informationPointers, Arrays and Parameters
Pointers, Arrays and Parameters This exercise is different from our usual exercises. You don t have so much a problem to solve by creating a program but rather some things to understand about the programming
More informationMidterm Practice Exam
Name: CS 410 Introduction to Software Engineering Fall 2016 Instructor: Marc Pomplun Midterm Practice Exam Duration: 75 minutes No books, no notes, and no calculators are allowed. Question 1: out of points
More informationOutline. Purpose. Useful Definitions. Pattern Overview
Design Patterns Outline Purpose Useful Definitions Pattern Overview Purpose To provide programmers with already documented solutions to common problems. Gives the programmers a common language. COMPOSITION?
More informationUndo. principles, concepts, and Java implementation. Checkpointing. Undo Benefits. A manual undo method. Consider a video game
Undo principles, concepts, and Java implementation Checkpointing A manual undo method - you save the current state so you can rollback later (if needed) Consider a video game - You kill a monster - You
More informationSubmitting Assignments
Submitting Assignments Blackboard s assignments feature allows the instructor to assign coursework for you to submit electronically. First, you need to locate the assignment. Your instructor will place
More informationCSE 373 Spring 2010: Midterm #1 (closed book, closed notes, NO calculators allowed)
Name: Email address: CSE 373 Spring 2010: Midterm #1 (closed book, closed notes, NO calculators allowed) Instructions: Read the directions for each question carefully before answering. We may give partial
More informationArrays in C++ Instructor: Andy Abreu
Arrays in C++ Instructor: Andy Abreu Reason behind the idea When we are programming, often we have to process a large amount of information. We can do so by creating a lot of variables to keep track of
More informationCSE 131 Introduction to Computer Science Fall Exam II
CSE 131 Introduction to Computer Science Fall 2013 Given: 6 November 2013 Exam II Due: End of session This exam is closed-book, closed-notes, no electronic devices allowed. The exception is the cheat sheet
More informationAsset List & Content Creation
Asset List & Content Creation Project 3 Due date: Monday, September 17 th At 10:00am Introduction Third in a series of related projects Will build towards working game Focuses on the content that must
More informationCPSC 427a: Object-Oriented Programming
CPSC 427a: Object-Oriented Programming Michael J. Fischer Lecture 1 September 2, 2010 CPSC 427a 1/54 Overview Course information Goals Learning C++ Programming standards Comparison of C and C++ Example
More informationMSO Lecture 1. Wouter Swierstra (adapted by HP) September 11, 2017
1 MSO Lecture 1 Wouter Swierstra (adapted by HP) September 11, 2017 So you think you can program... 2 From nrc.nl 3 Question: why do ICT-projects fail so often? 4 5 Question: why do ICT-projects fail so
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Fall Test I
Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.035 Fall 2014 Test I You have 50 minutes to finish this quiz. Write your name and athena username on this
More informationSoftware Design: Copy & Paste
Software Design: Copy & Paste Your assistant for this week Velko Vechev E-mail: velko.vechev@inf.ethz.ch Office: CNB H 100.9 You can simply stop by. You can also drop me a short e-mail to check if I m
More informationMore on Arrays CS 16: Solving Problems with Computers I Lecture #13
More on Arrays CS 16: Solving Problems with Computers I Lecture #13 Ziad Matni Dept. of Computer Science, UCSB Announcements Homework #12 due today No homework assigned today!! Lab #7 is due on Monday,
More informationWINTER 2017 ECE 102 ENGINEERING COMPUTATION STANDARD HOMEWORK #3 ECE DEPARTMENT PORTLAND STATE UNIVERSITY
WINTER 2017 ECE 102 ENGINEERING COMPUTATION STANDARD HOMEWORK #3 ECE DEPARTMENT PORTLAND STATE UNIVERSITY ECE 102 Standard Homework #3 (HW-s3) Problem List 15 pts Problem #1 - Curve fitting 15 pts Problem
More informationCOMP 401: THE DUAL ROLE OF A CLASS. Instructor: Prasun Dewan (FB 150,
COMP 401: THE DUAL ROLE OF A CLASS Instructor: Prasun Dewan (FB 150, dewan@unc.edu) SCRIPTS ANALOGY Script Program Follows Follows Theater Performer 2 STRUCTURING IN SCRIPTS Script (Folder) Act (File)
More informationCS 32. Lecture 5: Templates
CS 32 Lecture 5: Templates Vectors Sort of like what you remember from Physics but sort of not Can have many components Usually called entries Like Python lists Array vs. Vector What s the difference?
More informationCSE 131 Introduction to Computer Science Fall Exam II
CSE 131 Introduction to Computer Science Fall 2015 Given: 5 November 2015 Exam II Due: End of Exam Session This exam is closed-book, closed-notes, no electronic devices allowed. The exception is the sage
More information3. Task Group & Applying Composite Pattern
National Taipei University of Technology Object-Oriented Programming (Fall, 2007) Homework # 3 (Due: Wed., Nov. 7, 24:00) 1. Introduction In homework #3, we will assemble several tasks as a group called
More informationDesign Patterns Reid Holmes
Material and some slide content from: - Head First Design Patterns Book - GoF Design Patterns Book Design Patterns Reid Holmes GoF design patterns $ %!!!! $ "! # & Pattern vocabulary Shared vocabulary
More informationUndo. principles, concepts Java implementation. Undo 1
Undo principles, concepts Java implementation Undo 1 Undo* Benefits Undo enables exploratory learning - One of the key claims of direct manipulation is that users would learn primarily by trying manipulations
More informationLab 1: Space Invaders. The Introduction
Lab 1: Space Invaders The Introduction Welcome to Lab! Feel free to get started until we start talking! The lab document is located on course website: https://users.wpi.edu/~sjarvis/ece2049_smj/ Be sure
More informationCOMP322 - Introduction to C++ Lecture 01 - Introduction
COMP322 - Introduction to C++ Lecture 01 - Introduction Robert D. Vincent School of Computer Science 6 January 2010 What this course is Crash course in C++ Only 14 lectures Single-credit course What this
More informationDesign Patterns: Composite, Memento, Template Method, Decorator, Chain of Responsibility, Interpreter
Design Patterns: Composite, Memento, Template Method, Decorator, Chain of Responsibility, Interpreter Composite Outline for Week 14 [Skrien 8.7] We need to allow users to group figures together to make
More informationMyELT STUDENT QUICK START GUIDE
MyELT STUDENT QUICK START GUIDE TABLE OF CONTENTS ABOUT THIS GUIDE... 2 GETTING STARTED... 3 HOW DO I REGISTER FOR AN INSTRUCTOR- LED COURSE?... 3 HOW DO I CREATE A SELF- STUDY ACCOUNT?... 7 WHAT SHOULD
More informationLecture 14 CSE11 Fall 2013 For loops, Do While, Break, Continue
Lecture 14 CSE11 Fall 2013 For loops, Do While, Break, Continue General Loops in Java Look at other loop constructions Very common while loop: do a loop a fixed number of times (MAX in the example) int
More informationUniversity of Illinois at Urbana-Champaign Department of Computer Science. First Examination
University of Illinois at Urbana-Champaign Department of Computer Science First Examination CS 225 Data Structures and Software Principles Spring 2014 Tuesday, February 25, 7-10p Name: NetID: Lab Section
More informationCS11 Introduction to C++ Fall Lecture 1
CS11 Introduction to C++ Fall 2006-2007 Lecture 1 Welcome! 8 Lectures (~1 hour) Slides posted on CS11 website http://www.cs.caltech.edu/courses/cs11 7 Lab Assignments on course website Available on Monday
More informationCPSC 310 Software Engineering. Lecture 11. Design Patterns
CPSC 310 Software Engineering Lecture 11 Design Patterns Learning Goals Understand what are design patterns, their benefits and their drawbacks For at least the following design patterns: Singleton, Observer,
More informationObject-Oriented Oriented Programming Command Pattern. CSIE Department, NTUT Woei-Kae Chen
Object-Oriented Oriented Programming Command Pattern CSIE Department, NTUT Woei-Kae Chen Command: Intent Encapsulate a request as an object thereby letting you parameterize clients with different requests
More informationSyllabus COSC-051-x - Computer Science I Fall Office Hours: Daily hours will be entered on Course calendar (or by appointment)
Syllabus COSC-051-x - Computer Science I Fall 2018 Instructor: Jeremy Bolton, Ph.D. Asst Teaching Professor Department of Computer Science Office: TBD (see Course calendar for office hours) Email: jeremy.bolton@georgetown.edu
More informationLab 1 Implementing a Simon Says Game
ECE2049 Embedded Computing in Engineering Design Lab 1 Implementing a Simon Says Game In the late 1970s and early 1980s, one of the first and most popular electronic games was Simon by Milton Bradley.
More informationINSTRUCTIONS TO CANDIDATES
NATIONAL UNIVERSITY OF SINGAPORE SCHOOL OF COMPUTING MIDTERM ASSESSMENT FOR Semester 2 AY2017/2018 CS2030 Programming Methodology II March 2018 Time Allowed 90 Minutes INSTRUCTIONS TO CANDIDATES 1. This
More informationCSE 373 Autumn 2010: Midterm #1 (closed book, closed notes, NO calculators allowed)
Name: Email address: CSE 373 Autumn 2010: Midterm #1 (closed book, closed notes, NO calculators allowed) Instructions: Read the directions for each question carefully before answering. We may give partial
More informationCOMS W1007 Homework 4
COMS W1007 Homework 4 Submission instructions All programs must compile and run on CUNIX to receive credit. Submit your electronic files via http://courseworks.columbia.edu. Post your archived submission
More informationLinear Structures. Linear Structure. Implementations. Array details. List details. Operations 4/18/2013
Linear Structure Linear Structures Chapter 4 CPTR 318 Every non-empty linear structure has A unique element called first A unique element called last Every element except last has a unique successor Every
More informationLab 1: Simon. The Introduction
Lab 1: Simon The Introduction Welcome to Lab! Feel free to get started until we start talking! The lab document is located on the course website: http://users.wpi.edu/~ndemarinis/ece2049/ You do not need
More informationCSE 5A Introduction to Programming I (C) Homework 4
CSE 5A Introduction to Programming I (C) Homework 4 Read Chapter 7 Due: Friday, October 26 by 6:00pm All programming assignments must be done INDIVIDUALLY by all members of the class. Start early to ensure
More informationTecniche di Progettazione: Design Patterns
Tecniche di Progettazione: Design Patterns GoF: Memento Prototype Visitor 1 Design patterns, Laura Semini, Università di Pisa, Dipartimento di Informatica. Memento 2 Design patterns, Laura Semini, Università
More informationMCS-378 Intraterm Exam 1 Serial #:
MCS-378 Intraterm Exam 1 Serial #: This exam is closed-book and mostly closed-notes. You may, however, use a single 8 1/2 by 11 sheet of paper with hand-written notes for reference. (Both sides of the
More information1B1b Inheritance. Inheritance. Agenda. Subclass and Superclass. Superclass. Generalisation & Specialisation. Shapes and Squares. 1B1b Lecture Slides
1B1b Inheritance Agenda Introduction to inheritance. How Java supports inheritance. Inheritance is a key feature of object-oriented oriented programming. 1 2 Inheritance Models the kind-of or specialisation-of
More informationLinear Structures. Linear Structure. Implementations. Array details. List details. Operations 2/10/2013
Linear Structure Linear Structures Chapter 4 CPTR 318 Every non-empty linear structure has A unique element called first A unique element called last Every element except last has a unique successor Every
More informationProject#1: Grade Book
Project#1: Grade Book Objective Making Classes and Objects from these Classes. Also, practice making an array of objects and manipulating/using the data inside said array. Program Description This program
More informationStatements execute in sequence, one after the other, such as the following solution for a quadratic equation:
Control Structures Sequence Statements execute in sequence, one after the other, such as the following solution for a quadratic equation: double desc, x1, x2; desc = b * b 4 * a * c; desc = sqrt(desc);
More informationCommand. Comp-303 : Programming Techniques Lecture 22. Alexandre Denault Computer Science McGill University Winter 2004
Command Comp-303 : Programming Techniques Lecture 22 Alexandre Denault Computer Science McGill University Winter 2004 April 1, 2004 Lecture 22 Comp 303 : Command Page 1 Last lecture... Chain of Responsibility
More informationC02: Overview of Software Development and Java
CISC 3120 C02: Overview of Software Development and Java Hui Chen Department of Computer & Information Science CUNY Brooklyn College 08/31/2017 CUNY Brooklyn College 1 Outline Recap and issues Brief introduction
More informationCOMSC-051 Java Programming Part 1. Part-Time Instructor: Joenil Mistal
COMSC-051 Java Programming Part 1 Part-Time Instructor: Joenil Mistal Chapter 4 4 Moving Toward Object- Oriented Programming This chapter provides a provides an overview of basic concepts of the object-oriented
More informationAgile Architecture. The Why, the What and the How
Agile Architecture The Why, the What and the How Copyright Net Objectives, Inc. All Rights Reserved 2 Product Portfolio Management Product Management Lean for Executives SAFe for Executives Scaled Agile
More informationDesign Patterns and Frameworks Command
Design Patterns and Frameworks Command Oliver Haase Oliver Haase Emfra Command 1/13 Description Classification: Object-based behavioral pattern Purpose: Encapsulate a command as an object. Allows to dynamically
More informationCS Final Exam Review Suggestions - Fall 2017
CS 111 - Final Exam Review Suggestions p. 1 CS 111 - Final Exam Review Suggestions - Fall 2017 last modified: 2016-12-09 You are responsible for material covered in class sessions, lab exercises, and homeworks;
More informationWhat will happen if we try to compile, link and run this program? Do you have any comments to the code?
1 # include < iostream > 2 3 int main () 4 { 5 std :: cout
More informationCS1004: Intro to CS in Java, Spring 2005
CS1004: Intro to CS in Java, Spring 2005 Lecture #13: Java OO cont d. Janak J Parekh janak@cs.columbia.edu Administrivia Homework due next week Problem #2 revisited Constructors, revisited Remember: a
More informationQUIZ. 1. Explain the meaning of the angle brackets in the declaration of v below:
QUIZ 1. Explain the meaning of the angle brackets in the declaration of v below: This is a template, used for generic programming! QUIZ 2. Why is the vector class called a container? 3. Explain how the
More informationG52CPP C++ Programming Lecture 17
G52CPP C++ Programming Lecture 17 Dr Jason Atkin http://www.cs.nott.ac.uk/~jaa/cpp/ g52cpp.html 1 Last Lecture Exceptions How to throw (return) different error values as exceptions And catch the exceptions
More informationCOMP 111 PROGRAMMING I MODULARITY USING FUNCTIONS
COMP 111 PROGRAMMING I MODULARITY USING FUNCTIONS Instructor: Dr Dionysiou ADMINISTRATIVE This week s lecture [BRON06] Chapter 6 (6.1) What is a function? Function declaration (prototype) Function definition
More informationScenario Step-by-Step Guide
CONTENTS Overview... 2 Key Takeaways... 2 Scenario Toolbar... 3 Toolbar Options... 3 Creating a new Scenario... 4 Opening an existing Scenario... 6 Modeling scenario using shapes... 9 Linking between mockup
More informationOregon State University School of Electrical Engineering and Computer Science. CS 261 Recitation 1. Spring 2011
Oregon State University School of Electrical Engineering and Computer Science CS 261 Recitation 1 Spring 2011 Outline Using Secure Shell Clients GCC Some Examples Intro to C * * Windows File transfer client:
More informationDesign Pattern and Software Architecture: IV. Design Pattern
Design Pattern and Software Architecture: IV. Design Pattern AG Softwaretechnik Raum E 3.165 Tele.. 60-3321 hg@upb.de IV. Design Pattern IV.1 Introduction IV.2 Example: WYSIWYG Editor Lexi IV.3 Creational
More information9/19/2018 Programming Data Structures. Polymorphism And Abstract
9/19/2018 Programming Data Structures Polymorphism And Abstract 1 In-class assignment: deadline noon!! 2 Overview: 4 main concepts in Object-Oriented Encapsulation in Java is a mechanism of wrapping the
More informationCOURSE 11 DESIGN PATTERNS
COURSE 11 DESIGN PATTERNS PREVIOUS COURSE J2EE Design Patterns CURRENT COURSE Refactoring Way refactoring Some refactoring examples SOFTWARE EVOLUTION Problem: You need to modify existing code extend/adapt/correct/
More informationCOMP 401 COMMAND OBJECTS AND UNDO. Instructor: Prasun Dewan
COMP 401 COMMAND OBJECTS AND UNDO Instructor: Prasun Dewan PREREQUISITES Animation Threads Commands 2 TOPICS Command Object Object representing an action invocation such as Do your homework. Threads Support
More informationUNIVERSITY OF CALIFORNIA
UNIVERSITY OF CALIFORNIA Department of Electrical Engineering and Computer Sciences Computer Science Division CS164 Fall 1997 P. N. Hilfinger CS 164: Midterm Name: Please do not discuss the contents of
More informationCSCI 102L - Data Structures Midterm Exam #2 Spring 2011
CSCI 102L - Data Structures Midterm Exam #2 Spring 2011 (12:30pm - 1:50pm, Thursday, March 24) Instructor: Bill Cheng ( This exam is closed book, closed notes, closed everything. No cheat sheet allowed.
More informationCS 112 Introduction to Computing II. Wayne Snyder Computer Science Department Boston University
9/5/6 CS Introduction to Computing II Wayne Snyder Department Boston University Today: Arrays (D and D) Methods Program structure Fields vs local variables Next time: Program structure continued: Classes
More informationAbout this exam review
Final Exam Review About this exam review I ve prepared an outline of the material covered in class May not be totally complete! Exam may ask about things that were covered in class but not in this review
More informationPRINCIPLES OF SOFTWARE BIM209DESIGN AND DEVELOPMENT 00. WELCOME TO OBJECTVILLE. Speaking the Language of OO
PRINCIPLES OF SOFTWARE BIM209DESIGN AND DEVELOPMENT 00. WELCOME TO OBJECTVILLE Speaking the Language of OO COURSE INFO Instructor : Alper Bilge TA : Gökhan Çıplak-Ahmet Alkılınç Time : Tuesdays 2-5pm Location
More informationIntermediate Programming, Spring 2017*
600.120 Intermediate Programming, Spring 2017* Misha Kazhdan *Much of the code in these examples is not commented because it would otherwise not fit on the slides. This is bad coding practice in general
More informationCSCI 102L - Data Structures Midterm Exam #1 Fall 2011
Print Your Name: Page 1 of 8 Signature: Aludra Loginname: CSCI 102L - Data Structures Midterm Exam #1 Fall 2011 (10:00am - 11:12am, Wednesday, October 5) Instructor: Bill Cheng Problems Problem #1 (24
More informationImplementation of backtrack search
Fall Semester, 2005 CSCE 421/821: Foundations of Constraint Processing B.Y. Choueiry Homework 3 Assigned: Thursday, September 22, 2005 Due: Tuesday, October 11, 2005 Total value: 100 points. Penalty of
More informationECE15: Lab #4. Problem 1. University of California San Diego
University of California San Diego ECE15: Lab #4 This lab is a cumulative wrap-up assignment for the entire course. As such, it relates to the material covered in Lecture Units 1 5 and 7 9 in class. Here
More informationCS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 14: OCT. 25TH INSTRUCTOR: JIAYIN WANG
CS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 14: OCT. 25TH INSTRUCTOR: JIAYIN WANG 1 Notice Assignments No new homework this week. Please make up the homework 1 5 & class exercises this week.
More informationDesign Patterns Reid Holmes
Material and some slide content from: - Head First Design Patterns Book - GoF Design Patterns Book Design Patterns Reid Holmes GoF design patterns $ %!!!! $ "! # & Pattern vocabulary Shared vocabulary
More informationBluetooth Keyboard Commands with VoiceOver on the ipad
Bluetooth Keyboard Commands with VoiceOver on the ipad ios 9.2 Chapter 5: Editing and Manipulating Text in Editable Text Fields using Bluetooth Keyboard Commands (Quick Nav is OFF) Module Objectives 5.1
More informationECE2049 Homework #2 The MSP430 Architecture & Basic Digital IO (DUE Friday 9/8/17 at 4 pm in class)
ECE2049 Homework #2 The MSP430 Architecture & Basic Digital IO (DUE Friday 9/8/17 at 4 pm in class) Your homework should be neat and professional looking. You will loose points if your HW is not properly
More informationCS 132 Compiler Construction, Fall 2011 Instructor: Jens Palsberg Multiple Choice Exam, Dec 6, 2011
CS 132 Compiler Construction, Fall 2011 Instructor: Jens Palsberg Multiple Choice Eam, Dec 6, 2011 ID Name This eam consists of 22 questions. Each question has four options, eactl one of which is correct,
More informationCMPSC 111 Introduction to Computer Science I Fall 2016 Lab 8 Assigned: October 26, 2016 Due: November 2, 2016 by 2:30pm
1 CMPSC 111 Introduction to Computer Science I Fall 2016 Lab 8 Assigned: October 26, 2016 Due: November 2, 2016 by 2:30pm Objectives To enhance your experience with designing and implementing your own
More informationCS111: PROGRAMMING LANGUAGE II. Lecture 1: Introduction to classes
CS111: PROGRAMMING LANGUAGE II Lecture 1: Introduction to classes Lecture Contents 2 What is a class? Encapsulation Class basics: Data Methods Objects Defining and using a class In Java 3 Java is an object-oriented
More information16720 Computer Vision: Homework 3 Template Tracking and Layered Motion.
16720 Computer Vision: Homework 3 Template Tracking and Layered Motion. Instructor: Martial Hebert TAs: Varun Ramakrishna and Tomas Simon Due Date: October 24 th, 2011. 1 Instructions You should submit
More informationCS 132 Compiler Construction, Fall 2012 Instructor: Jens Palsberg Multiple Choice Exam, Nov 6, 2012
CS 132 Compiler Construction, Fall 2012 Instructor: Jens Palsberg Multiple Choice Exam, Nov 6, 2012 ID Name This exam consists of 22 questions. Each question has four options, exactly one of which is correct,
More informationDo not write in this area A.1 A.2 A.3 A.4 A.5 A.6 B.1 B.2 B.3 TOTAL. Maximum possible points:
Name: Student ID: Instructor: Borja Sotomayor Do not write in this area A.1 A.2 A.3 A.4 A.5 A.6 B.1 B.2 B.3 TOTAL Maximum possible points: 75 + 10 This homework has two parts: Part A (Polynomial ADT) and
More informationNote 7: Eliminating Excise
Computer Science and Software Engineering University of Wisconsin - Platteville Note 7: Eliminating Excise Yan Shi Lecture Notes for SE 3330 UW-Platteville Based on About Face 3: Chapter 11 & 16 Excise
More informationCLO Assessment CLO1 Q1(10) CLO2 Q2 (10) CLO3 Q4 (10) CLO4 Q3a (4)
CS210 Data Structures (171) Final Exam Name: ID Instructions: This exam contains four questions with multiple parts. Time allowed: 180 minutes Closed Book, Closed Notes. There are 10 pages in this exam
More informationTecniche di Progettazione: Design Patterns
Tecniche di Progettazione: Design Patterns GoF: Bridge 1 The problem Task: writing a program that will draw rectangles with either of two drawing programs. The rectangles are defined as two pairs of points
More information