Final Exam. CSE Section M, Winter p. 1 of 16. Family Name: Given Name(s): Student Number:
|
|
|
- Kerrie Holt
- 6 years ago
- Views:
Transcription
1 Fna Exam CSE Secton M, Wnter 2010 p. 1 o 16 Famy Name: Gven Name(s): Student Numer: Gudenes and Instructons: 1. Ths s a 90-mnute exam. You can use the textook, ut no eectronc ads such as cacuators, cephones etc. 2. Answer questons n the space provded. I you need more space, use the ack o the page. Ceary ndcate that your answer contnues on the ack o the page. 3. Wrte egy. Unreadae answers w not e marked. 4. Leave your ID on the desk. A sgn-up sheet w e dstruted durng the test. By sgnng t, you acknowedge that you are regstered n the course and you are the owner o the assocated ID.. Keep your eyes on your own work. At the dscreton o the nvgators, students may e asked to move. Queston Out o Mark Q1 34 Q2 36 Q3 30 Tota 100 Letter grade
2 p. 2 o 16 Q1. [34 marks] Suppose that you are asked to test an app that accepts as nput a numerca range and prnts out a the numers n that range separated y spaces. An exampe run or such an app woud e: Enter a numerca range: I the ounds o the range are gven n descendng order, no output shoud e produced, as n: Enter a numerca range: 13-9 The mpementaton you are testng s shown eow. It compes wth no errors. Pages n the textook contan descrptons o the methods used n ths app. mport java.ut.scanner; mport java.o.prntstream; puc cass Q1 { puc statc vod man(strng[] args) { Scanner nput = new Scanner(System.n); PrntStream output = System.out; output.prnt("enter a numerca range: "); Strng str = nput.nextlne(); nt dash = str.ndexo("-"); Strng et = str.sustrng(0, dash); Strng rght = str.sustrng(dash + 1); nt egn = Integer.parseInt(et); nt end = Integer.parseInt(rght); or (nt = egn; < end; ++) { output.prnt( + " "); output.prntn(end);
3 p. 3 o 16 In the space eow and on the next page, descre a set o test cases that you woud deveop or ths app. For each test case, ndcate whether t w pass, revea a ogc error, or produce a run-tme error. For every test case that does not pass, ndcate how you woud x the proem. You do not have to provde exact code, smpy a descrpton o the changes you woud make.
4 p. 4 o 16 There s a ug: Input 13-9 produces 13 nstead o nothng. Aso, there s no dash or non-numers, there w e exceptons smar to the exampe n the textook. A other test cases shoud pass. 4 marks: Upper ound > Lower ound. Works ok. 4 marks: Upper ound = Lower ound. Works ok. 6 marks: Upper ound < Lower ound. Produces output nstead o nothng. Add statement. 6 marks: Negatve numers. NumerFormat Excepton the rst numer s negatve, ogc error smar to Upper ound < Lower ound ony the second numer s negatve. 4 marks: Overow numers. NumerFormatExcepton marks: No dash. IndexOutOBoundsExcepton marks: Non-ntegers around the dash. NumerFormatExcepton
5 p. o 16 Q2. [36 marks] Consder the API or the three casses Anma, Cat, and Dog eow. puc astract cass Anma Ths cass encapsuates an anma. Fed Deta puc Strng name The name o ths anma Method Deta puc astract vod prntname() Prnts out normaton aout ths anma. puc cass Cat extends Anma Ths cass encapsuates a cat. Constructor Deta puc Cat(Strng s) The name ed s assgned the vaue o s Parameters: s - the name o ths cat Method Deta puc vod prntname() Aways prnts out the strng "Cat", oowed y a space, oowed y the vaue o the name ed, oowed y a newne. puc vod meow() Aways prnts out the strng "Meow!" oowed y a newne. puc cass Dog extends Anma Ths cass encapsuates a dog. Constructor Deta puc Dog(Strng s) The name ed s assgned the vaue o s Parameters: s - the name o ths dog Method Deta puc vod prntname() Aways prnts out the strng "Dog", oowed y a space, oowed y the vaue o the name ed, oowed y a newne. puc vod ark() Aways prnts out the strng "Ar!" oowed y a newne.
6 p. 6 o 16 Part 1: For each one o the code segments n ths and the next page, check the ox next to the expected outcome. Foow the nstructons gven ater the seected answer. You can assume a needed casses have een mported. No marks w e awarded wthout error expanaton or correct output as the case may e. Each code segment s worth 4 marks. (a) Anma a1 = new Dog("Moy"); a1.prntname(); Compes and runs (wrte output n space eow). Compe-tme error (expan source o error). Run-tme error (expan source o error). Compes and runs. Output s: Dog Moy () Anma a2 = new Dog("Moy"); a2.ark(); a2.prntname(); Compes and runs (wrte output n space eow). Compe-tme error (expan source o error). Run-tme error (expan source o error). Compe-tme error. Anma. Method ark() s not avaae or reerences o type (c) Dog d3 = new Cat("Astor"); d3.meow(); d3.prntname(); Compes and runs (wrte output n space eow). Compe-tme error (expan source o error). Run-tme error (expan source o error). Compe-tme error. Incompate types n ne 1.
7 (d) Anma a4 = new Anma("Moy"); a4.prntname(); Compes and runs (wrte output n space eow). Compe-tme error (expan source o error). Run-tme error (expan source o error). Compe-tme error. Cass Anma cannot e nstantated. p. 7 o 16 (e) Lst<Anma> a = new ArrayLst<Dog>(); a.add(new Dog("Moy")); a.get(0).prntname(); Compes and runs (wrte output n space eow). Syntax error (expan source o error). Run-tme error (expan source o error). Compe-tme error. Incompate types n ne 1. () Anma a6 = new Dog("Moy"); Dog d6 = (Dog) a6; a6.prntname(); d6.prntname(); Compes and runs (wrte output n space eow). Syntax error (expan source o error). Run-tme error (expan source o error). Compes and runs. Output s: Dog Moy Dog Moy
8 p. 8 o 16 Part 2: The oowng code segment correcty creates and popuates a set o anmas. Segment 1 Set<Anma> zoo = new HashSet<Anma>(); Cat c1 = new Cat("Astor"); zoo.add(c1); Cat c2 = new Cat("Nutmeg"); zoo.add(c2); Dog d1 = new Dog("Moy"); zoo.add(d1); Dog d2 = new Dog("Ay"); zoo.add(d2); a) [6 marks] Assume that Segment 2 (shown eow) mmedatey oows Segment 1. In the space eow, ndcate whether Segment 2 w compe correcty or not. I t compes, then ndcate what w happen at run-tme. I t does not compe, expan why. Segment 2 Iterator<Anma> t1 = zoo.terator(); or (;t1.hasnext();) { t1.next().prntname(); Compes ok (3 marks) and produces the output on the next page (3 marks).
9 p. 9 o 16 ) [6 marks] Assume that Segment 2 has een removed and Segment 3 (shown eow) mmedatey oows Segment 1. It compes and runs wth no errors. Segment 3 Iterator<Anma> t2 = zoo.terator(); or (;t2.hasnext();) { Anma a = t2.next(); (a nstanceo Cat) { Cat c = (Cat) a; c.prntname(); (a nstanceo Dog) { Dog d = (Dog) a; d.prntname(); The output produced s: Dog Ay Dog Moy Cat Astor Cat Nutmeg Assumng ths s the correct output, provde a crtque o Segment 3 (you may use the next page as we). How coud t e mproved? (Do not provde code, ony a descrpton o the changes you woud make). Does not use poymorphsm (3 marks). Shoud reay e repaced y Segment 2 (3 marks).
10 p. 10 o 16
11 p. 11 o 16 Q3. [30 marks] The UML dagrams o the oowng casses contan a ther attrutes. The deaut constructor or every cass ntazes a prmtves to 0, and a nonprmtves to nu. The unctonaty o methods shaowcopy and deepcopy s as ther name suggests. Ant + : nt + : Bear + shaowcopy(): Ant + deepcopy(): Ant Bear + d : doue + c : Cat + shaowcopy(): Bear + deepcopy(): Bear Cat + : ong + : oat + shaowcopy(): Cat + deepcopy(): Cat Consder the oowng app that uses these casses. puc cass Q3 { puc statc vod man (Strng[] args) { Cat c1 = new Cat(); c1. = 1; c1. = 2; Bear 1 = new Bear(); 1.d = 3; 1.c = c1; Ant a1 = new Ant(); a1. = 4; a1. = 1; // Draw dagram 1 Ant a2 = new Ant(); a2. = ; a2. = 1; Cat c2 = new Cat(); c2. = 6; c2. = 7; 1.c = c2; // Draw dagram 2 Ant a3 = a2.shaowcopy(); // Draw dagram 3 Ant a4 = a3.deepcopy(); // Draw dagram 4 1 = a4..shaowcopy(); // Draw dagram
12 p. 12 o 16 In the oowng pages, draw memory dagrams to reect the contents o memory at the ve ponts durng the executon o ths app desgnated y the comments n the code. For dagrams 2-, you don t need to redraw uy the parts that are unchanged rom the prevous dagram, ut ndcate these unchanged parts ceary. For each dagram, you can assume that the garage coector has just run. You do not need to show parts o the memory where cass dentons are oaded. Tp: Reserve the rst coumn eow or the memory dagram o cass Q3. Pace a ojects n the other two coumns. (a) [6 marks] Draw dagram Q3 Cass Cat Oject 00 c a Bear Oject d c Ant Oject The address vaues do not have to e the same as aove, ut they have to pont to the correct oject. The prmtve vaues must e exacty as shown. -2 marks per mssng or extra oject -1 mark per mssng or ncorrect vaue
13 () [6 marks] Draw dagram 2. p. 13 o Q3 Cass Cat Oject 00 c a a2 140 Bear Oject 40 c2 10 d c Ant Oject Ant Oject Cat Oject The address vaues do not have to e the same as aove, ut they have to pont to the correct oject. The prmtve vaues must e exacty as shown. Changed vaues are shown n green. No ojects are removed y the garage coector. -2 marks per mssng or extra oject -1 mark per mssng or ncorrect vaue
14 (c) [6 marks] Draw dagram 3. p. 14 o Q3 Cass Cat Oject 00 Ant Oject c a a2 140 Bear Oject 40 c2 10 d a c Ant Oject Ant Oject Cat Oject The address vaues do not have to e the same as aove, ut they have to pont to the correct oject. The prmtve vaues must e exacty as shown. No ojects are removed y the garage coector. -2 marks per mssng or extra oject -1 mark per mssng or ncorrect vaue
15 (d) [6 marks] Draw dagram 4. p. 1 o Q3 Cass Cat Oject 00 Ant Oject c a a2 140 Bear Oject 40 Ant Oject c2 10 d a c a Ant Oject 80 Bear Oject d c Ant Oject 620 Cat Oject Cat Oject The address vaues do not have to e the same as aove, ut they have to pont to the correct oject. The prmtve vaues must e exacty as shown. No ojects are removed y the garage coector. -2 marks per mssng or extra oject -1 mark per mssng or ncorrect vaue
16 (e) [6 marks] Draw dagram. p. 16 o Q3 Cass Cat Oject 00 Ant Oject c a a2 140 Bear Oject 40 Ant Oject c2 10 d a c a Ant Oject 80 Bear Oject d c Ant Oject 620 Cat Oject Cat Oject 660 Bear Oject d c The address vaues do not have to e the same as aove, ut they have to pont to the correct oject. The prmtve vaues must e exacty as shown. Changed vaues are shown n green. No ojects are removed y the garage coector. -2 marks per mssng or extra oject -1 mark per mssng or ncorrect vaue
index.pdf March 20,
ndex.pdf March 20, 20 ITI 2. Introducton to omputng II Impementaton -2-: usng an nner cass We use an nner cass to create the terators: Marce Turcotte Schoo of Informaton Technoogy and Engneerng Iterator
Outline. CIS 110: Introduction to Computer Programming. Review: Interactive Sum. More Cumulative Algorithms. Interactive Sum Trace (2)
Outlne CIS 110: Introducton to Computer Programmng More on Cumulatve Algorthms Processng Text Tacklng Programmng Problems Lecture 11 Text Processng and More On Desgn ( 4.2-4.3) 10/17/2011 CIS 110 (11fa)
AP PHYSICS B 2008 SCORING GUIDELINES
AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for
Computer models of motion: Iterative calculations
Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum
News. Recap: While Loop Example. Reading. Recap: Do Loop Example. Recap: For Loop Example
Unversty of Brtsh Columba CPSC, Intro to Computaton Jan-Apr Tamara Munzner News Assgnment correctons to ASCIIArtste.java posted defntely read WebCT bboards Arrays Lecture, Tue Feb based on sldes by Kurt
Pass by Reference vs. Pass by Value
Pass by Reference vs. Pass by Value Most methods are passed arguments when they are called. An argument may be a constant or a varable. For example, n the expresson Math.sqrt(33) the constant 33 s passed
Esc101 Lecture 1 st April, 2008 Generating Permutation
Esc101 Lecture 1 Aprl, 2008 Generatng Permutaton In ths class we wll look at a problem to wrte a program that takes as nput 1,2,...,N and prnts out all possble permutatons of the numbers 1,2,...,N. For
High level vs Low Level. What is a Computer Program? What does gcc do for you? Program = Instructions + Data. Basic Computer Organization
What s a Computer Program? Descrpton of algorthms and data structures to acheve a specfc ojectve Could e done n any language, even a natural language lke Englsh Programmng language: A Standard notaton
Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
A Petrel Plugin for Surface Modeling
A Petre Pugin for Surface Modeing R. M. Hassanpour, S. H. Derakhshan and C. V. Deutsch Structure and thickness uncertainty are important components of any uncertainty study. The exact ocations of the geoogica
Written Test 2. CSE Section M, Winter p. 1 of 8. Family Name: Given Name(s): Student Number:
Written Test 2 CSE 1020 3.0 Section M, Winter 2010 p. 1 of 8 Family Name: Given Name(s): Student Number: Guidelines and Instructions: 1. This is a 50-minute test. You can use the textbook, but no electronic
Setup and Use. Version 3.7 2/1/2014
Verson 3.7 2/1/2014 Setup and Use MaestroSoft, Inc. 1750 112th Avenue NE, Sute A200, Bellevue, WA 98004 425.688.0809 / 800.438.6498 Fax: 425.688.0999 www.maestrosoft.com Contents Text2Bd checklst 3 Preparng
Outline. CIS 110: Intro to Computer Programming. What Do Our Programs Look Like? The Scanner Object. CIS 110 (11fa) - University of Pennsylvania 1
Outlne CIS 110: Intro to Computer Programmng The Scanner Object Introducng Condtonal Statements Cumulatve Algorthms Lecture 10 Interacton and Condtonals ( 3.3, 4.1-4.2) 10/15/2011 CIS 110 (11fa) - Unversty
For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
FunctionF. u nc t. Functions. CSC 211 Intermediate Programming. Functions. Why use functions? Calling a function. Function Definition.
CSC Intermedate Programmng Functons A C++ program s a coecton of one or more subprograms nown as functons There must be a functon named man() Input(s) FunctonF u nc t Output The operatng system cas t,
Setup and Use. For events not using AuctionMaestro Pro. Version /7/2013
Verson 3.1.2 2/7/2013 Setup and Use For events not usng AuctonMaestro Pro MaestroSoft, Inc. 1750 112th Avenue NE, Sute A200, Bellevue, WA 98004 425.688.0809 / 800.438.6498 Fax: 425.688.0999 www.maestrosoft.com
Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
Terminal Window. 11. Section 7 Exercises Program Memory Exercise 7-1 Swap Values in an Array Working memory Global Memory. 2 nd call 3 rd call
11. Secton 7 Exercses Program Memory Exercse 7-1 Swap Values n an Array Workng memory Global Memory class SwapTlYouDrop publc statc vod man (Strng args[ ]) nt = 0; nt a; a = new nt[] 2, 4, 6, 8, 10, 12
Outerjoins, Constraints, Triggers
Outerjoins, Constraints, Triggers Lecture #13 Autumn, 2001 Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 358 Outerjoin R S = R S with danging tupes padded with nus and incuded in
Tutorial 3 Concepts for A1
CPSC 231 Introduction to Computer Science for Computer Science Majors I Tutoria 3 Concepts for A1 DANNY FISHER dgfisher@ucagary.ca September 23, 2014 Agenda script command more detais Submitting using
Notes on Organizing Java Code: Packages, Visibility, and Scope
Notes on Organzng Java Code: Packages, Vsblty, and Scope CS 112 Wayne Snyder Java programmng n large measure s a process of defnng enttes (.e., packages, classes, methods, or felds) by name and then usng
Intro. Iterators. 1. Access
Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy
Special Edition Using Microsoft Excel Selecting and Naming Cells and Ranges
Specia Edition Using Microsoft Exce 2000 - Lesson 3 - Seecting and Naming Ces and.. Page 1 of 8 [Figures are not incuded in this sampe chapter] Specia Edition Using Microsoft Exce 2000-3 - Seecting and
Nearest Neighbor Learning
Nearest Neighbor Learning Cassify based on oca simiarity Ranges from simpe nearest neighbor to case-based and anaogica reasoning Use oca information near the current query instance to decide the cassification
PBRT core. Announcements. pbrt. pbrt plug-ins
Announcements PBRT core Dgtal Image Synthess Yung-Yu Chuang 9/27/2007 Please subscrbe the malng lst. Wndows complaton Debuggng n Wndows Doxygen (onlne, download or doxygen by yourself) HW#1 wll be assgned
Midterms Save the Dates!
Unversty of Brtsh Columba CPSC, Intro to Computaton Alan J. Hu Readngs Ths Week: Ch 6 (Ch 7 n old 2 nd ed). (Remnder: Readngs are absolutely vtal for learnng ths stuff!) Thnkng About Loops Lecture 9 Some
I ~ ~ i. ~ ~ i d) All of the above. i ~ I. ~ 2. A is a window used to communicate with users. ~ i ~ b) control ~ j ~
t " "" E-Mansoura Unversty.. Subect: Programmng Language 3 (CSE 3223) Facuty of Engneerng.. Date: Wednesday, 13 June,2012 2 nd Year Students, Tme Aowed: Three Hours, Computers & Systems Engneerng Dept.
Nachos Project 3. Speaker: Sheng-Wei Cheng 2010/12/16
Nachos Project Speaker: Sheng-We Cheng //6 Agenda Motvaton User Programs n Nachos Related Nachos Code for User Programs Project Assgnment Bonus Submsson Agenda Motvaton User Programs n Nachos Related Nachos
Navigating and searching theweb
Navigating and searching theweb Contents Introduction 3 1 The Word Wide Web 3 2 Navigating the web 4 3 Hyperinks 5 4 Searching the web 7 5 Improving your searches 8 6 Activities 9 6.1 Navigating the web
CS240: Programming in C. Lecture 12: Polymorphic Sorting
CS240: Programmng n C ecture 12: Polymorphc Sortng Sortng Gven a collecton of tems and a total order over them, sort the collecton under ths order. Total order: every tem s ordered wth respect to every
3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
Data Management Updates
Data Management Updates Jenny Darcy Data Management Aiance CRP Meeting, Thursday, November 1st, 2018 Presentation Objectives New staff Update on Ingres (JCCS) conversion project Fina IRB cosure at study
Assembler. Building a Modern Computer From First Principles.
Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought
CSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Steve Setz Wnter 2009 Qucksort Qucksort uses a dvde and conquer strategy, but does not requre the O(N) extra space that MergeSort does. Here s the
Professor: Alvin Chao
Professor: Avin Chao CS149 For Each and Reference Arrays Looping Over the Contents of an Array We often use a for oop to access each eement in an array: for (int i = 0; i < names.ength; i++) { System.out.printn("Heo
124 Chapter 8. Case Study: A Memory Component ndcatng some error condton. An exceptonal return of a value e s called rasng excepton e. A return s ssue
Chapter 8 Case Study: A Memory Component In chapter 6 we gave the outlne of a case study on the renement of a safe regster. In ths chapter wepresent the outne of another case study on persstent communcaton;
CHAPTER 13 FINITE ELEMENTS: STIFFNESS MATRICES
4 5 CHAPTER FINITE ELEMENTS: STIFFNESS MATRICES. Introduction The purpose of this chapter is to use two simpe exampes to expain the asics of how finite eement stiffness matrices are formuated and how static
Slide 1 SPH3UW: OPTICS I. Slide 2. Slide 3. Introduction to Mirrors. Light incident on an object
Slde 1 SPH3UW: OPTICS I Introducton to Mrrors Slde 2 Lght ncdent on an object Absorpton Relecton (bounces)** See t Mrrors Reracton (bends) Lenses Oten some o each Everythng true or wavelengths
Sample of a training manual for a software tool
Sampe of a training manua for a software too We use FogBugz for tracking bugs discovered in RAPPID. I wrote this manua as a training too for instructing the programmers and engineers in the use of FogBugz.
Solutions to the Final Exam
CS/Math 24: Intro to Discrete Math 5//2 Instructor: Dieter van Mekebeek Soutions to the Fina Exam Probem Let D be the set of a peope. From the definition of R we see that (x, y) R if and ony if x is a
A Guitar Technique Lesson with Del Casher
A utar Technque Lesson wth De Casher Whz ues and Rght Hand Pckng Technques by De Casher - edted by Davd Oakes Edtor s note: De has recenty vsted my webste and came away excted by what he found and wanted
An improved hierarchical partitioning fuzzy approach to pattern classification
An mproved herarchca parttonng fuzzy approach to pattern cassfcaton A dssertaton submtted to The Unversty of Manchester for the degree of MSc Informaton Systems Engneerng n the Facuty of Engneerng and
Introduction to Programming. Lecture 13: Container data structures. Container data structures. Topics for this lecture. A basic issue with containers
1 2 Introducton to Programmng Bertrand Meyer Lecture 13: Contaner data structures Last revsed 1 December 2003 Topcs for ths lecture 3 Contaner data structures 4 Contaners and genercty Contan other objects
ELEC 377 Operating Systems. Week 6 Class 3
ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems
Brave New World Pseudocode Reference
Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be
Arrays. Array Data Type. Array - Memory Layout. Array Terminology. Gaddis: 7.1-4,6
Arrays Unit 5 Gaddis: 7.1-4,6 CS 1428 Fa 2017 Ji Seaman Array Data Type Array: a variabe that contains mutipe vaues of the same type. Vaues are stored consecutivey in memory. An array variabe definition
Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier
Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)
5.1 The ISR: Overvieui. chapter
chapter 5 The LC-3 n Chapter 4, we dscussed the basc components of a computer ts memory, ts processng unt, ncludng the assocated temporary storage (usually a set of regsters), nput and output devces, and
Arrays. Array Data Type. Array - Memory Layout. Array Terminology. Gaddis: 7.1-3,5
Arrays Unit 5 Gaddis: 7.1-3,5 CS 1428 Spring 2018 Ji Seaman Array Data Type Array: a variabe that contains mutipe vaues of the same type. Vaues are stored consecutivey in memory. An array variabe decaration
9. BASIC programming: Control and Repetition
Am: In ths lesson, you wll learn: H. 9. BASIC programmng: Control and Repetton Scenaro: Moz s showng how some nterestng patterns can be generated usng math. Jyot [after seeng the nterestng graphcs]: Usng
CMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
As Michi Henning and Steve Vinoski showed 1, calling a remote
Reducing CORBA Ca Latency by Caching and Prefetching Bernd Brügge and Christoph Vismeier Technische Universität München Method ca atency is a major probem in approaches based on object-oriented middeware
Optimal Allocation of Multi-Platform Sensor Resources for Multiple Target Tracking
4th Internatona Conference on Informaton Fuson Chcago, Inos, USA, Juy 5-8, 0 Optma Aocaton of Mut-Patform Sensor Resources for Mutpe Target Tracng Gary Asns Space and Arborne Systems Raytheon Company E
Chapter 5: Transactions in Federated Databases
Federated Databases Chapter 5: in Federated Databases Saes R&D Human Resources Kemens Böhm Distributed Data Management: in Federated Databases 1 Kemens Böhm Distributed Data Management: in Federated Databases
Overview. CSC 2400: Computer Systems. Pointers in C. Pointers - Variables that hold memory addresses - Using pointers to do call-by-reference in C
CSC 2400: Comuter Systems Ponters n C Overvew Ponters - Varables that hold memory addresses - Usng onters to do call-by-reference n C Ponters vs. Arrays - Array names are constant onters Ponters and Strngs
Analysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
file://j:\macmillancomputerpublishing\chapters\in073.html 3/22/01
Page 1 of 15 Chapter 9 Chapter 9: Deveoping the Logica Data Mode The information requirements and business rues provide the information to produce the entities, attributes, and reationships in ogica mode.
CS1100 Introduction to Programming
Factoral (n) Recursve Program fact(n) = n*fact(n-) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact
Harvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6)
Harvard Unversty CS 101 Fall 2005, Shmon Schocken Assembler Elements of Computng Systems 1 Assembler (Ch. 6) Why care about assemblers? Because Assemblers employ some nfty trcks Assemblers are the frst
A Method for Calculating Term Similarity on Large Document Collections
$ A Method for Cacuating Term Simiarity on Large Document Coections Wofgang W Bein Schoo of Computer Science University of Nevada Las Vegas, NV 915-019 bein@csunvedu Jeffrey S Coombs and Kazem Taghva Information
Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming
Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered
Mobile App Recommendation: Maximize the Total App Downloads
Mobie App Recommendation: Maximize the Tota App Downoads Zhuohua Chen Schoo of Economics and Management Tsinghua University chenzhh3.12@sem.tsinghua.edu.cn Yinghui (Catherine) Yang Graduate Schoo of Management
Prelim 1. CS 2110, 14 March 2017, 7:30 PM Total Question Name Short answer. OO Recursion Loop invariants Max Score Grader
Prelim 1 CS 2110, 14 March 2017, 7:30 PM 1 2 3 4 5 Total Question Name Short answer OO Recursion Loop invariants Max 1 36 33 15 15 100 Score Grader The exam is closed ook and closed notes. Do not egin
Lecture 3: Computer Arithmetic: Multiplication and Division
8-447 Lecture 3: Computer Arthmetc: Multplcaton and Dvson James C. Hoe Dept of ECE, CMU January 26, 29 S 9 L3- Announcements: Handout survey due Lab partner?? Read P&H Ch 3 Read IEEE 754-985 Handouts:
Load Balancing by MPLS in Differentiated Services Networks
Load Baancing by MPLS in Differentiated Services Networks Riikka Susitaiva, Jorma Virtamo, and Samui Aato Networking Laboratory, Hesinki University of Technoogy P.O.Box 3000, FIN-02015 HUT, Finand {riikka.susitaiva,
ECEn 528 Prof. Archibald Lab: Dynamic Scheduling Part A: due Nov. 6, 2018 Part B: due Nov. 13, 2018
ECEn 528 Prof. Archibad Lab: Dynamic Scheduing Part A: due Nov. 6, 2018 Part B: due Nov. 13, 2018 Overview This ab's purpose is to expore issues invoved in the design of out-of-order issue processors.
VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
A NEW STATISTIC PREDICTION MODEL AND APPLICATION IN ARITHMETIC CODING
A NEW STATISTIC PREDICTION MODEL AND APPLICATION IN ARITHMETIC CODING Hua Gang Zheng Nanng the Insttute of Artfca Integence and Robotcs, an Jaotong Unv. P.O.Bo 999# 70049 ganghua@263.net Abstract: In ths
Guidelines for Developing Effective Slide Presentations
Gudelnes for Developng Effectve Slde Presentatons Most presentatons consst of three man components: Content Vsuals Delvery Content Know your materal. No matter how great your presentaton looks, nothng
MATHEMATICS FORM ONE SCHEME OF WORK 2004
MATHEMATICS FORM ONE SCHEME OF WORK 2004 WEEK TOPICS/SUBTOPICS LEARNING OBJECTIVES LEARNING OUTCOMES VALUES CREATIVE & CRITICAL THINKING 1 WHOLE NUMBER Students wll be able to: GENERICS 1 1.1 Concept of
CSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Bran Curless Sprng 2008 Announcements (5/14/08) Homework due at begnnng of class on Frday. Secton tomorrow: Graded homeworks returned More dscusson
OPL: a modelling language
OPL: a modellng language Carlo Mannno (from OPL reference manual) Unversty of Oslo, INF-MAT60 - Autumn 00 (Mathematcal optmzaton) ILOG Optmzaton Programmng Language OPL s an Optmzaton Programmng Language
Memory and I/O Organization
Memory and I/O Organzaton 8-1 Prncple of Localty Localty small proporton of memory accounts for most run tme Rule of thumb For 9% of run tme next nstructon/data wll come from 1% of program/data closest
Efficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
$t88taltstg. Welcome Orientation Letter Mailing. m Using mail merge m Saving a document as. New Skills: Word Specialist.
l: ::' 11 "YEect#tw-L7 Word pecalst lntermedate r) go 0a o r) o5g. o - 0a o Welcome Orentaton Letter Malng New klls: m Usng mal merge m avng a document as a dfferent name lmportant Note: Pror to begnnng
Theoretical Computer Science. Fast minimal triangulation algorithm using minimum degree criterion
Theoretca Computer Scence 412 (2011) 3775 3787 Contents sts avaabe at ScenceDrect Theoretca Computer Scence journa homepage: www.esever.com/ocate/tcs Fast mnma tranguaton agorthm usng mnmum degree crteron
CE 221 Data Structures and Algorithms
CE 1 ata Structures and Algorthms Chapter 4: Trees BST Text: Read Wess, 4.3 Izmr Unversty of Economcs 1 The Search Tree AT Bnary Search Trees An mportant applcaton of bnary trees s n searchng. Let us assume
Infinity Connect Web App Customization Guide
Infinity Connect Web App Customization Guide Contents Introduction 1 Hosting the customized Web App 2 Customizing the appication 3 More information 8 Introduction The Infinity Connect Web App is incuded
AADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
Dijkstra s Single Source Algorithm. All-Pairs Shortest Paths. Dynamic Programming Solution. Performance. Decision Sequence.
All-Pars Shortest Paths Gven an n-vertex drected weghted graph, fnd a shortest path from vertex to vertex for each of the n vertex pars (,). Dstra s Sngle Source Algorthm Use Dstra s algorthm n tmes, once
Some Simple Algorithms for Some Odd Graceful Labeling Graphs
Proceedng of the 9th WSEAS Internatona Conference on APPLIED INFORMATICS AND COMMUNICATIONS (AIC '09) Some Smpe Agorthm for Some Odd Gracefu Labeng Graph M. Ibrahm Moua (moua_6060@yahoo.com) Facuty of
Induction of fuzzy rules based on scattered data modeling and multidimensional interpolation: A novel approach
Inducton of fuzzy rues based on scattered data modeng and mutdmensona nterpoaton: A nove approach D. S. Sfrs Department of Cv Engneerng, Democrtus Unversty of Thrace, 67100 Xanth, Greece Abstract ths paper
Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)
Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)
Today s Outline. Sorting: The Big Picture. Why Sort? Selection Sort: Idea. Insertion Sort: Idea. Sorting Chapter 7 in Weiss.
Today s Outlne Sortng Chapter 7 n Wess CSE 26 Data Structures Ruth Anderson Announcements Wrtten Homework #6 due Frday 2/26 at the begnnng of lecture Proect Code due Mon March 1 by 11pm Today s Topcs:
REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.
Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent
Nkmh="y^ TurboDOS. User's Guide \.'JJ U ', -- - 'i Y. ( 1 - V? J l., e i. - - ~ 03722A
" 1 v. \.'JJ U ', Nkmh="y^ ( 1 - V? J., e. t ). ' Y TurboDOS User's Gude " FT - m -- - «- - - - ~ 03722A TurboDOS s a regstered trademark of Software 2000, nc. Turbo-Pus"' s a trademark of Mcroserve, nc.
Prelim 1. Solution. CS 2110, 14 March 2017, 7:30 PM Total Question Name Short answer
Prelim 1. Solution CS 2110, 14 March 2017, 7:30 PM 1 2 3 4 5 Total Question Name Short answer OO Recursion Loop invariants Max 1 36 33 15 15 100 Score Grader 1. Name (1 point) Write your name and NetID
17.3 Surface Area of Pyramids and Cones
Name Cass Date 17.3 Surface Area of Pyramids and Cones Essentia Question: How is the formua for the atera area of a reguar pyramid simiar to the formua for the atera area of a right cone? Expore G.11.C
CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe
CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal
Improving Low Density Parity Check Codes Over the Erasure Channel. The Nelder Mead Downhill Simplex Method. Scott Stransky
Improvng Low Densty Party Check Codes Over the Erasure Channel The Nelder Mead Downhll Smplex Method Scott Stransky Programmng n conjuncton wth: Bors Cukalovc 18.413 Fnal Project Sprng 2004 Page 1 Abstract
Midterms Save the Dates!
Unversty of Brtsh Columba CPSC, Intro to Computaton Alan J. Hu Thnkng About Loops Intro to Arrays (Obect References?) Readngs Ths Week: Ch 6 (Ch 7 n old 2 nd ed). Next Week: Ch 7 (Ch 8 n old 2 nd ed).
CSE120 Principles of Operating Systems. Prof Yuanyuan (YY) Zhou Scheduling
CSE120 Principes of Operating Systems Prof Yuanyuan (YY) Zhou Scheduing Announcement Homework 2 due on October 25th Project 1 due on October 26th 2 CSE 120 Scheduing and Deadock Scheduing Overview In discussing
Straight-line code (or IPO: Input-Process-Output) If/else & switch. Relational Expressions. Decisions. Sections 4.1-6, , 4.
If/ese & switch Unit 3 Sections 4.1-6, 4.8-12, 4.14-15 CS 1428 Spring 2018 Ji Seaman Straight-ine code (or IPO: Input-Process-Output) So far a of our programs have foowed this basic format: Input some
Constructing a Maximal Independent Set in Parallel. Mark Goldberg ( ), Thomas Spencer Department of Computer Science Rensselaer Polytechnic Institute
Constructng a Maxma Independent Set n Parae Mark Godberg ( ), Thomas Spencer Department of Computer Scence Rensseaer Poytechnc Insttute ABSTRACT The probem of constructng n parae a maxma ndependent set
Chapter Ten. Volumes and Surface Areas of Simple Solids
Capter Ten Voumes and Surface Areas of Simpe Soids We ook at o to cacuate te areas and perimeters of many geometric figures in te ast capter. As you get farter advanced in mat, you find cases ere you need
ngenius Instrumentation Overview
ngenius Instrumentation Overview NetScout Systems, Inc. 4 Technoogy Park Drive Westford, MA 01886 Teephone: 978-614-4000 Fax: 978-614-4004 Web: http://www.netscout.com NetScout is a registered trademark
Performance Evaluation
Performance Evaluaton [Ch. ] What s performance? of a car? of a car wash? of a TV? How should we measure the performance of a computer? The response tme (or wall-clock tme) t takes to complete a task?
ASIAN CONFERENCE ON COMPUER VISION, JAN.-, proposed approach. II. Mutpe vews of a pont on a ne An mage (t) =[(t);y(t); ] R of a pont p E, wth coordnat
![ASIAN CONFERENCE ON COMPUER VISION, JAN.-, proposed approach. II. Mutpe vews of a pont on a ne An mage (t) =[(t);y(t); ] R of a pont p E, wth coordnat](/thumbs/92/109854458.jpg "ASIAN CONFERENCE ON COMPUER VISION, JAN.-, proposed approach. II. Mutpe vews of a pont on a ne An mage (t) =[(t);y(t); ] R of a pont p E, wth coordnat")
ASIAN CONFERENCE ON COMPUER VISION, JAN.-, Rank Defcency Condton of the Mutpe Vew Matr for Med Pont and Lne Features Y Ma, Jana Ko»secká and Kun Huang Abstract Geometrc reatonshps governng mutpe mages