5 Pages

ps4

Course: CS 205, Fall 2008
School: UVA
Rating:
 
 
 
 
 

Word Count: 2122

Document Preview

Problem cs205: Set 4: Subtyping and Inheritance Page 1 of 5 Problem Set 4 Subtyping and Inheritance Out: 20 September Due: Friday, 6 October (beginning of class) Collaboration Policy. For this problem set, you may either work alone and turn in a problem set with just your name on it, or work with one other student in your section of your choice. If you work with a partner, you and your partner should turn in...

Register Now

Unformatted Document Excerpt

Coursehero >> Virginia >> UVA >> CS 205

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Problem cs205: Set 4: Subtyping and Inheritance Page 1 of 5 Problem Set 4 Subtyping and Inheritance Out: 20 September Due: Friday, 6 October (beginning of class) Collaboration Policy. For this problem set, you may either work alone and turn in a problem set with just your name on it, or work with one other student in your section of your choice. If you work with a partner, you and your partner should turn in one assignment with both of your names on it. Regardless of whether you work alone or with a partner, you are encouraged to discuss this assignment with other students in the class and ask and provide help in useful ways. You may consult any outside resources you wish including books, papers, web sites and people. If you use resources other than the class materials, indicate what you used along with your answer. Reading: Chapter 7 and Bertrand Meyer's Static Typing and Other Mysteries of Life. Purpose Learn to use subtyping in a safe and useful way. Learn to design using inheritance. Gain some familiarity with graphical user interface programming. Add features to an image processing application (and use them to make some pretty pictures) In the first part of this assignment (questions 1-4), you will do some exercises that develop your understanding of type hierarchies and behavioral subtyping. In the second part (questions 5-11), you will enhance an image processing application using subtyping and inheritance. Subtyping Liskov's Chapter 7 and Meyer's Static Typing and Other Mysteries of Life describe very different rules for subtypes. Liskov's substitution principle requires that the subtype specification supports reasoning based on the supertype specification. When we reasoned about a call to a supertype method, we reasoned that if a callsite satisfies the preconditions in the requires clause, it can assume the state after the call satisfies the postconditions in the effects clause. This means the subtype replacement for the method cannot make the precondition stronger since then our reasoning about the callsite may no longer hold (that is, the callsite may not satisfy the stronger precondition). Hence, the type of the return value of the subtype method must be a subtype of the type of the return value for the supertype method; the types of the parameters of the subtype method must be supertypes of the types of the parameters of the supertype method. This is known as contravariant typing. Bertrand Meyer prefers covariant typing: the subtype replacement method parameter types must be subtypes of the types of the parameters of the supertype method. We will generalize his rules to apply to preconditions and postconditions also: the subtype method preconditions must be stronger than the supertype method precondition (presub => presuper) and the subtype postconditions must be stronger than the supertype postconditions (postsub => postsuper). Note that unlike the corresponding Liskov substitution rule, (presuper && postsub) => postsuper, there is no need for presuper in the covariant rule since postsub => postsuper. The signature rule in Java is stricter: subtype methods must have the exact same return and parameter types of the method they override, although they may throw fewer exception types. Java does not place constraints on the behavior of methods, however, since the compiler is not able to check this. Consider the minimal Tree class and its BinaryTree subtype, both specified on the next page. The Java compiler will not allow the getChild method of BinaryTree. Here is the error message: BinaryTree.java:29: getChild(int) in BinaryTree cannot override getChild(int) in Tree; attempting to use incompatible return type found : BinaryTree required: Tree http://www.cs.virginia.edu/cs205/ps/ps4/ 10/4/2006 cs205: Problem Set 4: Subtyping and Inheritance Page 2 of 5 public class Tree // OVERVIEW: A Tree is a mutable tree where the nodes are int values. // A typical Tree is < value, [ children ] > // where value is the int value of the root of the tree // and children is a sequence of zero or more Tree objects // that are the children of this tree node. // A Tree may not contain cycles, and may not contain the same // Tree object as a sub-tree in more than one place. public Tree (int val) // EFFECTS: Creates a tree with value val and no children: // < value, [] > public // // // // // // // void addChild (Tree t) REQUIRES: t is not contained in this. MODIFIES: this EFFECTS: Adds t to the children of this, as the rightmost child: this_post = < this_pre.value, children > where children = [ this_pre.children[0], this_pre.children[1], ..., this_pre.children[this_pre.children.length - 1], t] NOTE: the rep is exposed! public Tree getChild (int n) // REQUIRES: 0 <= n < children.length // EFFECTS: Returns the Tree that is the nth leftmost child // of this. // NOTE: the rep is exposed! public class BinaryTree extends Tree // OVERVIEW: A BinaryTree is a mutable tree where the nodes are int values // and each node has zero, one or two children. // // A typical BinaryTree is < value, [ children ] > // where value is the int value of the root of the tree // and children is a sequence of zero, one or two BinaryTree objects // that are the children of this tree node. // A BinaryTree may not contain cycles, and may not contain the same // BinaryTree object as a sub-tree in more than one place. public BinaryTree (int val) // EFFECTS: Creates a tree with value val and no children: // < value, null, null > public // // // // // // // void addChild (BinaryTree t) REQUIRES: t is not contained in this and this has zero or one children. MODIFIES: this EFFECTS (same as supertype): Adds t to the children of this, as the rightmost child: this_post = < this_pre.value, children > where children = [this_pre.children[0], this_pre.children[1], ..., this_pre.children[this_pre.children.length - 1], t] public BinaryTree getChild (int n) // REQUIRES: 0 <= n < 2 // EFFECTS: If this has n children, returns a copy of the BinaryTree // that is the nth leftmost child of this. Otherwise, returns null. http://www.cs.virginia.edu/cs205/ps/ps4/ 10/4/2006 cs205: Problem Set 4: Subtyping and Inheritance Page 3 of 5 1. (10) Does the getChild method in BinaryTree satisfy the Liskov substitution principle? Explain why or why not. 2. (10) Does the addChild method in BinaryTree satisfy the Liskov substitution principle? Explain why or why not. 3. (10) Does the getChild method in BinaryTree satisfy the Eiffel subtyping rules? Explain why or why not. 4. (10) Does the addChild method in BinaryTree satisfy the Eiffel subtyping rules? Explain why why or not. Note that the Java compiler will allow the addChild method, but it overloads instead of overrides the supertype addChild method. That is, according to the Java rules the BinaryTree class now has two addChild methods -- one is the addChild (Tree) method inherited from Tree, and the other is the addChild (BinaryTree) method implemented by BinaryTree. This can be quite dangerous since the overloaded methods are resolve based on apparent types, not actual types. For example, try this program: static public void main (String args[]) { Tree t = new BinaryTree (3); BinaryTree bt = new BinaryTree (4); t.addChild (bt); bt.addChild (new BinaryTree (5)); bt.addChild (new Tree (12)); } Note that the first call uses the inherited addChild(Tree) because the apparent type of t is Tree, even though its actual type is BinaryTree. // Calls the addChild(Tree) method // Calls the addChild (BinaryTree) method // Calls the addChild (Tree) method Rhocasa For the second part of this assignment, you will extend an image processing application (somewhat similar to Picasa, but a bit less sophisticated). Rhocasa does have one feature not provided by Picasa, which is to support filters that can involve multiple images. Download: ps4.zip -- this file contains all the source code for Rhocasa, and some sample images. Create a new project ps4 in Eclipse, containing the extracted files from ps4.zip. Create a Run configuration with the Main class as ps4.GUI. To avoid running out of memory, we need to increase the maximum size of the Java VM heap. Do this by selecting the Arguments pane, and adding a VM argument (the bottom window in the pane): -Xmx512m -ea The first argument sets the maximum size of the VM heap to 512 megabytes. The second argument turns on assertion checking. Rhocasa provides a graphical user interface (GUI) for manipulating a set of images by applying filters to generate new images. Every filter must be a subtype of the Filter datatype. The filters provided are shown in the class hierarchy below: java.lang.Object ps4.Filter ps4.PointFilter ps4.BrightenFilter ps4.GreyscaleFilter ps4.BlurFilter ps4.FlipFilter ps4.MultiFilter ps4.AddFilter ps4.TileFilter http://www.cs.virginia.edu/cs205/ps/ps4/ 10/4/2006 cs205: Problem Set 4: Subtyping and Inheritance Page 4 of 5 The Filter class is a subtype of java.lang.Object, the ultimate supertype of all Java object types. The Filter class provides methods for examining and manipulating an image including the filter abstract method. Since filter is an abstract method, the Filter abstract class provides no implementation of filter. To make a useful Filter object, we need a subclass of Filter that provides an implementation of the filter method. We provide two abstract subtypes of Filter: PointFilter -- support filters where the resulting color of each pixel can be determined only from the previous color of that pixel. The PointFilter class overrides filter with a final method (this means subtypes of PointFilter cannot override filter). MultiFilter -- a filter that is applied to a primary image and one or more secondary images For details on the provided subtypes, see the specifications in the provided code. 5. (10) Develop a new filter that replaces each pixel in the image with its negative (that is, the red value of the new image is 255 - the red value of the old image, and similarly for blue and green). To work with the provided GUI code, you should add the name of your filter to the effects array (initialized at the top of the GUI class. The GUI will load the class named ps4.effectFilter for the name selected from the menu, so if you name your class NegativeFilter in the ps4 package, you should add "Negative" to the effects array. For the next two questions, you are to implement new filters. The behavior of these filters is not specified precisely; you can determine in your implemention a good way to provide the effect described. 6. (10) Develop a new filter that tints an image so the pixels...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

