Course description. [insert your course of studies here (e.g. Information Systems )] [insert the name of the university you studied at]

Transcription

1 Name of applicant: Course description [insert your name here] Blue colored text indicates areas where you have to add content Course of studies: University: Grade Average: [insert your course of studies here (e.g. Information Systems )] [insert the name of the university you studied at] [insert your average grade on a scale of 1 to 5 with 1 being the best, i.e. 100% = 1,0; 75% = 2,0; 0% = 5,0] Table of contents Please refresh the index when you have finished the description! 1 [Category] [Course: Insert your courses here] Information Systems (process modeling) Data management Computer Science (data modeling and software engineering) Programming Quantitative Methods (Operations research and statistics) Operations research Business Administration Fundamentals of accounting... 10

2 Generic example of course description 1 [Category] Please categorize your lectures into the following four categories: Information Systems, Computer Science, Quantitative Methods, and Business Administration 1.1 [Course: Insert your courses here] Structure Example (template): Use this structure as a template/ copy the boxes from the example in order to add courses in your document. 1. [headline/content of chapter one] 1.1. [headline/content of first subchapter] 1.2. [ ] 2. [headline/content of chapter one] 2.1. [ ] Literature Example (template): [Surname], [first letter of given name]. ; [Surname], [first letter of given name]. : [Title]. [Subtitle]. [x th edition]., [place of publication] [year]. Example (applied): Winskel, G.: The Formal Semantics of Programming Languages, 5th edition, Cambridge Additional Information ECTS: [insert the amount of ECTS concerning this lecture] Contact hours (semester periods per week): Lecture: [insert the amount contact hours spent for lecture] Tutorial: [insert the amount contact hours spent for tutorial] SUM: [Total amount of contact hours]

3 2 Information Systems (process modeling) 2.1 Data management This is just an exemplary lecture of the Bachelor s program at the WWU Münster. Structure 1. Conceptual data models by means of the entity-relationship-method 1.1. Purpose of conceptual data models 1.2. Basic elements within ERM 1.3. Usage of cardinalities by means of the Min-Max-notation Syntax Combination possibilities and their interpretation 1.4. Hierarchies and structures in an ERM Hierarchies and trees Structures and networks 1.5. Attributes in an ERM Attributes as keys 1.6. Multivalent relationship types 1.7. Reinterpretation of relationship types 1.8. Generalization and specialization in an ERM 1.9. Special conventions of ER-modeling Denotation of relationship types The concept of time in an ER-model Conventions concerning cardinalities Conventions concerning generalization and specialization 2. Transformation of ER-models into data base schemata 2.1. Transformation of entity types 2.2. Transformation of relationship types 2.3. Transformation of generalizations and specializations Non disjunctive partial Non disjunctive total Disjunctive total Disjunctive partial Alternative transformation approaches

4 3. Data base normalization 3.1. First normal form Functional dependencies Procedure for transforming into first normal form 3.2. Second normal form Procedure for transforming into second normal form 3.3. Third normal form Procedure for transforming into third normal form 3.4. Fourth normal form Multivalent dependencies 3.5. Fifth normal form 4. Structured Query Language (SQL) 4.1. SQL as a standard 4.2. Purposes 4.3. Designators 4.4. Values Character chains Numbers NULL-values 4.5. Data types Numerical data types Time-related data types Character chain-related data types 4.6. Creation of tables (CREATE TABLE) 4.7. Modification of the table structure (ALTER TABLE) 4.8. Removal of tables (DROP TABLE) 4.9. Insertion of data (INSERT) Direct insertion Insertion from other tables Queries (SELECT) Simple queries Generation of preconditions (WHERE) Sorting (ORDER BY) JOIN-syntax Data aggregation Building of groups (GROUP BY) Conditions within groups (HAVING) The order of query processing Sub-queries Modification of data (UPDATE) Deletion of data (DELETE)

5 5. Data base synchronization and transactions 5.1. Synchronization of data base processes 5.2. Transactions (ACID) Atomicity Consistency Isolation Durability 5.3. Anomalies with competing accesses to data Dirty read Lost update Non-repeatable read Phantom read 5.4. Serializability of transactions Read-lock and write-lock Two-phase-protocol 6. Dispositive data management systems data warehouses 6.1. Structure of a data warehouse 6.2. Established data warehouse schemata 6.3. Data warehouse model on function specification level Literature Becker, J.; Schütte, R.: Handelsinformationssysteme. 2nd Edition, Landsberg Vossen, G.: Datenmodelle, Datenbanksprachen und Datenbankmanagementsysteme. 5th Edition, Oldenbourg Scheer, A.-W.: ARIS, Modellierungsmethoden, Metamodelle, Anwendungen. 4th edition, Berlin Additional Information ECTS: 5 Contact hours (semester periods per week): Lecture: 2 Tutorial: 2 SUM: 4 Please follow this example and add all lectures related to the field of Information Systems before you continue with the second category: Computer Science

