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.
64 Pages
Old Final Exams 97-99
Course: PSL 431, Spring 2009School: Michigan State University
Rating:
Document Preview
Sorry, a summary is not available for this document. Register and Upgrade to Premier to view the entire document.
Unformatted Document Excerpt
Coursehero >> Michigan >> Michigan State University >> PSL 431Course 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.
There is no excerpt for this document.
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:
Michigan State University - PSL - 431
Exam topics covered by Mark march 9th *vasopressin AKA antidiuertic hormone, great if patient is catecholamine depleted because it has nothing to do with cathecholamines! *art line square wave test with assess for patency *if patient had MI 4 months ago,
Michigan State University - PSL - 431
The Anesthesia Machine1/16TheAnesthesiaMachineI. Physical Properties of Volatile Anesthetic AgentsAnesthetic First used clinically Chemical formula Boiling point (C) Saturated vapor pressure at 20C (mmHg) Stabilizer Stability with soda lime MAC B/G pa
Michigan State University - PSL - 431
The Anesthesia Gas Machine GasWhen was Nitrous oxide first used?1884 by WellsWhat is the boiling point of Nitrous oxide?-89.5 CDoes nitrous oxide exist as a gas or a liquid at room temperature (20C)?Nitrous oxide exists as a gas at room temperature.
Michigan State University - PSL - 431
Michigan State University - PSL - 431
Michigan State University - PSL - 431
Michigan State University - PSL - 431
Michigan State University - PSL - 431
Michigan State University - PSL - 431
Michigan State University - PSL - 431
Michigan State University - PSL - 431
Michigan State University - PSL - 431
FIT - 252 - 455
Skrembleri i PN generatoriZADATAK 1: U sekvencijalnom kolu sa registrima kapaciteta N=5 elija, povratne sprege se odvode sa izlaza 3. i 5. elije. Odrediti jednu periodu generisanog niza in a konkretnom primeru utvrditi da li vai osobina iftovanja i sabir
University of Texas - CS - 341
CS 341 Homework 1 Due Tuesday, January 23Do the following problems from Chapter 32 of the book:1, 2, 3a, 4, 5, 6, 7, 9, 11, 13, 14, 17, 20b, 23.
University of Texas - CS - 341
CS 341 Homework 1 Answers1) Prove each of the following: a) (A B) C) (A B C). (A B) C) (A B C) (A B) C) (A B C) (A B) C) (A B C) (A B C) (A B C) True Definition of de Morgans Law Associativity of Definition of b) (A B C) (A (B C).(A B C) (A (B C) (A B
University of Texas - CS - 341
CS 341 Homework 2 Due Thursday, January 25Do the following problems from the book:Chapter 2: 1, 2, 3, 4, 5, 6, 7.Chapter 3: 1, 4, 5, 6.Chapter 4: 2, 3, 4, 6(a) or 6(b) or choose another interesting puzzle and solve for it.
University of Texas - CS - 341
CS 341 Homework 2 Answers Chapter 2 1) Consider the language L = cfw_1n2n : n > 0. Is the string 122 in L?No. Every string in L must have the same number of 1s as 2s.2) Let L1 = cfw_anbn : n > 0. Let L2 = cfw_cn : n > 0. For each of the following string
University of Texas - CS - 341
CS 341 Homework 3 Due Thursday, February 2Do the following problems from the book:Chapter 5: 2b, c, d, g, l; 3; 4; 5; 6a, d; 8a; 9a.Chapter 6: 1a (erroneously called c in the book); 2b, d, e, h, p, q; 3; 4b, d; 17; 18g, h.
University of Texas - CS - 341
CS 341 Homework 3 Answers Chapter 52) Show a DFSM to accept each of the following languages: b) cfw_w cfw_a, b* : w does not end in ba.a 2 a 1 b 4 bc) cfw_w cfw_0, 1* : w corresponds to the binary encoding, without leading 0s, of natural numbers that a
University of Texas - CS - 341
CS 341 Automata Theory Elaine Rich Homework 4 Due: Thursday, February 8, 2007 1) Consider the following FSM M: a a 1 b b 2 a 3 b 4 a,ba) Show a regular expression for L(M). b) Describe L(M) in English. 2) Consider the following FSM M: q0 b q2 a) Write a
University of Texas - CS - 341
CS 341 Automata Theory Elaine Rich Homework 4 Due: Thursday, February 8, 2007 1) Consider the following FSM M: a a 1 a) b b 2 a 3 b 4 a,bShow a regular expression for L(M). (a bb*aa)* ( bb*(a ).b) Describe L(M) in English. All strings in cfw_a, b* that
University of Texas - CS - 341
CS 341 Automata Theory Elaine Rich Homework 5 Due: Thursday, February 15, 2007 This assignment covers Chapters 8 and 9. 1) For each of the following languages L, state whether or not L is regular. Prove your answer: a) cfw_aibj : i, j 0 and i + j = 5. b)
University of Texas - CS - 341
CS 341 Automata Theory Elaine Rich Homework 5 Due: Thursday, February 15, 2007 This assignment covers Chapters 8 and 9. 1) For each of the following languages L, state whether or not L is regular. Prove your answer: a) cfw_aibj : i, j 0 and i + j = 5. Reg
University of Texas - CS - 341
CS 341 Automata Theory Elaine Rich Homework 6 Due: Thursday, February 22, 2007 This assignment covers Sections 5.10-5.13 and a review of regular languages. 1) Consider the problem of counting the number of words in a text file that may contain letters plu
University of Texas - CS - 341
CS 341 Automata Theory Elaine Rich Homework 6 Due: Thursday, February 22, 2007 This assignment covers Sections 5.10-5.13 and a review of regular languages. 1) Consider the problem of counting the number of words in a text file that may contain letters plu
University of Texas - CS - 341
CS 341 Automata Theory Elaine Rich Homework 7 Due: Thursday, March 1, 2007 This assignment covers Sections 11.1 - 11.6. 1) Let = cfw_a, b. For the languages that are defined by each of the following grammars, do each of the following: i. List five strings
University of Texas - CS - 341
CS 341 Automata Theory Elaine Rich Homework 7 Due: Thursday, March 1, 2007 This assignment covers Sections 11.1 - 11.6. 1) Let = cfw_a, b. For the languages that are defined by each of the following grammars, do each of the following: i. List five strings
University of Texas - CS - 341
CS 341 Automata Theory Elaine Rich Homework 8 Due: Thursday, March 8, 2007 This assignment covers Sections 11.7 - 11.8. 1) Let G be the ambiguous expression grammar of Example 11.14. Show at least three different parse trees that can be generated from G f
University of Texas - CS - 341
CS 341 Automata Theory Elaine Rich Homework 8 Due: Thursday, March 8, 2007 This assignment covers Sections 11.7 - 11.8. 1) Let G be the ambiguous expression grammar of Example 11.14. Show at least three different parse trees that can be generated from G f
University of Texas - CS - 341
CS 341 Automata TheoryElaine Rich Homework 1 Due Thursday, September 7 at 11:00 a. m. 1) Write each of the following explicitly: a) P(cfw_a, b) P(cfw_a, c) b) cfw_a, b cfw_1, 2, 3 c) cfw_x : (x 7 x 7 d) cfw_x : y (y < 10 (y + 2 = x) (where is the set of
University of Texas - CS - 341
CS 341 Automata TheoryElaine Rich Homework 1 Due Thursday, September 7 at 11:00 a. m. 1) Write each of the following explicitly: a) P(cfw_a, b) P(cfw_a, c) b) cfw_a, b cfw_1, 2, 3 c) cfw_x : (x 7 x 7 d) cfw_x : y (y < 10 (y + 2 = x) (where is the set of
University of Texas - CS - 341
CS 341 Automata TheoryElaine Rich Homework 2 Due Thursday, September 14 at 11:001)2)3)4)5)6)7) 8)For each of the following languages L, give a simple English description of L. Show two strings that are in L and two that are not (unless there are
University of Texas - CS - 341
CS 341 Automata Theory Elaine Rich Homework 3 Due Thursday, September 21 at 11:00 1) Give a clear English description of the language accepted by the following FSM: b1b a2a b a3a4a6b a, b52) Construct a deterministic finite state machine to ac
University of Texas - CS - 341
CS 341 Automata TheoryElaine Rich Homework 4 Due Thursday, Sept. 28 at 11:001) Write regular expressions for the following languages: a) The set of binary representations, without leading 0s, of integers that are divisible by 4. b) The set of binary rep
University of Texas - CS - 341
CS 341 Automata TheoryElaine Rich Homework 5 Due Thursday, Oct. 5 at 11:001)2) 3)4)5)6)Using the definitions of maxstring and mix presented in class, describe each of the following languages: a) maxstring(AnBn) b) maxstring(aibjck, 1 k j i) c) mix(
University of Texas - CS - 341
CS 341 Automata TheoryElaine Rich Homework 6 Due Thursday, October 12 at 11:00 1) Show that the regular languages are closed under each of the following operations: a) pref(L) = cfw_w * : x = wy for some x L, y * (The prefixes of L) b) suf(L) = cfw_w * :
University of Texas - CS - 341
CS 341 Automata TheoryElaine Rich Homework 7 Due Thursday, Oct. 19 Let = cfw_a, b. For the languages that are defined by each of the following grammars, do each of the following: i. List five strings that are in L. ii. List five strings that are not in L
University of Texas - CS - 341
CS 341 Automata TheoryElaine Rich Homework 8 Due Thursday, Oct. 261)2)3)4)5)6)Prove that the grammar G = cfw_S, a, b, cfw_a, b, R, S, where R = cfw_S aSa, S bSb, S correctly defines the language cfw_wwR : w cfw_a, b*. Build a PDA for each of the
University of Texas - CS - 341
CS 341 Automata TheoryElaine Rich Homework 9 Due Thursday, Nov. 2 at11:001) Build a deterministic PDA that accepts L$, where L = cfw_w cfw_a, b* : #a(w) = #b(w).2) Determine, for each of the following languages, whether it is (I) Regular, (II) Context
University of Texas - CS - 341
CS 341 Automata TheoryElaine Rich Homework 10 Due Thursday, Nov. 9 at 11:00 1) Determine, for each of the following languages, whether it is (I) Regular, (II) Context free but not regular, or (III) not context free. Prove your answer. a) L = cfw_wwRw : w
University of Texas - CS - 341
CS 341 Automata TheoryElaine Rich Homework 11 Due Thursday, Nov. 16 at 11:00 1) Define a Turing Machine M (using our macro language) that decides L, where L = cfw_x y = z : x, y, z 1+ and, when x, y, and z are viewed as unary numbers, x y = z. You may de
University of Texas - CS - 341
CS 341 Automata TheoryElaine Rich Homework 12 Due Wednesday, November 29 at noon (Slide it under my office door.)1)Construct a standard one-tape Turing machine M to enumerate the language: cfw_w : w is the binary encoding of a positive integer that is
University of Texas - CS - 341
CS 341 Automata TheoryElaine Rich Homework 13 Due Friday, Dec. 8 at 11:59 pm Let L1 and L2 be two languages such that L1 L2. Prove that: a) If L1 is not in D, then L2 is not in D. b) If L1 is not in SD, then L2 is not in SD. Hint: These are not hard. You
University of Texas - CS - 341
CS 341 Automata TheoryElaine Rich Homework 14 Due Friday, Dec.8 at 11:59 pm1)Construct unrestricted grammars that generate each of the following languages L: a) cfw_wwRw : w cfw_a, b*. b) cfw_anbmcn+m : n, m > 0. c) cfw_anbmcnm : n, m > 0.2) Construct
University of Texas - CS - 341
CS 341 Automata TheoryElaine Rich Homework 15 Due Friday, Dec. 8 at 11:55 pm1)Let M be an arbitrary Turing machine. a) Suppose that timereq(M) = 3n3(n+5)(n-4). Circle all of the following statements that are true: i) timereq(M) O(n).ii) iii)timereq(M
University of Texas - CS - 341
CS 341 Automata Theory Elaine Rich Homework 3 Answers1. Construct a deterministic finite state machine to accept each of the following languages: a) The set of binary representations, without leading 0s, of integers that are divisible by 4.b) The set of
UT Dallas - EE - 6390
The University of Texas at Dallas Course SyllabusCOURSE INFORMATION Course Number: Course Title: Term: EE6390 Introduction to Wireless Communications Systems Spring 2009PROFESSOR CONTACT INFORMATION Name: Phone Number: Office Location: Office Hours: Ema
Old Dominion - FIN - 432
3/12/2008Chapter 2. Ch 02 P14 Build a Modela. Use the data given to calculate annual returns for Bartman, Reynolds, and the Market Index, and then calculate average returns over the five-year period. (Hint: Remember, returns are calculated by subtractin
California PA - JUS - 103
Page |1*A citizen can be charged with false imprisonment- ex, locking someone into a bathroom, closet, etc. usually only found when rape, beating, or other exigent circumstances occur. *Defenses to Civil Suit 1) Good faith/good belief- if it was found to
California PA - SOW - 300
Unit4:Week4Exam11. QuestionRalphhasjustbeenapproachedbyhiswifeRachel.Shehasbeencriticalofhislovemaking,andagainhasbroughtupthesubjectrightafterdinner.Ralphbeginsmaking excusesanddenyingtheproblems.Whichofthefollowingbestdescribeswhat'shappening? (Points
California PA - FRN - 201
Medical Malpractice & Misadventure Clinical tests- such high radiological exposure (increased technologygood or bad?) 2-20 years after receiving exposure to radiation it finally shows up as a problem JACHO policy (institution truth policy) Health care err
UMSL - ENGL - 3130
To:ProfessorVogel,InstructorENGL3130 From:JoeDoyle,JamesEffington,AlexGawrys,ShontayEvans Subject:Requestingapprovalfor"GroupProposal"inLearningUnit5 Date:September22,2009 ThepurposeofthismemoistopresentagroupproposalforthefinalprojectdueinLearningUnit15a
UMSL - ENGL - 3130
14A)Weneedtobepreparedfortheresponsetotheannouncement. 14B)Thesuspectwasarrestednexttothesceneofthecrime. 14C)TheveryimportantdataonthedirectorywillbemovedtoanewserveronTuesday. 15A)Williamsisbeinginvestigatedbymanagement.Hemayhavefiledtripreportsthatwere
Washington University in St. Louis - ESE - 441
Name: _Homework Set #4 Fall 2009 Control Systems IYOU MUST SHOW ALL YOUR WORKs o0Aux_20 For the transfer functions given below use the Final Value Theorem, lim lim[ sY ( s ) R( s )] , to determine the steady state value of the output t for at ofunit
Washington University in St. Louis - ESE - 331
Joe DoyleProblem 4Prob 5aProb 5bProb 7
Washington University in St. Louis - ESE - 331
B rushless MotorsBy Joe DoyleLab Partners: Artem Boyko Ryan MasonPerformed on April 7, 2009P art AThe next page presents the graphs of the waveforms we were able to obtain f rom the scope captures. I have indicated the time displacement and voltage m
Washington University in St. Louis - ESE - 331
Vm2(V) 15 18.8 21.6 24.78 27.16 30.25Va(V)n(rpm) 39.4 2070 39.4 2610 39.34 3030 39.21 3450 39.19 3780 39.14 4140n(rpm) Vm2(V) 2070 15 2610 18.8 3030 21.6 3450 24.78 3780 27.16 4140 30.25 0 04500 4000 3500 3000 2500 2000 1500 1000 500 0n(rpm) 0 2070 2
Washington University in St. Louis - ESE - 331
Tc(*C) Tr(*C) To(*C) T(*C) Tr-To(*C) I(A) 12.8 23.14 22.78 10.34 0.36 7.2 23.41 22.78 16.21 0.63 3.71 23.74 22.78 20.03 0.96 1.86 24.77 22.78 22.91 1.99 0 25.34 22.78 25.34 2.56 -1 26.87 22.78 27.87 4.09Vm(*C) 0.5 1.76 1 3.26 1.5 4.63 2 6.01 2.5 7.38 3 8
Washington University in St. Louis - ESE - 331
Vp(V) 0.35Ip(A)Rp(Ohms)=Vp/Ip 5 46mVs(V) 0.23Is(A)Rs(Ohms)=Vs/Is 5 69ms(Ohms)=Vs/IsVp(V)Ip(A)Vs(V)Po(W)Is(A)1 3 5Ipcalculated(A)0.24 0.71 1.19 1.66 2.14 2.61Ipactual(A) 0.29 0.73 1.19 1.63 2.19 2.7710 20 30 40 50 60 70 80 90 100 110 120 13
Washington University in St. Louis - ESE - 331
SemesterDesignProjectPowerDistributionSystemsTourJEE4350 Prof.Dick ByJoeDoyleMay5,2009AftercompletingalllabrequirementsthissemesterIproposethatanew labshouldbeintroducedintoJEE4350fortheupcomingsemesters.Thebasis ofthislabwouldbeawalkingtourofpowerdis
Washington University in St. Louis - ESE - 331
JoeDoyle LabReportforThermoelectricityPartANoninsulated(At3Amps)Tc(*C) 0Tr(*C) 26.87To(*C) 22.78T(*C) 26.78Insulated(At3Amps) Tc(*C) 4 Tr(*C) 26.38 To(*C) 22.78 T(*C) 30.38Itisclearthataddingthefoaminsulationallowsformaximumcoolingofthemetal devic