Coursehero >>
Maryland >>
UMBC >>
CS 331 Course Hero has millions of student submitted documents similar to the one below including study guides, homework solutions, papers, and exam answer keys.
331, CS Principles of Programming Languages Chapter 4 Types: Data Representation Data Representation Issues Storage Management automatic, static Scope Internal vs. External Type Concepts Instances of a type individual constants, variables, expressions Basic types built into a language, e.g. float and int in C instances of basic types are also known as firstclass objects User-defined types defined using type expressions involving existing types Basic and User-defined Types In most modern languages, basic types include integer, real, character, and Boolean Most PLs have two mechanisms for userdefined types, namely array and record Internal vs. External Representations Integers in C are not the same as integers in arithmetic word length introduces issues related to overflow e.g. -32767..32768 so some operations don t act as they should Floats and doubles are not the same as real numbers (or rationals!) conversion to binary introduces small errors Storage Classes Typically, automatic variables are associated with a given block allocated (and initialized) when block is entered known only within that block freed when block is exited Compare to static variables, which are associated with a given block, but are allocated and initialized only once User-directed Allocation In C, we have malloc and free memory leaks can be a problem uninitialized or invalid pointers can be problems In C++ we have constructors and destructors In Pascal and Modula, we have new() and dispose() In Lisp and Java, garbage collection is used Data Aggregates Arrays are homogeneous all the elements are of the same type Records (known as structs in C) are heterogeneous components may be of different types Sets are available in languages like Pascal and Modula Type expressions are used to define these Storage Allocation for Arrays Typically, array elements occupy a contiguous block of memory hence C s use of subscript 0 For multi-dimensional arrays, there are two schemes row-major: the rightmost subscript varies fastest column-major: the leftmost subscript varies Records An example in C struct date { int day; int month; int year; } DoB, DoD; In Modula, it would be TYPE date = RECORD day, month, year: CARDINAL END; VAR DoB, DoD: date; linuxbeta.gl.umbc.edu> cat -n recordeg.mod 1 MODULE recordeg; 2 3 FROM InOut IMPORT WriteLn, WriteCard; 4 5 TYPE date = RECORD 6 day, month, year: CARDINAL 7 END; 8 VAR DoB, DoD: date; 9 10 BEGIN 11 DoB.year := 1808; 12 DoD.year := 1865; 13 WriteCard(DoB.year,10); 14 WriteCard(DoD.year,10); 15 WriteLn; 16 END recordeg. linuxbeta.gl.umbc.edu> source modulasetup linuxbeta.gl.umbc.edu> gpmodula recordeg.mod linuxbeta.gl.umbc.edu> build recordeg linuxbeta.gl.umbc.edu> recordeg 1808 linuxbeta.gl.umbc.edu> 1865 Varying Records in C Note that foo.data.I or foo.data.F are defined, but not both Allows data of different types to share storage Polymorphic data types! type enum field_type {integer, real}; struct { ft field_type; union { int I; float F; } data; } foo; if (foo.data.ft == integer) printf( %d , foo.data.I); else if (foo.data.ft == real) printf( %f , foo.data.F); else printf( error ); Varying Records in Modula TYPE field_type = {integer, real}; TYPE foo_type = RECORD CASE ft: field_type OF I: INTEGER; F: REAL; END; (* of CASE *) END; (* of RECORD *) VAR foo: foo_type; IF (foo.ft = integer) WriteInt(foo.I) ELSE IF (foo.ft = real) WriteReal(foo.F) ELSE WriteString( error ); Sets as Types There are situations where sets come in handy when only certain data values are allowed, e.g. program options or file permissions, and no existing subrange type is appropriate [Mon..Sun] is not a set (Sethi book has a mistake on p. 123) Example: Sets in Modula or Pascal Operations of membership (IN), union (+), intersection (*), and set difference (-) are common Commonly implemented as bit strings TYPE colors = (white,yellow,blue,green,cyan,black,red); (* note that white < yellow < blue < < red *) VAR CRT1, CRT2: SET OF colors; VAR testColor: colors; CRT1 := {cyan,yellow,green}; CRT2 := {red,green,blue}; IF (testColor IN CRT1) THEN WriteLn; Type Coercion PLs differ in their approach to type coercion coercion refers to automatic conversion from one type to another if a PL is strongly typed, then coercion is restricted and/or explicit if a PL is weakly typed, then coercion is taken care of by the compiler, which might cause errors in recent years, the trend is towards strong typing Determining an Object s Type For static or automatic objects it s easy static float x; int y; For other objects it can be hard if (x) float *f = new float[250]; else char *f = new char[1000]; /* other statements */ /* the following statement must have a semantic error, but at compile time C++ can t tell which one is wrong since it can t know x in advance */ cout << sqrt(f[0]) << strlen(f); Static and Dynamic Checking Type checking is needed to make sure operations are well-defined on the objects to which they re being applied Static type-checking is done once, typically at compile-time Dynamic type-checking is done whenever an operation is applied to an object whose type could not be determined in advance How is Dynamic Type-Checking Done? When an object is created, a tag is attached to that object to indicate its type When that object is involved in some operation, the tag is checked to make sure that the operation is defined on such objects A hassle in terms of storage and execution time Smalltalk and other O-O PLs do this, but not C++
Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more.
Course Hero has millions of course related materials that will enable you to learn better, faster and get an A in all your courses.
Below is a small sample set of documents:
chap05.ppt
Path: UMBC >> CS >> 331 Spring, 1999
Description: Procedure Activations Chapter 5 CS 331 Procedures: Basic Terminology Procedures take zero or more arguments, and then do something e.g printf(Hello), exit, Functions take zero or more arguments, and return a value of a given type e.g. sqrt(2.),...
chap06.ppt
Path: UMBC >> CS >> 331 Spring, 1999
Description: CS 331 Modules Chapter 6 Overview Decomposition and abstraction Program organization Abstract vs. concrete User-defined types Example discussion Decomposition Break the problem down into sub-tasks stepwise decomposition (Parnas 72) But how c...
chap07.ppt
Path: UMBC >> CS >> 331 Spring, 1999
Description: CS 331, Principles of Programming Languages Chapter 7 Object-Oriented Programming What is an object? Represents some important entity in the application Has external and internal properties, which include some data, and operations to be applied ...
Java.ppt
Path: UMBC >> CS >> 331 Spring, 1999
Description: Introduction to JAVA CMSC 331 Spring1999 Introduction Present the syntax of Java Introduce the Java API Demonstrate how to build stand-alone Java programs Java applets, which run within browsers e.g. Netscape Example programs tested using...
newman.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: The structure of scientific collaboration networks M. E. J. Newman* Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501 Communicated by Murray Gell-Mann, Santa Fe Institute, Santa Fe, NM, November 13, 2000 (received for review July 12, 2000) ...
sample.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: ~ {}{|zqyxsmx wv)6Esjth qi ghrfpn { lguu q gee o D ek d Qq#(q yr vt h fpxwusrqpYpig edd`ba` P5WU5 fT8#cV2Y18XEVTS 9P9 H F9 C A 9 75 3 1 RQ6IGEDB@86420 \' $\" )(&%#! ...
p22-palsberg.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: On Site Jens Palsberg and Scott J. Baxter Teaching Reviewing to Graduate Students Incorporating the principles and practices of formal review into a Ph.D. education, smoothly and inexpensively, as part of the existing coursework. he computer scienc...
plag-ex.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: In-Class Exercise on Plagiarism Original Passage ACT-R claims that cognition emerges as the consequence of an interaction between specic units of procedural knowledge and specic units of declarative knowledge. The units of declarative knowledge are c...
newman-summary.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Paper Summary: Newman, The Structure of Scientic Collaboration Networks January 27, 2004 M. E. J. Newman, The structure of scientic collaboration networks, Proceedings of the National Academy of Sciences USA 98(2):404-409, January 16, 2001. The contr...
paraphrase.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Examples of Unacceptable Paraphrases If there are more than two words in a row that are identical to the text, you are copying, not summarizing. I would much rather see grammatically incorrect insights into the paper than a cut-and-paste summary. Ea...
bib-guidelines.ps
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Examples of Unacceptable Paraphrases If there are more than two words in a row that are identical to the text, you are copying, not summarizing. I would much rather see grammatically incorrect insights into the paper than a cut-and-paste summary. Ea...
bib-guidelines.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: BibTex and Annotated Bibliographies Marie desJardins February 5, 2004 1 BibTeX BibTeX is a program that works in conjunction with LaTeX to produce inline citations and references. To use BibTeX, you need to create a .bib le that contains your bibl...
elvins.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: A Survey of Algorithms for Volume Visualization T. Todd Elvins Advanced Scientific Visualization Laboratory San Diego Supercomputer Center \". in 10 years, all rendering will be volume rendering.\" Jim Kajiya at SIGGRAPH \'91 Many computer graphics pro...
writing_feb12.ppt
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Writing: Progress and Style CMSC 691B February 11, 2004 Prof. Marie desJardins September1999 Sources Robert L. Peters, Getting What You Came For: The Smart Students Guide to Earning a Masters or Ph.D. (Revised Edition). NY: Farrar, Straus, and Gi...
pres-feedback.xls
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: CMSC 691B Presentation Feedback Your name: Date: Presenter\'s name: Authors of paper: Please rate the presentation using the following criteria (1-poor, 2-weak, 3-fair, 4-good, 5-excellent) Content Explained what the authors did and why 1 2 3 Review...
presentations_feb17.ppt
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Giving Effective Presentations Marie desJardins (mariedj@cs.umbc.edu) CMSC 691B February 17, 2004 September1999 October 1999 Sources x Robert L. Peters, Getting What You Came For: The Smart x x x x x Students Guide to Earning a Masters or Ph.D. ...
advice.ps
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Published in Crossroads, the Online ACM Student Magazine, issues 1.2 (December 1994) and 1.3 (January 1995). How to Succeed in Graduate School: A Guide for Students and Advisors Marie desJardins marie@erg.sri.com Abstract This paper attempts to rai...
advice.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Published in Crossroads, the Online ACM Student Magazine, issues 1.2 (December 1994) and 1.3 (January 1995). How to Succeed in Graduate School: A Guide for Students and Advisors Marie desJardins marie@erg.sri.com Abstract This paper attempts to rai...
reader.txt
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: CMSC 691B OUTSIDE READER AGREEMENT STUDENT NAME: _ PROJECT TOPIC: _ READER NAME: _ By signing this form, the student agrees to deliver the literature survey and final paper assignments to the reader by the deadlines indicated below. The reader ag...
survey-review.txt
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: CMSC 691B LITERATURE SURVEY REVIEW FORM Adapted from ICML-03 review form AUTHOR\'S NAME: TITLE OF SURVEY: REVIEWER\'S NAME: -SUMMARY. Please summarize the area of this survey in one sentence. -OVERALL. Give an overall rating of the paper (mark with an ...
Zafar.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: MARCHING CUBES: A HIGH RESOLUTION 3D SURFACE CONSTRUCTION ALGORITHM William E. Lorensen Harvey E. Cline What is Volume Rendering ? What is 3 Dimensional Volume ? How do we get it ? Where is it used ? Example Questions ...
GriffinPresentation.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Interactive Navigation of Multiple Agents in Crowded Environments Jur van den Berg, Sachin Patil, Jason Sewall, Dinesh Manocha, Ming Lin 2008 Symposium on Interactive 3D Graphics Autonomous navigation and planning of multiple agents in crowded scene...
hlee_coldBootAttack.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Cold Boot Attacks on Encryption Keys J.Alex Halderman, Seth D. Schoen, Nadia Heninger, and etc. Presented by Houcheng Lee Encrypted Disks Can encrypted disk techniques, such as BitLocker (Windows), FileVault (Mac), TrueCrypt, or dm-crypt, really p...
soumiray.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Improvement in Performance of Learning Using Scaling in Reinforcement Learning Soumi Ray Tim Oates CORAL LAB University of Maryland Baltimore County The problem Reinforcement learning methods are used in many problem domains, such as robotics, ga...
Sourav_Compressed.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Inducing Probabilistic Grammars by Bayesian Model Merging Andreas Stolcke, Stephen Omohundro Proceedings of the Second International ICGI Colloqium on Grammatical Inference and Applications, volume 862, Lecture Notes on Articial Intelligence, Berlin,...
experiments_mar9.ppt
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Experiment Design for Computer Scientists Marie desJardins (mariedj@cs.umbc.edu) Modified a little by Charles Nicholas CMSC 691B September1999 October 1999 Sources x Paul Cohen, Empirical Methods in Artificial Intelligence, MIT Press, 1995. x Tom...
holte-expmethod.ppt
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: ICML2003 Minitutorial on Research, Riting, and Reviews Experimental Methodology RobHolte UniversityofAlberta holte@cs.ualberta.ca 1 February 16, 2009 Experimentsserveapurpose q q q Theyprovideevidenceforclaims,design themaccordingly Chooseapprop...
OlegTrustManagement.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Defense of Trust Management Vulnerabilities in Distributed Networks Yan(Lindsay) Sun et. al. Presented by Oleg Aulov Trust Concepts in MANET ANETs M rediction and Diagnosis P implification and Abstraction S rust Record - {subject:agent, action}...
BoostingFeiChen.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Author: Lev Reyzin and Robert E. Schapire Best Student Paper in ICML 2006 Presented by Fei Chen Introduction Boosting Margin Arc-gv Experiments Analysis Machine learning: predict the future based on the past training experience. ! One obsta...
AudumbarRogueDetection.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Rogue Access Point Detection Using Challenge-Response Mechanism Authors: Kishor D, Audumbar C Presenter: Audumbar C Paper submitted to IEEE WoWMoM - SPAWN, Jun 2008 Rogue Access Point - Background What is Rogue Access Point? Wireless network with b...
MacGlashan.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: LearningfromInducedChangesin Opponent(Re)actionsinMulti AgentGames Hoen,etal. Presentedby:JamesMacGlashan Outline Intelligent(Multi)Agents MultiAgentgames Improvementstobemadeinupdatingpolicy Experimentalenvironment Results Conclusions Questi...
KaranSensorSecurity.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures Chris Karlof and David Wagner University of California at Berkeley Presented by Karan Oberoi Overview: Threat models and security goals for secure routing in wireless sensor n...
time_mar30.ppt
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Time Management / Success Strategies Marie desJardins (mariedj@cs.umbc.edu) CMSC 691B March 30, 2004 Revised a little by Charles Nicholas March 28, 2005 September1999 October 1999 Sources x Robert L. Peters, Getting What You Came For: The Smart S...
giving-a-talk-slides.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: How to give a good research talk Simon Peyton Jones Microsoft Research, Cambridge 1993 paper joint with John Hughes (Chalmers), John Launchbury (Oregon Graduate Institute) Research is communication The greatest ideas are worthless if you keep them t...
tTestExample.xls
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: t-test example based on Gpoal Kanji, 100 Statistical Tests, p.29 times in some appropriate unit, e.g. milliseconds Brand X 31 41 59 26 15 35 89 79 32 38 46 26 43 38 nx sumx avgx 14 ny 598 sumy 42.71 avgy New Brand Y 27 18 28 18 28 45 43 23 53 68 32 7...
portfolio.txt
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: CMSC 691B: RESEARCH PORTFOLIO REQUIREMENTS Contents of Portfolio -Below is a list of items that should be included in your portfolio. (1) A Program of Study form. You do not need to obtain the signatures indicated on the form. http:/www.cs.umbc.edu/C...
multinomialDemo.xls
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: p. 118 Gopal Kanji 100 Statistical Tests Example Group 1 2 a1 9 3 p(a1) 0.12 np1 6 a2 15 8 p(a2) 0.23 np2 11.5 1.07 1.07 a3 16 13 p(a3) 0.29 np3 15 0.07 0.27 a4 7 18 p(a4) 0.25 np4 12.5 2.42 2.42 a5 3 8 p(a5) 0.11 np5 5.5 1.14 1.14 Total 50 50...
Griffin.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Willfully Misbehaving Agents Navigating in Crowded Environments Wesley Grin University of Maryland, Baltimore County Abstract ere is currently much ongoing research in simulating large crowds and their movements and behaviors. Recently, a novel two-l...
FeiChen.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Semi-Supervised Boosting on Manifolds: Exploiting Unlabeled Data Adaptively in Learning Fei Chen Department of Computer Science and Electrical Engineering, University of Maryland Baltimore County Baltimore MD, US 21250 Introduction In this paper, we ...
Mukherjee.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Hyperedge Replacement Graph Grammars Learning Algorithms and Applications Sourav Mukherjee Department of Computer Science University of Maryland, Baltimore County Hyperedge Replacement Graph Grammars p. 1/1 Motivating Problems Given a social netwo...
MacGlashan.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Mapping Discrete Tabular State Based Agent Learning Frameworks to Large or Continuous State Environments James MacGlashan Motivation Many Agent Learning frameworks designed for discrete state problems where learned values can be stored in a table Man...
Zafar.pdf
Path: UMBC >> CSEE >> 601 Fall, 2008
Description: Abstract The images sampled from the video are independently converted to a Sketch NPR image. Since the algorithm in its original state contains no coherency handling for the images, the wriggly affect is introduced in the image stream. The affect oc...
Lec25F00.ppt
Path: UMBC >> CS >> 201 Fall, 2000
Description: CMSC 201 Fall 00 Design Issues Components A component (at least for sake of this discussion) is a routine or module. In C+ a component might be an object / class Routines and Modules A routine is a generic program unit a function, procedure,...
bronson_cv.pdf
Path: UMBC >> CS >> 1 Fall, 2008
Description: Jonathan Bronson University of Maryland, Baltimore County Department of Computer Science and Electrical Engineering 1000 Hilltop Circle Baltimore, MD 21250 Voice: (443)618-3726 Lab: (410)455-8935 E-mail: jonbron1@umbc.edu Website: http:/cs.umbc.edu/j...
lab1.pdf
Path: UMBC >> CS >> 1 Fall, 2008
Description: Lab 1: Fabricating and Testing a Printed Circuit Board (PCB) May 11, 2008 Department of Computer Science & Electrical Engineering CMPE 450: Capstone I University of Maryland Baltimore County Assigned : Due (Fabrication): Due (Soldering): 1 Overvie...
lab2.pdf
Path: UMBC >> CS >> 1 Fall, 2008
Description: Lab 2: Design, Layout, and Fabricate PCB May 11, 2008 Department of Computer Science & Electrical Engineering CMPE 450: Capstone I University of Maryland Baltimore County Assigned : Due (Fabrication): Due (Soldering): 1 Overview This lab is a conti...
ch1.ppt
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: Chapter1:Introduction s PurposeofDatabaseSystems s ViewofData s DataModels s DataDefinitionLanguage s DataManipulationLanguage s TransactionManagement s StorageManagement s DatabaseAdministrator s DatabaseUsers s OverallSystemStructure DatabaseSyste...
ch2-clean.ppt
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: Chapter2:EntityRelationshipModel s EntitySets s RelationshipSets s DesignIssues s MappingConstraints s Keys s ERDiagram s ExtendedERFeatures s DesignofanERDatabaseSchema s ReductionofanERSchematoTables DatabaseSystemConcepts 2.1 Silberschatz,Korth...
ch3.ppt
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: Chapter3:RelationalModel s StructureofRelationalDatabases s RelationalAlgebra s TupleRelationalCalculus s DomainRelationalCalculus s ExtendedRelationalAlgebraOperations s ModificationoftheDatabase s Views DatabaseSystemConcepts 3.1 Silberschatz,Ko...
ch4.ppt
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: Chapter4:SQL s BasicStructure s SetOperations s AggregateFunctions s NullValues s NestedSubqueries s DerivedRelations s Views s ModificationoftheDatabase s JoinedRelations s DataDefinitionLanguage s EmbeddedSQL,ODBCandJDBC DatabaseSystemConcepts 4....
ch7-clean.ppt
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: RelationalDatabaseDesign s FirstNormalForm s PitfallsinRelationalDatabaseDesign s FunctionalDependencies s Decomposition s BoyceCoddNormalForm s ThirdNormalForm s OverallDatabaseDesignProcess Silberschatz,KorthandSudarshan FirstNormalForm s Domaini...
ch12.ppt
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: Chapter12:IndexingandHashing s BasicConcepts s OrderedIndices s B+TreeIndexFiles s BTreeIndexFiles s StaticHashing s DynamicHashing s ComparisonofOrderedIndexingandHashing s IndexDefinitioninSQL s MultipleKeyAccess DatabaseSystemConcepts 12.1 Silb...
ch15.ppt
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: Chapter15:Transactions s TransactionConcept s TransactionState s ImplementationofAtomicityandDurability s ConcurrentExecutions s Serializability s Recoverability s ImplementationofIsolation s TransactionDefinitioninSQL s TestingforSerializability. D...
ch16.ppt
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: Chapter16:ConcurrencyControl s LockBasedProtocols s TimestampBasedProtocols s ValidationBasedProtocols s MultipleGranularity s MultiversionSchemes s DeadlockHandling s InsertandDeleteOperations s ConcurrencyinIndexStructures DatabaseSystemConcepts3r...
rel-alg.pdf
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: Exercises 31 employee (person-name, street, city) works (person-name, company-name, salary) company (company-name, city) manages (person-name, manager-name) Figure 3.39. Relational database for Exercises 3.5, 3.8 and 3.10. 3.4 In Chapter 2, we saw ...
hw2solution.doc
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: Database Homework #2 Solutions Consider the following six relations for an order processing database application in a company: Customer (Cust#, Cname, City) Order(Order#, Odate, Cust#, Ord_Amt) Order_Item(Order#, Item#, Qty) Item(Item#, Unit_Price) S...
hw3-solution.txt
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: Possible Solutions for Hw3 * See the clarification for e and g a. List the Order# and Ship_date for all orders shipped from Warehouse# \"W2\". select Order#, Ship_date from Shipment where Warehouse# = \'W2\' b. List the Warehouse information from which t...
sql.pdf
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: Exercises 43 person (driver-id, name, address) car (license, model, year) accident (report-number, date, location) owns (driver-id, license) participated (driver-id, car, report-number, damage-amount) Figure 4.12. Insurance database. insert into a...
project.pdf
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: CMSC 461 Project Description and Requirements Hospital Database Application System description: You are to implement a database application to support the basic functions of a hospital: Patients are admitted to the hospital and assigned beds, and dis...
hw4_answerkey.txt
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: HW4 Answer Key 1. Exercise 7.2: List all functional dependencies satisfied by the relation of Figure 7.18. Answer: Non-trivial functional dependencies: A -> B C -> B 2. Exrercise 7.6: Compute the closure of the following set F of functional dependenc...
ch2.ppt
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: Chapter2:EntityRelationshipModel s EntitySets s RelationshipSets s DesignIssues s MappingConstraints s Keys s ERDiagram s ExtendedERFeatures s DesignofanERDatabaseSchema s ReductionofanERSchematoTables DatabaseSystemConcepts 2.1 Silberschatz,Korth...
ch7.ppt
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: Chapter7:RelationalDatabaseDesign Chapter7:RelationalDatabaseDesign s FirstNormalForm s PitfallsinRelationalDatabaseDesign s FunctionalDependencies s Decomposition s BoyceCoddNormalForm s ThirdNormalForm s MultivaluedDependenciesandFourthNormalForm ...
Presentation1.ppt
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: Univ. Registrar Banking application Bookstore The following ER diagrams are from Ullmans text website http:/www-db.stanford.edu/~ullman/fcdb TV Series Database Music collection Photo Shop Literature search ...
CarDealership.pdf
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: CMSC461 Project: Car Dealership You are to design and develop an RDBMS-based software system to support a car dealership. The system must support both sales and servicing departments of the dealership. You must track, among other details, the make an...
hw4.pdf
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: Homework 4 due April 27 beginning of class. All homework unless otherwise noted must be done independently. No late homework accepted. Chapter 7 Exercise 7.2 Exercise 7.4 Exercise 7.6 Exercise 7.11 Exercise 7.12 Are there any inferred func...
FinalReviewTopics2.ppt
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: Final Review Topics Chapter 4 SQL, Chapter 7 Relational-Database Design, Chapter 11 Storage and File Structure, Chapter 12 Indexing and Hashing, Chapter 15 Transactions, Chapter 16 Concurrency Control SQL Emphasis on Aggregate Functions, Nest...
IT-SkillSurvey.doc
Path: UMBC >> CS >> 421 Fall, 1999
Description: Software skills evaluation Name (PRINT CLEARLY): _ UMBC email address: Date: _ _ Please complete the following questions as accurately as you can. 1. Are you mainly a PC user or a Mac user or a UNIX workstation user? Use the chart below to rate...
outline.pdf
Path: UMBC >> CMSC >> 1 Fall, 2008
Description: CMSC 461: Database Management Systems Jan 30, 2007 Course Outline Instructor: Parag Namjoshi 1 Contact Information Instructor Parag Namjoshi nam1@cs.umbc.edu Oce Hours ITE 215 TA Sandor Dornbush sandor1@umbc.edu Oce Hours ITE 332 Wed 3:30-5:30 p...
outline.pdf
Path: UMBC >> CMSC >> 461 Spring, 2008
Description: CMSC 461: Database Management Systems Jan 30, 2007 Course Outline Instructor: Parag Namjoshi 1 Contact Information Instructor Parag Namjoshi nam1@cs.umbc.edu Oce Hours ITE 215 TA Sandor Dornbush sandor1@umbc.edu Oce Hours ITE 332 Wed 3:30-5:30 p...
MPLS.ppt
Path: UMBC >> CSEE >> 681 Fall, 2006
Description: Multiprotocol Label Switching (MPLS) Sookyoung Lee Agenda Problems of traditional IP routing Motivations for MPLS Objectives of MPLS What is MPLS? Label, FEC, LIB, LER, LSR, and LSP How MPLS works? LDP, CR-LEP, TE-RSVP Main capabilities ...
