45669583-Organic-Practice
956 Pages

45669583-Organic-Practice

Course Number: CHEM 2410, Spring 2012

College/University: Toledo

Word Count: 115527

Rating:

Document Preview

Chapter 1 MULTIPLE CHOICE QUESTIONS Topic: Atomic Orbitals 1. A) B) C) D) E) In quantum mechanics a node (nodal surface or plane) is: a place where is negative. a place where is positive. a place where = 0. a place where 2 is large. a place where 2 is negative. Ans: C Topic: Atomic Orbitals, Molecular Orbitals 2. When the 1s orbitals of two hydrogen atoms combine to form a hydrogen molecule, how many...

Unformatted Document Excerpt
Coursehero >> Ohio >> Toledo >> CHEM 2410

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.

1 MULTIPLE Chapter CHOICE QUESTIONS Topic: Atomic Orbitals 1. A) B) C) D) E) In quantum mechanics a node (nodal surface or plane) is: a place where is negative. a place where is positive. a place where = 0. a place where 2 is large. a place where 2 is negative. Register to View Answer Topic: Atomic Orbitals, Molecular Orbitals 2. When the 1s orbitals of two hydrogen atoms combine to form a hydrogen molecule, how many molecular orbitals are formed? A) 1 B) 2 C) 3 D) 4 E) 5 Register to View AnswerTopic: Atomic Orbitals 3. Which principle(s) or rule must be used to determine the correct electronic configuration for carbon in its ground state? A) Aufbau Principle B) Hund's Rule C) Pauli Exclusion Principle D) (A) and (B) only E) All three Register to View Answer 1 Chapter 1 Topic: Atomic Orbitals, Bonding 4. What point on the potential energy diagram below represents the most stable state for the hydrogen molecule? A) B) C) D) E) I II III IV V Register to View Answer Topic: Atomic Orbitals, Molecular Orbitals 5. A) B) C) D) E) According to molecular orbital theory, which molecule could not exist? H2 He2 Li2 F2 N2 Ans: Atomic B Topic: Orbitals, Molecular Orbitals 6. When the ls orbitals of two hydrogen atoms combine to form a hydrogen molecule, which molecular orbitals are formed? A) One bonding molecular orbital only B) Two bonding molecular orbitals C) One bonding molecular orbital and one antibonding molecular orbital D) Two antibonding molecular orbitals E) Three bonding molecular orbitals Register to View Answer 2 Chapter 1 Topic: Atomic Orbitals, Hybridization 7. The following electron configuration represents _______. A) B) C) D) E) 1s 2sp3 2sp3 2sp3 2sp3 the ground state of boron. the sp3 hybridized state of carbon. the sp3 hybridized state of nitrogen. the ground state of carbon. an excited state of carbon. Register to View Answer Topic: Atomic Orbitals, Molecular Orbitals 8. According to molecular orbital theory, in the case of a carbon-carbon double bond, the carbon-carbon bonding electrons of higher energy occupy this molecular orbital. A) bonding MO B) bonding MO C) * antibonding MO D) * antibonding MO E) * bonding MO Register to View AnswerTopic: Atomic Orbitals, Hybridization 9.

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:

