// Class used to hold a list of Strings interpreted as web site addresses. public class URLList {

Size: px
Start display at page:

Download "// Class used to hold a list of Strings interpreted as web site addresses. public class URLList {"

Transcription

1 Question 1. The analysis of Ethernet performance in the paper by Metcalfe and Boggs makes the simplifying assumption that each computer will transmit during a given slot with probability 1 N where N is the number of stations trying to transmit. In reality, we know that the probability that a station will transmit depends on the number of collisions it has experienced rather than on N. If a computer has experienced K collisions, it chooses a random delay value from the set {0, 1S, 2S,..., (2 K 1)S. Therefore, the probability it transmits in any given slot is 1. 2 K Metcalfe and Boggs make this simplifying assumption in order to obtain a formula that approximates the expected number of slots that will be wasted either by being left idle or because a collision occurs during the slot. Any formula for the expected number of wasted slots that accurately reflects the actual dynamics of the exponential backoff algorithm would be extremely complicated. To appreciate this, we would like you to determine a formula for the expected number of slots that would be wasted in a single round of a very specific collision resolution scenario. Suppose that two computers, A and B, attempt to transmit simultaneously on an idle Ethernet. The process of collision resolution in which they will participate can be divided into rounds. In round 0, both stations transmit immediately and collide. In round 1, they both randomly choose a delay from the set {0, S and transmit after this delay. In this round, the probability of a collision is 1 2. If they collide again in round 1, then they engage in another round (round 2) in which they choose delays from the set {0, S, 2S, 3S. The total number of slots wasted during this process will be the sum of the slots wasted in each round. It is obvious that the maximum number of slots wasted in round K is 2 K. The actual number of slots wasted in a given round, however, depends on the random delays selected. For example, in round 1, there are four equally likely outcomes. Station A may choose delay 0 while station B chooses S. In this case, A will immediately transmit successfully and no slots will be wasted.. Similarly, if B chooses delay 0 and A chooses S, no slots will be wasted. On the other hand, if both A and B choose 0, they will both transmit immediately and collide. After this collision, they will both move on to round 2 immediately, so round 1 will only waste 1 slot. On the other hand, if the both choose a delay of S, one slot will be wasted by being left idle and another slot will be wasted due to collision. To compute the expected number of slots wasted in round 1, we simply sum the number of slots wasted in each of the four possible outcomes time the probability of each outcome ( 1 4 ) to obtain: = 3 4 That is, the expected number of slots that will be wasted during round 1 will be 3 4. Assuming that A and B do collide during round 1 and move on to round 2, determine the expected number of slots that will be wasted during round 2. Justify your answer. Question 2. The code for most of the URLList class we discussed in class is shown below. // Class used to hold a list of Strings interpreted as web site addresses. public class URLList { private boolean isempty = false; // true if nothing in list private String firstsite; // The first web site in the list private URLList restofsites; // The rest of the list of web sites // Create an empty list public URLList( ) { isempty = true; // Create a larger list from a new website and an existing list public URLList( String newsite, URLList existinglist ) { firstsite = newsite; restofsites = existinglist; 1

2 // determines whether the collection contains a given entry public boolean contains( String site ) { if ( isempty ) { else if ( firstsite.equals( site ) ) { return true; else { return restofsites.contains( site );... // a few other methods we do not care about in this question... For this question, we want you to consider several alternative definitions for contains that might have been used in this class. For each alternative, indicate whether it would i) work fine, ii) work, but not as efficiently as the original, iii) compile but not work correctly, or iv) not even compile. Briefly explain your answer. Hint: Although URLList is certainly an example of a recursive class, dont panic. This question is more about if statements than about recursive classes. a) public boolean contains( String site ) { if ( firstsite.equals( site ) ) { return true; else if ( isempty ) { else { return restofsites.contains( site ); b) public boolean contains( String site ) { if ( isempty ) { else if (! restofsites.contains( site ) ) { return firstsite.equals( site ); else { return true; c) public boolean contains( String site ) { return!isempty && ( firstsite.equals(site) restofsites.contains(site) ); d) public boolean contains( String site ) { if ( isempty ) { else if (! firstsite.equals( site ) ) { return restofsites.contains( site ); Question 3. On the following two pages, you will find definitions of two classes that could be used in the Java IM clients you constructed in labs 4 and 5. The first is a definition of a ChatWindow class. It should look very similar 2

3 to what you used in lab. The second class is named TOCSendIMPacket. It is not quite complete. It is missing the declarations of its instance variables, local variables, and formal parameters. For this problem, we want you to add the missing declarations. We have placed shaded bubbles at all the points in the code where the missing declarations could go. You will not need to fill in all of the bubbles we have provided, but you should not need to place declarations anywhere outside these bubbles. Each name should be declared as locally as possible. That is, if the program would work if a given name was declared either as a local variable or an instance variable, then you should declare it as a local variable. The names for which declarations must be provided are: destination buddysname message messageinhtml lesspos greaterpos original updated You should be able to complete this problem without fully understanding what the classes do, but to help you out, we provide the following explanation. The TOCSendIMPacket constructor expects parameter values that specify the essential details required to send an IM message, the screen name of the person the message should be sent to and the text of the message. The tostring method associated with the class then returns the packet that should be sent to the AOL server. That is, if you created a TOCSendIMPacket by saying packet = new TOCSendIMPacket( thommurtagh, Hi Tom ); you could later sent the appropriate text to the server by saying toserver.out.printpacket( packet.tostring() ); Real IM clients encode the messages they send in HTML. The programs you created in lab did not do this. The TOCSendIMPacket fixes this by adding some simple HTML to the messages being sent. It adds html body to the beginning of each message and /body /html to the end. In addition, if any less than signs were included as part of the original message, they are replaced by the characters HTML uses to encode less than signs, <. Similarly, any greater than signs are replaced by >. As a result, if you created a TOCSendIMPacket by saying packet = new TOCSendIMPacket( thommurtagh, Hi >Tom< ); and then later said String text = packet.tostring(); the variable text would be associated with the String: toc2_send_im thommurtagh <html><body>hi >Tom<</body></html> 3

4 import TOCtools.*; import squint.*; import javax.swing.*; public class ChatWindow extends GUIManager { private final int WINDOW_WIDTH = 550, WINDOW_HEIGHT = 350; // Dimensions of GUI components for text private final int TEXT_WIDTH = 40; private final int TEXT_AREA_HEIGHT = 15; // Area used to display IM messages (and other messages send by server) private JTextArea dialogue = new JTextArea( TEXT_AREA_HEIGHT, TEXT_WIDTH ); // The connection to the server private FLAPConnection toaol; // Field used to enter messages private JTextField message = new JTextField( TEXT_WIDTH - 10 ); // Buddy s name private String buddy; // User s name private String user; // Create a new chat window public ChatWindow(String screenname, String buddyname, FLAPConnection connection ) { this.createwindow( WINDOW_WIDTH, WINDOW_HEIGHT, buddyname ); buddy = buddyname; user = screenname; toaol = connection; dialogue.seteditable( false ); contentpane.add( new JScrollPane( dialogue ) ); contentpane.add( new JLabel( "Message: " ) ); contentpane.add( message ); // Send a message to the window s buddy public void textentered( ) { TOCServerPacket packet; dialogue.append( user + ": " + message.gettext() + "\n" ); packet = new TOCSendIMPacket( buddy, message.gettext() ); toaol.sendflapdata( packet.tostring() ); // Display a message received from the buddy public void messagereceived( String message ) { dialogue.append( buddy + ": " + message + "\n" ); 4

5 public class TOCSendIMPacket { // Create a new packet public TOCSendIMPacket( ) { destination = buddysname; messageinhtml = addhtml( message ); // Return the packet in text form public String tostring( ) { return "toc2_send_im " + destination + " \"" + messageinhtml + "\""; // Place HTML tags around the message body and replace and < and > in the orignal // message with the HTML sequences used to encode them ( < and >). private String addhtml( ) { // Look for the first < and > signs lesspos = original.indexof( "<" ); greaterpos = original.indexof( ">" ); updated = ""; while ( lesspos!= -1 greaterpos!= -1 ) { // Replace the first < or > found if ( lesspos!= -1 && (lesspos<greaterpos greaterpos == -1) ) { // a < was found before any > updated = updated + original.substring(0, lesspos ) + "<"; original = original.substring( lesspos + 1 ); else { // a > was found before any < updated = updated + original.substring(0, greaterpos ) + ">"; original = original.substring( greaterpos + 1 ); // Look for the first remaining < and > signs lesspos = original.indexof( "<" ); greaterpos = original.indexof( ">" ); // Add the tags to indicate the beginning and end of the HTML for the message return "<html><body>" + updated + original + "</html></body>"; 5

6 6

CS 134 Midterm Fall 2009

CS 134 Midterm Fall 2009 CS 34 Midterm Fall 29 This is a closed book exam. You have 9 minutes to complete the exam. There are 5 questions on this examination. The point values for the questions are shown in the table below. Your

More information

CS 134 Midterm Solutions Fall 2009

CS 134 Midterm Solutions Fall 2009 CS 34 Midterm Solutions Fall 29 This is a closed book exam. You have 9 minutes to complete the exam. There are 5 questions on this examination. The point values for the questions are shown in the table

More information

CS 134 Midterm Fall 2006

CS 134 Midterm Fall 2006 CS 34 Midterm Fall 26 This is a closed book exam. You have 5 minutes to complete the exam. There are 5 questions on this examination. The point values for the questions are shown in the table below. Your

More information

CS 134 Midterm Solutions Spring 2013

CS 134 Midterm Solutions Spring 2013 CS 134 Midterm Solutions Spring 2013 This is a closed book exam. You have 75 minutes to complete the exam. There are 5 questions on this examination. The point values for the questions are shown in the

More information

Lab 5 TOC to Me. Class Structure. IM Client Implementation --- Part 2 Due: 23:00 Monday 13 October. CS 150, Profs. Lawson and Szajda Fall 2008

Lab 5 TOC to Me. Class Structure. IM Client Implementation --- Part 2 Due: 23:00 Monday 13 October. CS 150, Profs. Lawson and Szajda Fall 2008 Lab 5 TOC to Me IM Client Implementation --- Part 2 Due: 23:00 Monday 13 October In this week s lab we will finish work on the IM client programs you started in the last lab. You will add one significant

More information

CS 134 Midterm Spring 2013

CS 134 Midterm Spring 2013 CS 134 Midterm Spring 2013 This is a closed book exam. You have 75 minutes to complete the exam. There are 5 questions on this examination. The point values for the questions are shown in the table below.

More information

A set, collection, group, or configuration containing members regarded as having certain attributes or traits in common.

A set, collection, group, or configuration containing members regarded as having certain attributes or traits in common. Chapter 6 Class Action In Chapter 1, we explained that Java uses the word class to refer to A set, collection, group, or configuration containing members regarded as having certain attributes or traits

More information

CS 134 Midterm Fall 2006

CS 134 Midterm Fall 2006 CS 134 Midterm Fall 2006 This is a closed book exam. You have 50 minutes to complete the exam. There are 5 questions on this examination. The point values for the questions are shown in the table below.

More information

Lab 5 TOC to Me. IM Client Implementation --- Part 2

Lab 5 TOC to Me. IM Client Implementation --- Part 2 Lab 5 TOC to Me IM Client Implementation --- Part 2 In this week s lab we will finish work on the IM client programs from the last lab. The primary goals are: to use multiple windows to manage more than

More information

Lab 5 Classy Chat. XMPP Client Implementation --- Part 2 Due Oct. 19 at 11PM

Lab 5 Classy Chat. XMPP Client Implementation --- Part 2 Due Oct. 19 at 11PM Lab 5 Classy Chat XMPP Client Implementation --- Part 2 Due Oct. 19 at 11PM In this week s lab we will finish work on the chat client programs from the last lab. The primary goals are: to use multiple

More information

Probing Questions. Chapter Accessor Methods

Probing Questions. Chapter Accessor Methods Chapter 3 Probing Questions In the preceding chapter, we learned how to give commands in Java. Using method invocations, you can now write programs that create GUI components and then command them to change

More information

Final Examination --- SAMPLE SOLUTIONS May

Final Examination --- SAMPLE SOLUTIONS May CS 134 Spring 2010 Final Examination --- SAMPLE SOLUTIONS May 19. 2010 This is a closed book exam. You have 150 minutes to complete the exam. There are 7 questions in total, and the point values for the

More information

Final Examination May

Final Examination May CS 134 Spring 2010 Final Examination May 19. 2010 This is a closed book exam. You have 150 minutes to complete the exam. There are 6 questions on this examination. The point values for the questions are

More information

Programming Project. Remember the Titans

Programming Project. Remember the Titans Programming Project Remember the Titans Due: Data and reports due 12/10 & 12/11 (code due 12/7) In the paper Measured Capacity of an Ethernet: Myths and Reality, David Boggs, Jeff Mogul and Chris Kent

More information

Postfix Notation is a notation in which the operator follows its operands in the expression (e.g ).

Postfix Notation is a notation in which the operator follows its operands in the expression (e.g ). Assignment 5 Introduction For this assignment, you will write classes to evaluate arithmetic expressions represented as text. For example, the string "1 2 ( * 4)" would evaluate to 15. This process will

More information

CS 209 Spring, 2006 Lab 8: GUI Development Instructor: J.G. Neal

CS 209 Spring, 2006 Lab 8: GUI Development Instructor: J.G. Neal CS 209 Spring, 2006 Lab 8: GUI Development Instructor: J.G. Neal Objectives: To gain experience with the programming of: 1. Graphical user interfaces (GUIs), 2. GUI components, and 3. Event handling (required

More information

Midterm Programming Project Encryption for IM Client

Midterm Programming Project Encryption for IM Client 1 CS 334 Computer Security Fall 2008 Midterm Programming Project Encryption for IM Client Assigned: October 24 Due: Monday, November 17, 11:59:59pm 1 Introduction In this project, you will take a functioning

More information

CS 112 Introduction to Computing II. Wayne Snyder Computer Science Department Boston University

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

Assignment3 CS206 Intro to Data Structures Fall Part 1 (50 pts) due: October 13, :59pm Part 2 (150 pts) due: October 20, :59pm

Assignment3 CS206 Intro to Data Structures Fall Part 1 (50 pts) due: October 13, :59pm Part 2 (150 pts) due: October 20, :59pm Part 1 (50 pts) due: October 13, 2013 11:59pm Part 2 (150 pts) due: October 20, 2013 11:59pm Important Notes This assignment is to be done on your own. If you need help, see the instructor or TA. Please

More information

You Can Make a Difference! Due April 11/12 (Implementation plans due in class on 4/9)

You Can Make a Difference! Due April 11/12 (Implementation plans due in class on 4/9) You Can Make a Difference! Due April 11/12 (Implementation plans due in class on 4/9) In last week s lab, we introduced some of the basic mechanisms used to manipulate images in Java programs. Now, we

More information

DEMYSTIFYING PROGRAMMING: CHAPTER SIX METHODS (TOC DETAILED) CHAPTER SIX: METHODS 1

DEMYSTIFYING PROGRAMMING: CHAPTER SIX METHODS (TOC DETAILED) CHAPTER SIX: METHODS 1 DEMYSTIFYING PROGRAMMING: CHAPTER SIX METHODS (TOC DETAILED) CHAPTER SIX: METHODS 1 Objectives 1 6.1 Methods 1 void or return 1 Parameters 1 Invocation 1 Pass by value 1 6.2 GUI 2 JButton 2 6.3 Patterns

More information

Assignment 5. Introduction

Assignment 5. Introduction Assignment 5 Introduction The objectives of this assignment are to exercise a few advanced object oriented programming and basic data structures concepts. The first mini-goal is to understand that objects

More information

Documenting Advanced Programming Techniques

Documenting Advanced Programming Techniques Documenting Advanced Programming Techniques https://no.wikipedia.org/wiki/tastatur#/media/file:computer_keyboard.png Prof. Dr. Bernhard Humm FB Informatik, Hochschule Darmstadt 1 Agenda 1. Documenting

More information

CIS 120 Midterm II November 8, 2013 SOLUTIONS

CIS 120 Midterm II November 8, 2013 SOLUTIONS CIS 120 Midterm II November 8, 2013 SOLUTIONS 1 1. Facts about OCaml and Java (15 points) For each part, circle true or false. a. T F The.equals method in Java is roughly similar to OCaml s = operator.

More information

Chapter 4 Defining Classes I

Chapter 4 Defining Classes I Chapter 4 Defining Classes I This chapter introduces the idea that students can create their own classes and therefore their own objects. Introduced is the idea of methods and instance variables as the

More information

Object-Oriented Design Lecture 3 CSU 370 Fall 2007 (Pucella) Friday, Sep 14, 2007

Object-Oriented Design Lecture 3 CSU 370 Fall 2007 (Pucella) Friday, Sep 14, 2007 Object-Oriented Design Lecture 3 CSU 370 Fall 2007 (Pucella) Friday, Sep 14, 2007 Java We will be programming in Java in this course. Partly because it is a reasonable language, and partly because you

More information

Page 1 of 7. public class EmployeeAryAppletEx extends JApplet

Page 1 of 7. public class EmployeeAryAppletEx extends JApplet CS 209 Spring, 2006 Lab 9: Applets Instructor: J.G. Neal Objectives: To gain experience with: 1. Programming Java applets and the HTML page within which an applet is embedded. 2. The passing of parameters

More information

16 Multiple Inheritance and Extending ADTs

16 Multiple Inheritance and Extending ADTs Object-Oriented Design Lecture 16 CS 3500 Fall 2009 (Pucella) Tuesday, Nov 10, 2009 16 Multiple Inheritance and Extending ADTs We looked last time at inheritance and delegation as two ways to reuse implementation

More information

CIS 120 Midterm II November 8, Name (printed): Pennkey (login id):

CIS 120 Midterm II November 8, Name (printed): Pennkey (login id): CIS 120 Midterm II November 8, 2013 Name (printed): Pennkey (login id): My signature below certifies that I have complied with the University of Pennsylvania s Code of Academic Integrity in completing

More information

CS171 Midterm Exam. October 29, Name:

CS171 Midterm Exam. October 29, Name: CS171 Midterm Exam October 29, 2012 Name: You are to honor the Emory Honor Code. This is a closed-book and closed-notes exam. You have 50 minutes to complete this exam. Read each problem carefully, and

More information

3.Constructors and Destructors. Develop cpp program to implement constructor and destructor.

3.Constructors and Destructors. Develop cpp program to implement constructor and destructor. 3.Constructors and Destructors Develop cpp program to implement constructor and destructor. Constructors A constructor is a special member function whose task is to initialize the objects of its class.

More information

CS 3114 Data Structures and Algorithms READ THIS NOW!

CS 3114 Data Structures and Algorithms READ THIS NOW! READ THIS NOW! Print your name in the space provided below. There are 7 short-answer questions, priced as marked. The maximum score is 100. This examination is closed book and closed notes, aside from

More information

CSIS 10B Lab 2 Bags and Stacks

CSIS 10B Lab 2 Bags and Stacks CSIS 10B Lab 2 Bags and Stacks Part A Bags and Inheritance In this part of the lab we will be exploring the use of the Bag ADT to manage quantities of data of a certain generic type (listed as T in the

More information

Computing Science 114 Solutions to Midterm Examination Tuesday October 19, In Questions 1 20, Circle EXACTLY ONE choice as the best answer

Computing Science 114 Solutions to Midterm Examination Tuesday October 19, In Questions 1 20, Circle EXACTLY ONE choice as the best answer Computing Science 114 Solutions to Midterm Examination Tuesday October 19, 2004 INSTRUCTOR: I E LEONARD TIME: 50 MINUTES In Questions 1 20, Circle EXACTLY ONE choice as the best answer 1 [2 pts] What company

More information

CS 151. Linked Lists, Recursively Implemented. Wednesday, October 3, 12

CS 151. Linked Lists, Recursively Implemented. Wednesday, October 3, 12 CS 151 Linked Lists, Recursively Implemented 1 2 Linked Lists, Revisited Recall that a linked list is a structure that represents a sequence of elements that are stored non-contiguously in memory. We can

More information

CS 3360 Design and Implementation of Programming Languages. Exam 1

CS 3360 Design and Implementation of Programming Languages. Exam 1 1 Spring 2017 (Thursday, March 9) Name: CS 3360 Design and Implementation of Programming Languages Exam 1 This test has 8 questions and pages numbered 1 through 7. Reminders This test is closed-notes and

More information

CMSC 150 Lab 8, Part II: Little PhotoShop of Horrors, Part Deux 10 Nov 2015

CMSC 150 Lab 8, Part II: Little PhotoShop of Horrors, Part Deux 10 Nov 2015 CMSC 150 Lab 8, Part II: Little PhotoShop of Horrors, Part Deux 10 Nov 2015 By now you should have completed the Open/Save/Quit portion of the menu options. Today we are going to finish implementing the

More information

Midterm Test II Object Oriented Programming in Java Computer Science, University of Windsor Fall 2014 Time 2 hours. Answer all questions

Midterm Test II Object Oriented Programming in Java Computer Science, University of Windsor Fall 2014 Time 2 hours. Answer all questions Midterm Test II 60-212 Object Oriented Programming in Java Computer Science, University of Windsor Fall 2014 Time 2 hours Answer all questions Name : Student Id # : Only an unmarked copy of a textbook

More information

Overview. Lecture 7: Inheritance and GUIs. Inheritance. Example 9/30/2008

Overview. Lecture 7: Inheritance and GUIs. Inheritance. Example 9/30/2008 Overview Lecture 7: Inheritance and GUIs Written by: Daniel Dalevi Inheritance Subclasses and superclasses Java keywords Interfaces and inheritance The JComponent class Casting The cosmic superclass Object

More information

Due: 9 February 2017 at 1159pm (2359, Pacific Standard Time)

Due: 9 February 2017 at 1159pm (2359, Pacific Standard Time) CSE 11 Winter 2017 Program Assignment #2 (100 points) START EARLY! Due: 9 February 2017 at 1159pm (2359, Pacific Standard Time) PROGRAM #2: DoubleArray11 READ THE ENTIRE ASSIGNMENT BEFORE STARTING In lecture,

More information

Proctors are unable to respond to queries about the interpretation of exam questions. Do your best to answer exam questions as written.

Proctors are unable to respond to queries about the interpretation of exam questions. Do your best to answer exam questions as written. HAND IN Answers Are Recorded on Question Paper QUEEN'S UNIVERSITY SCHOOL OF COMPUTING CISC124, WINTER TERM, 2009 FINAL EXAMINATION 7pm to 10pm, 18 APRIL 2009, Dunning Hall Instructor: Alan McLeod If the

More information

CMSC131. Inheritance. Object. When we talked about Object, I mentioned that all Java classes are "built" on top of that.

CMSC131. Inheritance. Object. When we talked about Object, I mentioned that all Java classes are built on top of that. CMSC131 Inheritance Object When we talked about Object, I mentioned that all Java classes are "built" on top of that. This came up when talking about the Java standard equals operator: boolean equals(object

More information

Model answers/marking scheme in bold, additional comments in bold italic.

Model answers/marking scheme in bold, additional comments in bold italic. COMP19612 2011 exam performance feedback Model answers/marking scheme in bold, additional comments in bold italic. Question 2 Only a couple of people did this and neither were close to the right answers.

More information

Graphics User Defined Forms, Part I

Graphics User Defined Forms, Part I Graphics User Defined Forms, Part I Quick Start Compile step once always mkdir labs javac PropertyTax5.java cd labs mkdir 5 Execute step cd 5 java PropertyTax5 cp /samples/csc/156/labs/5/*. cp PropertyTax1.java

More information

Birkbeck (University of London) Software and Programming 1 In-class Test Mar 2018

Birkbeck (University of London) Software and Programming 1 In-class Test Mar 2018 Birkbeck (University of London) Software and Programming 1 In-class Test 2.1 22 Mar 2018 Student Name Student Number Answer ALL Questions 1. What output is produced when the following Java program fragment

More information

ECE 4450:427/527 - Computer Networks Spring 2017

ECE 4450:427/527 - Computer Networks Spring 2017 ECE 4450:427/527 - Computer Networks Spring 2017 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 5.4: Multiple Access Protocols Dr. Nghi Tran (ECE-University of Akron) ECE 4450:427/527

More information

All code must follow best practices. Part (but not all) of this is adhering to the following guidelines:

All code must follow best practices. Part (but not all) of this is adhering to the following guidelines: Java Coding Guidelines Version 1.3.2 All code must follow best practices. Part (but not all) of this is adhering to the following guidelines: Development For code development, I recommend the following

More information

Guessing Game with Objects

Guessing Game with Objects Objectives Lab1: Guessing Game with Objects Guessing Game with Objects 1. Practice designing and implementing an object-oriented program. 2. Use Console I/O in Java. Tasks 1. Design the program (problem

More information

Networking Technologies and Applications

Networking Technologies and Applications Networking Technologies and Applications Rolland Vida BME TMIT September 23, 2016 Aloha Advantages: Different size packets No need for synchronization Simple operation If low upstream traffic, the solution

More information

Software Testing Prof. Meenakshi D Souza Department of Computer Science and Engineering International Institute of Information Technology, Bangalore

Software Testing Prof. Meenakshi D Souza Department of Computer Science and Engineering International Institute of Information Technology, Bangalore Software Testing Prof. Meenakshi D Souza Department of Computer Science and Engineering International Institute of Information Technology, Bangalore Lecture 04 Software Test Automation: JUnit as an example

More information

College of Computer and Information Sciences Department of Computer Engineering CEN444 Computer Networks Midterm 2 Exam Second Semester 1434/1435

College of Computer and Information Sciences Department of Computer Engineering CEN444 Computer Networks Midterm 2 Exam Second Semester 1434/1435 College of Computer and Information Sciences Department of Computer Engineering CEN444 Computer Networks Midterm 2 Exam Second Semester 1434/1435 Student Name ID Time Allowed: 2.0 Hours. Closed Book, Closed

More information

AP Computer Science Chapter 10 Implementing and Using Classes Study Guide

AP Computer Science Chapter 10 Implementing and Using Classes Study Guide AP Computer Science Chapter 10 Implementing and Using Classes Study Guide 1. A class that uses a given class X is called a client of X. 2. Private features of a class can be directly accessed only within

More information

PROGRAMMING FUNDAMENTALS

PROGRAMMING FUNDAMENTALS PROGRAMMING FUNDAMENTALS Q1. Name any two Object Oriented Programming languages? Q2. Why is java called a platform independent language? Q3. Elaborate the java Compilation process. Q4. Why do we write

More information

Fall 2017 Mentoring 9: October 23, Min-Heapify This. Level order, bubbling up. Level order, bubbling down. Reverse level order, bubbling up

Fall 2017 Mentoring 9: October 23, Min-Heapify This. Level order, bubbling up. Level order, bubbling down. Reverse level order, bubbling up CSM B Heaps & Hashing Fall 0 Mentoring : October 3, 0 Min-Heapify This. In general, there are 4 ways to heapify. Which ways actually work? Level order, bubbling up Level order, bubbling down Reverse level

More information

Definition of DJ (Diminished Java)

Definition of DJ (Diminished Java) Definition of DJ (Diminished Java) version 0.5 Jay Ligatti 1 Introduction DJ is a small programming language similar to Java. DJ has been designed to try to satisfy two opposing goals: 1. DJ is a complete

More information

CSCI 1301: Introduction to Computing and Programming

CSCI 1301: Introduction to Computing and Programming This lab is not meant to be completed in a single lab period - it is broken up into two parts and there are two files to submit. Please complete part 1 before going to part 2. Part 1 Introduction In this

More information

CS 314 Exam 2 Spring

CS 314 Exam 2 Spring Points off 1 2 3 4 5 Total off CS 314 Exam 2 Spring 2017 Your Name Your UTEID Instructions: 1. There are 5 questions on this test. 100 points available. Scores will be scaled to 200 points. 2. You have

More information

Tips from the experts: How to waste a lot of time on this assignment

Tips from the experts: How to waste a lot of time on this assignment Com S 227 Spring 2018 Assignment 1 100 points Due Date: Friday, September 14, 11:59 pm (midnight) Late deadline (25% penalty): Monday, September 17, 11:59 pm General information This assignment is to be

More information

Multiple Access Protocols

Multiple Access Protocols Multiple Access Protocols Computer Networks Lecture 2 http://goo.gl/pze5o8 Multiple Access to a Shared Channel The medium (or its sub-channel) may be shared by multiple stations (dynamic allocation) just

More information

CMP 326 Midterm Fall 2015

CMP 326 Midterm Fall 2015 CMP 326 Midterm Fall 2015 Name: 1) (30 points; 5 points each) Write the output of each piece of code. If the code gives an error, write any output that would happen before the error, and then write ERROR.

More information

Introduction to Software Development (ISD) Week 3

Introduction to Software Development (ISD) Week 3 Introduction to Software Development (ISD) Week 3 Autumn term 2012 Aims of Week 3 To learn about while, for, and do loops To understand and use nested loops To implement programs that read and process

More information

Assignment 4 Publication date: 27/12/2015 Submission date: 17/01/ :59 People in-charge: R. Mairon and Y. Twitto

Assignment 4 Publication date: 27/12/2015 Submission date: 17/01/ :59 People in-charge: R. Mairon and Y. Twitto Assignment 4 Publication date: 27/12/2015 Submission date: 17/01/2016 23:59 People in-charge: R. Mairon and Y. Twitto Introduction The objectives of this assignment are to exercise a few advanced object

More information

Queues. CITS2200 Data Structures and Algorithms. Topic 5

Queues. CITS2200 Data Structures and Algorithms. Topic 5 CITS2200 Data Structures and Algorithms Topic 5 Queues Implementations of the Queue ADT Queue specification Queue interface Block (array) representations of queues Recursive (linked) representations of

More information

Ethernet. Introduction. CSE 3213 Fall 2011

Ethernet. Introduction. CSE 3213 Fall 2011 Ethernet CSE 3213 Fall 2011 19 October 2011 1 Introduction Rapid changes in technology designs Broader use of LANs New schemes for high-speed LANs High-speed LAN technologies: Fast and gigabit Ethernet

More information

Java Programming Lecture 7

Java Programming Lecture 7 Java Programming Lecture 7 Alice E. Fischer Feb 16, 2015 Java Programming - L7... 1/16 Class Derivation Interfaces Examples Java Programming - L7... 2/16 Purpose of Derivation Class derivation is used

More information

ext Total Score /20 /20 /15 /20 /25 /5 Grader

ext Total Score /20 /20 /15 /20 /25 /5 Grader NAME: NETID: CS2110 Fall 2013 Prelim 2 November 21, 2013 Write your name and Cornell netid. There are 5 questions plus one extra-credit question on 10 numbered pages. Check now that you have all the pages.

More information

Switched LANs A Set of Local Area Networks Interconnected by Switches

Switched LANs A Set of Local Area Networks Interconnected by Switches Switched LANs A Set of Local Area Networks Interconnected by Switches Objective This lab is designed to demonstrate the implementation of switched local area networks. The simulation in this lab will help

More information

King Fahd University of Petroleum and Minerals College of Computer Sciences and Engineering Department of Computer Engineering

King Fahd University of Petroleum and Minerals College of Computer Sciences and Engineering Department of Computer Engineering Student Name: Section #: King Fahd University of Petroleum and Minerals College of Computer Sciences and Engineering Department of Computer Engineering COE 344 Computer Networks (T072) Final Exam Date

More information

Boolean Expressions and if 9/14/2007

Boolean Expressions and if 9/14/2007 Boolean Expressions and if 9/14/2007 1 Opening Discussion Do you have any questions about the quiz? Let's look at solutions to the interclass problem. Minute essay questions. What functions will we be

More information

CSCI Lab 9 Implementing and Using a Binary Search Tree (BST)

CSCI Lab 9 Implementing and Using a Binary Search Tree (BST) CSCI Lab 9 Implementing and Using a Binary Search Tree (BST) Preliminaries In this lab you will implement a binary search tree and use it in the WorkerManager program from Lab 3. Start by copying this

More information

SINGLE EVENT HANDLING

SINGLE EVENT HANDLING SINGLE EVENT HANDLING Event handling is the process of responding to asynchronous events as they occur during the program run. An event is an action that occurs externally to your program and to which

More information

Programming Problems 22nd Annual Computer Science Programming Contest

Programming Problems 22nd Annual Computer Science Programming Contest Programming Problems 22nd Annual Computer Science Programming Contest Department of Mathematics and Computer Science Western Carolina University 5 April 2011 Problem One: Add Times Represent a time by

More information

Chapter 13 Lab Advanced GUI Applications

Chapter 13 Lab Advanced GUI Applications Gaddis_516907_Java 4/10/07 2:10 PM Page 113 Chapter 13 Lab Advanced GUI Applications Objectives Be able to add a menu to the menu bar Be able to use nested menus Be able to add scroll bars, giving the

More information

First Name: AITI 2004: Exam 2 July 19, 2004

First Name: AITI 2004: Exam 2 July 19, 2004 First Name: AITI 2004: Exam 2 July 19, 2004 Last Name: Standard Track Read Instructions Carefully! This is a 3 hour closed book exam. No calculators are allowed. Please write clearly if we cannot understand

More information

Networking. Melissa Winstanley

Networking. Melissa Winstanley Networking Melissa Winstanley mwinst@cs.washington.edu What is a computer network? "A collection of autonomous computers interconnected by a single technology" Can exchange information Many different technologies

More information

Subclassing for ADTs Implementation

Subclassing for ADTs Implementation Object-Oriented Design Lecture 8 CS 3500 Fall 2009 (Pucella) Tuesday, Oct 6, 2009 Subclassing for ADTs Implementation An interesting use of subclassing is to implement some forms of ADTs more cleanly,

More information

CS 1316 Exam 1 Summer 2009

CS 1316 Exam 1 Summer 2009 1 / 8 Your Name: I commit to uphold the ideals of honor and integrity by refusing to betray the trust bestowed upon me as a member of the Georgia Tech community. CS 1316 Exam 1 Summer 2009 Section/Problem

More information

Discrete Structures Lecture 14

Discrete Structures Lecture 14 Introduction Instead of closely following our text in chapter 3, we take a different approach based on the industrial experience of your instructor. First, we narrow the application of algorithms to algorithms

More information

FINALTERM EXAMINATION Fall 2009 CS301- Data Structures Question No: 1 ( Marks: 1 ) - Please choose one The data of the problem is of 2GB and the hard

FINALTERM EXAMINATION Fall 2009 CS301- Data Structures Question No: 1 ( Marks: 1 ) - Please choose one The data of the problem is of 2GB and the hard FINALTERM EXAMINATION Fall 2009 CS301- Data Structures Question No: 1 The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should Use better data structures

More information

Collections, Maps and Generics

Collections, Maps and Generics Collections API Collections, Maps and Generics You've already used ArrayList for exercises from the previous semester, but ArrayList is just one part of much larger Collections API that Java provides.

More information

INCORPORATING ADVANCED PROGRAMMING TECHNIQUES IN THE COMPUTER INFORMATION SYSTEMS CURRICULUM

INCORPORATING ADVANCED PROGRAMMING TECHNIQUES IN THE COMPUTER INFORMATION SYSTEMS CURRICULUM INCORPORATING ADVANCED PROGRAMMING TECHNIQUES IN THE COMPUTER INFORMATION SYSTEMS CURRICULUM Charles S. Saxon, Eastern Michigan University, charles.saxon@emich.edu ABSTRACT Incorporating advanced programming

More information

Table of Contents Date(s) Title/Topic Page #s. Chapter 4: Writing Classes 4.1 Objects Revisited

Table of Contents Date(s) Title/Topic Page #s. Chapter 4: Writing Classes 4.1 Objects Revisited Table of Contents Date(s) Title/Topic Page #s 11/6 Chapter 3 Reflection/Corrections 56 Chapter 4: Writing Classes 4.1 Objects Revisited 57 58-59 look over your Ch 3 Tests and write down comments/ reflections/corrections

More information

Final Examination Semester 3 / Year 2008

Final Examination Semester 3 / Year 2008 Southern College Kolej Selatan 南方学院 Final Examination Semester 3 / Year 2008 COURSE : JAVA PROGRAMMING COURSE CODE : PROG1114 TIME : 2 1/2 HOURS DEPARTMENT : COMPUTER SCIENCE CLASS : CS08-A + CS08-B LECTURER

More information

COMP19612 exam performance feedback 2014

COMP19612 exam performance feedback 2014 COMP19612 exam performance feedback 2014 (excluding section A which is multiple choice) Questions in plain font, original marking scheme in bold, additional comments in bold italic. Question 1 The students

More information

LAN PROTOCOLS. Beulah A AP/CSE

LAN PROTOCOLS. Beulah A AP/CSE LAN PROTOCOLS Beulah A AP/CSE IEEE STANDARDS In 1985, the Computer Society of the IEEE started a project, called Project 802, to set standards to enable intercommunication among equipment from a variety

More information

Points Missed on Page page 1 of 8

Points Missed on Page page 1 of 8 Midterm II - CSE11 Fall 2013 CLOSED BOOK, CLOSED NOTES 50 minutes, 100 points Total. Name: ID: Problem #1 (8 points) Rewrite the following code segment using a for loop instead of a while loop (that is

More information

12/22/11. Java How to Program, 9/e. public must be stored in a file that has the same name as the class and ends with the.java file-name extension.

12/22/11. Java How to Program, 9/e. public must be stored in a file that has the same name as the class and ends with the.java file-name extension. Java How to Program, 9/e Education, Inc. All Rights Reserved. } Covered in this chapter Classes Objects Methods Parameters double primitive type } Create a new class (GradeBook) } Use it to create an object.

More information

Computer Science Engineering Sample Papers

Computer Science Engineering Sample Papers See fro more Material www.computetech-dovari.blogspot.com Computer Science Engineering Sample Papers 1 The order of an internal node in a B+ tree index is the maximum number of children it can have. Suppose

More information

CS 211 Programming Practicum Fall 2018

CS 211 Programming Practicum Fall 2018 Due: Wednesday, 11/7/18 at 11:59 pm Infix Expression Evaluator Programming Project 5 For this lab, write a C++ program that will evaluate an infix expression. The algorithm REQUIRED for this program will

More information

CSE 143 SAMPLE MIDTERM

CSE 143 SAMPLE MIDTERM CSE 143 SAMPLE MIDTERM 1. (5 points) In some methods, you wrote code to check if a certain precondition was held. If the precondition did not hold, then you threw an exception. This leads to robust code

More information

l Determine if a number is odd or even l Determine if a number/character is in a range - 1 to 10 (inclusive) - between a and z (inclusive)

l Determine if a number is odd or even l Determine if a number/character is in a range - 1 to 10 (inclusive) - between a and z (inclusive) Final Exam Exercises Chapters 1-7 + 11 Write C++ code to: l Determine if a number is odd or even CS 2308 Fall 2016 Jill Seaman l Determine if a number/character is in a range - 1 to 10 (inclusive) - between

More information

Data Link Layer, Part 3 Medium Access Control. Preface

Data Link Layer, Part 3 Medium Access Control. Preface Data Link Layer, Part 3 Medium Access Control These slides are created by Dr. Yih Huang of George Mason University. Students registered in Dr. Huang's courses at GMU can make a single machine-readable

More information

Defining Your Own Classes

Defining Your Own Classes Defining Your Own Classes In C, you are allowed to define a struct and then define variables of that struct. But Java allows you to define your own class. This means not only defining the data structure,

More information

CS 2505 Computer Organization I

CS 2505 Computer Organization I Instructions: Print your name in the space provided below. This examination is closed book and closed notes, aside from the permitted one-page formula sheet. No calculators or other computing devices may

More information

ECE 4450:427/527 - Computer Networks Spring 2017

ECE 4450:427/527 - Computer Networks Spring 2017 ECE 4450:427/527 - Computer Networks Spring 2017 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 5.5: Ethernet Dr. Nghi Tran (ECE-University of Akron) ECE 4450:427/527 Computer Networks

More information

Part 3. Why do we need both of them? The object-oriented programming paradigm (OOP) Two kinds of object. Important Special Kinds of Member Function

Part 3. Why do we need both of them? The object-oriented programming paradigm (OOP) Two kinds of object. Important Special Kinds of Member Function Part 3 The object-oriented programming paradigm (OOP) Two kinds of object Value objects The object contains the member data items Allocated automatically just like primitive (built-in) data items Suitable

More information

CS/ENGRD 2110 SPRING Lecture 7: Interfaces and Abstract Classes

CS/ENGRD 2110 SPRING Lecture 7: Interfaces and Abstract Classes CS/ENGRD 2110 SPRING 2019 Lecture 7: Interfaces and Abstract Classes http://courses.cs.cornell.edu/cs2110 1 Announcements 2 A2 is due Thursday night (14 February) Go back to Lecture 6 & discuss method

More information

String Theory. Chapter Cut and Paste

String Theory. Chapter Cut and Paste Chapter 8 String Theory A great deal of the data processed by computer programs is represented as text. Word processors, email programs, and chat clients are primarily concerned with manipulating text.

More information

Introduction to Computer Science II (ITI 1121) Midterm Examination

Introduction to Computer Science II (ITI 1121) Midterm Examination Introduction to Computer Science II (ITI 1121) Midterm Examination Instructor: Marcel Turcotte February 2008, duration: 2 hours Identification Student name: Student number: Signature: Instructions 1. 2.

More information

Networks Homework # 2

Networks Homework # 2 ISLAMIC UNIVERSITY OF GAZA COMPUTER ENGINEERING DEPARTMENT Networks Homework # 2 INSTRUCTIONS: 1. Show your work (i.e., how you derived your answer or the reason behind your thinking) in addition to your

More information