# Problem 1 (1.5 points)

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Leganés, June 17th, 2014 Time: 120 min Systems Programming Extraordinary Call (Problems) Grade: 5 points out of 10 from the exam Problem 1 (1.5 points) City councils apply two types of municipal taxes to buildings. The first one is the IBI (Building Property Tax, in Spanish Impuesto de Bienes Inmuebles ) and the second one is the TRU (Urban Garbage Tax, in Spanish Tasa de Residuos Urbanos ). The city council of our city defines the following interface for calculating these taxes. The IBI tax amount will be calculated by multiplying the area of the building (in square meters) by the BASIC IBI constant. public interface CityCouncilTaxes { static final double BASIC_IBI = 10.0; static final double FACADE_SUPPLEMENT = 20.0; static final double ROOM_SUPPLEMENT = 15.0; double calculateibi (); double calculatetru (); Section 1 (0.3 points) Write the code for the Estate class, which represents every element to which the taxes must be applied (basically, housing and establishments). This class must implement the CityCouncilTaxes interface. Take into account the following requirements: Estate class must have the following attributes. Notice that all attributes are private, except for age, which is protected so that it can be directly accessed from the subclasses without a get method. private String name; protected int age; private double area; // Estate s name // Number of years since the estate was built // Area in square meters The only constructor of the Estate class receives these three data as arguments. The class must implement the calculateibi() method. This method calculates the basic IBI, multiplying the estate area by the BASIC IBI constant defined by the city council. The calculatetru() method must not be implemented in the Estate class because there is not enough information to do it. Therefore, the children classes must be the ones implementing it. Remember that you have to indicate so in the class definition. Section 2 (0.7 points) Write the code for the Housing and Establishment classes, both of them extending the Estate class. Take into account that: Duplicate code or attributes will be penalized. The attributes must be private, except indicated otherwise. The Housing class must inherit the Estate class attributes, and have an additional attribute, called rooms. This attribute is an integer representing the number of rooms in the house.

3 Problem 2 (3.5 points) An -ary tree is a tree that might have among 0 and infinite subtrees. It can be defined through mutual recursion in the following way: An -ary tree contains a datum and a forest. A forest is a queue of -ary trees. The following classes define a -ary tree that uses Strings as data. public class Tree { private String name; private Forest forest; public Tree(String name, Forest forest) { setname(name); setforest(forest); private void setname(string name) { if (name == null) { throw new IllegalArgumentException(); this.name = name; private void setforest(forest forest) { if (forest == null) { throw new IllegalArgumentException(); this.forest = forest; public class Forest implements Queue<Tree> { private Node<Tree> top; private Node<Tree> tail; private int size; public Forest() { top = null; tail = null; size = 0; public boolean isempty() { return (top == null); public int size() { return size; public Tree dequeue() { // assume this method is already coded public interface Queue<E> { boolean isempty(); int size(); void enqueue(e info); E dequeue(); class Node<E> { private E info; private Node<E> next; public Node(E info, Node<E> next) { setinfo(info); setnext(next); public Node<E> getnext() { return next; public E getinfo() { return info; public void setnext(node<e> next) { // assume this method is already coded public void setinfo(e info) { // assume this method is already coded // thrwos an exception if info is null Note: we recommend to solve the following sections in the same order they appear. Note: when solving the following sections, you CANNOT implement nor use any other additional classes or methods than the ones you are asked to implement in each section. Although, you can use the classes and methods mentioned in the initial description of the problem and the ones in the previous sections to the section your are solving.

4 Section 1 (0.75 points) Write the code for the public void enqueue(tree tree) method of the Forest class. If the implementation of this method is not efficient in time, the solution will be penalized with 0.3 points. Section 2 (0.5 points) Write the code for the public boolean isleaf() method in the Tree class. This method must return true if the tree with which the method is invoked is a leaf, or false otherwise. Section 3 (1 point) Write the code for the public static Tree Thor() method in a new Test class. This method must create, build and return the tree describing Durin s descendants, from Thór to Fíli and Kíli, as shown in the following figure: Thór Thráin II Frerin Thorin II Dís Fíli Kíli Section 4 (1.25 points) Implement the public String tostring() method in the Tree class. This method must return the textual representation of the tree data in pre-order, separated by end-of-line characters. In order to solve this section you also must implement the public String tostring() method of the Forest class. For instance, the result of printing the tree shown in the previous figure would be: Thór Thráin II Frerin Thorin II Dís Fíli Kíli Hint: in Java, you can obtain a String with the end-of-line characters by calling the System.lineSeparator() method.

5 Solution to section 1.1 (0.3 points) public abstract class Estate implements CityCouncilTaxes { private String name; protected int age; private double area; public Estate (String name, int age, double area){ this.name = name; this.age = age; this.area = area; public double calculateibi(){ return (area * BASIC_IBI); public abstract double calculatetru(); Solution to section 1.2 (0.7 points) public class Housing extends Estate { private int rooms; public Housing (String name, int age, double area, int rooms){ super(name, age, area); this.rooms = rooms; public double calculateibi() { if(super.age < 10) { return super.calculateibi() * 1.20; else { return super.calculateibi(); public double calculatetru() { return (ROOM_SUPPLEMENT * rooms); public class Establishment extends Estate {

6 private double facadelength; public Establishment (String name, int age, double area, double facadelength) { super(name, age, area); this.facadelength = facadelength; public double calculateibi() { if (super.age < 20) { return super.calculateibi() * 1.10; else { return super.calculateibi(); public double calculatetru() { return (FACADE_SUPPLEMENT * facadelength); Solution to section 1.3 (0.5 points) public static void printaverageibimaxtru(estate data[]) { double sumibi = 0.0; double maxtru = 0.0; for (int i=0; i<data.length; i++) { sumibi += data[i].calculateibi(); if (data[i].calculatetru() > maxtru) { maxtru = data[i].calculatetru(); System.out.println("Average IBI" + (sumibi / data.length)); System.out.println("Maximum TRU" + maxtru);

7 Solution to section 2.1 (0.75 points) public void enqueue(tree tree) { Node<Tree> n = new Node<Tree>(tree, null); if (isempty()) { top = n; else { tail.setnext(n); tail = n; size++; * 0,15 si tienen bien los generics * 0,15 si tienen bien el caso en que la cola está vacía * 0,30 si tienen bien el caso en la cola no está vacía (ignorando si es eficiente o no). * 0,15 si incrementan el tama~no * (-0.15) si tienen mal la signatura del método (por ejemplo, si usan E en vez de Tree) * (-0.30) si tienen mal la construcción del nodo * (-0,30) si recorren la cola para insertar Solution to section 2.2 (0.5 points) public boolean isleaf() { return forest.isempty(); * 0,5 si está bien, 0 en caso contrario.

8 Solution to section 2.3 (1 point) Thór Thráin II Frerin Thorin II Dís Fíli Kíli public class Test { public static Tree Thor() { // Fíli and Kíli Tree fili = new Tree("Fíli", new Forest()); Tree kili = new Tree("Kíli", new Forest()); // Dís Forest forest_dis = new Forest(); forest_dis.enqueue(fili); forest_dis.enqueue(kili); Tree dis = new Tree("Dís", forest_dis); // Frerin and Thorin II Tree frerin = new Tree("Frerin", new Forest()); Tree thorin2 = new Tree("Thorin II", new Forest()); // Thráin II Forest forest_thrain2 = new Forest(); forest_thrain2.enqueue(frerin); forest_thrain2.enqueue(thorin2); forest_thrain2.enqueue(dis); Tree thrain2 = new Tree("Thráin II", forest_thrain2); // Thór Forest forest_thor = new Forest(); forest_thor.enqueue(thrain2); Tree thor = new Tree("Thór", forest_thor); return thor; No importa si no declaran la clase Test. * 0,25 si usan correctamente el constructor de Tree * 0,25 si usan correctamente el constructor de Forest * 0,25 si encolan correctamente los árboles en los bosques # Estos 0,25 se reducen a 0,10 si el órden es el inverso * 0,25 si el árbol que construyen es correcto (las relaciones entre padres e hijos son correctas) * (-0,25) si no retornan el árbol una vez construido * Si usan nulls, como mucho tendrán un 0,25 si todo lo demás está bien.

9 Solution to section 2.4 (1.25 points) // Tree.java public String tostring() { if (isleaf()) { return name + System.lineSeparator(); else { return name + System.lineSeparator() + forest.tostring(); // Forest.java public String tostring() { String retval = new String(); for (Node<Tree> current = top; current!= null; current = current.getnext()) { retval += current.getinfo().tostring(); return retval; * 0,50 si se nota que entienden el concepto de recursión mútua, aunque tengan otras partes del apartado mal. * 0,15 si Tree.toString() es correcta en el caso base (ignorando el uso de EOL) * 0,15 si Tree.toString() es correcta en el caso recursivo (ignorando el uso de EOL) * 0,30 si Forest.toString() es correcta, independientemente si lo resuelven mediante recursión o iteración. # Estos 0,30 se reducen a 0,10 si se dejan el último nodo por recorrer * 0,15 si utilizan y emplazan correctamente el fin de línea. No importa si Tree.toString() está resuleto de forma iterativa usando la cola del enunciado. En ese caso se puntuará con 0,30 si la implementación es correcta (que es justo la suma del caso base y el recursivo si se hace por recursión). No importa si usan un String o un StringBuffer.

### Problem 1 (2.5 points)

Duration: 90 minutes University Carlos III of Madrid Instructions for the exam: Books and notes are not allowed. Please write your name, surname, NIA and group on all pages. Problem 1 (2.5 points) Context:

### DIPLOMADO DE JAVA - OCA

DIPLOMADO DE JAVA - OCA TABLA DE CONTENIDO INTRODUCCION... 3 ESTRUCTURA DEL DIPLOMADO... 4 Nivel I:... 4 Fundamentals of the Java Programming Language Java SE 7... 4 Introducing the Java Technology...

### Algorithms and Data Structures Written Exam Proposed SOLUTION

Algorithms and Data Structures Written Exam Proposed SOLUTION 2005-01-07 from 09:00 to 13:00 Allowed tools: A standard calculator. Grading criteria: You can get at most 30 points. For an E, 15 points are

### Resumen de Entrevista: Asociación de Agentes de Aduana del Puerto de Manzanillo

Resumen de Entrevista: Asociación de Agentes de Aduana del Puerto de Manzanillo 1. To your knowledge, to what extent do customs brokers run into operative inconveniences when it comes to collecting payment

### Announcements. FINAL EXAM Monday May 21, 1:30pm Review Session. Wednesday May 16, 7-9pm

Announcements FINAL EXAM Monday May 21, 1:30pm Review Session Wednesday May 16, 7-9pm 1 Recitation 12 Root Finding, Sorting, Stacks, Queues 2 Outline Linked Lists Sorting Queues 3 Object References Let

### Bucle for_in. Sintaxis: Bucles for_in con listas. def assessment(grade_list): """ Computes the average of a list of grades

Bucle for_in Sintaxis: for in : Bucles for_in con listas In [38]: def assessment(grade_list): Computes the average of a list of grades @type grades: [float]

### CmpSci 187: Programming with Data Structures Spring 2015

CmpSci 187: Programming with Data Structures Spring 2015 Lecture #12 John Ridgway March 10, 2015 1 Implementations of Queues 1.1 Linked Queues A Linked Queue Implementing a queue with a linked list is

### Sales Management Main Features

Sales Management Main Features Optional Subject (4 th Businesss Administration) Second Semester 4,5 ECTS Language: English Professor: Noelia Sánchez Casado e-mail: noelia.sanchez@upct.es Objectives Description

### Cambridge IGCSE. www.cie.org.uk

Cambridge IGCSE About University of Cambridge International Examinations (CIE) Acerca de la Universidad de Cambridge Exámenes Internacionales. CIE examinations are taken in over 150 different countries

### POR QUE MI HIJO SE PARECE A SU ABUELA? / WHY DOES MY CHILD LOOKS LIKE THE GRANDMOTHER?: Y OTRAS CUESTIONES GENETICAS / AND OTHER GENETIC QU

POR QUE MI HIJO SE PARECE A SU ABUELA? / WHY DOES MY CHILD LOOKS LIKE THE GRANDMOTHER?: Y OTRAS CUESTIONES GENETICAS / AND OTHER GENETIC QU READ ONLINE AND DOWNLOAD EBOOK : POR QUE MI HIJO SE PARECE A

### Propedéutico de Programación

Propedéutico de Programación Coordinación de Ciencias Computacionales 4/12 Material preparado por: Dra. Pilar Gómez Gil Chapter 14 Object-Oriented Software Development (continuación) Dale/Weems Constructor

### AV-002: Professional Web Component Development with Java

AV-002: Professional Web Component Development with Java Certificación Relacionada: Oracle Certified Web Component Developer Detalles de la Carrera: Duración: 120 horas. Introducción: Java es un lenguaje

### Exemplar for Internal Achievement Standard. Spanish Level 1

Exemplar for Internal Achievement Standard Spanish Level 1 This exemplar supports assessment against: Achievement Standard 90910 Interact using spoken Spanish to communicate personal information, ideas

### Apéndice C: Código Fuente del Programa DBConnection.java

Apéndice C: Código Fuente del Programa DBConnection.java import java.sql.*; import java.io.*; import java.*; import java.util.*; import java.net.*; public class DBConnection Connection pgsqlconn = null;

### AP Computer Science Java Subset

APPENDIX A AP Computer Science Java Subset The AP Java subset is intended to outline the features of Java that may appear on the AP Computer Science A Exam. The AP Java subset is NOT intended as an overall

### ENVIRONMENT: Collaborative Learning Environment

Guía Integrada de Actividades Contexto de la estrategia de aprendizaje a desarrollar en el curso: The activity focuses on the Task Based Language Learning (TBLL). The task is used by the student in order

### A binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and:

Binary Search Trees 1 The general binary tree shown in the previous chapter is not terribly useful in practice. The chief use of binary trees is for providing rapid access to data (indexing, if you will)

### COMPUTACIÓN ORIENTADA A SERVICIOS (PRÁCTICA) Dr. Mauricio Arroqui EXA-UNICEN

COMPUTACIÓN ORIENTADA A SERVICIOS (PRÁCTICA) Dr. Mauricio Arroqui EXA-UNICEN Actividad Crear un servicio REST y un cliente para el mismo ejercicio realizado durante la práctica para SOAP. Se requiere la

### sngraph * Optimal software to manage scale-free networks

sngraph * Optimal software to manage scale-free networks R. Maestre-Martínez ** Geographic Information System Unit Center for Humanities and Social Sciences Spanish National Research Council Madrid 200,

### CE204 Data Structures and Algorithms Part 3

CE204 Data Structures and Algorithms Part 3 23/01/2016 CE204 Part 3 1 Trees The ADTs encountered so far have been linear; list and array implementations have been adequate. We now consider a nonlinear

### Customer Name Address City, State Zip <INSERT DATE>

Customer Name Address City, State Zip Announcement to Customers: The transition is complete Dear < insert name>, has successfully completed transitioning your water utility account. Once

### 240EO031 - Supply Chain Design

Coordinating unit: 240 - ETSEIB - Barcelona School of Industrial Engineering Teaching unit: 732 - OE - Department of Management Academic year: Degree: 2015 MASTER'S DEGREE IN MANAGEMENT ENGINEERING (Syllabus

### CS 111 Classes I 1. Software Organization View to this point:

CS 111 Classes I 1 Software Organization View to this point: Data Objects and primitive types Primitive types operators (+, /,,*, %). int, float, double, char, boolean Memory location holds the data Objects

### AP SPANISH LANGUAGE 2011 PRESENTATIONAL WRITING SCORING GUIDELINES

AP SPANISH LANGUAGE 2011 PRESENTATIONAL WRITING SCORING GUIDELINES SCORE DESCRIPTION TASK COMPLETION TOPIC DEVELOPMENT LANGUAGE USE 5 Demonstrates excellence 4 Demonstrates command 3 Demonstrates competence

Inheritance, overloading and overriding Recall with inheritance the behavior and data associated with the child classes are always an extension of the behavior and data associated with the parent class

### What is the Common Problem that Makes most Biological Databases Hard to Work With, if not Useless to most Biologists?

What is the Common Problem that Makes most Biological Databases Hard to Work With, if not Useless to most Biologists? RUNI VILHELM MRAG Americas, Inc. 110 South Hoover Blvd., Suite 212 Tampa, Florida 33609-2458

### Verbos modales. In this class we look at modal verbs, which can be a tricky feature of English grammar.

Verbos modales In this class we look at modal verbs, which can be a tricky feature of English grammar. We use Modal verbs in English to show: Probability,Possibility, Capability, Permission, ObligaCon,

### Control of a variety of structures and idioms; occasional errors may occur, but

AP SPANISH LANGUAGE 2012 PRESENTATIONAL WRITING SCORING GUIDELINES SCORE DESCRIPTION TASK COMPLETION TOPIC DEVELOPMENT LANGUAGE USE 5 Demonstrates excellence 4 Demonstrates command 3 Demonstrates competence

### Topic 15. The Binary Search Tree ADT

Topic 15 The Binary Search Tree ADT Binary Search Tree A binary search tree (BST) is a binary tree with an ordering property of its elements, such that the data in any internal node is Greater than the

### Master English. Comparatives and Superlatives. Learn how to use comparatives and superlatives correctly. Download this handbook to your mobile phone

Master English Comparatives and Superlatives Learn how to use comparatives and superlatives correctly Download this handbook to your mobile phone Practice with the Hewitt English Grammar House 3. Future

### Payment. amount. Payment. amount: Money. getbalance(): Money

Dpto. de Computación y T.I. Taller de Ingeniería de Software Clase 5 Agenda 1.Exposición por equipos: Diagrama de Clases de Análisis 2. Diagrama de Clases 3.Traducción clases a Esquema Relacional 3. 4.Asignación

### OFFICE OF COMMON INTEREST COMMUNITY OMBUDSMAN CIC#: DEPARTMENT OF JUSTICE

RETURN THIS FORM TO: FOR OFFICIAL USE: (Devuelva Este Formulario a): (Para Uso Oficial) OFFICE OF COMMON INTEREST COMMUNITY OMBUDSMAN CIC#: DEPARTMENT OF JUSTICE (Caso No) STATE OF DELAWARE Investigator:

### Schema XML_PGE.xsd. element GrupoInformes. attribute GrupoInformes/@version. XML_PGE.xsd unqualified qualified http://sgpfc.igae.minhap.

Schema XML_PGE.xsd schema location: attribute form default: element form default: targetnamespace: XML_PGE.xsd unqualified qualified http://sgpfc.igae.minhap.es/xmlpge element GrupoInformes children Informe

### Binary Search Trees. Yes! So, a binary tree T is a binary search tree if T is a single node.

Which are Binary Search Trees (BST)? Binary Search Trees So, a binary tree T is a binary search tree if T is a single node. Yes! No! All the values on the left subtree must be less than the value at the

Graduate Assessment Test (Sample) CS201-203 1. Fibonacci sequence is defined by a recurrence relation. The series is: 0,1,1,2,3,5,8,13,... Write a complete recursive method/function that returns the fibonacci

### // Basic node stored in unbalanced binary search trees // Note that this class is not accessible outside // of this package.

// Basic node stored in unbalanced binary search trees // Note that this class is not accessible outside // of this package. class BinaryNode AnyType element; // The data in the node BinaryNode

### Preparando a futuros profesores para integrar tecnología

Preparando a futuros profesores para integrar tecnología Preparing future teachers to integrate technology in education Petra Fisser University of Twente The Netherlands Wim de Boer VVOB 02/04/2012 Title:

### Propiedades del esquema del Documento XML de envío:

Web Services Envio y Respuesta DIPS Courier Tipo Operación: 122-DIPS CURRIER/NORMAL 123-DIPS CURRIER/ANTICIP Los datos a considerar para el Servicio Web DIN que se encuentra en aduana son los siguientes:

### Visión general de la integración con asanetwork

Visión general de la integración con asanetwork Este documento se ha preparado parar dar una visión general del flujo de trabajo de asanetwork y de las tareas a realizar por los programadores del Sistema

### LBWN ALQUILAR CON OPCIÓN A COMPRAR

LBWN ALQUILAR CON OPCIÓN A COMPRAR BENEFICIOS PARA LA COMUNIDAD LBWN Alquilar con Opción a Comprar es una iniciativa de desarrollo de \$5.8 millones que convertirá 24 foreclosures en viviendas unifamiliares

### 7.1 Our Current Model

Chapter 7 The Stack In this chapter we examine what is arguably the most important abstract data type in computer science, the stack. We will see that the stack ADT and its implementation are very simple.

### Object-Oriented Design Lecture 4 CSU 370 Fall 2007 (Pucella) Tuesday, Sep 18, 2007

Object-Oriented Design Lecture 4 CSU 370 Fall 2007 (Pucella) Tuesday, Sep 18, 2007 The Java Type System By now, you have seen a fair amount of Java. Time to study in more depth the foundations of the language,

### Java Interview Questions and Answers

1. What is the most important feature of Java? Java is a platform independent language. 2. What do you mean by platform independence? Platform independence means that we can write and compile the java

### SPAN 2113 Intermediate Spanish Schedule

August September 1 st nd 3rd week 4 6 31 SPAN 113 Intermediate Spanish Schedule The University of Oklahoma Department of Modern Languages, Literatures, and Linguistics Fall 015 MW PM Class Abbreviations:

### J a v a Quiz (Unit 3, Test 0 Practice)

Computer Science S-111a: Intensive Introduction to Computer Science Using Java Handout #11 Your Name Teaching Fellow J a v a Quiz (Unit 3, Test 0 Practice) Multiple-choice questions are worth 2 points

### January 5, 2013. Writing assignments: 40% Final written report: 40% Oral exam: 20%

University of North Carolina at Chapel Hill ENVR 890-010 Spanish Vocabulary in the Environmental Sciences Spring 2013 Instructor: Orlando Coronell (coronell@unc.edu, 163B Rosenau, 919-966-9010) Meeting

### 0530 SPANISH (FOREIGN LANGUAGE)

CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Secondary Education MARK SCHEME for the October/November 2012 series 0530 SPANISH (FOREIGN LANGUAGE) 0530/22 Paper 2 (Reading and

Sentence Match Quiz for Category: por_vs_para_1 1) Son las habitaciones accesibles para discapacitados? - A: Are the rooms handicapped accessible? - B: You must fill out this form in order to get work

### AP SPANISH LITERATURE 2009 SCORING GUIDELINES

AP SPANISH LITERATURE 2009 SCORING GUIDELINES Question 1: Poetry Analysis 9 Demonstrates Superiority A very well-developed essay that clearly and thoroughly analyzes the vision of la higuera presented

### MS10266: Programming in C# with Microsoft Visual studio 2010

40 HORAS INTRODUCTION The course focuses on C# program structure, language syntax, and implementation detailswith.net Framework 4.0. This course describes the new enhancements in the C# 4.0 language by

### Spanish GCSE Student Guide

Spanish GCSE Student Guide Is this the right subject for me? If you enjoy meeting and talking to people from other countries, finding out about their cultures and learning how language works, then studying

### Software Development with UML and Java 2 SDJ I2, Spring 2010

Software Development with UML and Java 2 SDJ I2, Spring 2010 Agenda week 7, 2010 Pakages Looking back Looking forward Packages Interfaces Page 1 Spring 2010 Download, Install/Setup 1. Java SE SDK (http://java.sun.com/javase/downloads)

### Trees LOGO STYLE GUIDE Schools within the University 1 19

Trees 1 Example Tree 2 A Generic Tree 3 Tree ADT n Tree definition q A tree is a set of nodes which may be empty q If not empty, then there is a distinguished node r, called root and zero or more non-empty

### C:\Documents and Settings\Gijs\Desktop\src\client\Client.java dinsdag 3 november 2009 10:50

C:\Documents and Settings\Gijs\Desktop\src\client\Client.java dinsdag 3 november 2009 10:50 package client; import hotel.bookingconstraints; import hotel.bookingexception; import hotel.costumersessionremote;

### learning science through inquiry in primary classroom Overview of workshop

Indicators of teaching and learning science through inquiry in primary classroom Wynne Harlen UK Overview of workshop Part 1: Why IBSE? What do we want to achieve through it? Part 2: Thinking about how

### CSE 308. Coding Conventions. Reference

CSE 308 Coding Conventions Reference Java Coding Conventions googlestyleguide.googlecode.com/svn/trunk/javaguide.html Java Naming Conventions www.ibm.com/developerworks/library/ws-tipnamingconv.html 2

### Física Computacional Conceptos de programación.

Física Computacional Conceptos de programación. F. A. Velázquez-Muñoz Departamento de Física CUCEI UdeG 6 de febrero de 2015 Sistemas Operativos ms-dos windows linux suse; redhat; ubuntu; etc. unix Mac

### MODULE 4q - An abstract class

MODULE 4q - An abstract class SQUARES AND CIRCLES The Block.java program incorporated a parent class Square and a child class Cube. The relationship was established by the declaration of class Cube which

### Memorial Health Care System Catholic Health Initiatives Financial Assistance Application Form

B Please note - Memorial Hospital may access external validation resources to assist in determining whether a full application for assistance is required. Financial Assistance Application 1) Patient Name

### API for java.util.iterator. ! hasnext() Are there more items in the list? ! next() Return the next item in the list.

Sequences and Urns 2.7 Lists and Iterators Sequence. Ordered collection of items. Key operations. Insert an item, iterate over the items. Design challenge. Support iteration by client, without revealing

### LINIO COLOMBIA. Starting-Up & Leading E-Commerce. www.linio.com.co. Luca Ranaldi, CEO. Pedro Freire, VP Marketing and Business Development

LINIO COLOMBIA Starting-Up & Leading E-Commerce Luca Ranaldi, CEO Pedro Freire, VP Marketing and Business Development 22 de Agosto 2013 www.linio.com.co QUÉ ES LINIO? Linio es la tienda online #1 en Colombia

### Comments on Draft OECD/IOPS Good Practices on Pension Fund s Use of Alternative Investments and Derivatives

Comments on Draft OECD/IOPS Good Practices on Pension Fund s Use of Alternative Investments and Derivatives This document includes comments from various FIAP members, belonging to different countries.

### SUMMER WORK AP SPANISH LANGUAGE & CULTURE Bienvenidos a la clase de Español AP!

SUMMER WORK AP SPANISH LANGUAGE & CULTURE Bienvenidos a la clase de Español AP! To truly learn a language you have to use it as much as possible. The AP Exam focuses on the four communication skills: speaking,

### Habanero Extreme Scale Software Research Project

Habanero Extreme Scale Software Research Project Comp215: Java Method Dispatch Zoran Budimlić (Rice University) Always remember that you are absolutely unique. Just like everyone else. - Margaret Mead

### Author: Sascha Wolski Sebastian Hennebrueder http://www.laliluna.de/tutorials.html Tutorials for Struts, EJB, xdoclet and eclipse.

JUnit Testing JUnit is a simple Java testing framework to write tests for you Java application. This tutorial gives you an overview of the features of JUnit and shows a little example how you can write

C++ How to Program, 8/e 1992-2012 by Pearson Education, Inc. 1992-2012 by Pearson Education, Inc. 1992-2012 by Pearson Education, Inc. We ve studied fixed-size data structures such as one-dimensional arrays

### Sub OPT() j = 1 k = 1 m = 1 n = 1 o = 1 g = 1 h = 1

Module1-1 j = 1 k = 1 m = 1 n = 1 o = 1 g = 1 h = 1 Sub OPT() Dim minpc As Integer Dim max(100) As Double Dim row_max, fday, lday As Integer Dim aux, aux2 As String Dim frow(1000) As Double Dim lrow(1000)

### LOS ANGELES UNIFIED SCHOOL DISTRICT REFERENCE GUIDE

TITLE: Environmental Health Advisory Procedures ROUTING All Schools and Offices NUMBER: ISSUER: Robert Laughton, Director Office of Environmental Health and Safety DATE: March 30, 2015 Thelma Meléndez,

### Object Oriented Software Design

Object Oriented Software Design Inner classes, RTTI, Tree implementation Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa October 29, 2010 G. Lipari (Scuola Superiore Sant

### Entry to Year 7 - Information for Parents

Entry to Year 7 - Information for Parents Key Names: Mrs Elizabeth Batchelor - Head of the Secondary School Mr Darren Roth - Head of Key Stage Three Miss Karen Britcliffe - Head of Pastoral Care Groupings

### Global Art: A Sense of Caring Nos Preocupamos por los Demas

Project Starter Kit for Online Collaborations Submitted by Jennifer Geist Bridges to Understanding Seattle, WA December 2006 Global Art: A Sense of Caring Nos Preocupamos por los Demas A Starter Kit for

### A. Before you read the text, answer the following question: What should a family do before starting to look for a new home?

UNIT 1: A PLAN FOR BUYING English for Real Estate Materials A. Before you read the text, answer the following question: What should a family do before starting to look for a new home? Read the following

### School of Informatics, University of Edinburgh Computer Science 1 Ah [03 04]

School of Informatics, University of Edinburgh Computer Science 1 Ah [03 04] CS1Ah Lecture Note 25 Binary Search Trees This lecture studies binary trees in more detail, in particular their application

### STUDENT LESSON A11 Inheritance

STUDENT LESSON A11 Inheritance Java Curriculum for AP Computer Science, Student Lesson A11 1 STUDENT LESSON A11 Inheritance INTRODUCTION: Inheritance, a major component of OOP, is a technique that will

### Manejo Basico del Servidor de Aplicaciones WebSphere Application Server 6.0

Manejo Basico del Servidor de Aplicaciones WebSphere Application Server 6.0 Ing. Juan Alfonso Salvia Arquitecto de Aplicaciones IBM Uruguay Slide 2 of 45 Slide 3 of 45 Instalacion Basica del Server La

### Binary Search Trees (BST)

Binary Search Trees (BST) 1. Hierarchical data structure with a single reference to node 2. Each node has at most two child nodes (a left and a right child) 3. Nodes are organized by the Binary Search

### This lecture. Abstract data types Stacks Queues. ADTs, Stacks, Queues 1. 2004 Goodrich, Tamassia

This lecture Abstract data types Stacks Queues ADTs, Stacks, Queues 1 Abstract Data Types (ADTs) An abstract data type (ADT) is an abstraction of a data structure An ADT specifies: Data stored Operations

### More Binary Tree examples

More Binary Tree examples NOTE: Your homework asks you to write static methods using a public TreeNode class. All the methods here are for the BinaryTree class with an inner BTnode class, for contrast.

### CSE 1020 Introduction to Computer Science I A sample nal exam

1 1 (8 marks) CSE 1020 Introduction to Computer Science I A sample nal exam For each of the following pairs of objects, determine whether they are related by aggregation or inheritance. Explain your answers.

### New words to remember

Finanza Toolbox Materials What is a Bank Loan? Borrowing money from the bank is called a bank loan. People borrow money from the bank for many reasons. One reason to get a bank loan might be to buy a car.

### Modificación de los Gastos operativos y de administración en JPMorgan Investment Funds y JPMorgan Funds

Modificación de los operativos y de administración en JPMorgan Investment s y JPMorgan s June 2015 Por la presente, la Sociedad gestora informa a los accionistas de las modificaciones efectuadas en relación

### Chapter 8 Binary Search Trees

Chapter 8 Binary Search Trees Chapter 8: Binary Search Trees 8.1 Trees 8.2 The Logical Level 8.3 The Application Level 8.4 The Implementation Level: Basics 8.5 Iterative versus Recursive Method Implementations

### CompSci-61B, Data Structures Final Exam

Your Name: CompSci-61B, Data Structures Final Exam Your 8-digit Student ID: Your CS61B Class Account Login: This is a final test for mastery of the material covered in our labs, lectures, and readings.

### Object-Oriented Programming in C# (VS 2010)

Object-Oriented Programming in C# (VS 2010) Description: This thorough and comprehensive five-day course is a practical introduction to programming in C#, utilizing the services provided by.net. This course

### LOS ANGELES UNIFIED SCHOOL DISTRICT REFERENCE GUIDE

REFERENCE GUIDE TITLE: No Child Left Behind (NCLB): Qualifications for Teachers; Parent Notification Requirements and Right to Know Procedures, Annual Principal Certification Form ROUTING All Schools and

Sentence Match Quiz for Category: hacer_make_do_1 1) Nosotros hacemos todo lo posible para proporcionar un buen servicio. - A: We do our best to provide good service. - B: These chores are done each time.

### Java Application Developer Certificate Program Competencies

Java Application Developer Certificate Program Competencies After completing the following units, you will be able to: Basic Programming Logic Explain the steps involved in the program development cycle

### Outline. Computer Science 331. Stack ADT. Definition of a Stack ADT. Stacks. Parenthesis Matching. Mike Jacobson

Outline Computer Science 1 Stacks Mike Jacobson Department of Computer Science University of Calgary Lecture #12 1 2 Applications Array-Based Linked List-Based 4 Additional Information Mike Jacobson (University

### Introduction to Java A First Look

Introduction to Java A First Look Java is a second or third generation object language Integrates many of best features Smalltalk C++ Like Smalltalk Everything is an object Interpreted or just in time

### Class 28: Binary Search Trees. Binary Search Trees

Introduction to Computation and Problem Solving Class 2: Binary Search Trees Prof. Steven R. Lerman and Dr. V. Judson Harward Binary Search Trees In the previous lecture, we defined the concept of binary

### Application for Admission 2014-2015 School Year

Application for Admission 2014-2015 School Year Mail or deliver applications to: Admissions Office Cristo Rey Columbus High School 840 West State Street Columbus, Ohio 43222 Phone: (614) 223-9261 x 227

### Computing Concepts with Java Essentials

2008 AGI-Information Management Consultants May be used for personal purporses only or by libraries associated to dandelon.com network. Computing Concepts with Java Essentials 3rd Edition Cay Horstmann

### Ask your child what he or she is learning to say in Spanish at school. Encourage your child to act as if he or she is your teacher.

Welcome to Descubre el español con Santillana! This year, your child will be learning Spanish by exploring the culture of eight Spanish-speaking countries. Please join us as we travel through each of the

### Voices of Recent Latina Immigrants and Refugees:Effects of Budget Cuts on Their Settlement Experiences

Voices of Recent Latina Immigrants and Refugees:Effects of Budget Cuts on Their Settlement Experiences by Neita Kay Israelite, Faculty of Education, York University Arlene Herman, Department of Sociology,

### csci 210: Data Structures Stacks and Queues

csci 210: Data Structures Stacks and Queues Summary Topics stacks and queues as abstract data types implementations arrays linked lists analysis and comparison application: searching with stacks and queues

### The Sun Certified Associate for the Java Platform, Standard Edition, Exam Version 1.0

The following applies to all exams: Once exam vouchers are purchased you have up to one year from the date of purchase to use it. Each voucher is valid for one exam and may only be used at an Authorized

### Project AGUA Survey Results

Project AGUA Survey Results Project AGUA (Arid Garden Underground Aquifer) This survey was conducted after the AGUA Presentation on August 6, 2015 at the Santa Ana Public Library to analyze the public