# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

4 Pages

### sample_final_sol_2003

Course: ECE 242, Fall 2009
School: UMass (Amherst)
Rating:

Word Count: 273

#### Document Preview

For Solution Sample Final Exam 1. Please refer to the class notes and textbook for the concepts. 2. a. The adjacency matrix representation: A[i][j] 0 1 2 3 4 0 0 1 0 1 0 1 1 0 1 0 1 2 0 1 0 0 1 3 1 0 0 0 1 4 0 1 1 1 0 b. The adjacency list representation 0 1 2 3 4 1 0 1 0 1 3 2 4 4 2 3 4 3. The implementation of enqueue is: void enqueue(Node newNode) { if(newNode==null) throw new IllegalArgumentException (...

Register Now

#### Unformatted Document Excerpt

Coursehero >> Massachusetts >> UMass (Amherst) >> ECE 242

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.
For Solution Sample Final Exam 1. Please refer to the class notes and textbook for the concepts. 2. a. The adjacency matrix representation: A[i][j] 0 1 2 3 4 0 0 1 0 1 0 1 1 0 1 0 1 2 0 1 0 0 1 3 1 0 0 0 1 4 0 1 1 1 0 b. The adjacency list representation 0 1 2 3 4 1 0 1 0 1 3 2 4 4 2 3 4 3. The implementation of enqueue is: void enqueue(Node newNode) { if(newNode==null) throw new IllegalArgumentException ( "Trying to enqueue null onto the queue" ); if( isEmpty()) front = newNode; else rear.next = newNode; rear = newNode; } 4. The implementation of the add method is: void add(Node newNode, Node pos) { if(newNode==null) throw new IllegalArgumentException ( "Illegal arguments" ); if(pos ==null) pos = newNode; else add(newNode, pos.next); } 5. a. O(N) b. O(N) c. O(N) This is the recursive implementation of the search. But the complexity is still linear. d. O(N2) 6. a. The implementation of dequeue is: Node dequeue() { if(isEmpty()) new throw IllegalStateException("Trying to dequeue an empty queue"); Node item = front; front = front.next; if(front == null) rear = null; } return item; b. The implementation of merge method is: static Node merge(Node n1, Node n2) { if(n1==null && n2 ==null) return null; else if(n1==null&&n2!=null) return n2; else if(n1!=null && n2==null) return n1; Node ptr1 = n1; Node ptr2 = n2; Node mergedfront, ptr; if(ptr1.value<ptr2.value) { mergedfront = ptr1; ptr1 = ptr1.next; } else { mergedfront = ptr2; ptr2 = ptr2.next; } ptr=mergedf...

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:

UMass (Amherst) - ECE - 242
Project 1 ECE242 Data Structures in Java Spring 2003 Due date: 11:00pm on February 18, 2003 (Off-campus, 10 days after receiving the videotape of this lecture) Description: This project gives you a chance to get familiar with some basic Java programm
UMass (Amherst) - ECE - 242
ECE 242 Spring 2003Data Structures in Javahttp:/rio.ecs.umass.edu/ece242Object-Oriented Programming (1)Prof. Lixin GaoECE242 Spring 2003 Data Structures in Java, Prof. Gao 1Today's Topics Object Oriented Design Class Instance variables
UMass (Amherst) - ECE - 242
ECE 242 Data Structures in Java Instructor: Prof L. Gao Project 4 Queue implementation using Linked ListDue date: 11:00pm on Apr 10, 2003 (Off-campus, 10 days after receiving the videotape of this lecture) In this project you will use Linked List
UMass (Amherst) - ECE - 242
Project 1 ECE242 Data Structures in Java Spring 2003 Due date: 11:00pm on February 18, 2003 (Off-campus, 10 days after receiving the videotape of this lecture) Description: This project gives you a chance to get familiar with some basic Java programm
UMass (Amherst) - ECE - 242
ECE242: Spring 2003 Prerequisites Test Solution(Not counted toward your grade) Instructor: Prof. Lixin GaoName: Student ID:Questions: 1. (a) What year are you in? What is your major?(b) Have you taken ECE122 or any other equivalent courses? If
UMass (Amherst) - ECE - 242
ECE242 Data Structures in Java Project 5: Linked List &amp; Recursion Spring 2003 Due date: 11:00pm, Apr 26, 2003 (Off-campus, 10 days after receiving the videotape of this lecture) Description: Write a Java address book program to keep the contact infor
UMass (Amherst) - ECE - 242
Project 2 ECE242 Data Structures in Java Spring 2003 Due date: 11:00pm, March 1, 2003 (Off-campus, 10 days after receiving the videotape of this lecture) Description: (Please upload your work to PROG2 directory on ftp server, rio.ecs.umass.edu) This
UMass (Amherst) - ECE - 242
ECE 242 Data Structures in Java Instructor: Prof L. Gao Project 3 Object Oriented ProgrammingDue date: 11:00pm on March 25, 2003 (Off-campus, 10 days after receiving the videotape of this lecture) In this project you will use Object Oriented Progr
UMass (Amherst) - ECE - 242
ECE 242 Data Structures in Java Instructor: Prof L. Gao Project 4 Queue implementation using Linked ListDue date: 11:00pm on Apr 10, 2003 (Off-campus, 10 days after receiving the videotape of this lecture) In this project you will use Linked List
UMass (Amherst) - ECE - 242
Most of the students did very well on project 3. It seems thatabout 90% of the students got the concept of Object OrientedProgramming.Most of the students got the concept of passing Objects asarguments in methods and were able to manipulate the
UMass (Amherst) - ECE - 242
general comments:1. Some students did not submit all java files, especially EasyIn.java file. So we can not compile/run their program without copying EasyIn.java from our course website.2. The input format in some students' codes did not sa
UMass (Amherst) - ECE - 242
GRADING CRITERIA FOR PROJECT 3 - Object oriented programming style and code documentation (20 points) * Students must show understanding of object oriented programming concepts. Code must be split into multiple classes. -
UMass (Amherst) - ECE - 242
Schedule for ECE242 Fall 2003, NTU students+First Day 09/03/2003Project 01: 09/19/2003Project 02: 10/02/20031st Midterm: 10/17/2003 last lecture to be viewed: lecture 17 (session 17 in CD)Project 03: 10/30/2003Project 04: 11/10/20
UMass (Amherst) - ECE - 242
GRADING CRITERIA FOR PROJECT 4 Compiles Properly - 20 points Linked List Implementation - 20 points Queue using Linked list - 20 points Proper use of queue in MyCapital - 20 points Proper Output - 20 points
UMass (Amherst) - ECE - 242
The Grading Criteria for Project 1 was as follows:1. Missing any neccessary java files -10 points2. Incorrect input format (inconsistent with requirements) -10 points3. Program does not allow the customer to check
UMass (Amherst) - ECE - 242
Grading Criteria: 50 points for each section -10 points if the code does not compile -5 points for minor errors for extra credit : 10 points for random generation of records and 10 points if you calculated the runni
UMass (Amherst) - ECE - 242
General Comments:Almost everyone has got this project right. This shows that they have got the concept of using recursion fairly well.
UMass (Amherst) - ECE - 122
From tessier@ecs.umass.edu Sat Sep 2 17:39:47 2006From: tessier@ecs.umass.edu (Russell Tessier)Date: Sat, 2 Sep 2006 12:39:47 -0400 (EDT)Subject: [Ece122_list] Undergraduate TA opportunityIn-Reply-To: &lt;200608241303.k7OD30Z12225@davis.ecs.umass.
UMass (Amherst) - ECE - 697
Lecture Oct 16Q1:How about this case: (slide 15), for case2, Path(A.B.C.D.E,R) and path (C,D, E,R) and then receive update path (B,C, F,R)A:Then, (B,C, F,R) is infeasible. - choose the one 'most' direct.Q2:Why distinguish policy withdrawal a
UMass (Amherst) - ECE - 697
Lecture notes for &quot;Network topology-Inferences&quot;Part IQuestion: Why IPSs put their resource message on the Internet?Answer: Many people could benefit from them. And it's a good method to debug their own network also.Q: Does &quot;Loo
UMass (Amherst) - ECE - 697
Q1) Whether Dispute wheel approach is used in actual BGP protocol to judge stability.A1) No, as they are very resource inetnsive. It's more of a theoretical approach.Q2) What is the difference between NP complete and NP-hard?A2) NP complete are t
UMass (Amherst) - ECE - 697
-ECE 697 F-Advanced Computer Networks-Class notes for IP addressing and Routing Protocols--Hot topic for discussion and research: -1. Do the network prefixes have to be continuous bits in the IP address?2.Why do we do multihoming?A
UMass (Amherst) - ECE - 697
1.Q: Why not generating network topologies from top tiers to lower tiers?A: If so, the generator will span a much larger area geography as well as relationships which cause too much labor.2.Q: Is Waxman model reasonable for locality?A: It
UMass (Amherst) - ECE - 697
HLP: A Next Generation Inter-domain Routing ProtocolLakshminarayanan Subramanian Matthew Caesar Morley Mao Scott Shenker Cheng Tien Ee Ion Stoica Mark HandleyAbstractIt is well-known that BGP, the current inter-domain routing protocol, has many d
UMass (Amherst) - ECE - 665
Randomized Algorithms1Upper BoundsWe'd like to say &quot;Algorithm A never takes more than f(n) steps for an input of size n&quot; &quot;BigO&quot; Notation gives worstcase, i.e., maximum, running times. A correct algorithm is a constructive upper bound on the c
UMass (Amherst) - ECE - 697
Routing BehaviorProf. Gao Persistent OscillationECE697A Fall 2003 Advanced Computer Networks OutlineSo far, Persistent Oscillation due to EBGPPersistent Oscillation due to IBGP Routing oscillation in IBGP with route reflect
UMass (Amherst) - ECE - 697
UMass (Amherst) - ECE - 697
Routing Behavior Routing InstabilityProf. Gao ECE697A Fall 2003 Advanced Computer Networks OutlineEndtoEnd measurementRouting dynamicsLargescale routing behavior in the Internet Delayed Internet routing convergence Motivatio
UMass (Amherst) - ECE - 665
ShortestPaths8 B 2 8 2 7 5 E 3 C A 0 4 1 8 F D 5 3 2 9ShortestPaths1OutlineandReadingWeightedgraphs(7.1) Shortestpathproblem Shortestpathproperties Algorithm EdgerelaxationDijkstrasalgorithm(7.1.1) TheBellmanFordalgorithm(7.1.2) Short
UMass (Amherst) - ECE - 697
UMass (Amherst) - ECE - 697
Network Topology PropertiesProf. Gao ECE697A Fall 2003 Advanced Computer Networks OutlineHow does network topology look like?Properties of Network TopologyRandom Graph?Degree distributionStructure Power lawHierarchical
UMass (Amherst) - ECE - 697
Research Progress on Interdomain RoutingProf. Gao ECE697J Spring 2005 Advanced Computer Networks Where are we in interdomain routing?Research since 1997, more intensive last five years Both theoretical research as well as extensive m
UMass (Amherst) - ECE - 697
Introduction Prof. Gao ECE697J Spring 2005 Advanced Computer NeworksToday's Outline Course description Course format A survey from youCourse GoalsIntroduction to research topics in computer networks Research skills: Survey existing
UMass (Amherst) - ECE - 697
UMass (Amherst) - ECE - 697
BGP/Router Behavior under StressProf. Gao ECE697A Fall 2003 Advanced Computer Networks Outline BGP behavior under stress Router response on large BGP routing table load What could cause BGP instability? How BGP behaves unde
UMass (Amherst) - ECE - 697
RoutingBehaviorPersistentOscillationProf.Gao ECE697AFall2003 AdvancedComputerNetworksOutlinePersistentOscillationduetoEBGP Mightneverconverge AnalysisofBGPconvergenceproperties StableInternetroutingwithoutglobalcoordination Routingosc
UMass (Amherst) - ECE - 697
NetworkTopology FaultToleranceProf.Gao ECE697AFall2003 AdvancedComputerNetworks OutlineFaulttoleranceofInternettopology Randomfailures Selectivefailures(attacks)RouterlevelTopologySCANandLucentInternetMapping Project Routerlevelt
UMass (Amherst) - ASTR - 114
B 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35RVWYAstronomy 114 - Spring 2008 - Prof. Julio NavarroStudent Code Homework Quiz Final Exam Letter Grade grade grade grade Final63 158 415 436
UMass (Amherst) - ECO - 5
On Subjacency and A movement in Hindi/Urdu One of the long-term debates in the modular approach concerns the level at which Subjacency applies. The locus of the issue is the fact that languages like English, which involve overt displacement of the Wh
UMass (Amherst) - LING - 201
UMass (Amherst) - LING - 201
Linguistics 201 Section B Morphology Handout 1 If you were asked what the smallest meaningful element in your language was, your first answer might have been words, obviously. This answer seems obvious to us because we ordinarily think of utterances
UMass (Amherst) - LING - 201
Linguistics 201/Section E February 14, 2008 Morphology Handout 3 1. Morphological trees So far we have indicated morpheme boundaries simply by putting a hyphen between the morphemes: cat-s, mean-ing-ful etc. However, this notation is not accurate eno
UMass (Amherst) - LING - 201
Ling 201/ Section E Lecture NotesIntroduction1. Defining properties of human languages Human language is a discrete combinatorial system: Speakers have at their disposal an inventory of building blocks which they can combine to form bigger units (
UMass (Amherst) - LING - 201
Homework Assignment 4 Name: _Page 1Linguistics 201, Sect B.~ I. FranaHomework Assignment 4 Due date: 1. Voiced or voiceless? Thursday March 13 at the beginning of classAre the first and last sounds in each of the following words voiced or voi
UMass (Amherst) - LING - 201
Homework Assignment 5 Name: _Page 1Linguistics 201, Sect E~ I. FranaHomework Assignment 5 Due date: Tuesday March 25 at the beginning of classFor this homework, you need to use the IPA charts on the last page. Good luck and happy spring break
UMass (Amherst) - LING - 201
Homework Assignment 6 Name: _Page 1Linguistics 201, Sect E.~ I. FranaHomework Assignment 6 Due date: 1. Spanish Tuesday April 1st at the beginning of classExamine the sound segments [d] and [] in the following data from Spanish. 1. [drama] 2.
UMass (Amherst) - LING - 201
Homework Assignment 7 Name: _Page 1Linguistics 201, Sect E.~ I. FranaHomework Assignment 7 Due date: 1) Constituency tests Use the constituency tests from the lecture notes and from class to determine (i) whether the phrases below sentences 1-3
UMass (Amherst) - LING - 201
Homework Assignment 8 Name: _Page 1Linguistics 201, Sect E.~ I. FranaHomework Assignment 8 Due date: Tuesday April 29 at the beginning of classMake sure your trees are complete and tidy! Current set of PS-rules (as of April 24) S NP (Aux) VP
UMass (Amherst) - LING - 201
Linguistics 201/E March 5, 2008Phonetics1. Try to put the IPA symbols from your IPA chart in the right place in the table, considering these three factors: place of articulation (bilabial, alveolar etc.); manner of articulation (stop, fricative, e
UMass (Amherst) - LING - 201
Homework Assignment 10 Name: _Page 1Linguistics 201, Sect E.~ I. FranaHomework Assignment 10 Due date: New set of PS-rulesNP-rules S NP (Aux) VP PP P NP CP C S AP (AdvP) A (PP) AdvP (Adv) Adv NP (Det) N' N' N' PP N' AP N' N' N (PP) VP-rules
UMass (Amherst) - LING - 201
UMass (Amherst) - LING - 201
LINGUISTICS 201 ~ SECTION E INTRODUCTION TO LINGUISTIC THEORYTuesday &amp; Thursday 9:30-10:45 Bartlett 212Instructor: Email: Office: Office Hours: Mailbox:Ilaria Frana ilaria@linguist.umass.edu South College 305 South College is the old red brick b
UMass (Amherst) - PUBP - 606
C hapte 7 r Public GoodsHom work se 5 live e tAaron S Ye . lowitz - C opyright 2005 Worth Publishe rsPublic goods Marke failure t Ke proble fre ride proble y m e r mDe finition Non-rival in consum ption: Non-e xcludable The is no way to
UMass (Amherst) - MGU - 2005
Topics in Formal Semantics, Lecture 6 Barbara H. Partee, MGU March 29, 2005Topics in Formal Semantics, Lecture 6 Barbara H. Partee, MGU March 29, 2005Lecture 6. Semantic Typology of Indefinites II11. Introduction .. 2 2. Specific indefinites. ..
UMass (Amherst) - NZ - 2006
Ling 310 The Structure of Meaning, Lecture 1 B.H. Partee, February 20, 2006 p.1Lecture 1: Introduction to Formal Semantics and Compositionality1. Compositional Semantics .. 1 1.1. The Principle of Compositionality. . 1 1.2. Model-theoretic Semanti
UMass (Amherst) - RGGU - 2005
Formal Semantics, Lecture 9 B. H. Partee, RGGU April 21, 2005 p. 1Formal Semantics, Lecture 9 B. H. Partee, RGGU April 21, 2005 p. 2Lecture 9: Formal semantics and formal pragmatics0. Syntax, Semantics, Pragmatics. .. 1 1. Grices Conversational
UMass (Amherst) - NZ - 2006
The Structure of Meaning, Lecture 10 Barbara H. Partee, March 27, 2006Lecture 10. Compositionality, context-dependence, and meaning shifts.1. The difference between modifier constructions and compounds. .. 1 2. Favorite and genitives. 2 2.1. Theor
UMass (Amherst) - MGU - 2007
Formal Semantics and Current Problems of Semantics, Lecture 5 Barbara H. Partee, MGU, March 13, 2007 p. 1Lecture 5. Negation I1. Negation in Logic. ..1 2. Negation in natural language: syntax, semantics, pragmatics.3 2.1. Syntactic, semantic, prag
UMass (Amherst) - MGU - 2007
Topics in Formal Semantics, Lecture 11 Barbara H. Partee, MGU April 24, 2007Lecture 11. Semantic Typology of Indefinites II11. Introduction..2 2. Specific indefinites.3 2.1 Properties:..3 2.2 Analyses:..5 2.2.1 Fodor and Sag (1982): Referential an
UMass (Amherst) - MGU - 2007
Formal Semantics and Current Problems of Semantics, Lecture 1 B.H. Partee, MGU, February 13, 2007 p.1Lecture 1: Introduction to Formal Semantics and CompositionalityLecture 1: Introduction to Formal Semantics and Compositionality..1 1. Composition
UMass (Amherst) - MGU - 2007
Formal Semantics and Current Problems of Semantics, Lecture 4 Barbara H. Partee, MGU, March 6, 2007 p. 1Lecture 4. Noun Phrases and Generalized Quantifiers1. Function-argument structure, syntactic categories, and semantic types..1 2. NPs as Genera