6 Pages

CE_CourseDescriptions

Course: CAT 2006, Fall 2009
School: Dallas
Rating:
 
 
 
 
 

Word Count: 2243

Document Preview

Engineering Computer Course Descriptions CS 5303 Computer Science I (3 semester hours) Computer science problem solving. The structure and nature of algorithms and their corresponding computer program implementation. Programming in a high-level block-structured language (e.g., PASCAL, Ada, C++, or JAVA). Elementary data structures: arrays, records, linked lists, trees, stacks, and queues. (3-0) S CE 5325 (EE 5325)...

Register Now

Unformatted Document Excerpt

Coursehero >> Texas >> Dallas >> CAT 2006

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.
Engineering Computer Course Descriptions CS 5303 Computer Science I (3 semester hours) Computer science problem solving. The structure and nature of algorithms and their corresponding computer program implementation. Programming in a high-level block-structured language (e.g., PASCAL, Ada, C++, or JAVA). Elementary data structures: arrays, records, linked lists, trees, stacks, and queues. (3-0) S CE 5325 (EE 5325) Hardware Modeling Using VHDL (3 semester hours) This course introduces students to VHDL beginning with simple examples and describing tools and methodologies. It covers the language, dwelling on fundamental stimulation concepts. Students are also exposed to the subset of VHDL that may be used for synthesis of custom logic. VHDL simulation and synthesis labs and projects are performed using commercial and/or academic VLSI CAD tools. Prerequisite: EE 3320 or equivalent. (3-0) T CS 5330 Computer Science II (3 semester hours) Basic concepts of computer organization: Numbering systems, twos complement notation, multi-level machine concepts, machine language, assembly programming and optimization, subroutine calls, addressing modes, code generation process, CPU datapath, pipelining, RISC vs. CISC, performance calculation. Co-requisite: CS 5303. (3-0) S CS 5333 Discrete Structures (3 semester hours) Mathematical foundation of computer science. Logic, sets, relations, graphs and algebraic structures. Combinatorics and metrics for performance evaluation of algorithms. (3-0) S CS 5343 Algorithm Analysis and Data Structures (3 semester hours) Formal specifications and representation of lists, arrays, trees, graphs, multi-linked structures, strings and recursive pattern structures. Analysis of associated algorithms. Sorting and searching, file structures. Relational data models. Prerequisites: CS 5303, CS 5333. (3-0) S CS 5348 Operating Systems Concepts (3 semester hours) An introduction to fundamental concepts in operating systems, their design, implementation, and usage. Topics include: process management, main memory management, virtual memory, I/O and device drivers, file systems, secondary storage management, introduction to critical sections and deadlocks. Prerequisites: CS 5330 and CS 5343 (may be taken concurrently) and a working knowledge of C and Unix. (3-0) S CE 5354 (CS 5354, SE 5354) Software Engineering (3 semester hours) Formal specification and program verification. Software life-cycle models and their stages. System and software requirements engineering; user-interface design. Software architecture, design, and analysis. Software testing, validation, and quality assurance. Corequisite: CS 5343 (CS 5343 can be taken before or at the same time as CS 5354) (3-0) S CE 5381 Curriculum Practical Training in Computer Engineering (3 semester hours) This course is required of students who need additional training in engineering practice. Credit does not apply to the 33 hour M.S.C.E. requirement. Consent of Graduate Adviser required. (May be repeated to a maximum of 9 hours). (3-0) S CE 6301 (EE 6301) Advanced Digital Logic (3 semester hours) Modern design techniques for digital logic. Logic synthesis and design methodology. Link between front-end and back-end design flows. Field programmable gate arrays and reconfigurable digital systems. Introduction to testing, simulation, fault diagnosis and design for testability. Prerequisites: EE 3320 or equivalent and background in VHDL/Verilog. (3-0) T CE 6302 (EE 6302) Microprocessor Systems (3 semester hours) Design of microprocessor based systems including I/O and interface devices. Microprocessor architectures. Use of emulators and other sophisticated test equipment. Extensive laboratory work. Prerequisite: EE 4304 or equivalent. (2-3) Y CE 6303 (EE 6303) Testing and Testable Design (3 semester hours) Techniques for detection of failures in digital circuits and systems. Fault modeling and detection. Functional testing and algorithms for automatic test pattern generation (ATPG). Design of easily testable digital systems. Techniques for introducing built-in self test (BIST) capability. Test of various digital modules, like PLAs, memory circuits, datapath, etc. Prerequisites: EE 3320 or equivalent and background in VHDL/Verilog. (3-0) Y CE 6304 (EE 6304, CS 6304) Computer Architecture (3 semester hours) Trends in processor, memory, I/O and system design. Techniques for quantitative analysis and evaluation of computer systems to understand and compare alternative design choices in system design. Components in high performance processors and computers: pipelining, instruction level parallelism, memory hierarchies, and input/output. Students will undertake a major computing system analysis and design project. Prerequisites: EE 4304 and C/C++. (3-0) Y CE 6305 (EE 6305) Computer Arithmetic (3 semester hours) Carry look ahead systems and carry save adders. Multipliers, multi-bit recoding schemes, array multipliers, redundant binary schemes, residue numbers, slash numbers. High-speed division and square root circuits. Multi-precision algorithms. The IEEE floating point standard, rounding processes, guard bits, error accumulation in arithmetic processes. Cordic algorithms. Prerequisites: EE 3320 and C/C++. (3-0) Y CE 6306 (EE 6306) Application Specific Integrated Circuits Design (3 semester hours) This course discusses the design of application specific integrated circuits (ASIC). Specific topics include: VLSI system design specification, ASIC circuit structures, synthesis, and implementation of an ASIC digital signal processing (DSP) chip. Prerequisite: EE 3320. (3-0) Y CE 6307 (EE 6307) Fault-Tolerant Digital Systems (3 semester hours) Concepts in hardware and software fault tolerance. Topics include fault models, coding in computer systems, fault diagnosis and fault-tolerant routing, clock synchronization, system reconfiguration, etc. Survey of practical fault-tolerant systems. Prerequisites: EE 6301, EE 3341 or equivalent. (3-0) R CE 6308 (EE 6308, CS 6396) Real-Time Systems (3 semester hours) Introduction to real-time applications and concepts. Real-time operating systems and resource management. Specification and design methods for real-time systems. System performance analysis and optimization techniques. Project to specify, analyze, design, implement and test small real-time system. Prerequisite: CS 5348. (3-0) R CE 6324 (CS 6324) Information Security (3 semester hours) A comprehensive study of security vulnerabilities in information systems and the basic techniques for developing secure applications and practicing safe computing. Topics include common attacking techniques such as buffer overflow, Trojan, virus, etc. UNIX, Windows and Java security. Conventional encryption. Hashing functions and data integrity. Public-key encryption (RSA, Elliptic-Curve). Digital signature. Watermarking for multimedia. Security standards and applications. Building secure software and systems. Management and analysis of security. Legal and ethical issues in computer security. Prerequisite: CS 5348 and CS 5390 (3-0) Y CE 6325 (EE 6325) VLSI Design (3 semester hours) Introduction to MOS transistors. Analysis of the CMOS inverter. Combinational and sequential design techniques in VLSI; issues in static, transmission gate and dynamic logic design. Design and layout of complex gates, latches and flip-flops, arithmetic circuits, memory structures. Low power digital design. The method of logical effort. CMOS technology, and rationale behind various design rules. Use of CAD tools to design, layout, check, extract and simulate a small project. Prerequisite: EE 3320 or equivalent. (3-0) Y CE 6345 (EE 6345) Engineering of Packet-Switched Networks (3 semester hours) Detailed coverage, from the point of view of engineering design, of the physical, datalink, network and transport layers of IP (Internet Protocol) networks. This course is a Masters-level introduction to packet networks. Prior knowledge of digital communication systems is strongly recommended. (3-0) Y CE 6352 (CS 6352) Performance of Computer Systems and Networks (3 semester hours) Overview of case studies. Quick review of principles of probability theory. Queuing models and physical origin of random variables used in queuing models. Various important cases of the M/M/m/N queuing system. Littles law. The M/G/1 queuing system. Simulation of queuing systems. Product form solutions of open and closed queuing networks. Convolution algorithms and Mean Value Analysis for closed queuing networks. Discrete time queuing systems. Prerequisite: a first course on probability theory. (3-0) S CE 6353 (CS 6353) Compiler Construction (3 semester hours) Lexical analyzers, context-free grammars. Top-down bottom-up and parsing; shift reduce and LR parsing. Operator-precedence, recursive-descent, predictive, and LL parsing. LR(k), LL(k) and precedence grammars will be covered. Prerequisites: CS 5343 and CS 5349. (3-0) Y CE 6354 (CS 6354, SE 6354) Advanced Software Engineering (3 semester hours) This course covers advanced theoretical concepts in software engineering and provides an extensive hands-on experience in dealing with various issues of software development. It involves a semester-long group software development project spanning software project planning and management, analysis of requirements, construction of software architecture and design, implementation, and quality assessment. The course will introduce formal specification, component-based software engineering, and software maintenance and evolution. Prerequisite: CS 5354 (or equivalent) and knowledge of Java (3-0) S CE 6367 (CS 6367, SE 6367) Software Testing, Validation, Verification (3 semester hours) Methods for evaluating software for correctness, performance and reliability including code inspections, program proofs and testing methodologies. Formal and informal proofs of correctness. Code walkthroughs, code inspections and their role in software verification. Unit and system testing techniques, testing tools and limitations of testing. Statistical testing, reliability models and performance measurement techniques. Prerequisite: CE 5354. (3-0) Y CE 6370 (EE 6370) Design and Analysis of Reconfigurable Systems (3 semester hours) Introduction to reconfigurable computing, programmable logic: FPGAS, CPLDs, CAD issues with FPGA based design, reconfigurable systems: emulation, custom computing, and embedded application based computing, static and dynamic hardware, evolutionary design, software environments for reconfigurable systems. Prerequisite: EE 3320 or equivalent. (3-0) Y CE 6375 (EE 6375) Design Automation of VLSI Systems (3 semester hours) This course deals with various topics related to the development of CAD tools for VLSI systems design. Algorithms, data structures, heuristics and design methodologies behind CAD tools. Design and analysis of algorithms for layout, circuit partitioning, placement, routing, chip floor planning, design rule checking (DRC). Introduction to CAD algorithms for RTL and behavior level synthesis, module generators, and silicon compilation. Prerequisite: CS 5343; Co-requisite: CE 6325. (3-0) Y CE 6378 (CS 6378) Advanced Operating Systems (3 semester hours) Concurrent processing, inter-process communication, process synchronization, deadlocks, introduction to queuing theory and operational analysis, topics in distributed systems and algorithms, checkpointing, recovery, multiprocessor operating systems. Prerequisites: CS 5348, knowledge of C and Unix. (3-0) S CE 6380 (CS 6380) Distributed Computing (3 semester hours) Topics include distributed algorithms, election algorithms, synchronizers, mutual exclusion, resource allocation, deadlocks, Byzantine agreement and clock synchronization, knowledge and common knowledge, reliability in distributed networks, proving distributed programs correct. Prerequisite: CS 5348. (3-0) S CE 6390 (CS 6390) Advanced Computer Networks (3 semester hours) The design and analysis of computer networks. Topics include network architectures, the OSI reference model, theoretical basis for data-communications, network protocols, local area networks, ISDN. Prerequisites: CS 5341, CS 5390. (3-0) S CE 6392 (CS 6392) Mobile Computing Systems (3 semester hours) Topics include coping with mobility of computing systems, data management, reliability issues, packet transmission, mobile IP, end-to-end reliable communication, channel and other resource allocation, slot assignment, routing protocols, and issues in mobile wireless networks (without base stations). Prerequisite: CS 6378 or CS 6390. (3-0) Y CE 6397 (CS 6397) Synthesis and Optimization of High-Performance Systems (3 semester hours) A comprehensive study of the high-level synthesis and optimization algorithms for designing high performance systems with multiple CPUs or functional units for critical applications such as Multimedia, Signal processing, Telecommunications, Networks, and Graphics applications, etc. Topics including algorithms for architecture-level synthesis, scheduling, resource binding, real-time systems, parallel processor array design and mapping, code generations for DSP processors, embedded systems and hardware/software codesigns. Prerequisite: CS 5348. (3-0) Y CE 6398 (CS 6398/EE 6398) DSP Architectures (3 semester hours) Typical DSP algorithms, representation of DSP algorithms, data-graph, FIR filters, convolutions, Fast Fourier Transform, Discrete Cosine Transform, low power design, VLSI implementation of DSP algorithms, implementation of DSP algorithms on DSP processors, DSP applications including wireless communication and multimedia. Prerequisite: CS 5343. (3-0) Y Deleted: CE CE 6399 (CS 6399) Parallel Architectures and Systems (3 semester hours) A comprehensive study of the fundamentals of parallel systems and architecture. Topics including parallel programming environment, fine-grain parallelism such as VLIW and superscalar, parallel computing para...

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:

