# Search result: Catalogue data in Autumn Semester 2020

Number Title Type ECTS Hours Lecturers Electrical Engineering and Information Technology Bachelor  3rd Semester: Examination Blocks  Examination Block 1 401-0353-00L Analysis 3  O 4 credits 2V + 2U M. Iacobelli Abstract In this lecture we treat problems in applied analysis. The focus lies on the solution of quasilinear first order PDEs with the method of characteristics, and on the study of three fundamental types of partial differential equations of second order: the Laplace equation, the heat equation, and the wave equation. Objective The aim of this class is to provide students with a general overview of first and second order PDEs, and teach them how to solve some of these equations using characteristics and/or separation of variables. Content 1.) General introduction to PDEs and their classification (linear, quasilinear, semilinear, nonlinear / elliptic, parabolic, hyperbolic)2.) Quasilinear first order PDEs- Solution with the method of characteristics- COnservation laws3.) Hyperbolic PDEs- wave equation- d'Alembert formula in (1+1)-dimensions- method of separation of variables4.) Parabolic PDEs- heat equation- maximum principle- method of separation of variables5.) Elliptic PDEs- Laplace equation- maximum principle- method of separation of variables- variational method Literature Y. Pinchover, J. Rubinstein, "An Introduction to Partial Differential Equations", Cambridge University Press (12. Mai 2005) Prerequisites / Notice Prerequisites: Analysis I and II, Fourier series (Complex Analysis) 402-0053-00L Physics II O 8 credits 4V + 2U A. Imamoglu Abstract The goal of the Physics II class is an introduction to quantum mechanics Objective To work effectively in many areas of modern engineering, such as renewable energy and nanotechnology, students must possess a basic understanding of quantum mechanics. The aim of this course is to provide this knowledge while making connections to applications of relevancy to engineers. After completing this course, students will understand the basic postulates of quantum mechanics and be able to apply mathematical methods for solving various problems including atoms, molecules, and solids. Additional examples from engineering disciplines will also be integrated. Content Content:- Wave mechanics: the old quantum theory- Postulates and formalism of Quantum Mechanics- First application: the quantum well and the harmonic Oscillator- QM in three dimension: the Hydrogen atom- Identical particles: Pauli's principle- Crystalline Systems and band structures- Quantum statistics- Approximation Methods- Applications in Engineering- Entanglement and superposition Lecture notes Lecture notes (hand-written) will be distributed via the Moodle interface Literature David J. Griffiths, "Introduction to quantum mechanics" Second edition, Cambridge University Press. Link Prerequisites / Notice Prerequisites: Physics I. 227-0045-00L Signals and Systems I O 4 credits 2V + 2U H. Bölcskei Abstract Signal theory and systems theory (continuous-time and discrete-time): Signal analysis in the time and frequency domains, signal spaces, Hilbert spaces, generalized functions, linear time-invariant systems, sampling theorems, discrete-time signals and systems, digital filter structures, Discrete Fourier Transform (DFT), finite-dimensional signals and systems, Fast Fourier Transform (FFT). Objective Introduction to mathematical signal processing and system theory. Content Signal theory and systems theory (continuous-time and discrete-time): Signal analysis in the time and frequency domains, signal spaces, Hilbert spaces, generalized functions, linear time-invariant systems, sampling theorems, discrete-time signals and systems, digital filter structures, Discrete Fourier Transform (DFT), finite-dimensional signals and systems, Fast Fourier Transform (FFT). Lecture notes Lecture notes, problem set with solutions. 252-0836-00L Computer Science II O 4 credits 2V + 1U F. Mattern Abstract Introduction to basic problem solving methods, algorithms, and data structures. Topics: divide and conquer, recursion, sorting algorithms, backtracking, game tree search, data structures (lists, stacks, binary trees, etc.), discrete simulation, concurrency, complexity, verification. In the assignments and exercises, the programming language Java is used. Objective Introduction to the general methods of computer science for electrical engineers. Also provides basic skills for advanced exercises and projects later in the electrical engineering program. Content Part II of the lecture concentrates on the most common problem solving skills, algorithms, and data structures. It also teaches fundamental concepts and mechanisms of structured programming. Furthermore, working with formal systems, the necessity of abstraction, and the importance of modeling in computer science will be motivated. The emphasis of the lecture is on practical concepts of computer science. Specific topics are: complexity and correctness of algorithms, divide and conquer, recursion, algorithms for sorting, backtracking, game tree search, data structures (lists, stacks, inary trees, etc.), discrete simulation, concurrency, and verification. For the assignments and exercises, the programming language Java is used. Here, also modularization, abstraction, encapsulation, and object orientation will be considered. Occasionally, short remarks on the historical context of relevant concepts are given. In the practice groups, students program an automatic player for the game "Reversi"; at the end of the semester a tournament will take place. Lecture notes Copies of slides, extended with bonus slides that give hints to advanced concepts and present the historical context of selected concepts. Literature Textbook: Mark Allan Weiss: Data Structures and Problem Solving Using Java, Addison Wesley. Prerequisites / Notice Prerequisite: Part 1 of the course.  Examination Block 2 227-0077-10L Electronic Circuits O 4 credits 2V + 2U Q. Huang Abstract Introductory lecture on electronic circuits. Transistor fundamentals, analysis and design of transistor based electronic circuits such as amplifiers and filters; operational amplifiers and circuits based thereon. Objective Modern, transistor-based electronics has transformed our lives and plays a crucial role in our economy since the 2nd half of last century. The main objective of this course in electronic circuits is to introduce the concept of the active device, including operational amplifiers, and their use in amplification, signal conditioning, switching and filtering to students. In addition to gaining experience with typical electronic circuits that are found in common applications, including their own Gruppenarbeit and Fachpraktikum projects, students sharpen their understanding of linear circuits based on nonlinear devices, imperfections of electronic circuits and the concept of design (as opposed to analysis). The course is a prerequisite for higher semester subjects such as analog integrated circuits, RF circuits for wireless communications, A/D and D/A converters and optoelectronics. Content Review of transistor devices (bipolar and MOSFET), large signal and small signal characteristics, biasing and operating points. Single transistor amplifiers, simple feedback for bias stabilization. Frequency response of simple amplifiers. Broadbanding techniques. Differential amplifiers, operational amplifiers, variable gain amplifiers. Instrumentation amplifiers: common mode rejection, noise, distortion, chopper stabilization. Transimpedance amplifiers. Active filters: simple and biquadratic active RC-filters, higher order filters, biquad and ladder realizations. Switched-capacitor filters. Literature Göbel, H.: Einführung in die Halbleiter-Schaltungstechnik. Springer-Verlag Berlin Heidelberg, 6th edition, 2019.Pederson, D.O. and Mayaram, K.: Analog Integrated Circuits for Communication. Springer US, 2nd edition, 2008.Sansen, W.M.C.: Analog Design Essentials. Springer US, 1st edition, 2006.Su, K.L.: Analog Filters. Springer US, 2nd edition, 2002. 401-0053-00L Discrete Mathematics O 4 credits 2V + 1U D. Adjiashvili Abstract Introduction to foundations of discrete mathematics: combinatorics (elementary counting), graph theory, algebra, and applications thereof. Objective The main goal is to get a good understanding of some of the most prominent areas within discrete mathematics.
•  Page  1  of  1  