POLS 1101 Study Guide - Quiz Guide: Coordination Game, Jury Trial, Collective Action

177 views2 pages

pucecaribou34

11 Sep 2015

School

University of Georgia

Department

Political Science

Course

POLS 1101

Professor

Jamie Monogan

For unlimited access to Study Guides, a Grade+ subscription is required.

Document Summary

Study guide for first midterm exam, fall 2015. The rst midterm exam is worth 25 points towards your nal grade in the class. The test will consist of 52 multiple choice questions, each worth a half point. (hence, you could earn a bonus point towards your nal grade, for 26 points. ) The exam will be held during our regu- lar lecture meeting on september 16, so you will have 50 minutes to complete the exam. Useful study tools for the exam, including practice quizzes, can be found at the studyspace website: http://www. wwnorton. com/college/polisci/american-political-system/. Recall that approximately 10% of the test questions will be related to georgia politics. Also, the exam will be split across the rst four units so that approximately 13 questions will come from each unit. To prepare for the exam, be sure you can complete all of the following objectives:

Related Questions

29. Consider the Cocktail Sort (code 4) algorithm described in the appendix. What is the fewest number of lines of code that would have to be added, removed, or changed in order for this algorithm to sort from largest to smallest? (A) Everything inside the second for loop. (B) 3 (C) 1 (D) 2 (E) Everything inside both for loops. Binary answers For the following questions you are to use your choices as they were the representation of a binary number. More precisely, A = 24, B = 23, C = 22, D = 21, and E = 20 position in a base 2 number. For example if you wanted to answer the number 23, you would translate it first as base 2 number, which is 10111, you would blacken A, C, D and E.2 Lets look at this process on your answer sheet, we have these 5 circle you can blacken. Normally you only pick one, here you might have to blacken more than one! @ ® © D ® Following the previous example, the answer we want to input is 23, its binary representation is 10111, hence the circle you would blacken are the following:

33. Base10 is the set of numbers created from the digits {0,1,2,3,4,5,6,7,8,9}. Whereas base2, which is the set of numbers created with {0,1}. We could similarly define base; as the ordered set of characters created from {X,Y,Z}. What is the following basez number, Yxz, in base ? Random graph For this section you will need to look at the classes Graph and GraphNode present in the appendix. A Graph consists of a number of nodes, each of which has connections to other nodes in the graph. You can think of nodes as a representation of a person in a social network (e.g. Facebook). The ArrayList connectedTo variable in GraphNodes is the list of friends that particular person has. For example, in the following graph, the node O is friends with node 1 and 2. On the other hand, node 2 and node 1 are not friends, hence the lack of link. 0-0 In the constructor of the Graph, the process of connecting nodes is randomized. Moreover, we will not allow a node to be connected to itself and we are going to assume that the arguments passed to the Graph constructor respect the following conditions: n > 2, and n > nbConnections. Pay close attention to the character order

9. Finally, you should write a program MontrealMaps which will suggest a path to go along the metro to get from one place to another. The only required method for MontrealMaps is a main method but of course you are allowed to write others. Your program should do the following. For any library methods that you use, make sure that you are properly importing things and handling any exceptions they may throw. (10 points) • Using an appropriate library method, you should create a Subway System object. If this method fails to initialize, you should print the message Error, not enough funding. • Use a Scanner and print statements to read the current x and y position of the user. • Use a Scanner and print statements to read the x and y position that the user wants to go to. . Find the nearest Metro Station to both the start position of the user and his final destination. • If the 2 metro stations have the same name (i.e. are the same metro station) then print It is fastest to walk there. • Otherwise, call the method findPath from the previous part to find a path from these 2 metro stations. . If the method returns null, then print Sorry, there is no path on the metro, you'll have to walk • Otherwise, print the path using the metro using the method printPath defined in the MapUtilities class in the appendix. SUMMARY OF JAVA STANDARD LIBRARY METHODS POR SELECTED CLASSES • String package java.lang) Methods - public boolean gist and e rs is stingeancoject - puble boolean grease Sering another ca t ering String paint i th Stre C h eshilly before the Stripe with striert w Single weiter water N ENE fusha -publish tohy Casting de . File( p age java.io) Methods r eate - publie Yiling path : C • Scanner (package java.ut 1) Method -ple S ule - double Double Sc - le bon when : S Scanner tal de fethede h able othebean - puble String Best Mus eethe u s tepal -pulle haalean haxtLine: Check the hea ther in left PrintStream( p age java.io) Methods pul vaid pri Pribonaat - puli wid pride d oble vile. - pille vaid print Print vei. -pulle vaid printject o: Prints Object -puli vaid printString : Prints String .. - vaid primi The theme line by writing the li n e tie id print in bool bl. Prise n value the - public void platinabled Prints double ved and then the line - public void printit Prints Ent value and then tomis the - Pull vaid pri l l be t he minime publie wild prin t ing with String in the terminates the line • ArrayLiat package java.util) Methods - public boolean Arraybettype was a new ArrayList

POLS 1101 Study Guide - Quiz Guide: Coordination Game, Jury Trial, Collective Action

Document Summary

Get access

Related Documents

POLS 1101 Lecture Notes - Lecture 7: Jury Trial, Microsoft Powerpoint, Excessive Bail Clause

POLS 1101 Lecture Notes - Lecture 1: Bumper Sticker, Bipartisan Campaign Reform Act, Campaign Finance Reform In The United States

POLS 1101 Lecture Notes - Lecture 5: Jim Crow Laws, Strict Scrutiny, Intermediate Scrutiny

Related Questions