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.
3 Pages
review_exercises_key
Course: RUSS 301, Fall 2009School: South Carolina
Rating:
Word Count: 253
Document Preview
2006 301 1. When I was taking her to school we talked about her problem. [by vehicle] , . [on foot] , . Unidirectionals in the past tense 'set the scene' for an additional event. Note that the destination is in the accusative case! All such destinations are marked in green in this key. Last year I went to France. It was wonderful! . ! We use a multidirectional verb here since we're...
Unformatted Document Excerpt
Coursehero >> South Carolina >> South Carolina >> RUSS 301Course 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.
2006 301 1. When I was taking her to school we talked about her problem. [by vehicle] , . [on foot] , . Unidirectionals in the past tense 'set the scene' for an additional event. Note that the destination is in the accusative case! All such destinations are marked in green in this key. Last year I went to France. It was wonderful! . ! We use a multidirectional verb here since we're talking about a completed round trip. When I was on my way there I met an interesting young man. , . Again, the unidirectional (past of ) sets the scene for meeting the young man. I'll give you the visa when we are on our way to Russia. , . Just as in the past tense, unidirectionals in the future set the scene for another action. Do you go to Moscow every summer? They ? went to Russia every summer for 10 years. . Where are you going? I'm taking these CDs to my friends. ? - . I always take my daughter to school in the morning. / . Her parents will take her [to see her] grandmother every week. (by vehicle) . (on foot) . As in the present, multidirectionals in the future refer to repeated (not a single!) round trips. When I was on my way to the park, I saw an old friend. , . We walked around in the park and talked about life. .
2.
3.
4.
5. 6. 7. 8. 9.
10. 11.
12. 13. 14.
The driver drove us around Tashkent for a long time. . -Do you like to run/jog? -No, I'm running to class! ? -, ! We've been waiting for you. Where were you? -I went to the library. . ? - .
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:
Below is a small sample set of documents:
South Carolina - RUSS - 301
. 1 1. .: , , . 2. . . 3. . . 4. . . 5. . . 6. . . 7. . . 8. ., . 9. . . 10. . , , . . 3 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. / 12. 13. 14. 15. ! 16. 17. , , , , 18. . 19 1. 2. . 3. ? 4. . 5. . 6. . 7. . 8. -, . . 201. , . 2. , . 3. , . 4. , . 5. , . 6. ,
South Carolina - RUSS - 301
. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. . 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. . 1. 2. 3. 4. 5. 6. 7. . 1. 2. 3. 4. 5. 1 . . . . 12 . . . . . . 2 -? ! 3 ( ) 4 . . . , . . . . 6. 7. 8. 9.. . . . . . 1. 2. 3. 4. 5. 6. 7. 8. 9. . 1. 2. 3. 4. 5. 6. 7. 8. 9. . 1. 2. 3.
South Carolina - RUSS - 301
301 2008 1. My brother married a Russian last year. -Really? My sister married a Russian last week! . -?/? ! suggests greater surprise or disbelief. Be sure to know the expressions / ( ? accusative) for a woman getting married, and ( ? prepositional) f
South Carolina - RUSS - 301
301 2008 1. My brother married a Russian last year. -Really? My sister married a Russian last week! Galia wants to marry Zhenia, but is he afraid to marry her. Dostoevski was the greatest writer of the 19th century. Who was at the lecture? -Two childre
South Carolina - RUSS - 301
. 1 1. . 2. . 3. , , . 4. . 5. ! 6. . 7. . 8. . 9. . 10. . . 2 1. 2. 3. 4. / 5. 6. 7. 8. 9. 10. . 3 1. . . 2. . . 3. . . 4. . . 5. . !. . 4 1. . 2. . ,. 3. . 4. ,. 5. . . 6. . . 7. . 8. . . 9. . -. 10. , . . 14 1. I know this city much better than you do
Broward College - BUL - 2241
ADMINISTRATIVE LAW Constitutions and statutes are never complete in the sense of covering all the detailed rules that affect government and business relations. The federal government, as well as state and local governments, has dozens of administrative
Broward College - BUL - 2241
CASES Constitutions, legislatures, and administrative agencies encourage certain behavior and prevent other actions. But the boundaries of these laws are seldom self-explanatory. law must be interpreted. Case law is the collection of legal interpretations
Broward College - BUL - 2241
CONSTITUTIONS The United States Constitution and the constitution of each state establish the fundamental principles and rules by which the United States and the individual states are governed. The term constitutional law refers to the general limits an
Broward College - BUL - 2241
Historical School: Tradition One of the most often used guidelines for shaping the law is tradition, or custom, also called the historical school. Stare devises is rooted in this perspective. we attempt to link our future behavior to the behavior of those
Broward College - BUL - 2241
Law and Its Purposes Many of us might like to impose rules on others, defining their rights and responsibilities. Few of us can do this as individuals, but a majority of citizens in a democracy can agree to establish rules for business behavior. They ca
Broward College - BUL - 2241
Natural Law The term natural law refers to the idea that there are certain ethical laws and principles that are morally right and "above" the laws devised by humans. individuals should have the freedom to disobey a law enacted by majorities of people if t
Broward College - BUL - 2241
Recordkeeping employer covered by the FLSA must keep certain records for each covered, nonexempt worker. Employers must keep records on wages, hours, and other information as set forth in the Department of Labor's regulations. Most of this data is the typ
Broward College - BUL - 2241
Test 2 Write 2 paragraphs for each subject1. Facts 2. Issue 3. Reasoning and conclusion 4. Rules of law 5. Evaluation of the reasoning 6. Ambiguity in reasoning 7. Strong analogies 8. Quality of evidence 9. Rival causesAnswer.1. What is natural? 2. Wha
Broward College - BUL - 2241
Test 31. What is historical school? 2. What is legal realism? 3. What kind of logic is needed when there is a legal problem? 4. What does the followers of legal realism argue about? 5. What are the basic principle of legal realism? 6. What are judges fol
Broward College - BUL - 2241
Test 41. What is constitutional law? 2. What are statutes? 3. What does the constitution establish? 4. What is the supreme law of the land? 5. What are the United States Code? 6. What is statutory law? 7. What are the similarities of the constitution and
Broward College - BUL - 2241
Who is Covered The Fair Labor Standards Act (FLSA) is administered by the Wage and Hour Division (WHD). establishes standards for minimum wages, overtime pay, recordkeeping, and child labor. affect more than 130 million workers, both fulltime and parttim
FSU - ANT - 2100
STUDY GUIDE FORINRTRO TO ARCHAEOLOGYTEST 2Chapter 5Paleolithic hunter-gatherer- A collective term for the members of small-scalemobile or semi-sedentary societies, whose subsistence is mainly focusedon hunting game and gathering wild plants and fruit
Florida State College - CTE - 3809
Fiftypercentofshoppersbuythefirstthingtheytouch.EnvirosellAModeloftheForecastingAModeloftheForecastingProcess(Kim,2011)Forecasting:Textiles/ApparelForecasting:Textiles/ApparelLongTermForecastingFIBERCOMPANIESECONOMICCYCLESLIFESTYLETRENDSSOCIALT
Florida State College - CTE - 3809
Thecouturierdoesnotcreatefashion,heinterpretsit.YvesSt.LaurentTheThreeModernErasinFashionLipovetsky(1994).TheEmpireofFashion.Era11860sCharlesFrederickWorthShoweddesignspreparedinadvanceChangedstylesfrequentlyEmployedmodelstoshowclothesTheorgani
Florida State College - CTE - 3809
Wearenotamanufacturerofapparel.Weareacompanythatlearnswhatconsumerswant,thenweproduceit.MackeyMcDonald,PresidentandCEOofVFCorporationAModeloftheForecastingAModeloftheForecastingProcess(Kim,2011)BusinessBeginsandEndswiththeBusinessBeginsandEndswi
USC - BUAD - 311
Illustrative Exam 11BUAD311 Operations ManagementFall 2011Section A: Multiple ChoicesCircle only one.1. Which of the following statement is correct?a. Make-to-order systems are better than make-to-stock systems.b. Make-to-stock systems are better t
USC - BUAD - 311
Illustrative Exam 2 1BUAD311 Operations ManagementFall 2011Section A: Multiple Choices [No partial credits.]Circle only one.1. Of the following five expressions, how many are linear?x2 3 yylog x +35x 2 yy5x 25x + 2 ya)b)c)d)e)Only one
Broward College - ECO - ECO2013
Macroeconomics test #1 chapters (1-15) 1. What are the three categories of resource? 2. Private property rights involve what? 3. What is the law of supply? 4. Is price floor a good thing? Why or why not? explain 5. What are the two function of government
Broward College - ECO - ECO2013
Test 21. What are forecasting models? 2. Why are evidence mixed on the accuracy of forecasting from computermodels? 3. List examples of marketing signals. 4. Who is Allan Greenspan? 5. What is a recognition lag? 6. How long do lags last? 7. List the 6 p
UCSD - CSE - 105
CSE 105: Automata and Computability TheoryWinter 2012Problem Set #1Due: Monday, January 30th, 2012Problem 1 Let M = (Q, , , q0 , F ) be a DFA. Let w = w1 w2 wn be a string accepted by M , for which let r0 , r1 , . . . , rn be the corresponding accepti
UCSD - CSE - 105
CSE 105: Automata and Computability TheoryWinter 2012Problem Set #2Due: Friday, February 10th, 2012Problem 1 For a string x, let xR denote the symbol-by-symbol reverse of x. In other words, if x = x1 x2 . . . xn then xR = xn xn-1 . . . x1 . For a lang
UCSD - CSE - 105
CSE 105: Automata and Computability TheoryWinter 2012Problem Set #3Due: Monday, February 27th, 2012Problem 1 A string x is a substring of a string y if there are some (possibly empty) strings u and v such that y = uxv. For example, 000 is a substring
UCSD - CSE - 105
CSE 105: Automata and Computability TheoryWinter 2012Problem Set #4Due: Wednesday, March 14th, 2012Problem 1 Show that the following language is decidable: L= A A is a DFA and L(A) includes at least one non-palindrome .(Recall: a palindrome is a stri
UCSD - CSE - 12
CSE 12Basic Data Structures and Object Oriented Designhttp:/ieng6.ucsd.edu/~cs12f01Introduction First: Review course structure and requirements on the course website Next: A quick overview of course content Then: Abstraction, Abstract Data Types, J
UCSD - CSE - 12
CSE 12 Abstraction, Classes, and Interfaces Abstraction, continued ADT's, Classes, and Interfaces The Inheritance and Composition Patterns Intro to UML Intro to the Java Collections Framework (JCF) Intro to Unit Testing with JUnit02Abstraction (reviewe
UCSD - CSE - 12
CSE 12 ADT's, OOP, and Java ADT specifications and Programming by Contract Error handling with exceptions Test plans, test cases, and more about JUnit Generic programming and Java generic types03Specifying an ADT An ADT specifies the possible values
UCSD - CSE - 12
CSE 12 The Java Collections Framework The Java Collections Framework The Collection and List Interfaces Ambiguities in Interface Specification04Data structures, collections, containers A data structure is. an object that contains data Another word for
UCSD - CSE - 12
CSE 12 The Java Collections Framework Methods Inherited from the Object Class Iterators and the Iterator Pattern Developing a test plan for a Collection class04Methods Required by an Interface A Java interface specifies instance methods that any class
UCSD - CSE - 12
CSE 12 Analysis and Measurement of Algorithms Algorithm costs: time, space, and energy Best case, worst case, average case analysis Counting instructions and asymptotic analysis Big-O, big-Omega, big-Theta notation Introduction to algorithm measurement0
UCSD - CSE - 12
CSE 12 Fundamental Data Structures: The Array and Linked Structures Implementations of the List ADT Properties of array and linked implementations Separate and inner node classes Singly and doubly linked lists07Introduction Any interface specification
UCSD - CSE - 12
CSE 12 Fundamental Data Structures: The Array and Linked Structures Inserting at an index in a linked list Removing a node from a linked list Inner classes for node classes Comparing array and linked implementations08Operations on a singly-linked list
UCSD - CSE - 12
CSE 12 Implementing the Iterator Pattern Review of the Iterator Design Pattern Review of the Iterator and Iterable interfaces Implementing the Iterator interface The concurrent modification problem09The Iterator Software Design Pattern A common situat
UCSD - CSE - 12
CSE 12 Algorithm Time Cost Measurement Algorithm analysis vs. measurement Timing an algorithm Average and standard deviation Improving measurement accuracy10Introduction Three characteristics of programs are of interest: robustness: a program's abilit
UCSD - CSE - 12
CSE 12 The Stack Abstract Data Type The Stack ADT Stack attributes and operations Designing a test plan for Stack Implementing the Stack ADT The Adapter design pattern11Introduction Stack: a Last-In-First-Out (LIFO) data structure the last item put i
UCSD - CSE - 12
CSE 12 Implementing the Stack ADT Implementing Stack using the Adapter pattern Alternative implementations of Stack Time costs of Stack implementations12Implementing Stack using List Recall that we are implementing the Stack ADT by adapting a List In
UCSD - CSE - 12
CSE 12 The Queue ADT The Queue ADT Queue attributes and operations Designing a test plan for Queue13The Queue ADTQueue: a First-In-First-Out (FIFO) data structure the first item put into the structure will be the first item to be taken out of it Value
UCSD - CSE - 12
CSE 12 The Queue ADT and Circular Arrays Alternative implementations of Queue The Adapter pattern, revisited Circular arrays Time costs of Queue implementations14Implementing Queue Any interface specification (such as the one for Queue that we have ju
UCSD - CSE - 12
CSE 12 Java Generics and Wildcards More on Java Generics The Java Type System and Type Wildcards Unbounded and Bounded Wildcards15Java Generics and the Java Type System Consider the inheritance hierarchy shown in this UML diagram:Circle+display()Sh
UCSD - CSE - 12
CSE 12 Recursion What is recursion? Recursive definitions Recursion as a problem solving strategy Recursive programming Relationship between recursion and iteration Time and space costs of recursion16What is recursion? A recursive function is a functi
UCSD - CSE - 12
CSE 12 Sorting Algorithms Sorting and ordering Fundamental sorting algorithms Time and space costs of sorting17Sorting and ordering To sort elements of a set. a set of integers, or a set of Strings, or a set of Objects. a total ordering must apply to
UCSD - CSE - 12
CSE 12 Ordering Objects Comparison and ordering Comparing primitive types and objects The Comparable interface Designing a generic sorting method Making a class Comparable18Comparing Objects for Ordering Every Java object "knows how" to compare itsel
UCSD - CSE - 12
CSE 12 Priority Queues, Trees, Heaps The PriorityQueue ADT PriorityQueue implementations Trees and tree terminology Binary trees Heaps and heap implementations19IntroductionPriority Queue: a HighestPriority-In-First-Out (HPIFO) data structure the high
UCSD - CSE - 12
CSE 12 Priority Queues, Heapsort, and Resizable Arrays Heaps and heap implementations Priority queues and sorting The Heapsort sorting algorithm Resizeable arrays20HeapsA heap is a special kind of binary tree that has the following invariants "Struct
UCSD - CSE - 12
CSE 12 Binary Search Trees Copying collections and depth of copy Binary Search Tree ADT A Linked Implementation of Binary Search Tree Binary Search Tree Operation Time Costs21Copying Collections However sometimes it is useful to create a copy of a Col
UCSD - CSE - 12
CSE 12 Binary Search Trees Remove in a BST BST best and worst case time costs Balanced BST's AVL trees and AVL rotations21Implementing remove() in a BST Removing a node is a little trickier than add() or contains() Need to keep the tree connected, and
UCSD - CSE - 12
CSE 12 Parse Trees and Abstract Syntax Trees Compilers and Interpreters Syntax Rules and Backus-Naur Form Definitions Derivations and Parse Trees Parse Trees and Abstract Syntax Trees (AST's)23Using Algorithms and Data StructuresDigital computers can
UCSD - CSE - 12
CSE 12 Evaluating Abstract Syntax Trees Creating and Evaluating AST's Semantic Rules and BNF Rules The Map ADT and Symbol Tables24Abstract syntax treesA parse tree includes all the information in a derivation of a string from the start symbolIn a par
UCSD - CSE - 12
CSE 12 The Map Abstract Data Type The Map ADT Implementations of the Map ADT Hashing and Hash Tables Collisions and Collision Resolution Strategies25The Map ADT The other ADT's we have talked about are container structures intended to hold data of a c
UCSD - CSE - 12
CSE 12 The Map Abstract Data Type Hash table time costs Hash functions The Map<K,V> interface and implementations26Hashing and hash tables We are considering issues in implementing hash tables We have seen that since the number of possible key values
UCSD - CSE - 12
Midterm Examination #1 CSE 12 , UCSD (practice)RULES: 1. Don't start the exam until the instructor says to. 2. This is a closed-book, closed-notes, no-calculator exam. Don't refer to any materials other than the exam itself. 3. Write your name, and your
UCSD - CSE - 12
Midterm Examination #2 CSE 12 , UCSD (practice)RULES: 1. Don't start the exam until the instructor says to. 2. This is a closed-book, closed-notes, no-calculator exam. Don't refer to any materials other than the exam itself. 3. Write your name, and your
UCSD - CSE - 12
P2 README11/7/11 5:28 PMProgramming assignment #2: CSE 12 Fall 2011Here's a description of the second programming assignment for CSE 12, Fall 2011. In this assignment, you will write a class that implements the Java Collections interface List<E>, using
UCSD - CSE - 12
P3 README11/7/11 5:28 PMProgramming assignment #3: CSE 12 Fall 2011Here's a description of the third programming assignment for CSE 12, Fall 2011. In this assignment, you will write generic circular array, stack, and queue implementations. Along the wa
UCSD - CSE - 12
P4 README11/28/11 12:50 PMProgramming assignment #4: CSE 12 Fall 2011Here's a description of the fourth programming assignment for CSE 12, Fall 2011. In this assignment, you will implement a priority queue and in turn use it to implement the heapsort a