UVA - CS - 205
cs205: Problem Set 5: Object-Oriented Design and ConcurrencyPage 1 of 9Out: 11 October Design Reviews: (in class) Monday, 16 October Due: Wednesday, 25 October (beginning of class)Problem Set 5Distributed Simulations(Object-Oriented Design an
UVA - CS - 655
Automated Delegation is a Viable Alternative to Multiple Inheritance in Class Based LanguagesJohn ViegaReliable Software Technologies Sterling, VA viega@list.orgPaul ReynoldsReimer BehrendsDepartment of Computer Science Department of Computer
UVA - CS - 415
Cool Type Checking Cool Run-Time OrganizationRun-Time Organization#1One-Slide Summary We will use SELF_TYPEC for C or any subtype of C. It shows off the subtlety of our type system and allows us to check methods that return self objects. The
UVA - CS - 416
OutlineProblem Solving AgentsCS 416 Artificial IntelligenceLecture 3 Uninformed Searches (mostly copied from Berkeley) Restricted form of general agentProblem Types Fully vs. partially observable, deterministic vs. stochasticProblem Formul
UVA - CS - 416
Homework assignment for chapters 8 and 9 in Russell &amp; Norvig1. Modified from 8.7 on page 269: Represent the sentence &quot;All Germans speak the same languages&quot; in predicate calculus. Use Speaks(x,l), meaning that person x speaks language l, and German(y
UVA - CS - 416
CS 416, Artificial Intelligence Midterm ExaminationFall 2004Name:_ This is a closed book, closed note exam. All questions and subquestions are equally weighted.Introductory Material1) True or False: In this course, we are studying rational agen
UVA - CS - 416
Markov decision processes (MDP)Initial StateCS 416 Artificial IntelligenceLecture 21 Making Complex Decisions Chapter 17 S0Transition Model T (s, a, s) How does Markov apply here? Uncertainty is possibleReward Function R(s) For each st
UVA - CS - 416
Mapping MDPs to POMDPsCS 416 Artificial IntelligenceLecture 22 Making Complex Decisions Chapter 17The belief state after executing action a and observing observation o is: Your belief vector, b, at state, s, evaluates to:Call this b = FORW
UVA - CS - 416
Chess Match Kasparov 1, Deep Junior 1, Draws 2CS 416 Artificial IntelligenceLecture 6 Informed SearchesCompare two heuristicsCompare these two heuristics h2 is always better than h1 for any node, n, h2(n) &gt;= h1(n) h2 dominates h1 Recall a
UVA - CS - 416
Model of Neurons CS 416 Artificial IntelligenceLecture 18 Neural Nets Chapter 20 Multiple inputs/dendrites (~10,000!) Cell body/soma performs computation Single output/axon Computation is typically modeled as linearEarly History of Neural Net
UVA - CS - 416
Midterm Exam Midterm will be on Thursday, March 13thCS 416 Artificial IntelligenceLecture 10 Logical Agents Chapter 7 It will cover material up until Feb 27thChess ArticleGarry Kasparov reflects on computerized chess IBM should have release
UVA - CS - 416
Final Exam ReminderCS 416 Artificial IntelligenceLecture 23 Making Complex Decisions Chapter 17 Final Exam is Tuesday, May 6th at 7 p.m. Let me know if you have a legitimate conflictZero-sum gamesPayoffs in each cell sum to zero Morra Two
UVA - CS - 416
Chess ArticleDeep Blue (IBM)CS 416 Artificial IntelligenceLecture 2 Agents 418 processors, 200 million positions per secondDeep Junior (Israeli Co.) 8 processors, 3 million positions per secondKasparov 100 billion neurons in brain, 2 move
UVA - CS - 416
Guest Speaker CS 416 Artificial IntelligenceLecture 15 First-Order Logic Chapter 9Topics in Optimal Control, Minimax Control, and Game Theory March 28th, 2 p.m. OLS 005 Onesimo Hernandez-Lerma Department of Mathematics CINVESTAV-IPN, Mexico CityTh
UVA - CS - 416
Midterm Exam Midterm will be on Thursday, March 13thCS 416 Artificial IntelligenceLecture 12 Logical Agents Chapter 7 It will cover material up until Feb 27thPropositional Logic We're still emphasizing Propositional Logic Very important que
UVA - CS - 416
Games&quot;Shall we play a game?&quot;CS 416 Artificial IntelligenceLecture 9 Adversarial Search Chapter 6Let's play tic-tac-toeMinimaxWhat data do we need to play?Initial State How does the game start?Successor Function A list of legal (move, s
UVA - CS - 416
I Cannot Add Students to Course CS 416 Artificial IntelligenceLecture 1 Introduction Unfortunately, this class is oversubscribed I cannot add new students to the course Potential exception for 4th-year CS Majors Feel free to stay through end of
UVA - CS - 416
Chess Kasparov won the first chess gameCS 416 Artificial IntelligenceLecture 4 Uninformed Searches (cont)Cost of Breadth-first Search (BFS) b max branching factor (infinite?) d depth to shallowest goal node m max length of any path (infin
UVA - CS - 416
Robot ExampleImagine a robot with only local sensingCS 416 Artificial IntelligenceLecture 19 Making Complex Decisions Chapter 17 Traveling from A to B Actions have uncertain results might move at right angle to desired We want robot to learn
UVA - CS - 416
CS 416, Artificial Intelligence Midterm ExaminationSpring 2003Name:_ This is a closed book, closed note exam. The standard problem is worth 3 points and problems 7, 10, 13, 14, 23, and 27 are worth double points.Introductory Material1) When did
UVA - CS - 416
Hippocampus 101 CS 416 Artificial IntelligenceLecture 20 Biologically-Inspired Neural Nets Modeling the Hippocampus In 1957, Scoville and Milner reported on patient HM Since then, numerous studies have used fMRI and PET scans to demonstrate use of
UVA - CS - 416
Hidden Markov ModelsAn attempt to understand Markov ProcessesCS 416 Artificial IntelligenceLecture 25 Hidden Markov Models Chapter 15 We know the state of the system at an instant state x_1,x_2, ., x_n at times t_1, t_2, ., t_n transitions t
UVA - CS - 416
Neural Network Assignment Due December 10thThe first two questions are required. Question three is 10% extra credit. 1. You are given a simple Perceptron with 3 inputs, A, B, and C that uses a step function with threshold of 0.5 (on the step boundar
UVA - CS - 416
CS 416, Artificial Intelligence Midterm ExaminationSpring 2003Name:_ This is a closed book, closed note exam. The standard problem is worth 3 points and problems 7, 10, 13, 14, 23, and 27 are worth double points.Introductory Material1) When did
UVA - CS - 416
Convergent Learning in Neural Networks Assignment due: December 10th at 11:59:59 p.m.There are some neural network topologies (connections between neurons) that fail to produce correct output for a given problem no matter what settings are made to t
UVA - CS - 416
HMM Example Point to stress about HMMsCS 416 Artificial IntelligenceLecture 26 Review / Movies There need not be a correlation between real states and the HMM states Example: modeling a coin tossThree-state HMM Modeling a coin tossFinal E
UVA - BIOCHEM - 503
Protein modications 1Protein acetylationJeffrey S. SmithTypes of protein modications Phosphorylation Acetylation Methylation Ubiquitylation ADP-ribosylation Sumoylation Neddylation Glycosylation Nitrosylation1AcetylationO CH3Acetyl group
UVA - BIO - 201
Lecture #16 10/10 Dr. WormingtonRecombination Freq. 206+185/2300 =0.17 (17%) How Far Apart Are B &amp; Vg? T.H. Morgan 1st to Construct a Genetic Map Using Recombination Frequencies 1 Map Unit = Recombination Frequency of 0.01 (1%) = 1 centiMorgan (c
UVA - MUSI - 162
MUSI 162 - SyllabusContact InformationWilliam E. Pease pease@virginia.edu Cavalier Bands Office Onesty Hall - 3rd Floor 434.982.5347 OH: M/W 3-5 pm Andrew Koch akoch@virginia.edu Cavalier Bands Office Onesty Hall - 3rd Floor 434.982.5347 OH: M/W 9:
UVA - MSE - 524
PHYSICAL REVIEW BVOLUME 61, NUMBER 21 JANUARY 2000-IILocally activated Monte Carlo method for long-time-scale simulations M. Kaukonen, J. Perajoki, and R. M. NieminenLaboratory of Physics, Helsinki University of Technology, P.O. Box 1100, FIN
UVA - CS - 662
Chapter1Introduction to Object-Relational Database DevelopmentOverviewThis book describes the Object-Relational Database Management Systems (ORDBMS) technology implemented in the INFORMIX Dynamic Server (IDS) product, and explains how to use it.
UVA - CS - 453
Client-side Verification of Credit Card Payment Information CS453 Electronic Commerce Fall 2007 Homework #2 JavaScriptAssigned: Thursday, September 13, 2007 Due: by 2pm Thursday, September 27, 2007 via Collab Instructions: Work individually or in a
UVA - CS - 494
CS 494 Object-Oriented Analysis &amp; Design Interaction Diagrams Examples of Collaboration and Sequence Diagrams 2001 T. Horton10/17/01H-1Dynamic Views in UML Class diagrams are models of data types What non-fundamental types are you using? H
UVA - CS - 453
CS 453 Electronic Commerce Technologies Fall 2007 Homework # 4 PHP-based E-StoreAssigned: Sunday, October 28, 2007 Due: Tuesday, November 20, by midnight that evening via electronic submission Credit: 100 points Instructions: You may work in teams
UVA - CS - 494
CS 494 Object-Oriented Analysis &amp; Design On to DesignReminder: Analysis models Earlier we modeled requirements using. Class Diagrams: Known as the Conceptual Model Sometimes known as the logical model. Classes represent domain-level entities. (
UVA - CS - 390
CS290/390: Ethics Case Studies (Feb. 9, 2006)Adopted from Michael Quinns Ethics for the Information Age, 2/e. (Addison-Wesley, 2006) Class activity: The instructor will explain about reading one or more of the cases below and discussing with fellow
UVA - CS - 494
Java Foundation Classes Java Swing, EventsReadings: Just Java 2: Chap 19 &amp; 21, or Eckel's Thinking in Java: Chap 14Slide credits to CMPUT 301, Department of Computing Science University of AlbertaSwing Portable API: The appearance and behavior
UVA - CS - 494
Using Rational Rose to Create Object-Oriented DiagramsThis is a brief overview to get students started in using Rational Rose to quickly create object-oriented models and diagrams. It is not by any means a complete introduction to Rational Rose, but
UVA - CS - 305
CS305, HCI in Software Engineering (formerly Usability Engineering) Beginning of Course Memo for Fall 2008 (version 1.0)Instructor: Dr. Tom Horton. horton(at)cs.virginia.edu 982-2217 Office Hours: MW 3-4:30pm, TTh 1-2pm Class Web site: http:/www.cs.
UVA - CS - 494
CS494 Interfaces and Collection in JavaJava Interfaces Note that the word interface Is a specific term for a language contstruct Is not the general word for communication boundary Is also a term used in UML (but not in C+)1/20/03A2-11/20/
UVA - CS - 305
The Challenge of Designing Interfaces for the Tablet PCPage 1 of 4http:/www.devx.comPrinted from http:/www.devx.com/TabletPC/Article/21302The Challenge of Designing Interfaces for the Tablet PCDesigning a usable interface for a Tablet PC pro
UVA - CS - 494
CS 494 Object-Oriented Analysis &amp; Design UML Class ModelsOverview How class models are used? Perspectives Classes: attributes and operations Associations Multiplicity Generalization and Inheritance Aggregation and composition Later: How to
UVA - CS - 494
CS 494 Adv. SW Design and DevelopmentA Tasting. Course 1: Design patterns: Intro, example Course 2: Inheritance, Interfaces, OO DesignReading Assignment Read for understanding (code if it helps) Basic Java program structure Classes and files;
UVA - CS - 494
CS 494 Object-Oriented Analysis &amp; Design Evaluating Class Diagrams Topics include: Cohesion, Coupling Law of Demeter (handout) Generalization and specialization Generalization vs. aggregation Other aggregation issuesCohesion How diverse are
UVA - CS - 494
CS 494 Object-Oriented Analysis &amp; Design Using PARTS to Illustrate Requirements ConceptsExamples based on PARTS Proposed software system: Project Artifact Report Tracking System (PARTS) PARTS' concept is very similar to commercial defecttracking
UVA - CS - 494
CS 494 Object-Oriented Analysis &amp; Design Software Architecture and DesignReadings: Ambler, Chap. 7(Sections 7.1-7.3 to start - some of this is on detailed design.)What is Design? Specification Is about What, and Design is the start of the How I
UVA - CS - 494
CS 494 Object-Oriented Analysis &amp; Design Design PatternsReadings Chapter 1 of GoF book Especially pp. 1-10, 24-26 I'll get this to you (toolkit, reserve, Web?) Eckel's Thinking in Patterns, on Web Chap. 1, &quot;The pattern concept&quot; Chap. 5, &quot;Fac
UVA - CS - 494
CS 494 Object-Oriented Analysis &amp; Design Course IntroductionDr. Tom Horton Email: horton@virginia.edu Phone: 982-2217 Office Hours: Mon. &amp; Wed., 3:30-5 p.m. and Thur. 2-3:30 (or by appointment) Office: Olsson 228B 2001 T. HortonCourse Overview O
UVA - CS - 494
CS 494 Object-Oriented Analysis &amp; Design Requirements and Use CasesBTW. Specification Documents Steven McConnell (IEEE Software, Oct. 2000) says any of the following are called &quot;requirements document&quot;: Half-page summary of software product vision
UVA - CS - 494
Chuck Allison Featurehttp:/www.cuj.com/sub/special.htmlWhat's New in Standard C+ by Chuck AllisonStandard C+ is finally real, after nine years in the making. Chuck supplies a quick guided tour of the end result. Its official! On July 20, 1998, a
UVA - CS - 390
Computer Architecture in an Era of Multi-Core ChipsKevin Skadron Univ. of Virginia Dept. of Computer Science LAVA LabA New Era of Multi-Core Architectures 2006, Kevin Skadronvs. 2006, Kevin SkadronSource: Chrostopher Reeve Homepage, http:/
UVA - CS - 305
CS305: Introducing Evaluation Readings: from IDbook: Sections 12.1, 12.2, 12.3, 12.5 Section 12.4: definitely 12.4.3 and 12.4.4 Assignment: HW1: Evaluation Homework (more info here in these slides)Where We Are. We've covered: Usability goal
UVA - EVSC - 466
Map Projections Posterhttp:/mac.usgs.gov/mac/isb/pubs/MapProjections/projections.html| The Globe | Mercator | Transverse Mercator | Oblique Mercator | Space Oblique Mercator | | Miller Cylindrical | Robinson | Sinusoidal Equal Area | Orthographic
UVA - LAW - 0708
MORTGAGE MARKET SENSITIVITY TO BANKRUPTCY MODIFICATION ADAM J. LEVITIN JOSHUA GOODMAN ABSTRACTBankruptcy has traditionally been one of the primary mechanisms used for sorting out consumer financial distress. The bankruptcy system, however, has been
UVA - LAW - 0607
State Court Debt Collection in the Old Dominion: Too Broke for Bankruptcy? Richard M. Hynes January 25, 2007 DRAFT- PLEASE DONT QUOTE OR CITE Virginia, with a population of approximately seven million, has averaged more than a million civil filings a
UVA - ASSIGN - 312
Assignment 8Problem 11. Fundamental constants from LED data. In class, we measured the threshold voltage to get appreciable light from various LEDs (red, yellow, green, blue). Use these data to obtain a rough estimate of h=e, assuming that all the
UVA - PHYS - 524
Gravitation and CosmologyLecture 8: Variational methods in mechanics and E&amp;MVariational methods in mechanics and E&amp;MElectrodynamics in Minkowski space Recall we found the equation of motion of a particle in a Lorentz vector field dp = QU F d wher
UVA - PHYS - 252
The Uncertainty PrincipleMichael Fowler University of Virginia Waves are Fuzzy As we have shown for wavepackets, the wave nature of particles implies that we cannot know both position and momentum of a particle to an arbitrary degree of accuracyif
UVA - PHYS - 252
The Lorentz TransformationsMichael Fowler, UVa Physics. 2/26/08 Problems with the Galilean Transformations We have already seen that Newtonian mechanics is invariant under the Galilean transformations relating two inertial frames moving with relativ
UVA - ASSIGN - 312
1. Explain why a transient current flows when you touch a piece of n-type semiconductor to a piece of p-type semiconductor. What is the direction of current flow? What stops the current after a while? Similar questions are in Bloomf ield, p. 439. Som