Dallas - CAT - 2006
Department of Electrical Engineeringhttp:/www.utdallas.edu/dept/eeFacultyProfessors: Larry P. Ammann, Poras T. Balsara, Andrew Blanchard, Cyrus D. Cantrell III, David E. Daniel, John P. Fonseka, William R. Frensley, Andrea F. Fumagalli, Bruce Gna
Dallas - CAT - 2006
Department of Computer Sciencehttp:/www.utdallas.edu/dept/cs/FacultyProfessors: Farokh Bastani, Ramaswamy Chandrasekaran, Ding-Zhu Du, Andrs Farag, Gopal Gupta, Dung T. Huynh, Dan Moldovan, Simeon C. Ntafos, Balaji Raghavachari, Hsing-Mean (Edwin
Dallas - CAT - 2006
Department of Molecular and Cell Biologyhttp:/utdallas.edu/nsm/biology/FacultyProfessors: Hans Bremer (emeritus), Lee A. Bulla, Santosh R. DMello, Rockford K. Draper, Juan E. Gonzlez, Steven R. Goodman, Donald M. Gray, Betty S. Pace, Lawrence J.
Dallas - CAT - 2004
Back to Catalog Contents Telecommunications Engineering Course Listing Graduate programs in Computer Science, Electrical Engineering, Computer Engineering, Telecommunications Engineering, Industrial PracticeGraduate Program in Telecommunication
Dallas - YXH - 052000
Yue He, Initiated Date: 2/15/2007 Implemented Functions: Blocking Bandwidth, Handling CAC failure, PathErr Message Mechanism, FloodingReviewing the simulation:A figure of the whole process is as following: Trigger CAC and PathError if not succeede
Dallas - YXH - 2007
Yue He, Initiated Date: 2/15/2007 Implemented Functions: Blocking Bandwidth, Handling CAC failure, PathErr Message Mechanism, FloodingReviewing the simulation:A figure of the whole process is as following: Trigger CAC and PathError if not succeede
Dallas - POST - 883
NCT COG Regional Police AcademyBasic Instructor CourseCredit Card Fraud: Minimize Your RiskInstructor: Roger Stearns Criminal Investigator with UT PoliceUniversity of Texas at Dallas Ten Years of service in Campus Law Enforcement & Security
Dallas - POST - 883
Welcome BackCredit Card & Debit Card FraudPossible Affects on VictimsFinancial Loss Damage to credit report Wrongful warrant/arrest Potential legal fees. Additional inconvenience of timeHow can you minimize your risk?Check Your StatementOpe
Dallas - POST - 883
LESSON PLAN COVER SHEETCOURSE: INSTRUCTIONAL UNIT: INSTRUCTOR: TCLEOSE Basic Instructor Course Credit Card Fraud: Minimize Your Risk Roger Stearns, Investigator University of Texas at Dallas Police Department 2601 N Floyd Road (PG-11) Richardson, TX
Dallas - POST - 883
# STATUSNAMEIDINTERNSHIP CREDIT=001 Squad Leader Tom Lee 002 Asst Squad Leader Leslie Elliot6 credit hours003 Explorer John Frensley004 Explorer Brian Hills 005 Explorer Benjamin Lotzer006 Explorer Keith Mattson 007 E
Penn State - JTK - 187
Feed and the Medias Effects upon Individuality Unit Title/ Theme: Media Student Name: Lauren Baker, Max Feldman, Danielle Greene, Jonathan Klingeman Rationale One of the major themes that Feed deals with is the effect of the media upon the characters
Penn State - JTK - 187
"A Raisin in the Sun" Pre-Reading LessonPrior to the class beginning to read the play "A Raisin in the Sun", we will use two outside texts to discuss a few of the larger themes in the reading as well as to connect the play to the rest of the unit. F
Penn State - JTK - 187
The Pennsylvania StateProducer Assistant Director Technical Director Dr. Tony M. Lentz Kristen Rowe Brenton DeFlitchUniversity Readers, CAS 480 ClassPresentsThe CrewThe Pennsylvania State UniversitySpecial Thanks ToThe Schlow Centre Regio
Penn State - JTK - 187
Day Two: Civil Disobedience Read: Roll of Thunder, Hear My Cry, page 21 (beginning with Now Miss Crocker) through page 31, aloud using jump in reading. Teacher: Have you ever heard of the term civil disobedience before? Civil disobedience encompasses
Penn State - JTK - 187
A Raisin in the Sun Debate: -2 Class Periods-Should the word Nigger or any form of it be used in todays culture? Objective: Students will learn to formulate arguments based on both their prior knowledge and interpretations of the text. They will demo
Penn State - JTK - 187
Assessment: Social Injustice & Identity Unit Plan Through the course of this unit, students will be asked to actively participate everyday during class activities. A variety of different assessments will be used to analyze the progression of each stu
Penn State - JTK - 187
Day Four and Five: Research ProjectRESEARCH (kinda) PROJECTTask #1: Select an historical event in which a person or persons stood up for what they believed. In no way shape or form does this need to involve the Civil Rights Movement or focus aroun
Penn State - JTK - 187
Lesson Plan Three: Expression is Everything Topic: Poetry and arts in the Harlem Renaissance and across society Objectives: Conclude A Raisin in the Sun through bringing in other modes of expression (poetry; music) Practice writing poetry Become m
Penn State - JTK - 187
A Raisin the Sun Making a Raisin LessonObjective: To discuss the topic of identity, both the personal identity of the students as well as and in connection to the characters in the book. When considering the broader theme of the unit, it is importan
Penn State - JTK - 187
Penn State - JTK - 412
Penn State - JTK - 187
Penn State - JTK - 412
Penn State - JTK - 412
Reading & Writing PoetryJonathan Klingeman jtk187@psu.edu Mt. Nittany Middle School March 29, 2007Learning Objectives By the end of the class period, students will: Write, respond and react to each other's poems. Understand requirements of I-mo
Penn State - JTK - 187
Persuasion Invasion Introductory lessonJonathan Klingeman jtk187@psu.edu Mt. Nittany Middle School March 5, 2007Learning Objectives By the end of the class period, students will: Define persuasion Be familiar with "Powerful" Persuasive Words
Penn State - JTK - 412
Persuasion Invasion Introductory lessonJonathan Klingeman jtk187@psu.edu Mt. Nittany Middle School March 5, 2007Learning Objectives By the end of the class period, students will: Define persuasion Be familiar with "Powerful" Persuasive Words
Penn State - COMM - 187
http:/bp1.blogger.comhttp:/www.livemusicblog.com/festivals/06/07/13/lollapalooza-aftershows.phphttp:/www.arts-festival.com/hotpicks.htmhttp:/www.rioabajodays.org/KARAOKE_SINGER.jpghttp:/dealwitit.com/store/product_info.php?products_id=32
Penn State - COMM - 461
http:/bp1.blogger.comhttp:/www.livemusicblog.com/festivals/06/07/13/lollapalooza-aftershows.phphttp:/www.arts-festival.com/hotpicks.htmhttp:/www.rioabajodays.org/KARAOKE_SINGER.jpghttp:/dealwitit.com/store/product_info.php?products_id=32
Penn State - JQM - 5111
\*123.IWillRuntoYou CGCD/F#EmEm/D YoureyeisonthesparrowandYourhand,itcomfortsme FC/EDD/F#mG Fromtheendsoftheearthtothedepthsofmyheart CAmDsusD LetYourmercyandgracebeseen. CGCD/F#mEmEm/D YoucallmetoYourpurposeasangelsunderstand FC/EDD/F#mGG/BCDG
Penn State - JQS - 5120
Jonathan Sackner Email: jqs5120@psu.edu Basketballplr89@comcast.net Website: www.personal.psu.edu/jqs5120 Education: Pennsylvania State Univeristy (Abington Campus) Major: IST or Business Expected graduation date May 2011 Work Experienc
Dallas - CHEM - 051000
Perspective on the reactions between F and CH3CH2F: The free energy landscape of the E2 and SN2 reaction channelsBernd Ensing* and Michael L. KleinCenter for Molecular Modeling and Department of Chemistry, 231 South 34th Street, University of Penns
Dallas - CHEM - 3411
Perspective on the reactions between F and CH3CH2F: The free energy landscape of the E2 and SN2 reaction channelsBernd Ensing* and Michael L. KleinCenter for Molecular Modeling and Department of Chemistry, 231 South 34th Street, University of Penns
Dallas - OCHEM - 1
ORGANIC CHEMISTRY I PRACTICE PROBLEMS FOR BRONSTED-LOWRY ACID-BASE CHEMISTRY1. For each of the species below, identify the most acidic proton and provide the structure of the corresponding conjugate base. You might want to draw detailed Lewis formu
Dallas - OCHEM - 1
INTRODUCTION TO ORGANIC NOMENCLATUREALKANES, HYDROCARBONS, and FUNCTIONAL GROUPS. All organic compounds are made up of at least carbon and hydrogen. The most basic type of organic compound is one made up exclusively of sp3 carbons covalently bonded
Dallas - OCHEM - 1
ORGANIC CHEMISTRY I PRACTICE EXERCISE Elimination Reactions and Alkene Synthesis 1) One of the products that results when 1-bromo-2,2-dimethylcyclopentane is heated in ethanol is shown below. Give a mechanism by which it is formed and give the name
Dallas - OCHEM - 1
PRACTICE QUESTIONS FOR CH. 5 PART I1) Is the molecule shown below chiral or achiral?OHOH2) Is the molecule shown below chiral or achiral?H C H C CCH3 CO2OH3) Is the molecule shown below chiral or achiral?CH2OH HO2C H C CO2H4) Is the m
Dallas - OCHEM - 1
IMPORTANT CONCEPTS IN ALKYNE CHEMISTRYSUMMARY OF IMPORTANT TOPICS FOR ALKYNES AND ALKYNE CHEMISTRY1. NOMENCLATURE - Refer to section 9-2 of the textbook for IUPAC and common names, and to the chart of functional group order of precedence on page 2
Dallas - OCHEM - 1
CONFORMATIONAL ANALYSIS OF ALKANESimportant concepts1. STRUCTURAL ISOMERS 2. CONFORMERS 3. NEWMAN PROJECTIONS & DIHEDRAL ANGLE 4. RELATIONSHIP BETWEEN STABILITY AND POTENTIAL ENERGY LEVEL IN MOLECULAR SYSTEMS 5. FACTORS THAT INCREASE POTENTIAL ENE
Dallas - OCHEM - 1
ELECTROPHILIC ADDITIONS OF ALKENES AS THE COUNTERPART OF ELIMINATIONSINTRODUCTION - Chapter 8 is mostly about alkene reactions. That is, how one can transform alkenes into other functional groups. Mostof these reactons are electrophilic additions,
Dallas - OCHEM - 1
ORGANIC CHEMISTRY I STEREOCHEMISTRY EXERCISES SET 2PART A Consider the following molecules and answer the questions. a) dichloromethane b) 1-bromo-1-chloroethane c) 2-bromopropane d) 2-chlorobutane e) cis-1,2-dichlorocyclopropane f) trans-1,2-dich
Dallas - OCHEM - 1
INTRODUCTION TO THEORY OF CHEMICAL REACTIONSBACKGROUND The introductory part of the organic chemistry course has three major modules: Molecular architecture (structure), molecular dynamics (conformational analysis), and molecular transformations (ch
Dallas - OCHEM - 1
INTRODUCTION TO LEWIS ACID-BASE CHEMISTRYDEFINITIONSLewis acids and bases are defined in terms of electron pair transfers. A Lewis base is an electron pair donor, and a Lewis acid is an electron pair acceptor. An organic transformation (the creatio
Dallas - OCHEM - 1
ORGANIC CHEMISTRY I PRACTICE EXERCISE Sn1 and Sn2 Reactions1) Which of the following best represents the carbon-chlorine bond of methyl chloride?Hd+CdCl HHdCd+Cl HHd+Cd+Cl HHHdCdCl HC HClH HHHHIIIIII
Dallas - OCHEM - 1
CONFORMATIONAL ANALYSIS PRACTICE EXERCISES 1) Draw a Newman projection of the most stable conformation of 2-methylpropane. 2) The structures below are:CH3 H H H HHCH3H H CH3HCH3A) B) C) D) E)not isomers. conformational isomers. cis-tra
Dallas - OCHEM - 1
PRACTICE PROBLEMS, CHAPTERS 1 - 3(Covered from Ch. 3: Alkane and Alkyl Halide nomenclature only) 1. The atomic number of boron is 5. The correct electronic configuration of boron is: A. 1s22s3 B. 1s22p3 C. 1s22s22p1 D. 2s22p3 E. 1s22s23s12. How ma
Dallas - OCHEM - 1
SUPPLEMENTARY NOTES FOR STEREOCHEMISTRYSOME IMPORTANT CONCEPTS IN STEREOCHEMISTRY1. RELATIONSHIP BETWEEN SYMMETRY AND CHIRALITYAsymmetric objects are chiral Symmetric objects are achiral2. RELATIONSHIP BETWEEN OBJECTS AND THEIR MIRROR IMAGESSy
Dallas - OCHEM - 1
ORGANIC CHEM I Practice Questions for Ch. 41) Write an equation to describe the initiation step in the chlorination of methane. 2) Reaction intermediates that have unpaired electrons are called _. 3) When light is shined on a mixture of chlorine and
Dallas - OCHEM - 1
USING HYDROGEN AS A NUCLEOPHILE IN HYDRIDE REDUCTIONSLike carbon, hydrogen can be used as a nucleophile if it is bonded to a metal in such a way that the electron density balance favors the hydrogen side. A hydrogen atom that carries a net negative
Dallas - OCHEM - 1
ELECTRON DELOCALIZATION AND RESONANCELEARNING OBJECTIVESTo introduce the concept of electron delocalization from the perspective of molecular orbitals, to understand the relationship between electron delocalization and resonance, and to learn the p
Dallas - OCHEM - 1
LEWIS FORMULAS, STRUCTURAL ISOMERISM, AND RESONANCE STRUCTURESLEARNING OBJECTIVES: To understand the uses and limitations of Lewis formulas, to introduce structural isomerIsm, and to learn the basic concept of resonance structures.CHARACTERISTICS
Dallas - OCHEM - 1
1. ATOMIC STRUCTURE FUNDAMENTALSLEARNING OBJECTIVESTo review the basics concepts of atomic structure that have direct relevance to the fundamental concepts of organic chemistry. This material is essential to the understanding of organic molecular s
Dallas - OCHEM - 1
INTRODUCTION TO IONIC MECHANISMS PART I: FUNDAMENTALS OF BRONSTED-LOWRY ACID-BASE CHEMISTRYHYDROGEN ATOMS AND PROTONS IN ORGANIC MOLECULES - A hydrogen atom that has lost its only electron is sometimesreferred to as a proton. That is because once t
Dallas - OCHEM - 1
ORBITAL PICTURE OF BONDING: ORBITAL COMBINATIONS, HYBRIDIZATION THEORY, & MOLECULAR ORBITALSLEARNING OBJECTIVESTo introduce the basic principles of molecular orbital theory and electronic geometry of molecules.ORBITAL COMBINATIONSAtomic orbitals
Dallas - VSN - 061000
Transfer of Adaptation Aftereffects between Simple Visual Forms and FacesVaidehi Natu-Wasson1*, Kai-Markus Mller2,3, Fang Jiang1, Alice O'Toole1The University of Texas at Dallas1 National Institute of Mental Health2 International Max-Planck Researc
Dallas - SON - 051000
J Math Chem DOI 10.1007/s10910-008-9374-7 ORIGINAL PAPERCalculating the surface tension between a flat solid and a liquid: a theoretical and computer simulation study of three topologically different methodsUriel Octavio Moreles Vzquez Wataru Shi
Dallas - HCS - 6367
Speech Communication 40 (2003) 467491 www.elsevier.com/locate/specomInteraction between the native and second language phonetic subsystemsJames E. Flegeaa,*, Carlo Schirru b, Ian R.A. MacKaycDivision of Speech and Hearing Sciences, Univer
Dallas - PHYS - 020509
ExamplesA small particle has a charge -5.0 C and mass 2*10-4 kg. It moves from point A, where the electric potential is a =200 V and its speed is V0=5 m/s, to point B, where electric potential is b =800 V. What is the speed at point B? Is it movin
Dallas - PHYS - 2326
ExamplesA small particle has a charge -5.0 C and mass 2*10-4 kg. It moves from point A, where the electric potential is a =200 V and its speed is V0=5 m/s, to point B, where electric potential is b =800 V. What is the speed at point B? Is it movin
Dallas - NATS - 015000
NATS 1311 - From the Cosmos to EarthA model of the celestial sphere shows the patterns of the stars, the borders of the 88 official constellations, the ecliptic, and the celestial equator and poles.NATS 1311 - From the Cosmos to EarthLatitude a
Dallas - NATS - 1311
NATS 1311 - From the Cosmos to EarthA model of the celestial sphere shows the patterns of the stars, the borders of the 88 official constellations, the ecliptic, and the celestial equator and poles.NATS 1311 - From the Cosmos to EarthLatitude a
Dallas - ISNS - 015000
ISNS 3371 - Phenomena of NatureCircuits in SeriesResistance (light bulbs) on same path Current has one pathway - same in every part of the circuit Total resistance is sum of individual resistances along path Current in circuit equal to voltage su