# Problem 1 (2.5 points)

Size: px
Start display at page:

Download "Problem 1 (2.5 points)"

## Transcription

1 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: We have a simple linked list, implemented by MyLinkedList and Node classes: public class MyLinkedList { private Node first; private int numelems; MyLinkedList (){ first=null; numelems=0; public int getsize(){return numelems; public Object retrieventh (int pos){ // To implement public int insertnth (Object o, int pos){ // To implement public class Node { private Object info; private Node next; Node (Object obj) {info=obj; next=null; public void setinfo(object obj){ info=obj; public void setnext(node n){ next=n; public Object getinfo() {return info; public Node getnext(){return next; Section 1 (1.25 points) Implement the method public Object retrieventh (int pos) 1

2 from MyLinkedList class. This method returns the element placed at the pos -th position. If the position specified does not exist in the list (i.e. the position is out of bounds), the method must return null. Positions start at index 1. The method must not delete any item from the list. Section 2 (1.25 points) Implement the method public int insertnth (Object obj, int pos) from MyLinkedList class. This method takes as parameters both the object to be inserted and the position at which the object will be inserted. Positions start at index 1. Inserting an object at a specific position means that this object must be placed at that position. It might be necessary to shift other elements. For example, if there is an object to be inserted at position 3, then the element that was at position 3 before the insertion will be shifted to position 4. If the position specified is higher than the number of elements in the list, the object must be added at the end of the list (e.g. if the list contains 4 elements, and the position at which the new element is wanted to be added is 10, then the new element will be actually inserted at position 5). If the position specified is 0 or lower than 0, then no insertion must be done. The method must return the position at which the new element is finally inserted (the case in which pos>list size must be taken into account), or -1 is no insertion is made. Problem 2 (2.5 points) Context: We have a binary search tree representing a library (Library class). Each tree node stores information about a book: title, author and ISBN code. The tree is sorted alphabetically by book title in increasing order. We can assume there will not be two books with the same title. The following code implements the library: 2

3 public class Library { BNode root; public boolean insertbook(book con){ if (root==null) { root=new BNode(con); return true; else { return root.insertbook(con); public int getnumbooks (){ if (root==null) return 0; else return root.getnumbooks(); public class Book{ String title; String author; String isbn; Contact (){ title=""; author=""; isbn=""; public String gettitle() {return title; public String getauthor() {return author; public String getisbn() { return isbn; public class BNode { private Book info; private BNode left; private BNode right; public void setleft(bnode n) {left=n; public void setright(bnode n) {right=n; public BNode getright() {return right; public BNode getleft() {return left; public Book getinfo() {return info; public void setinfo(book c){ info = c; BNode (Book con) { setinfo(con); setleft(null); setright(null); public int getnumbooks(){ // // TO IMPLEMENT IN SECTION 1 public boolean insertbook(book con){ // // TO IMPLEMENT IN SECTION 2 3

4 Section 1 (1.25 points) Implement the method getnumbooks from BNode class. This method returns the number of books in the subtree which root node is the one invoking the method. Notice this method is the one called from getnumbooks method, from Library class, in order to get the total number of books in the library. This method must be solved recursively. Section 2 (1.25 points) Implement the method insertbook from BNode class. This method inserts the book (Book) specified as parameter at its corresponding place. Notice this method is the one called from the method insertbook from Library class. The method must return true if the book is inserted in the tree, or false if the book is not inserted because there is another book with the same title in the tree. This method must be solved recursively. 4

5 SOLUCIONES PROBLEMA 1 public Object retrieventh (int pos){ Node aux=first; if (pos<=0) return null; if (pos>getsize()) return null; for (int i=1;i<pos;i++){ aux=aux.getnext(); return aux.getinfo(); public int insertnth (Object o, int pos){ Node aux=first; Node newnode=new Node(o); if (pos<=0){ return -1; if (pos==1) { newnode.setnext(first); first=newnode; numelems++; else { if (pos>getsize()){ pos=getsize()+1; for (int i=1;i<pos-1;i++){ aux=aux.getnext(); newnode.setnext(aux.getnext()); aux.setnext(newnode); numelems++; return pos; Criterios de calificación Problema 1 Apartado 1) 0,75 puntos - Recorrer correctamente la lista hasta la posición requerida. Si la indexación no la hace correctamente desde 1, sino desde 0, se le da 0,5 puntos. 0,25 puntos - Check correcto de índice de posición fuera de rangos. 0,25 puntos - Return correcto del objeto. Apartado 2) 0,10 puntos. Crear correctamente el nodo a insertar. 0,25 puntos. Insertar correctamente en la primera posición. 0,25 puntos, recorrer hasta la posición a insertar. 0,25 puntos. Insertar correctamente en la posición nth. 5

6 0,15 controlar que la posición requerida sea mayor que el tamaño de la lista. 0,25 devolver correctamente la posición final. SOLUCIONES PROBLEMA 2 public int getnumbooks (){ int n=1; if (this.getleft()!=null){ n+=this.getleft().getnumbooks(); if (this.getright()!=null){ n+=this.getright().getnumbooks(); return n; public boolean insertbook(book newcon){ boolean res=false; int comp = this.getinfo().getname().compareto(newcon.getname()); if (comp == 0) { res=false; else if (comp < 0){ if (this.getright()==null) { this.setright(new BNode(newcon)); res=true; else{ res = this.getright().insertbook(newcon); else if (comp > 0){ if (this.getleft()==null) { this.setleft(new BNode(newcon)); res=true; else { res = this.getleft().insertbook(newcon); return res; Criterios de calificación Apartado 1) 0,25 Sumar correctamente 1 por el nodo actual. 0,25 Comprobar correctamente que las ramas!= null antes de invocar. 0,25 Invocar correctamente de forma recursiva. 0,25 sumar correctamente los return de las ramas. 0,25 devolver suma completa. Apartado 2) 0,15 Comparación correcta del título. 0,25 Comprobación de si es el título del nodo actual. 0,25 Comprobar si la rama correspondiente es null o no. 6

7 0,25 Insertar si la rama es null. 0,25 Invocar correctamente la llamada recursiva si la rama no es null. 0,10 return correcto de true/false. 7

### Problem 1 (1.5 points)

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

More information

### 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]

More information

### Ordered Lists and Binary Trees

Data Structures and Algorithms Ordered Lists and Binary Trees Chris Brooks Department of Computer Science University of San Francisco Department of Computer Science University of San Francisco p.1/62 6-0:

More information

### Taller de Emprendimiento 2 IESE Business School Version 06.07 LMC

Taller de Emprendimiento 2 IESE Business School Version 06.07 LMC . Anuncio del taller de emprendimiento madrid 2013.pdf Bibliografía The Startup Owners Manual, Steve Blank, Ranch House 2012 http://steveblank.com/2012/11/27/open-source-entrepreneurship/

More information

### 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

More information

### Data Structures and Algorithms

Data Structures and Algorithms CS245-2016S-06 Binary Search Trees David Galles Department of Computer Science University of San Francisco 06-0: Ordered List ADT Operations: Insert an element in the list

More information

### 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,

More information

### 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

More information

### 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

More information

### 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

More information

### 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)

More information

### Chapter 12 Intellectual Development from One One to Three to Three

Chapter 12 Chapter 12 Intellectual Development from One One to Three to Three Contents Section 12.1 Brain Development from One to Three Section 12.2 Encouraging Learning from One to Three 1 Section 12.1

More information

### 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

More information

### Output: 12 18 30 72 90 87. struct treenode{ int data; struct treenode *left, *right; } struct treenode *tree_ptr;

50 20 70 10 30 69 90 14 35 68 85 98 16 22 60 34 (c) Execute the algorithm shown below using the tree shown above. Show the exact output produced by the algorithm. Assume that the initial call is: prob3(root)

More information

### Quiz 4 Solutions EECS 211: FUNDAMENTALS OF COMPUTER PROGRAMMING II. 1 Q u i z 4 S o l u t i o n s

Quiz 4 Solutions Q1: What value does function mystery return when called with a value of 4? int mystery ( int number ) { if ( number

More information

### Update a MS2.2 20060817

Los cambios a realizar en la base de datos son los siguientes. Se ejecutarán en el phpmyadmin del servidor. A ser posible sobre una base de datos replicada, por si hay algún error. Si no se trata de una

More information

### 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

More information

### POSIBILIDAD DE REALIZACIÓN DE PFC EN DELPHI (Luxembourg)

SUBDIRECCIÓN DE RELACIONES EXTERIORES ETSIAE UNIVERSIDAD POLITÉCNICA DE MADRID POSIBILIDAD DE REALIZACIÓN DE PFC EN DELPHI (Luxembourg) Los interesados deben presentar el formulario de solicitud antes

More information

### 5-Port Gigabit GREENnet Switch TEG-S5g ŸGuía de instalación rápida (1) ŸTechnical Specifications (3) ŸTroubleshooting (4)

5-Port Gigabit GREENnet Switch TEG-S5g ŸGuía de instalación rápida (1) ŸTechnical Specifications (3) ŸTroubleshooting (4) 2.02 1. Antes de iniciar Contenidos del paquete ŸTEG-S5g ŸGuía de instalación rápida

More information

### 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:

More information

### D755M CONTROL CARD FOR TWO SINGLE-PHASE MOTORS 220/230 VAC TARJETA DE MANDO PARA DOS MOTORES MONOFÁSICOS 220/230 VAC INSTALLATION GUIDE

Distributed by: AFW Access Systems Phone: 305-691-7711 Fax: 305-693-1386 E-mail: sales@anchormiami.com D755M CONTROL CARD FOR TWO SINGLE-PHASE MOTORS 220/230 VAC TARJETA DE MANDO PARA DOS MOTORES MONOFÁSICOS

More information

### COMPUTER SCIENCE. Paper 1 (THEORY)

COMPUTER SCIENCE Paper 1 (THEORY) (Three hours) Maximum Marks: 70 (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time) -----------------------------------------------------------------------------------------------------------------------

More information

### Work Instruction (Instruccion de Trabajo) Wistron InfoComm (Texas) Corp.

Effective Date: 8/1/2011 Page 1 of 6 Description: (Descripción) 1.0 Purpose (Objetivo) 2.0 Scope (Alcance) 3.0 Fixture List (Lista de Materiales) 4.0 Activities (Actividades) Prepared By: Daniel Flores

More information

### Exercises Software Development I. 11 Recursion, Binary (Search) Trees. Towers of Hanoi // Tree Traversal. January 16, 2013

Exercises Software Development I 11 Recursion, Binary (Search) Trees Towers of Hanoi // Tree Traversal January 16, 2013 Software Development I Winter term 2012/2013 Institute for Pervasive Computing Johannes

More information

### 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.

More information

### EJEMPLO IMPRESIÓN PDF desde llamada RFC a SAP utilizando una variable binaria SAP (XSTRING)

En SAP R/3. EJEMPLO IMPRESIÓN PDF desde llamada RFC a SAP utilizando una variable binaria SAP (XSTRING) Crear formulario Z_TEST2 con transacción SFP Entonces si tenemos function RFC function zhr1_certs_via_portal_action.

More information

### Data Structures CSC212 (1) Dr Muhammad Hussain Lecture - Binary Search Tree ADT

(1) Binary Search Tree ADT 56 26 200 18 28 190 213 12 24 27 (2) Binary Search Tree ADT (BST) It is a binary tree with the following properties 1. with each node associate a key 2. the key of each node

More information

### Curso académico 2015/2016 INFORMACIÓN GENERAL ESTRUCTURA Y CONTENIDOS HABILIDADES: INGLÉS

Curso académico 2015/2016 INFORMACIÓN GENERAL ESTRUCTURA Y CONTENIDOS HABILIDADES: INGLÉS Objetivos de Habilidades: inglés El objetivo de la prueba es comprobar que el alumno ha adquirido un nivel B1 (dentro

More information

### 1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++

Answer the following 1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++ 2) Which data structure is needed to convert infix notations to postfix notations? Stack 3) The

More information

### Práctica 1: PL 1a: Entorno de programación MathWorks: Simulink

Práctica 1: PL 1a: Entorno de programación MathWorks: Simulink 1 Objetivo... 3 Introducción Simulink... 3 Open the Simulink Library Browser... 3 Create a New Simulink Model... 4 Simulink Examples... 4

More information

### Visual basic string search function, download source code visual basic 6.0 gratis. > Visit Now <

Visual basic string search function, download source code visual basic 6.0 gratis. > Visit Now < Visual studio 2010 c# coding standards microsoft visual studio 2012 ultimate kickass curso online de basic

More information

### 5-Port 10/100Mbps Fast Ethernet Switch (TE100-S5) 8-Port 10/100Mbps Fast Ethernet Switch (TE100-S8)

5-Port 10/100Mbps Fast Ethernet Switch (TE100-S5) 8-Port 10/100Mbps Fast Ethernet Switch (TE100-S8) ŸGuía de instalación rápida (1) ŸTechnical Specifications [3] ŸTroubleshooting (4) 1.22 1. Antes de iniciar

More information

### BSc (Hons) Business Information Systems, BSc (Hons) Computer Science with Network Security. & BSc. (Hons.) Software Engineering

BSc (Hons) Business Information Systems, BSc (Hons) Computer Science with Network Security & BSc. (Hons.) Software Engineering Cohort: BIS/05/FT BCNS/05/FT BSE/05/FT Examinations for 2005-2006 / Semester

More information

### IBM PureSystems: Familia de Sistemas Expertos Integrados

IBM PureSystems: Familia de Sistemas Expertos Integrados Carlos Etchart Sales Support Specialist IBM Está IT listo para el Cambio? New server spending Power & cooling costs Server mgmt & admin costs 2013

More information

### 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

More information

### Dictionary (catálogo)

Catálogo Oracle Catálogo Esquema: un conjunto de estructuras de datos lógicas (objetos del esquema), propiedad de un usuario Un esquema contiene, entre otros, los objetos siguientes: tablas vistas índices

More information

### J.5-11- 2015 Intercultural communica0on, mee0ngs and nego0a0ons Seminars and case studies

I"nerario Profesional Primer semestre L.28-09- 2015 Interna0onal marke0ng Business trips and socializing M.29-09- 2015 Interna0onal Business Management Business correspondence X.30-09- 2015 Using Documents

More information

### DEMENTIA. Impact of an intervention in a rural community in Peru. Dr. Sara Gallardo Instituto de La Memoria IMEDER Puerto Rico - 2014

DEMENTIA Impact of an intervention in a rural community in Peru Dr. Sara Gallardo Instituto de La Memoria IMEDER Puerto Rico - 2014 LAR 038 No te olvides de Mi Improving management of dementia in andean

More information

### FORMULARIO DE INSCRIPCIÓN

INFORMACIÓN PERSONAL PERSONAL DATA APELLIDOS / SURNAME MBRE / NAME FECHA DE NACIMIENTO (D/M/A) / BIRTHDATE (D/M/Y) NACIONALIDAD / CITIZENSHIP NÚMERO DE PASAPORTE / PASSPORT NUMBER HOMBRE / MALE MUJER /

More information

### Chapter 14 The Binary Search Tree

Chapter 14 The Binary Search Tree In Chapter 5 we discussed the binary search algorithm, which depends on a sorted vector. Although the binary search, being in O(lg(n)), is very efficient, inserting a

More information

### Sample Questions Csci 1112 A. Bellaachia

Sample Questions Csci 1112 A. Bellaachia Important Series : o S( N) 1 2 N N i N(1 N) / 2 i 1 o Sum of squares: N 2 N( N 1)(2N 1) N i for large N i 1 6 o Sum of exponents: N k 1 k N i for large N and k

More information

### BDL4681XU BDL4675XU. Video Wall Installation Guide

BDL4681XU BDL4675XU Video Wall Installation Guide Video walls can create a stunning visual effect, attracting attention and audiences to view your messages and other video content. To ensure optimal performance

More information

### FAMILY INDEPENDENCE ADMINISTRATION Seth W. Diamond, Executive Deputy Commissioner

FAMILY INDEPENDENCE ADMINISTRATION Seth W. Diamond, Executive Deputy Commissioner James K. Whelan, Deputy Commissioner Policy, Procedures and Training Lisa C. Fitzpatrick, Assistant Deputy Commissioner

More information

### Data Structures and Algorithms Written Examination

Data Structures and Algorithms Written Examination 22 February 2013 FIRST NAME STUDENT NUMBER LAST NAME SIGNATURE Instructions for students: Write First Name, Last Name, Student Number and Signature where

More information

### 1. DESCRIPCIÓN DE WEB SERVICES DE INTERCAMBIO DE DATOS CON NOTARIOS

1. DESCRIPCIÓN DE WEB SERVICES DE INTERCAMBIO DE DATOS CON NOTARIOS 1.1 Solicitud certificado:

More information

### DIPLOMADO EN BASE DE DATOS

DIPLOMADO EN BASE DE DATOS OBJETIVOS Preparan al Estudiante en el uso de las tecnologías de base de datos OLTP y OLAP, con conocimientos generales en todas las bases de datos y especialización en SQL server

More information

### Analysis of Algorithms I: Binary Search Trees

Analysis of Algorithms I: Binary Search Trees Xi Chen Columbia University Hash table: A data structure that maintains a subset of keys from a universe set U = {0, 1,..., p 1} and supports all three dictionary

More information

### Unit 5. Landmarks and Large Numbers. How Much Is 1,000? Common Core

Unit 5 Landmarks and Large Numbers Common Core Mathematical Practices (MP) Domains Number and Operations in Base Ten (NBT) Measurement and Data (MD) INVESTIG ATION 1 How Much Is 1,000? Day Session Common

More information

### Data Structure [Question Bank]

Unit I (Analysis of Algorithms) 1. What are algorithms and how they are useful? 2. Describe the factor on best algorithms depends on? 3. Differentiate: Correct & Incorrect Algorithms? 4. Write short note:

More information

### 56h NIVEL LOWER INTERMEDIATE INGLÉS OBJETIVOS DEL CURSO. ÍNDICE 1 Objetivos didácticos_unit 1

56h INGLÉS OBJETIVOS DEL CURSO Consta de 9 unidades que gramaticalmente comienzan con un refuerzo del nivel 1, llegando hasta el uso de los condicionales y el estilo indirecto. Continuamos introduciendo

More information

### Desde la División de Advanced Solutions de Ingram Micro, queremos agradecerle su asistencia al evento Technology Day organizado por Symantec.

Apreciado colaborador, Desde la División de Advanced Solutions de Ingram Micro, queremos agradecerle su asistencia al evento Technology Day organizado por Symantec. A su vez, esperamos que su asistencia

More information

### Lista de Condiciones y Reglas

EMCS-Sistema de Control de Movimientos de Impuestos Especiales. Lista de Condiciones y Reglas Autor: S.G.A.A. Fecha: 30/06/2009 Versión: 1.2 Revisiones Edi. Rev. Fecha A(*) Páginas 1 0 29/01/2008 Versión

More information

### Apéndice C: Esquemas de la base de datos

Apéndice C: Esquemas de la base de datos 141 Apéndice C Esquemas de las bases de datos de T E R R A Con el objetivo de hacer persistentes los objetos generados por T E R R A se escogió un sistema manejador

More information

### HPN Product Tools. Copyright 2012 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice.

HPN Product Tools Requerimiento: Conozco el numero de parte (3Com,H3C,Procurve) Solución : El lookup Tool 1 Permite convertir el número de parte de un equipo proveniente de 3Com, H3C o Procurve para obtener

More information

### Ranking de Universidades de Grupo of Eight (Go8)

En consecuencia con el objetivo del programa Becas Chile el cual busca a través de la excelencia de las instituciones y programas académicos de destino cerciorar que los becarios estudien en las mejores

More information

### 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

More information

### Previous Lectures. B-Trees. External storage. Two types of memory. B-trees. Main principles

B-Trees Algorithms and data structures for external memory as opposed to the main memory B-Trees Previous Lectures Height balanced binary search trees: AVL trees, red-black trees. Multiway search trees:

More information

### Binary Search Trees. Data in each node. Larger than the data in its left child Smaller than the data in its right child

Binary Search Trees Data in each node Larger than the data in its left child Smaller than the data in its right child FIGURE 11-6 Arbitrary binary tree FIGURE 11-7 Binary search tree Data Structures Using

More information

### DATA STRUCTURES USING C

DATA STRUCTURES USING C QUESTION BANK UNIT I 1. Define data. 2. Define Entity. 3. Define information. 4. Define Array. 5. Define data structure. 6. Give any two applications of data structures. 7. Give

More information

### 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

More information

### Horizon 2020 Y emprendedores en la red

Horizon 2020 Y emprendedores en la red 29 November 2011 Oportunidad para el ABI Horizon es el nuevo programa de la UE para la investigación y la innovación con llamadas desde el 2013 EL ABi debe empezar

More information

### 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

More information

### Recursive Implementation of Recursive Data Structures

Recursive Implementation of Recursive Data Structures Jonathan Yackel Computer Science Department University of Wisconsin Oshkosh Oshkosh, WI 54901 yackel@uwosh.edu Abstract The elegant recursive definitions

More information

### REVIEWER(S): Clement Anson, Tim Dodge. Ortega Industrial Contractors

GAINESVILLE REGIONAL UTILITIES Water & Wastewater Engineering SUBMITTAL REVIEW COMMENTS DATE: 11/17/14 PROJECT: GRU Dewatering SUBMITTAL NO.: 04230-001 PROJECT NUMBER: 461318.02.20.10 SUBMITTAL TITLE:

More information

### Military Scholarship & Employment Program (MSEP)

MSEP Military Scholarship & Employment Program (MSEP) INCLUDES: Army Spouse Employment Partnership (ASEP); Army/Air National Guard; Air Force; Marine Corps; Navy; Coast Guard CONTENTS SUMMARY:...3 WHO

More information

### OMEGA SOFT WF RISKEVAL

OMEGA SOFT WF RISKEVAL Quick Start Guide I. PROGRAM DOWNLOAD AND INSTALLATION... 2 II. CONNECTION AND PASSWORD CHANGE... 3 III. LIST OF WIND FARMS / PREVENTION TECHNICIANS... 4 IV. ADD A NEW WIND FARM...

More information

### Lotus Foundations Despreocupese de sus problemas de TI, enfoquese en su Negocio Network en una Caja

March 10, 2009 IBM Industry Forum Mexico City, Mexico Lotus Foundations Despreocupese de sus problemas de TI, enfoquese en su Negocio Network en una Caja Dan Kempf Business Development Executive, Latin

More information

### Técnicas Avanzadas de Inteligencia Artificial Dpt. Lenguajes y Sistemas Informáticos. FISS. UPV-EHU

Laboratorio 2 Comportamientos Técnicas Avanzadas de Inteligencia Artificial Dpt. Lenguajes y Sistemas Informáticos. FISS. UPV-EHU 1 Hilo de ejecución de un agente Ejecución del comportamiento onstart()

More information

### UNIVERSIDADES PÚBLICAS DE LA COMUNIDAD DE MADRID PRUEBA DE ACCESO A ESTUDIOS UNIVERSITARIOS (LOGSE) Curso 2008-2009 (Junio)

UNIVERSIDADES PÚBLICAS DE LA COMUNIDAD DE MADRID PRUEBA DE ACCESO A ESTUDIOS UNIVERSITARIOS (LOGSE) Curso 2008-2009 (Junio) MATERIA: INGLÉS INSTRUCCIONES GENERALES Y VALORACIÓN l. Lea todo el texto cuidadosamente.

More information

### LINKED DATA STRUCTURES

LINKED DATA STRUCTURES 1 Linked Lists A linked list is a structure in which objects refer to the same kind of object, and where: the objects, called nodes, are linked in a linear sequence. we keep a reference

More information

### Keys and records. Binary Search Trees. Data structures for storing data. Example. Motivation. Binary Search Trees

Binary Search Trees Last lecture: Tree terminology Kinds of binary trees Size and depth of trees This time: binary search tree ADT Java implementation Keys and records So far most examples assumed that

More information

### Symbol Tables. Introduction

Symbol Tables Introduction A compiler needs to collect and use information about the names appearing in the source program. This information is entered into a data structure called a symbol table. The

More information

### LOS ANGELES UNIFIED SCHOOL DISTRICT POLICY BULLETIN

TITLE: NUMBER: ISSUER: Guidelines for the Use of Audiovisual Materials Not Owned, Broadcast, or Recommended by the District BUL-5210 Judy Elliott, Chief Academic Officer ROUTING Local District Superintendents

More information

### Monitoreo de Bases de Datos

Monitoreo de Bases de Datos Monitoreo de Bases de Datos Las bases de datos son pieza fundamental de una Infraestructura, es de vital importancia su correcto monitoreo de métricas para efectos de lograr

More information

### LA HOMOLOGACIÓN DE ESTUDIOS EN LA COMUNIDAD EUROPEA: PERSPECTIVAS DESDE EL PUNTO DE VISTA DEL TRABAJO SOCIAL

THE HISTORY OF SOCIAL WORK EDUCATION IN SPAIN: DOES HARMONISATION MAKE SENSE? LA HOMOLOGACIÓN DE ESTUDIOS EN LA COMUNIDAD EUROPEA: PERSPECTIVAS DESDE EL PUNTO DE VISTA DEL TRABAJO SOCIAL PAZ MÉNDEZ-BONITO

More information

### New words to remember

Finanza Toolbox Materials Your Budget A budget is a plan that helps to match your expenses to your income. Expenses are the amount of money you spend. Income is the amount of money you earn. Making a budget

More information

### DESIGN OF ACTION PLANS AGAINST NOISE IN NAVARRE, SPAIN

DESIGN OF ACTION PLANS AGAINST NOISE IN NAVARRE, SPAIN PACS: 43.50.Sr Arana, M.; San Martín, R.; Nagore, I.; Perez, D. Universidad Pública de Navarra. Departamento de Física. Campus de Arrosadia 31006

More information

### 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

More information

### Package hive. January 10, 2011

Package hive January 10, 2011 Version 0.1-9 Date 2011-01-09 Title Hadoop InteractiVE Description Hadoop InteractiVE, is an R extension facilitating distributed computing via the MapReduce paradigm. It

More information

### RIGGING CONDITIONS AND PROCEDURES

RIGGING CONDITIONS AND PROCEDURES 1. ESTIMATE BUDGET PROCEDURES 1.1 Rigging Order The exhibitor should fill in the form Quotation Order Form (enclosed in the next section) in order to elaborate the suitable

More information

### TREE BASIC TERMINOLOGIES

TREE Trees are very flexible, versatile and powerful non-liner data structure that can be used to represent data items possessing hierarchical relationship between the grand father and his children and

More information

### Binary Heaps. CSE 373 Data Structures

Binary Heaps CSE Data Structures Readings Chapter Section. Binary Heaps BST implementation of a Priority Queue Worst case (degenerate tree) FindMin, DeleteMin and Insert (k) are all O(n) Best case (completely

More information

### www.pnsystem.com 305.818.5940

POLICY ON FACE TO FACE ENCOUNTER PURPOSE: The Affordable Care Act mandates that all patients receiving Medicare home care services must have a face to face encounter with a physician or Non-Physician Practitioner

More information

### Binary Heap Algorithms

CS Data Structures and Algorithms Lecture Slides Wednesday, April 5, 2009 Glenn G. Chappell Department of Computer Science University of Alaska Fairbanks CHAPPELLG@member.ams.org 2005 2009 Glenn G. Chappell

More information

### Dave Rojas. Summary. Experience. Software Engineer - Web Developer & Web Designer davejrojas@gmail.com

Dave Rojas Software Engineer - Web Developer & Web Designer davejrojas@gmail.com Summary Software Engineer with humanistic tendencies. Passionated about Web development and Web design with a critical and

More information

### Come to London, divorce capital of the world

Examen 2014-15 Plan: [G25] ACCESO A GRADO PARA MAYORES DE 25 Asignatura: [538] Inglés Profesor: María Davinia Sánchez García Fecha: 23/04/2015 Horario peninsular 13:30-14:30 Pegatina del Estudiante Espacio

More information

### Completa los recuadros con las conjugaciones correctas del verbo TO BE. Elige la opción más adecuada para responder a las siguientes preguntas.

Completa los recuadros con las conjugaciones correctas del verbo TO BE. 1. My name James. 2. Mary the secretary. 3. John and Lucy at school. 4. I a student. 5. The boys in the garden. 6. He a lawyer. 7.

More information

### IntesisBox PA-RC2-xxx-1 SANYO compatibilities

IntesisBox PA-RC2-xxx-1 SANYO compatibilities In this document the compatible SANYO models with the following IntesisBox RC2 interfaces are listed: / En éste documento se listan los modelos SANYO compatibles

More information

### Inteligencia Artificial Representación del conocimiento a través de restricciones (continuación)

Inteligencia Artificial Representación del conocimiento a través de restricciones (continuación) Gloria Inés Alvarez V. Pontifica Universidad Javeriana Cali Periodo 2014-2 Material de David L. Poole and

More information

### Prior Knowledge Needed -Students should have a basic Spanish vocabulary (basic verbs, determiners, pronouns, adjectives, adverbs, etc)

Lesson Title: Spanish Morphology Jacob Winters Spanish II (Grades 9-11) Time Required: 50 minutes Prior Knowledge Needed -Students should have a basic Spanish vocabulary (basic verbs, determiners, pronouns,

More information

### Big Data and Scripting. Part 4: Memory Hierarchies

1, Big Data and Scripting Part 4: Memory Hierarchies 2, Model and Definitions memory size: M machine words total storage (on disk) of N elements (N is very large) disk size unlimited (for our considerations)

More information

### 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)

More information

### VMware vsphere with Operations Management: Fast Track

VMware vsphere with Operations Management: Fast Track Duración: 5 Días Código del Curso: VSOMFT Método de Impartición: Curso Cerrado (In-Company) Temario: Curso impartido directamente por VMware This intensive,

More information

### 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;

More information

### Level 2 Spanish, 2012

91148 911480 2SUPERVISOR S Level 2 Spanish, 2012 91148 Demonstrate understanding of a variety of spoken Spanish texts on familiar matters 2.00 pm Tuesday 20 November 2012 Credits: Five Achievement Achievement

More information

### Data Structure with C

Subject: Data Structure with C Topic : Tree Tree A tree is a set of nodes that either:is empty or has a designated node, called the root, from which hierarchically descend zero or more subtrees, which

More information

### The following themes form the major topics of this chapter: The terms and concepts related to trees (Section 5.2).

CHAPTER 5 The Tree Data Model There are many situations in which information has a hierarchical or nested structure like that found in family trees or organization charts. The abstraction that models hierarchical

More information

### Binary Search Trees > = Binary Search Trees 1. 2004 Goodrich, Tamassia

Binary Search Trees < 6 2 > = 1 4 8 9 Binary Search Trees 1 Binary Search Trees A binary search tree is a binary tree storing keyvalue entries at its internal nodes and satisfying the following property:

More information

### 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

More information

### Tema: Encriptación por Transposición

import java.awt.*; import java.awt.event.*; import javax.swing.*; public class PrincipalSO extends JApplet implements ActionListener { // Declaración global JLabel lblclave, lblencriptar, lblencriptado,

More information