Toledo - BIOL - 3090
Question 1With respect to extraembryonic membranes the chorionAnswer- is the outer most membrane surrounding the embryo.Question 2The blastopore of an amphibian embryoAnswer-is an opening into the archenteron.Question 3Which process is most respons
Toledo - CHEM - 2420
Toledo - CHEM - 2420
Toledo - CHEM - 2420
Review for Exam I17-1Review for Exam I17-2Review for Exam IAddition of Carbon nucleophiles to C=ORMgXA G r i gn ardreagentRLiA n or gan ol i th i umreagentRC C CNA n ani on of a C yan i de i onterm i nal al k yn e17-3Review for Exam IWitt
Toledo - CHEM - 2420
Toledo - CHEM - 2420
CHEM 2420 Organic Chemistry IIFall 2012_Practice Exam No. 2: Chapter 18-20Section 1. Multiple Choice (80 points)Circle the choice that best completes each phrase and/or answers the question (20 X 4 = 80 points).1. What is the correct assignment of t
Toledo - PHYS - 2070
Lauren McCabe2070-004TR 12pmMH 1002CHAPTER 7 SUMMARYIn chapter seven, we learned about rotational motion and the law of gravity. In the studyof rotational motion the concepts are analogous with those of linear motion which are angularacceleration,
Tufts - ECON - 12
EC12, Final - Sample Exam08/06/2012Name:General InstructionsThe exam has two parts, 20 multiple choice questions (worth 2 point each) and 4 shortanswer questions (value given below). No partial credit will be given for multiple choicequestions. For
NYU - LAW - civil proc
This outline likely has curses/immaturity sprinkledthroughout its pages. Sorry. Dont use it if easilyoffended.SUBJECT MATTER JURISDICTIONPower to hear disputeCant waive, Federalism (Capron, collateral attack)No SMJ dismiss 12 h 3LimitedoGiven by
Università di Bologna - ECONOMICS - 0904
INDICE1. INTRODUZIONE : LIMITI DEL MOTO BROWNIANO22. LA DISTRIBUZIONE NORMALE33. MOTO BROWNIANO44. MOTO BROWNIANO GEOMETRICO45. IL CARATTERE DELLA NON-GAUSSIANA56. PROCESSO DI LVY67. IL PROCESSO VARIANZA GAMMA87.1 IL PROCESSO GAMMA87.2 TO
UCSD - CSE - 202
CSE 202: Design andAnalysis of AlgorithmsLecture 2Instructor: Kamalika ChaudhuriAnnouncementReminder: Email me the name of your groupmember by Thursday Jan 19Pick up calibration quizzes after classGreedy AlgorithmsMinimum Spanning TreesThe Union
UCSD - CSE - 202
CSE 202: Design andAnalysis of AlgorithmsLecture 3Instructor: Kamalika ChaudhuriAnnouncementHomework 1 outDue on Tue Jan 24 in classNo late homeworks will be acceptedGreedy AlgorithmsDirect argument - MSTExchange argument - CachingGreedy approx
UCSD - CSE - 202
CSE 202: Design andAnalysis of AlgorithmsLecture 4Instructor: Kamalika ChaudhuriAnnouncementsHW 1 due in class on Tue Jan 24Email me your homework partner name, or if youneed a partner todayGreedy AlgorithmsDirect argument - MSTExchange argument
UCSD - CSE - 202
CSE 202: Design andAnalysis of AlgorithmsLecture 5Instructor: Kamalika ChaudhuriAnnouncementsKamalikas Ofce hours today moved to tomorrow,12:15-1:15pmHomework 1 due nowMidterm on Feb 14Algorithm Design Paradigms Exhaustive Search Greedy Algorit
UCSD - CSE - 202
CSE 202: Design andAnalysis of AlgorithmsLecture 6Instructor: Kamalika ChaudhuriAnnouncementsHomework 1 solutions are up!Homework 2 is out, due in class Feb 2ndLast Class: Three steps ofDynamic ProgrammingMain Steps:1. Divide the problem into su
UCSD - CSE - 202
CSE 202: Design andAnalysis of AlgorithmsLecture 7Instructor: Kamalika ChaudhuriAnnouncementsPick up graded HW1 after classHW2 due on Thu Feb 2Last class: Three steps ofDynamic ProgrammingMain Steps:1. Divide the problem into subtasks2. Dene th
UCSD - CSE - 202
CSE 202: Design andAnalysis of AlgorithmsLecture 8Instructor: Kamalika ChaudhuriOil Through PipelinesProblem: Given directed graph G=(V,E), source s, sink t, edge capacities c(e),how much oil can we ship from s to t?Oil Through PipelinesProblem: G
UCSD - CSE - 202
CSE 202: Design andAnalysis of AlgorithmsLecture 9Instructor: Kamalika ChaudhuriLast Class: Max Flow ProblemThe Max Flow Problem: Given directed graph G=(V,E), source s, sink t,edge capacities c(e), nd an s-t ow of maximum sizeAn s-t ow is a functi
UCSD - CSE - 202
CSE 202: Design andAnalysis of AlgorithmsLecture 10Instructor: Kamalika ChaudhuriAnnouncementsMidterm on Feb 14 in classMaterial: Greedy, Divide and Conquer, DynamicProgramming, Flows (including Capacity Scaling, butnot including Preow-push)Last
UCSD - CSE - 202
CSE 202: Design andAnalysis of AlgorithmsLecture 11Instructor: Kamalika ChaudhuriLast Class: Algorithms for Max-Flown = #vertices, m = #edges in G, Cmax = max capacity, Fmax = max owInteger edge capacities Ford-Fulkerson:Running Time = O(m Fmax)
UCSD - CSE - 202
CSE 202: Design andAnalysis of AlgorithmsLecture 14Instructor: Kamalika ChaudhuriAlgorithm Design ParadigmsExhaustive SearchDivide and Conquer: Divide into parts, solve eachpart, combine resultsDynamic Programming: Divide into subtasks,perform su
UCSD - CSE - 202
CSE 202: Design andAnalysis of AlgorithmsLecture 13Instructor: Kamalika ChaudhuriExpectationGiven discrete random variable X, which takes m values xi w.p. pi, theexpectation E[X] is dened as:E [X ] =mi=1xi Pr[X = xi ] =mx i pii=1Linearity of
UCSD - CSE - 202
CSE 202: Design andAnalysis of AlgorithmsLecture 14Instructor: Kamalika ChaudhuriTypes of Randomized AlgorithmsMonte Carlo Algorithm:Always has the same running timeNot guaranteed to return the correct answer (returns acorrect answer only with som
UCSD - CSE - 202
CSE 202: Design andAnalysis of AlgorithmsLecture 15Instructor: Kamalika ChaudhuriMAX 3SAT3-SAT Problem: Given a boolean formula F consisting of:n variables x1, x2, ., xnm clauses of size 3 of the form xi V xj V xk or not(xi) V xj V xkIs there an a
UCSD - CSE - 202
CSE 202: Design andAnalysis of AlgorithmsLecture 16Instructor: Kamalika ChaudhuriInequality 1: Markovs InequalityPr(X=x)Pr(X >= a)0axIf X is a random variable which takes non-negative values, and a > 0, thenPr[X a] E [X ]aExample: n tosses o
UCSD - CSE - 152
What is computer vision?IntroductionDone?Introduction to Computer VisionCSE 152Lecture 1CSE152, Spr 2011Intro Computer VisionCSE152, Spr 2011What is Computer Vision?Intro Computer VisionWhy is this hard? Trucco and Verri (Text): Computing prop
UCSD - CSE - 152
Announcements Assignment 0: due Thursday 4/12 Office Hour: Tuesdays 1:00-2:00 Read Trucco & Verri: pp. 15-40Human Visual SystemIntroduction to Computer VisionCSE 152Lecture 2CSE152, Spring 2012Intro. Computer VisionCSE152, Spring 2012Pythagoras
UCSD - CSE - 152
AnnouncementsImage Formationand CamerasIntroduction to Computer VisionCSE 152Lecture 3CSE152, Spr 2012Intro Computer VisionAssignment 0: due Thursday 4/12Sign up for Piazza: http:/www.piazza.comOffice Hour: Tuesdays 1:00-2:00Read Trucco & Verri
UCSD - CSE - 152
Announcements Read Trucco & Verri: pp. 15-40 Irfanview: http:/www.irfanview.com/ is agood Windows utility for manipulatingimages. Try xv for linux. Assignment 0: due todayImage Formationand CamerasIntroduction to Computer VisionCSE 152Lecture 4
UCSD - CSE - 152
Announcements ReadingImage Formationand Cameras Trucco & Verri, Chapter 2, pp. 16-26, Szeliski pp.60-72 Assignment 1: To be assigned later today.Introduction to Computer VisionCSE 152Lecture 5CSE152, Spr 2012Intro Computer VisionCSE152, Spr 20
UCSD - CSE - 152
Announcements HW1 has been posted See links on web page for readings on color.Introduction to Computer VisionCSE 152Lecture 6CSE152, Spring 2012Intro Computer VisionCSE152, Spring 2012LightingDeviations from the lens modelDeviations from this i
UCSD - CSE - 152
Announcements HW1 due on Thursday See links on web page for reading Section: Mondays 3:00-3:50PM, PepperCanyon Hall, Rm. 120 Kriegman Office Hrs: Tuesday 1:00-2:00Introduction to Computer VisionCSE 152Lecture 7`CSE152, Spring 2012Intro Computer
UCSD - CSE - 152
Announcements HW 1 is due today HW2 will be available in the next couple days. See links on web page for reading on binaryimage processing (e-reserves) Midterm May 10FilteringIntroduction to Computer VisionCSE 152Lecture 8CSE152, Spr. 2011Intro
UCSD - CSE - 152
AnnouncementsEdge DetectionIntroduction to Computer VisionCSE 152Lecture 9CSE152, Spr 2012 Assignment 2 assigned and due Tuesday, May 3. Midterm: Thursday, May 5.Intro Computer VisionCSE152, Spr 2012Intro Computer VisionConvolution: R= K*IConv
UCSD - CSE - 152
AnnouncementsEdge Detection, Corner DetectionLines Assignment 2 due Friday, May 11, midnight, submitelectronically by emailing to sbranson@cs.ucsd.edu Midterm: Thursday, May 10.Introduction to Computer VisionCSE 152Lecture 10CSE152, Spr 2012Intr
UCSD - CSE - 152
Announcements Assignment 2: Due FridayGeneralized Hough Transform,line fitting Midterm: Thursday, May 10 in class,Well talk about it at the end of classIntroduction to Computer VisionCSE 152Lecture 11CSE152, Spr 12Intro Computer VisionCSE152, S
UCSD - CSE - 152
Midterm StatsStereo Vision IIntroduction to Computer VisionCSE 152Lecture 13CSE152, Spring 2011Intro Computer VisionCSE152, Spring 2011Intro Computer VisionExample: Helmholtz StereoDepth + Normals + BRDFShape-from-X(i.e., Reconstruction) Meth
UCSD - CSE - 152
Binocular Stereopsis: MarsGiven two images of a scene where relativelocations of cameras are known, estimate depthof all common scene points.Stereo Vision IIIntroduction to Computer VisionCSE 152Lecture 14Two images of MarsCSE152, Spring 2011Int
UCSD - CSE - 152
Stereo Vision OutlineBStereo Vision IIIOffline: Calibrate cameras & determineepipolar geometryOnline1. Acquire stereo imagesC 2. Rectify images to convenient epipolar geometryIntroduction to Computer VisionCSE 152Lecture 15CSE152, Spring 2012D
UCSD - CSE - 152
Announcements HW 3 due on TuesdayPhotometric StereoIntroduction to Computer VisionCSE152Lecture 16CS152, Spring 2012Intro Computer VisionShading reveals 3-D surface geometryCS152, Spring 2012Intro Computer VisionTwo shape-from-X methods that us
UCSD - CSE - 152
Announcements HW 3 due 12 noon, tomorrow. HW 4 to be posted soon recognition Lecture plan recognition for next twolectures, then video and motion.Recognition IIntroduction to Computer VisionCSE 152Lecture 17CSE152, Spr 12Intro Computer VisionCS
UCSD - CSE - 152
Announcements HW 4 has been posted. Due 06/08 Lecture plan recognition then video andmotion. Final exam: June 12, 8-11Recognition IIIntroduction to Computer VisionCSE 152Lecture 18CSE152, Spr 12Intro Computer VisionCSE152, Spr 12Sketch of a Pa
UCSD - CSE - 152
Announcements HW 4 has been posted. Due 06/08 Lecture plan Wrap up Recognition and ontomotion. Final exam: June 12, 8AM-11AM,cumulativeRecognition IIIIntroduction to Computer VisionCSE 152Lecture 19CSE152, Spr 12Intro Computer VisionCSE152, Sp
UCSD - CSE - 152
Announcements HW 4 due Friday at Midnight Final Exam: Tuesday, 6/12 at8:00AM-11:00AM, regular classroom Extra Office Hours: Monday 6/119:00AM-10:00AM Fill out your CAPESMotionIntroduction to Computer VisionCSE 152Lecture 20CSE152, Spring 2012I
UCSD - CSE - 152
CSE 152 Assignment 0Spring 2012Due Thursday April 12, 2012InstructionsTurn in a hard copy of the completed tutorial, your Part 3 write-up, your Matlab code, and both pairsof images (source & result) in class.Email your Matlab source code and results
UCSD - ECE - 273
ECE 273: Convex Optimization and ApplicationsSpring 2012Homework 1Lecturer: Gert Lanckriet(please indicate whether you are taking the class for letter grade or S/U grade)Due: Thursday 04/19/12 (in class)1. In this problem we examine the geometrical
UCSD - ECE - 273
ECE 273: Convex Optimization and ApplicationsSpring 2012Homework 2Lecturer: Gert Lanckriet(please indicate whether you are taking the class for letter grade or S/U grade)Due: Thursday 05/03/12 (in class)1. (3 points) Suppose A Rmn , b Rm , with b R(
UCSD - ECE - 273
ECE 273: Convex Optimization and ApplicationsSpring 2012Homework 3Lecturer: Gert LanckrietDue: Thursday 05/17/12 (in class)1. Consider the following quadratic programming (QP) problem1min xT P x + q T x + r,x2wheres.t. 1 xi 1, i = 1, 2, 3,13 12
UCSD - ECE - 273
ECE 273: Convex Optimization and ApplicationsSpring 2012Homework 4Lecturer: Gert LanckrietDue: Thursday 06/07/12We consider the non-convex least-squares approximation problem with binary constraintsminimize |Ax b|222subject to xk = 1, k = 1, . .
UCSD - ECE - 273
The Matrix Cookbook[ http:/matrixcookbook.com ]Kaare Brandt Petersen Michael Syskind Pedersen Version: November 14, 2008What is this? These pages are a collection of facts (identities, approximations, inequalities, relations, .) about matrices and matt
UCSD - CSE - 207
Computer Science and Engineering, UCSDCSE 207: Modern CryptographyProblem Set 2Fa12Instructor: Mihir BellareOctober 8, 2012Problem Set 2Due: Monday October 15, 2012, in class.Collaboration is allowed on this problem set, meaning you may work with
University of Toronto - PSYCHOLOGY - PSY240
AbnormalPsychologyLecture1PSY240SyllabusDiagnosticStatisticsManualVersion4(NorthAmerica)InternationalClassificationofDiseasesVersion10(World)MidtermM.C3AssignmentspostedtoBlackboardreadingassociatedwithassignmentsecondarysourcespermitted10%eachPo
Uni. São Paulo - AERONAUTIC - 09
Universidade de So PauloEscola de Engenharia de So CarlosDepartamento de Engenharia AeronuticaComparao experimental de aeronaves do tipo:Asa Alta x Asa BaixaSumrio da apresentao:INTRODUOREVISOBIBLIOGRFICADESCRIO DOENSAIORESULTADOS EDISCUSSOnt
Kennesaw - MKTG - 3100
A(n) _ is the result of applying human or mechanical efforts to people or objects.serviceThe service sector:employs roughly 80 percent of the U.S. workforceAll of the following are unique characteristics that distinguish services from goods EXCEPT:se
Birla Institute of Technology & Science - CS&IS - CS363
BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI-HYDERABAD CAMPUS,INSTRUCTION DIVISION, FIRST SEMESTER 2010 2011COURSE HANDOUT (PART II)Date : 03.08.2010In addition to part I (General Handout for all courses appended to the time table), this portiongi
Birla Institute of Technology & Science - CS&IS - CS363
Birla Institute of Technology & Science PilaniHyderabad Campus1st Semester 2010-2011Data Structures and Algorithms (CS C363 & IS C363) - Test IIDate: 13.11.2010 Weightage: 20% Duration: 50min. Type: Closed Book__Please note:1. Answer all questions
Birla Institute of Technology & Science - CS&IS - CS363
Birla Institute of Technology & Science PilaniHyderabad Campus1st Semester 2010-2011Data Structures and Algorithms (CS C363 & IS C363) - Test IIKey1.(a) (i) Kruskals algorithm: min cost is 37(ii) Prims algorithm: min cost is 37(iii) Kruskals algori
Birla Institute of Technology & Science - CS&IS - CS363
Q.1 Answer:(a) Pivot is the smallest element. i=0 and T(0) = 1 which can be ignored. So the recurrence isT(n) = T(n-1) +cn, n>1Telescoping the above expression and adding up all the equation yields:T(n-1) = T(n-2) +c(n-1)T(n-2) = T(n-3) +c(n-2)T(2)
Birla Institute of Technology & Science - CS&IS - CS363
AlgorithmStrategiesDIVIDEANDCONQUER Given a function to compute on n inputs thedivide and conquer strategy suggests splittingthe inputs into k distinct subsets, 1<k<=n,yieldingksubproblems Thesesubproblemsmustbesolvedandthenamethodmustbefoundtocomb
Birla Institute of Technology & Science - CS&IS - CS363
DivideandConquerAPPLICATIONSOFDANDCBINARYSEARCH Let a be the listofelementsthataresortedinithenondecreasingorder;1<=i<=n The problem is to determine whether a givenelementxispresentinthelist Ifxispresent,findavaluejsuchthata xj=Ifxisnotthere,the
Birla Institute of Technology & Science - CS&IS - CS363
DivideandConquerExamplesFindingthemaximumandtheminimumTofindthemaximumandtheminimuminasetofnelementsAlgorithmMaxMin(a,n,max,min)/setmaxandmintothefirstelementmax=min=a[1];fori=2tondocfw_if(a[i]>max)thenmax=a[i];if(a[i]<min)thenmin=a[i];Analys