Extra Problems + Solutions

Size: px
Start display at page:

Download "Extra Problems + Solutions"

Transcription

1 Extra Problems + Solutions 1. The following four sentences define language L. This house is big. This barn stinks. This dog smiles. This student gets good grades. Here are two grammars, G1 and G2, with missing tokens, identifiers, and rule names whose language is L. Fill in the missing holes, where hole h is denoted by <h>: Grammar with holes G1 :- <h1> <h2> <h3> ; <h2> :- <h4> <h5> <h6> <h7> ; G2 :- <p0> <p14> ; N :- <p1> <p6> <p2> <p7> <p3> <p8> <p4> <p9> ; <p6> :- <p10> ; <p7> :- <p11> ; <p8> :- <p12> ; <p9> :- <p13> ; Grammar without holes G1 :- This nv. ; nv :- house is big barn stinks dog smiles student gets good grades ; G2 : N. ; N :- This house v1. This barn v2 This dog v3 This student v4 ; v1 :- is big ; v2 :- stinks ; v3 :- smiles ; v4 :- gets good grades ;

2 2. Here is some application code and 2 classes of a package that it references. Draw the result of moving method doit() of class A to class B via field A.bb, leaving behind a delegate doit() in class A. (a) what is the absolute function of doit( ) A doit(a a, B b) { // parameter (A a) was this in class A // absolute call looks like: doit(alpha,beta) where alpha A and beta B (b) what is the absolute function of doit( ) after the move-via-field refactoring: A doit(a a, B b, B bb) { // move-via-field adds parameter (B bb) so that doit() can be moved to class B (via parameter bb) // note that parameter bb is not used. // absolute call looks like: doit(alpha,beta,gamma) where alpha A, beta B, gamma B application before refactoring class A before refactoring class B before refactoring void main(string[] args) { B b; b = new B(); a2 = new A(); a2.doit(b); A doit(b b) { counter++; return this;

3 move A.doit() to class B via field/parameter bb. application after refactoring class A after refactoring class B after refactoring B b; b = new B(); a2 = new A(); a2.doit(b); // main unchanged since // delegate is called. A doit(b b) { bb.doit(this,b); A doit(a a, B b) { 3. Here is some application code and 2 classes of a package that it references. Draw the result of move method more() of class A to class B via field A.bb. (NO DELEGATE IS TO BE CREATED). See notes on move polymorphic and delegate, even though there isn t much polymorphism in this example. Hint: the answer is not obvious. I suggest that you use Netbeans to type in the problem and perform the move and delegate to see what the real answer is so that you can understand why it is what it is! (a) what is the absolute function of more( ) A more(a a) { a.b a.b (b) what is the absolute function of more after the move via field A more(a a, B bb) { a.b a.b // note param (B bb) was added, but it is NOT used.

4 perform the refactoring: application before refactoring class A before refactoring class B before refactoring a1.more(); a1.more(); a2 = new a().doit(); A more() { b b counter++; return this; (c) after refactoring, an absolute call is more(a,a.bb). When more is in class B, the call is a.bb.more(a); application after refactoring class A after refactoring class B after refactoring void main(string[] args) { a1.bb.more(a1); a1.bb.more(a1); a2 = new A; a2.bb.more(a2); A more(a a) { a.b a.b

5 4. Consider the following application and class hierarchy: application before refactoring class hierarchy before refactoring Visitor before refactoring Poly p1 = new Square(); Poly p2 = new Octagon(); p1.draw(); p2.draw(); class Poly { void center() {.. void draw() { center(); // algorithm to draw // polygon class Square extends Poly { Points p[4]; void draw() { center(); // algorithm to draw square class Octagon extends Poly { Points p[8]; void draw() { center(); // algorithm to draw octagon Show this codebase after a visitor for method draw() has been created: application after refactoring class hierarchy after refactoring Visitor after refactoring Poly p1 = new Square(); Poly p2 = new Octagon(); Visitor v = Visitor.sgl; p1.accept(v); p2.accept(v); class Poly { void center() {.. void accept(visitor v) { v.visit(this); class Visitor { public static Vistor sgl = new Vistor(); void visit(poly p) { p.center(); // alg to draw // polygon class Square extends Poly { Points p[4]; void accept(visitor v) { v.visit(this); class Octagon extends Poly { Points p[8]; void accept(visitor v) { v.visit(this; void visit(square s) { s.center(); // alg to draw // square void visit(octagon o) { o.center(); // alg to draw // octagon

6 5. Given the following class diagram, translate it into Java code (as you d expect a tool to do). Note that field Manifold.all is a static linked list of all Manifold objects that have been created. Now, association fields are by definition private, as indicated below. Override such modifiers as needed (explain justification). Manifold -name -all : LinkedList<> +draw() -inmanifold 1 -segments * Segment -name +draw() -inseg 1 -points * Point -x -y +drawto(in p : Point) class Manifold { private String name; public LinkedList<Segment> segments; // public to be updatable by leaking C. private static LinkedList<Manifold> all = new LinkedList<>(); public Manifold(String n) { name = n; segments = new LinkedList<>(); all.add(this); public draw() { /* TODO */ class Segment { private String name; private Manifold inmanifold; public LinkedList<Point> points; // public to be updatable by leaking C. public Segment(String n, Manifold m){ name = n; inmanifold = m; points = new LinkedList<>(); m.segments.add(this); // leaking public draw() { /* TODO */ class Point { private int x; private int y; private Segment inseg; public Point( int x, int y, Segment s) { this.x = x; this.y = y; inseg = s; s.points.add(this); // leaking public void drawto(point p) {...

Composite Pattern - Shapes Example - Java Sourcecode

Composite Pattern - Shapes Example - Java Sourcecode Composite Pattern - Shapes Example - Java Sourcecode In graphics editors a shape can be basic or complex. An example of a simple shape is a line, where a complex shape is a rectangle which is made of four

More information

Midterm Exam 2 CS 455, Spring 2015

Midterm Exam 2 CS 455, Spring 2015 Name: USC NetId (e.g., ttrojan): Midterm Exam 2 CS 455, Spring 2015 April 7, 2015 There are 7 problems on the exam, with 60 points total available. There are 8 pages to the exam, including this one; make

More information

Chapter 2: Java OOP I

Chapter 2: Java OOP I Chapter 2: Java OOP I Yang Wang wyang AT njnet.edu.cn Outline OO Concepts Class and Objects Package Field Method Construct and Initialization Access Control OO Concepts Object Oriented Methods Object An

More information

CSE P 501 Compilers. Implementing ASTs (in Java) Hal Perkins Autumn /20/ Hal Perkins & UW CSE H-1

CSE P 501 Compilers. Implementing ASTs (in Java) Hal Perkins Autumn /20/ Hal Perkins & UW CSE H-1 CSE P 501 Compilers Implementing ASTs (in Java) Hal Perkins Autumn 2009 10/20/2009 2002-09 Hal Perkins & UW CSE H-1 Agenda Representing ASTs as Java objects Parser actions Operations on ASTs Modularity

More information

Practice Questions for Final Exam: Advanced Java Concepts + Additional Questions from Earlier Parts of the Course

Practice Questions for Final Exam: Advanced Java Concepts + Additional Questions from Earlier Parts of the Course : Advanced Java Concepts + Additional Questions from Earlier Parts of the Course 1. Given the following hierarchy: class Alpha {... class Beta extends Alpha {... class Gamma extends Beta {... In what order

More information

HAS-A Relationship. Association is a relationship where all objects have their own lifecycle and there is no owner.

HAS-A Relationship. Association is a relationship where all objects have their own lifecycle and there is no owner. HAS-A Relationship Association is a relationship where all objects have their own lifecycle and there is no owner. For example, teacher student Aggregation is a specialized form of association where all

More information

CSE P 501 Compilers. Implementing ASTs (in Java) Hal Perkins Winter /22/ Hal Perkins & UW CSE H-1

CSE P 501 Compilers. Implementing ASTs (in Java) Hal Perkins Winter /22/ Hal Perkins & UW CSE H-1 CSE P 501 Compilers Implementing ASTs (in Java) Hal Perkins Winter 2008 1/22/2008 2002-08 Hal Perkins & UW CSE H-1 Agenda Representing ASTs as Java objects Parser actions Operations on ASTs Modularity

More information

CS 455 Midterm 2 Spring 2018 [Bono] Apr. 3, 2018

CS 455 Midterm 2 Spring 2018 [Bono] Apr. 3, 2018 Name: USC NetID (e.g., ttrojan): CS 455 Midterm 2 Spring 2018 [Bono] Apr. 3, 2018 There are 7 problems on the exam, with 59 points total available. There are 10 pages to the exam (5 pages double-sided),

More information

Programming Languages and Techniques (CIS120)

Programming Languages and Techniques (CIS120) Programming Languages and Techniques (CIS120) Lecture 26 March 23, 2016 Inheritance and Dynamic Dispatch Chapter 24 Inheritance Example public class { private int x; public () { x = 0; } public void incby(int

More information

Instance Members and Static Members

Instance Members and Static Members Instance Members and Static Members You may notice that all the members are declared w/o static. These members belong to some specific object. They are called instance members. This implies that these

More information

Example: Count of Points

Example: Count of Points Example: Count of Points 1 class Point { 2... 3 private static int numofpoints = 0; 4 5 Point() { 6 numofpoints++; 7 } 8 9 Point(int x, int y) { 10 this(); // calling the constructor with no input argument;

More information

drawobject Circle draw

drawobject Circle draw 25 THE VISITOR PATTERN The Visitor pattern turns the tables on our object-oriented model and creates an external class to act on data in other classes. This is useful if there are a fair number of instances

More information

CS165 Practice Final Exam

CS165 Practice Final Exam CS165 Practice Final Exam I, the undersigned, do hereby affirm that the work contained in this exam is solely my own, and that none of the results were achieved by cheating. This includes using automated

More information

Final exam. CS 2110, December 15, 2016, 9:00AM

Final exam. CS 2110, December 15, 2016, 9:00AM Final exam CS 2110, December 15, 2016, 9:00AM Question Short Trie Loop Exp Rec Gen Span Mon BigO Data Total Max 20 7 9 10 9 9 8 10 10 8 100 Score Grader The exam is closed book and closed notes. Do not

More information

Classes and Objects 3/28/2017. How can multiple methods within a Java class read and write the same variable?

Classes and Objects 3/28/2017. How can multiple methods within a Java class read and write the same variable? Peer Instruction 8 Classes and Objects How can multiple methods within a Java class read and write the same variable? A. Allow one method to reference a local variable of the other B. Declare a variable

More information

Chair of Software Engineering Java and C# in Depth

Chair of Software Engineering Java and C# in Depth Chair of Software Engineering Java and C# in Depth Exercise Session Week 3 Agenda Ø Assignment I Review Ø Class Ini;aliza;on and Class Instance Crea;on Ø Quizzes Ø Assignment II Handout 2 Class Diagram

More information

CS 1331 Fall 2016 Exam 2

CS 1331 Fall 2016 Exam 2 CS 1331 Fall 2016 Exam 2 Fall 2016 Name (print clearly): GT account (gpburdell1, msmith3, etc): Section (e.g., B1): Signature: Failure to properly fill in the information on this page will result in a

More information

Event Handling Java 7

Event Handling Java 7 Event Handling Java 7 Waterford Institute of Technology September 25, 2014 John Fitzgerald Waterford Institute of Technology, Event Handling Java 7 1/24 Inheritance Inheritance v Interface Inheritance

More information

ITEC2620 Introduction to Data Structures

ITEC2620 Introduction to Data Structures ITEC2620 Introduction to Data Structures Lecture 9b Grammars I Overview How can a computer do Natural Language Processing? Grammar checking? Artificial Intelligence Represent knowledge so that brute force

More information

Csci 102: Sample Exam

Csci 102: Sample Exam Csci 102: Sample Exam Duration: 65 minutes Name: NetID: Student to your left: Student to your right: DO NOT OPEN THIS EXAM UNTIL INSTRUCTED Instructions: Write your full name and your NetID on the front

More information

Outline. Java Models for variables Types and type checking, type safety Interpretation vs. compilation. Reasoning about code. CSCI 2600 Spring

Outline. Java Models for variables Types and type checking, type safety Interpretation vs. compilation. Reasoning about code. CSCI 2600 Spring Java Outline Java Models for variables Types and type checking, type safety Interpretation vs. compilation Reasoning about code CSCI 2600 Spring 2017 2 Java Java is a successor to a number of languages,

More information

CS 455 Midterm Exam 2 Fall 2015 [Bono] Nov. 10, 2015

CS 455 Midterm Exam 2 Fall 2015 [Bono] Nov. 10, 2015 Name: USC NetID (e.g., ttrojan): CS 455 Midterm Exam 2 Fall 2015 [Bono] Nov. 10, 2015 There are 9 problems on the exam, with 54 points total available. There are 8 pages to the exam (4 pages double-sided),

More information

Abstract Classes. Abstract Classes a and Interfaces. Class Shape Hierarchy. Problem AND Requirements. Abstract Classes.

Abstract Classes. Abstract Classes a and Interfaces. Class Shape Hierarchy. Problem AND Requirements. Abstract Classes. a and Interfaces Class Shape Hierarchy Consider the following class hierarchy Shape Circle Square Problem AND Requirements Suppose that in order to exploit polymorphism, we specify that 2-D objects must

More information

Inheritance and Polymorphism

Inheritance and Polymorphism Inheritance and Polymorphism Recitation 10/(16,17)/2008 CS 180 Department of Computer Science, Purdue University Project 5 Due Wed, Oct. 22 at 10 pm. All questions on the class newsgroup. Make use of lab

More information

Software and Programming 1

Software and Programming 1 Software and Programming 1 Week 9 Lab - Use of Classes and Inheritance 8th March 2018 SP1-Lab9-2018.ppt Tobi Brodie (Tobi@dcs.bbk.ac.uk) 1 Lab 9: Objectives Exercise 1 Student & StudentTest classes 1.

More information

CS 455 MT 2 Sample Questions

CS 455 MT 2 Sample Questions CS 455 MT 2 Sample Questions [CS455 Bono] This doesn t cover everything. There s likely to be at least one question about exceptions (e.g., writing some code with exceptions, or saying what some code does

More information

Midterm Exam 2 CS 455, Spring 2011

Midterm Exam 2 CS 455, Spring 2011 Name: USC loginid (e.g., ttrojan): Midterm Exam 2 CS 455, Spring 2011 March 31, 2011 There are 6 problems on the exam, with 50 points total available. There are 7 pages to the exam, including this one;

More information

CS165 Practice Final Exam Answer Key

CS165 Practice Final Exam Answer Key CS165 Practice Final Exam Answer Key I, the undersigned, do hereby affirm that the work contained in this exam is solely my own, and that none of the results were achieved by cheating. This includes using

More information

Activity 4: Methods. Content Learning Objectives. Process Skill Goals

Activity 4: Methods. Content Learning Objectives. Process Skill Goals Activity 4: Methods Java programs are organized into classes, each of which has one or more methods, each of which has one or more statements. Writing methods allows you to break down a complex program

More information

BEHAVIORAL DESIGN PATTERNS

BEHAVIORAL DESIGN PATTERNS BEHAVIORAL DESIGN PATTERNS BEHAVIORAL DESIGN PATTERNS Identifies common communication patterns between objects that realize these patterns Describes the objects and classes interact and divide responsibilities

More information

Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan

Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Language Processing Systems Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Semantic Analysis Compiler Architecture Front End Back End Source language Scanner (lexical analysis)

More information

CMSC 433 Section 0101 Fall 2012 Midterm Exam #1

CMSC 433 Section 0101 Fall 2012 Midterm Exam #1 Name: CMSC 433 Section 0101 Fall 2012 Midterm Exam #1 Directions: Test is closed book, closed notes. Answer every question; write solutions in spaces provided. Use backs of pages for scratch work. Good

More information

W09 CPSC 219 Midterm Exam Page 1 of 7

W09 CPSC 219 Midterm Exam Page 1 of 7 W09 CPSC 219 Midterm Exam Page 1 of 7 1. (15 %) Identify 5 differences in syntax between python and Java. Describe each with at least one sentence and provide an example which shows both the Java and python

More information

PLC Papers Created For:

PLC Papers Created For: PLC Papers Created For: Year 10 Topic Practice Papers: Polygons Polygons 1 Grade 4 Look at the shapes below A B C Shape A, B and C are polygons Write down the mathematical name for each of the polygons

More information

CSSE 220. Interfaces and Polymorphism. Check out Interfaces from SVN

CSSE 220. Interfaces and Polymorphism. Check out Interfaces from SVN CSSE 220 Interfaces and Polymorphism Check out Interfaces from SVN Interfaces What, When, Why, How? What: Code Structure used to express operations that multiple class have in common No method implementations

More information

Example: Count of Points

Example: Count of Points Example: Count of Points 1 public class Point { 2... 3 private static int numofpoints = 0; 4 5 public Point() { 6 numofpoints++; 7 } 8 9 public Point(int x, int y) { 10 this(); // calling Line 5 11 this.x

More information

JAVA Programming Language Homework I - Nested Class

JAVA Programming Language Homework I - Nested Class JAVA Programming Language Homework I - Nested Class Student ID: Name: 1. Which two statements are true about has-a and is-a relationships? (choose two) A. Inheritance represents an is-a relationship. B.

More information

Building Java Programs

Building Java Programs Building Java Programs Chapter 16 References and linked nodes reading: 16.1 2 Value semantics value semantics: Behavior where values are copied when assigned, passed as parameters, or returned. All primitive

More information

QUIZ 2 Introduction to Computer Science (COMP 250) Mon. March 2, 2009 Professor Michael Langer

QUIZ 2 Introduction to Computer Science (COMP 250) Mon. March 2, 2009 Professor Michael Langer QUIZ 2 Introduction to Computer Science (COMP 250) Mon. March 2, 2009 Professor Michael Langer STUDENT NAME: ID: The exam consists of five questions. There are a total of 10 points. You may use the back

More information

Binghamton University. CS-140 Fall Dynamic Types

Binghamton University. CS-140 Fall Dynamic Types Dynamic Types 1 Assignment to a subtype If public Duck extends Bird { Then, you may code:. } Bird bref; Duck quack = new Duck(); bref = quack; A subtype may be assigned where the supertype is expected

More information

EXAMINATIONS 2011 Trimester 2, MID-TERM TEST. COMP103 Introduction to Data Structures and Algorithms SOLUTIONS

EXAMINATIONS 2011 Trimester 2, MID-TERM TEST. COMP103 Introduction to Data Structures and Algorithms SOLUTIONS T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW V I C T O R I A UNIVERSITY OF WELLINGTON Student ID:....................... EXAMINATIONS 2011 Trimester 2, MID-TERM TEST COMP103 Introduction

More information

CPSC 219 Extra review and solutions

CPSC 219 Extra review and solutions CPSC 219 Extra review and solutions Multiple choice questions: Unless otherwise specified assume that all necessary variable declarations have been made. For Questions 1 6 determine the output of the print()

More information

CSE 401/M501 Compilers

CSE 401/M501 Compilers CSE 401/M501 Compilers ASTs, Modularity, and the Visitor Pattern Hal Perkins Autumn 2018 UW CSE 401/M501 Autumn 2018 H-1 Agenda Today: AST operations: modularity and encapsulation Visitor pattern: basic

More information

COMP-202 More Complex OOP

COMP-202 More Complex OOP COMP-202 More Complex OOP Defining your own types: Remember that we can define our own types/classes. These classes are objects and have attributes and behaviors You create an object or an instance of

More information

Fall CS 101: Test 2 Name UVA ID. Grading. Page 1 / 4. Page3 / 20. Page 4 / 13. Page 5 / 10. Page 6 / 26. Page 7 / 17.

Fall CS 101: Test 2 Name UVA  ID. Grading. Page 1 / 4. Page3 / 20. Page 4 / 13. Page 5 / 10. Page 6 / 26. Page 7 / 17. Grading Page 1 / 4 Page3 / 20 Page 4 / 13 Page 5 / 10 Page 6 / 26 Page 7 / 17 Page 8 / 10 Total / 100 1. (4 points) What is your course section? CS 101 CS 101E Pledged Page 1 of 8 Pledged The following

More information

CS/ENGRD 2110 SPRING Lecture 4: The class hierarchy; static components

CS/ENGRD 2110 SPRING Lecture 4: The class hierarchy; static components 1 CS/ENGRD 2110 SPRING 2014 Lecture 4: The class hierarchy; static components http://courses.cs.cornell.edu/cs2110 2 Klaatu barada nikto We are recruiting developers for the Fall semester.! We will also

More information

Midterm Exam CS 251, Intermediate Programming March 12, 2014

Midterm Exam CS 251, Intermediate Programming March 12, 2014 Midterm Exam CS 251, Intermediate Programming March 12, 2014 Name: NetID: Answer all questions in the space provided. Write clearly and legibly, you will not get credit for illegible or incomprehensible

More information

Object Oriented Programming. Week 1 Part 3 Writing Java with Eclipse and JUnit

Object Oriented Programming. Week 1 Part 3 Writing Java with Eclipse and JUnit Object Oriented Programming Part 3 Writing Java with Eclipse and JUnit Today's Lecture Test Driven Development Review (TDD) Building up a class using TDD Adding a Class using Test Driven Development in

More information

JAVA Programming Language Homework II Student ID: Name:

JAVA Programming Language Homework II Student ID: Name: JAVA Programming Language Homework II Student ID: Name: 1. Given the following Java code: 1. class A { 2. public static void main (String[] args) { 3. Byte tmp1 = new Byte( 1 ); 4. Byte tmp2 = new Byte(

More information

Tutorial notes on. Object relational structural patterns

Tutorial notes on. Object relational structural patterns Tutorial notes on Object relational structural patterns Dr. C. Constantinides, P.Eng. Computer Science and Software Engineering Concordia University Page 1 of 14 Exercise 1. a) Briefly describe what is

More information

HAS-A Relationship. If A uses B, then it is an aggregation, stating that B exists independently from A.

HAS-A Relationship. If A uses B, then it is an aggregation, stating that B exists independently from A. HAS-A Relationship Association is a weak relationship where all objects have their own lifetime and there is no ownership. For example, teacher student; doctor patient. If A uses B, then it is an aggregation,

More information

User Interface Programming OOP/Java Primer. Step 3 - documentation

User Interface Programming OOP/Java Primer. Step 3 - documentation User Interface Programming OOP/Java Primer Step 3 - documentation Department of Information Technology Uppsala University What is the documentation? Documentation about program in the program Clearly written

More information

Programming Languages and Techniques (CIS120)

Programming Languages and Techniques (CIS120) Programming Languages and Techniques (CIS120) Lecture 27 March 28, 2018 Java Generics Collections and Equality Chapters 25 & 26 Announcements HW7: Chat Server Available on Codio / Instructions on the web

More information

CS 177 Spring 2010 Exam I

CS 177 Spring 2010 Exam I CS 177 Spring 2010 Exam I There are 25 multiple choice questions. Each one is worth 4 points. The total score for the exam is 100. Answer the multiple choice questions on the bubble sheet given. Fill in

More information

CS/ENGRD 2110 SPRING Lecture 4: The class hierarchy; static components

CS/ENGRD 2110 SPRING Lecture 4: The class hierarchy; static components 1 CS/ENGRD 2110 SPRING 2019 Lecture 4: The class hierarchy; static components http://cs.cornell.edu/courses/cs2110 Announcements 2 We're pleased with how many people are already working on A1, as evidenced

More information

public class Foo { private int var; public int Method1() { // var accessible anywhere here } public int MethodN() {

public class Foo { private int var; public int Method1() { // var accessible anywhere here } public int MethodN() { Scoping, Static Variables, Overloading, Packages In this lecture, we will examine in more detail the notion of scope for variables. We ve already indicated that variables only exist within the block they

More information

Object-Oriented Programming

Object-Oriented Programming References: Beginning Java Objects by Jacquie Barker; Designing Object-Oriented Software by Rebecca Wirfs- Brock;Object-oriented Analysis & Design by Grady Booch; Sara Stoecklin 9/11/2003 1 Object Oriented

More information

HAS-A Relationship. Association is a relationship where all objects have their own lifecycle and there is no owner.

HAS-A Relationship. Association is a relationship where all objects have their own lifecycle and there is no owner. HAS-A Relationship Association is a relationship where all objects have their own lifecycle and there is no owner. For example, teacher student Aggregation is a specialized form of association where all

More information

AP CS Unit 3: Control Structures Notes

AP CS Unit 3: Control Structures Notes AP CS Unit 3: Control Structures Notes The if and if-else Statements. These statements are called control statements because they control whether a particular block of code is executed or not. Some texts

More information

Final Exam Practice Questions

Final Exam Practice Questions Final Exam Practice Questions 1. Short Answer Questions (10 points total) (a) Given the following hierarchy: class Alpha {... class Beta extends Alpha {... class Gamma extends Beta {... What order are

More information

1. Which of the following is the correct expression of character 4? a. 4 b. "4" c. '\0004' d. '4'

1. Which of the following is the correct expression of character 4? a. 4 b. 4 c. '\0004' d. '4' Practice questions: 1. Which of the following is the correct expression of character 4? a. 4 b. "4" c. '\0004' d. '4' 2. Will System.out.println((char)4) display 4? a. Yes b. No 3. The expression "Java

More information

Does a group of parallel line segments need to be the same length?

Does a group of parallel line segments need to be the same length? 1 Parallel Line Segments Parallel t Parallel What is the same about the groups of parallel line segments? They are always the same distance apart. They do not intersect each other. If you extend the line

More information

Introduction to Computer Science Unit 2. Notes

Introduction to Computer Science Unit 2. Notes Introduction to Computer Science Unit 2. Notes Name: Objectives: By the completion of this packet, students should be able to describe the difference between.java and.class files and the JVM. create and

More information

Lecture 02, Fall 2018 Friday September 7

Lecture 02, Fall 2018 Friday September 7 Anatomy of a class Oliver W. Layton CS231: Data Structures and Algorithms Lecture 02, Fall 2018 Friday September 7 Follow-up Python is also cross-platform. What s the advantage of Java? It s true: Python

More information

Exam Duration: 2hrs and 30min Software Design

Exam Duration: 2hrs and 30min Software Design Exam Duration: 2hrs and 30min. 433-254 Software Design Section A Multiple Choice (This sample paper has less questions than the exam paper The exam paper will have 25 Multiple Choice questions.) 1. Which

More information

CSSE 220. Intro to Java Graphics. Check out IntroToJavaGraphics and BiggestFan projects from SVN

CSSE 220. Intro to Java Graphics. Check out IntroToJavaGraphics and BiggestFan projects from SVN CSSE 220 Intro to Java Graphics Check out IntroToJavaGraphics and BiggestFan projects from SVN Announcement Exam 1 Starts Wednesday the 23 rd We re splitting the exam into written and programming and doing

More information

Outline. Object Oriented Programming. Course goals. Staff. Course resources. Assignments. Course organization Introduction Java overview Autumn 2003

Outline. Object Oriented Programming. Course goals. Staff. Course resources. Assignments. Course organization Introduction Java overview Autumn 2003 Outline Object Oriented Programming Autumn 2003 2 Course goals Software design vs hacking Abstractions vs language (syntax) Java used to illustrate concepts NOT a course about Java Prerequisites knowledge

More information

1. Data types ( =13 points)

1. Data types ( =13 points) Software Development I Univ.-Prof. Dr. Alois Ferscha Examination, January 27, 2015 Last name: SAMPLE SOLUTION First name: Institute for Pervasive Computing Lecture hall: Seat: ID: SKZ: Points / Grade:

More information

CSCI 201L Written Exam #2. 10% of course grade

CSCI 201L Written Exam #2. 10% of course grade Name Final Score ID Extra Credit Section (circle one): MW 3:30-6:30 CSCI 201L Written Exam #2 10% of course grade 1. Anonymous Inner Classes In lecture we walked through the following: 1. Having two classes

More information

Day 3. COMP 1006/1406A Summer M. Jason Hinek Carleton University

Day 3. COMP 1006/1406A Summer M. Jason Hinek Carleton University Day 3 COMP 1006/1406A Summer 2016 M. Jason Hinek Carleton University today s agenda assignments 1 was due before class 2 is posted (be sure to read early!) a quick look back testing test cases for arrays

More information

Computer Science II (20082) Week 1: Review and Inheritance

Computer Science II (20082) Week 1: Review and Inheritance Computer Science II 4003-232-08 (20082) Week 1: Review and Inheritance Richard Zanibbi Rochester Institute of Technology Review of CS-I Syntax and Semantics of Formal (e.g. Programming) Languages Syntax

More information

Name Section Number. CS110 Exam #1 *** PLEASE TURN OFF ALL CELLPHONES ***

Name Section Number. CS110 Exam #1 *** PLEASE TURN OFF ALL CELLPHONES *** Name Section Number CS110 Exam #1 *** PLEASE TURN OFF ALL CELLPHONES *** Sections: All Practice Bob Wilson You may use your crib sheet only (one HANDWRITTEN 8-1/2 x 11 page both sides). You will have all

More information

CS 455 Midterm Exam 1 Spring 2011 [Bono] Feb. 17, 2011

CS 455 Midterm Exam 1 Spring 2011 [Bono] Feb. 17, 2011 Name: USC loginid (e.g., ttrojan): CS 455 Midterm Exam 1 Spring 2011 [Bono] Feb. 17, 2011 There are 4 problems on the exam, with 50 points total available. There are 7 pages to the exam, including this

More information

Computer Science Spring 98 Midterm Examination Professor L. Rowe

Computer Science Spring 98 Midterm Examination Professor L. Rowe Computer Science 164 - Spring 98 Midterm Examination Professor L. Rowe Problem #1 (30 points) Define the following terms: parser terminal symbol abstract class method abstract syntax tree pushdown automaton

More information

Administration. Conditional Statements. Agenda. Syntax. Flow of control. Lab 2 due now on floppy Lab 3 due tomorrow via FTP

Administration. Conditional Statements. Agenda. Syntax. Flow of control. Lab 2 due now on floppy Lab 3 due tomorrow via FTP Administration Conditional Statements CS 99 Summer 2000 Michael Clarkson Lecture 4 Lab 2 due now on floppy Lab 3 due tomorrow via FTP need Instruct account password Lab 4 posted this afternoon Prelim 1

More information

Midterm Exam 2 CS 455, Fall 2013

Midterm Exam 2 CS 455, Fall 2013 Name: USC loginid (e.g., ttrojan): Midterm Exam 2 CS 455, Fall 2013 Wednesday, November 6, 2013 There are 9 problems on the exam, with 58 points total available. There are 8 pages to the exam, including

More information

Introduction to Computing II (ITI 1121) FINAL EXAMINATION

Introduction to Computing II (ITI 1121) FINAL EXAMINATION Université d Ottawa Faculté de génie École de science informatique et de génie électrique University of Ottawa Faculty of Engineering School of Electrical Engineering and Computer Science Identification

More information

CS 455 Midterm Exam 2 Fall 2016 [Bono] November 8, 2016

CS 455 Midterm Exam 2 Fall 2016 [Bono] November 8, 2016 Name: USC NetID (e.g., ttrojan): CS 455 Midterm Exam 2 Fall 2016 [Bono] November 8, 2016 There are 7 problems on the exam, with 50 points total available. There are 8 pages to the exam (4 pages double-sided),

More information

CS165 Practice Midterm Problems Fall 2018

CS165 Practice Midterm Problems Fall 2018 CS165 Practice Midterm Problems Fall 2018 The following is a collection of practice problems for the CS165: Data Structures and Applications second midterm. The questions are similar to what they would

More information

CS 3331 Advanced Object-Oriented Programming Exam 1

CS 3331 Advanced Object-Oriented Programming Exam 1 1 Fall 2015 (Thursday, October 22) Name: CS 3331 Advanced Object-Oriented Programming Exam 1 This test has 13 questions and pages numbered 1 through 9. Reminders This test is closed-notes and closed-book.

More information

CS 102/107 - Introduction to Programming Midterm Exam #2 - Prof. Reed Spring 2011

CS 102/107 - Introduction to Programming Midterm Exam #2 - Prof. Reed Spring 2011 CS 102/107 - Introduction to Programming Midterm Exam #2 - Prof. Reed Spring 2011 What is your name?: This test has the following sections: I. True/False... 60 points; (30 questions, 2 points each) II.

More information

CSC 1351: Final. The code compiles, but when it runs it throws a ArrayIndexOutOfBoundsException

CSC 1351: Final. The code compiles, but when it runs it throws a ArrayIndexOutOfBoundsException VERSION A CSC 1351: Final Name: 1 Interfaces, Classes and Inheritance 2 Basic Data Types (arrays, lists, stacks, queues, trees,...) 2.1 Does the following code compile? If it does not, how can it be fixed?

More information

Programming Languages and Techniques (CIS120)

Programming Languages and Techniques (CIS120) Programming Languages and Techniques (CIS120) Lecture 26 November 3, 2017 The Java ASM, Java Generics Chapter 24 Announcements HW7: Chat Server Available on Codio / InstrucNons on the web site Due Tuesday,

More information

Object-Oriented ProgrammingInheritance & Polymorphism

Object-Oriented ProgrammingInheritance & Polymorphism Inheritance Polymorphism Overriding and Overloading Object-Oriented Programming Inheritance & Polymorphism Inf1 :: 2008/09 Inheritance Polymorphism Overriding and Overloading 1 Inheritance Flat Hierarchy

More information

University of Utah School of Computing

University of Utah School of Computing University of Utah School of Computing CS 1410 / CS 2000 Study Notes December 10, 2011 This study guide is designed to help you prepare and study the appropriate material for the final exam. For the multiple

More information

CREATED BY: Muhammad Bilal Arslan Ahmad Shaad. JAVA Chapter No 5. Instructor: Muhammad Naveed

CREATED BY: Muhammad Bilal Arslan Ahmad Shaad. JAVA Chapter No 5. Instructor: Muhammad Naveed CREATED BY: Muhammad Bilal Arslan Ahmad Shaad JAVA Chapter No 5 Instructor: Muhammad Naveed Muhammad Bilal Arslan Ahmad Shaad Chapter No 5 Object Oriented Programming Q: Explain subclass and inheritance?

More information

Object Oriented Programming (OOP) is a style of programming that incorporates these 3 features: Encapsulation Polymorphism Class Interaction

Object Oriented Programming (OOP) is a style of programming that incorporates these 3 features: Encapsulation Polymorphism Class Interaction Object Oriented Programming (OOP) is a style of programming that incorporates these 3 features: Encapsulation Polymorphism Class Interaction Class Interaction There are 3 types of class interaction. One

More information

CS111: PROGRAMMING LANGUAGE II. Lecture 1: Introduction to classes

CS111: 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 information

CS/B.TECH/CSE(New)/SEM-5/CS-504D/ OBJECT ORIENTED PROGRAMMING. Time Allotted : 3 Hours Full Marks : 70 GROUP A. (Multiple Choice Type Question)

CS/B.TECH/CSE(New)/SEM-5/CS-504D/ OBJECT ORIENTED PROGRAMMING. Time Allotted : 3 Hours Full Marks : 70 GROUP A. (Multiple Choice Type Question) CS/B.TECH/CSE(New)/SEM-5/CS-504D/2013-14 2013 OBJECT ORIENTED PROGRAMMING Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks. Candidates are required to give their answers

More information

COS 226 Algorithms and Data Structures Week 3: Comparators, & Sorting (Video 5.D & Algorithms 2.1 and 2.2)

COS 226 Algorithms and Data Structures Week 3: Comparators, & Sorting (Video 5.D & Algorithms 2.1 and 2.2) COS 226 Algorithms & Data Structures p. 1/6 COS 226 Algorithms and Data Structures Week 3: Comparators, & Sorting (Video 5.D & Algorithms 2.1 and 2.2) Version: September 28, 2017 Exercise 1 Comparables

More information

CS 455 Midterm Exam 1 Spring 2013 [Bono] Feb. 21, 2013

CS 455 Midterm Exam 1 Spring 2013 [Bono] Feb. 21, 2013 Name: USC loginid (e.g., ttrojan): CS 455 Midterm Exam 1 Spring 2013 [Bono] Feb. 21, 2013 There are 5 problems on the exam, with 54 points total available. There are 7 pages to the exam, including this

More information

Classes. Classes. Classes. Class Circle with methods. Class Circle with fields. Classes and Objects in Java. Introduce to classes and objects in Java.

Classes. Classes. Classes. Class Circle with methods. Class Circle with fields. Classes and Objects in Java. Introduce to classes and objects in Java. Classes Introduce to classes and objects in Java. Classes and Objects in Java Understand how some of the OO concepts learnt so far are supported in Java. Understand important features in Java classes.

More information

Inheritance and Interfaces

Inheritance and Interfaces Inheritance and Interfaces what is inheritance? examples & Java API examples inheriting a method overriding a method polymorphism Object tostring interfaces Ex: sorting and Comparable interface Inheritance

More information

Computer Science II (20073) Week 1: Review and Inheritance

Computer Science II (20073) Week 1: Review and Inheritance Computer Science II 4003-232-01 (20073) Week 1: Review and Inheritance Richard Zanibbi Rochester Institute of Technology Review of CS-I Hardware and Software Hardware Physical devices in a computer system

More information

Exam Number/Code : 1Z Exam Name: Name: Java Standard Edition 6. Demo. Version : Programmer Certified Professional Exam.

Exam Number/Code : 1Z Exam Name: Name: Java Standard Edition 6. Demo. Version : Programmer Certified Professional Exam. Exam Number/Code : 1Z0-851 Exam Name: Name: Java Standard Edition 6 Programmer Certified Professional Exam Version : Demo http://it-shiken.jp/ QUESTION 1 public class Threads2 implements Runnable { public

More information

Model Solutions. COMP 102: Test May, 2014

Model Solutions. COMP 102: Test May, 2014 Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test

More information

INSTRUCTIONS TO CANDIDATES

INSTRUCTIONS 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 information

CS 455 Final Exam Fall 2012 [Bono] Dec. 17, 2012

CS 455 Final Exam Fall 2012 [Bono] Dec. 17, 2012 Name: USC loginid (e.g., ttrojan): CS 455 Final Exam Fall 2012 [Bono] Dec. 17, 2012 There are 6 problems on the exam, with 70 points total available. There are 7 pages to the exam, including this one;

More information

Final Exam. COMP Summer I June 26, points

Final Exam. COMP Summer I June 26, points Final Exam COMP 14-090 Summer I 2000 June 26, 2000 200 points 1. Closed book and closed notes. No outside material allowed. 2. Write all answers on the test itself. Do not write any answers in a blue book

More information

On Polymorphism and the Open-Closed Principle

On Polymorphism and the Open-Closed Principle Berner Fachhochschule Engineering and Information Technology On Polymorphism and the Open-Closed Principle Prof. Dr. Eric Dubuis Berner Fachhochschule, Engineering and Information Technology @ Biel Course

More information