6 3 Computer Science (data modeling and software engineering) 3.1 Programming This is just an exemplary lecture of the Bachelor s program at the WWU Münster. Structure 1. Introduction 1.1. Classification of programming languages 1.2. Aims of programming 2. Object-oriented programming (with Java) 2.1. First java programs and features 2.2. Basic types and operations 2.3. Arrays 2.4. Control structures 2.5. Object orientation and programming on large-scale 2.6. Graphical user interfaces (GUI) 2.7. Inner classes 2.8. Exception handling 2.9. Generic types Loops applied to collections Automated pack and upack Enumeration types Data files Value- vs. reference-semantics Java memory administration Applets Concurrency General programming principles 3. Declarative/functional programming (with Haskell/Curry) 3.1. Definition of functions 3.2. Definition of types 3.3. Pattern-matching 3.4. Type-inference 3.5. Functions of a higher rank 3.6. Lazy evaluation

7 3.7. Accumulation within parameters 4. Semantics of imperative programming languages (by means of imperative language IMP ) 4.1. Syntax of IMP 4.2. Reduction-semantics of IMP 4.3. Machine-semantics of IMP Literature Java: Krüger, G.: Handbuch der Java-Programmierung, Studentenausgabe, München Haskell: Chakravarty. M.; Keller, G.: Einführung in die Programmierung mit Haskell, München Thompson, S.: Haskell - The Craft of Functional Programming, 2nd edition, Harlow Bird, R.: Introduction to Functional Programming using Haskell, 2nd edition, London Semantics: Winskel, G.: The Formal Semantics of Programming Languages, 5th edition, Cambridge Additional Information ECTS: 10 Contact hours (semester periods per week): Lecture: 4 Tutorial: 2 SUM: 6 Please follow this example and add all lectures related to the field of Computer Science before you continue with the second category: Quantitative Methods

8 4 Quantitative Methods (Operations research and statistics) 4.1 Operations research This is just an exemplary lecture of the Bachelor s program at the WWU Münster. Structure 1. Graphs and trees 1.1. Relations and graphs 1.2. Shortest ways within graphs 1.3. Trees 1.4. Critical path analysis 2. Linear optimization (linear programming) 2.1. Basics (questions and solutions) 2.2. Simplex algorithm 2.3. Two-phase-method 2.4. Sensitivity analysis 2.5. Duality and the dual simplex algorithm 3. Integer optimization 3.1. Linear programming including integrity constraints 3.2. Issues of transport 3.3. Issues of allocation 4. Decision optimization and Markov-chains 4.1. Dynamic optimization 4.2. Markov chains 4.3. Markov decision processes 5. Optimization procedures 5.1. Problem classification 5.2. Search procedures 5.3. Simulated annealing 5.4. Genetic algorithms Literature references Kathöfer, U.; Müller-Funk, U.: BWL-Crash-Kurs Operations Research, 2 nd edition, Konstanz Bomze, I., Grossmann, W.: Optimierung- Theorie und Algorithmen. Eine Einführung in Operations Research für Wirtschaftsinformatiker, Mannheim Gal, T.: Grundlagen des Operations Research, Part 3, Berlin Neumann, K., Morlock, M.: Operations Research, 2 nd edition, München 2002.

9 Additional Information ECTS: 10 Contact hours (semester periods per week): Lecture: 3 Tutorial: 2 Additional qualification - computer supported mathematics: 2 SUM: 7 Please follow this example and add all lectures related to the field of Quantitative Methods before you continue with the second category: Business Administration

10 5 Business Administration This is just an exemplary lecture of the Bachelor s program at the WWU Münster. 5.1 Fundamentals of accounting Structure 1. Purpose-orientation of accounting systems 1.1. Subcategorization of economic accountancy 1.2. Purposes of economic accountancy 1.3. Definitions and demarcation 2. Internal accountancy 2.1. Tasks of cost-accounting/activity-accounting 2.2. The structure of cost-accounting/activity-accounting 2.3. Cost-accounting systems 2.4. Cost-type accounting 2.5. Cost-center accounting 2.6. Cost-unit accounting 2.7. Selective cost-accounting procedures 3. External accountancy 3.1. Basics of the annual account 3.2. Reporting procedure 3.3. Valuation 3.4. Profit commission statement 3.5. Additional elements concerning the accounts of stock corporations 3.6. Annual audit 3.7. Financial statement analysis Literature Berens, W.; Flacke, K.; Kraft, M.; Triska, T.: Grundlagen des betriebswirtschaftlichen Rechnngswesens, 3 rd edition, Münster Coenenberg, A.: Kostenrechnung und Kostenanalyse, 5 th edition, Stuttgart Baetge, J.; Kirch, H.-J.; Thiele, S.: Bilanzen, 8 th edition, Düsseldorf 2005.

11 Additional Information ECTS: 10 Contact hours (semester periods per week): Lecture: 5 Tutorial: 1 SUM: 6 Please follow this example and add all lectures related to the field of Business Administration in order to finalize the course description.