SE-Wiki

teaching:labs:xp:2013b:sidebar

Daniel Speicher — 2013-05-17T17:06:16+02:00

* :en: Agile Lab '13 * Seminar * Seminar Topics * Team Area * Topic Distribution * Tutorials * Tutorial Achievements * Tutorial Tracking Pages * Laboratory * :sec: Internal * Helpful Links * Kanban * Introduction into Agile * Introduction to XP * "Are we doing XP?"

ALP General Information

Günter Kniesel — 2013-05-17T11:57:09+02:00

ALP General Information Assignment 4 is online Chapter 4 is online This course is regularly offered in the summer semester, as part of the ICM track of the CS Master's program. The course number in the master module handbook is MA-INF 3207. It should be preferably attended in the second semester of your studies. The course can also be attended by diploma students.

ALP Slides - Chapter 3 (update) and 4

Günter Kniesel — 2013-05-17T11:54:53+02:00

Date Chapter/Topic Last update of slides 10.04.13 0. Organizational Issues [Chapter 0, 15.4.2013] 17.04.13 1. Syntax, Informal Semantics, Application Example [Chapter 1, 15.4.2013] 24.04.13 2. Declarative semantics [Chapter 2, 24.4.2013] 01.05.13 May Day (no lecture, no tutorials) 08.05.13 3. Software Analysis [Chapter 3, 01.5.2013] 15.05.13 4. Operational Semantics …

teaching:lectures:oosc:2013:sidebar

Daniel Speicher — 2013-05-17T11:27:57+02:00

* Lectures * OOSC 13 * Schedule / Slides * Assignments * Assignment 0: Hello OOSC! * Assignment 1: Object Oriented Programming * Assignment 2: UML, Class and Object Diagrams * Assignment 3: UML, Behavior Diagrams * Assignment 4: Requirements Elicitation * 8-) Competition 8-)

Competition

Daniel Speicher — 2013-05-17T11:27:12+02:00

Student Assignment Competition This semester we plan to do a student competition. The competition provides you the possibility to compete with your fellow students. Every assignment solution you do gives you a score value. The accumulated score is presented in a leaderboard available on the wiki and updated weekly. Below, you’ll find an example scoreboard with fictional names and scores. The scoreboard will be available on the website of the lecture.

Assignments

Narges Tavalkopour Saleh — 2013-05-16T22:47:40+02:00

* Assignment sheets will be linked here on the “Publishing date”. * Your solutions must be submitted via SVN by the “Submission date” (specified also on the assignment sheet). * Sample solutions will be linked one week after the submission date.

Res-On: Prüfungsergebnisse sicher online abfragen - created

Günter Kniesel — 2013-05-16T16:34:09+02:00

Mit Hilfe von Res-On ist es möglich, Klausur-Ergebnisse online zu publizieren und abzufragen. Diese Seite erklärt wie Sie Res-On nutzen können und was bisherige Nutzer dazu sagen (, Detailkommentare): * (durch Dozenten) * (durch Prüfungsteilnehmer) * * *

Schedule / Slides

Daniel Speicher — 2013-05-16T14:08:28+02:00

* 11.04.2013 * Introduction * Literature: [BD09, Ch.1] * 18.04.2013 * Objects and Classes, [Static] aspects of OOP and UML * OOP by example (incomplete notes) * Literature: [BD09, Ch.2], [PP05] * 25.04.2013 * Software Configuration Management * Dynamic aspects of OOP and UML * Literature: [BD09, Ch.2], [PP05]

Sandwich

Daniel Speicher — 2013-05-15T23:01:53+02:00

Effective feedback. Based on pattern writers workshop. * It's great that you produced ... for us. * We liked about your description ... * We suggest the following improvements ... * Questions for clarification. * Finally we'd like to say that we really liked ...

Tutorials

Daniel Speicher — 2013-05-15T16:52:12+02:00

Here is a list of tutorials that we developed for different occasions. I collected them here for ease of reuse. As they are not new there might be already solutions out there, but you learn much more, if you solve them on your own. Basics of Object-Oriented Programming * Goal: Basic understanding of equality, identity, inheritance, substitutability. * Object Oriented Programming * Estimated time: 1 hour - 4 hours

Agile Lab 2013 - Seminar

Daniel Speicher — 2013-05-14T16:50:30+02:00

Teaching Staff Name E-mail Phone Office dsp Daniel Speicher (0228) 73-4315 A109 jn Jan Nonnen (0228) 73-4276 A107 Topic Assignment Nr. Topic Student Advisor 1 Kanban Shirish Negi dsp 2 SEMAT Ugochukwu Ejikeme dsp 3 Pair Programming Nourhan Abdelhalim dsp 4 Test Driven Development Panagiotis Sal…

Assignment 4: Requirements Elicitation

Daniel Speicher — 2013-05-14T15:52:37+02:00

Release date: Wednesday, 01.05.13 - Due date: Sunday, 12.05.13, 23:59 Task 01: Usage Scenarios and Use Cases - Coffee 2 points One of your colleagues came back from an interview session with a customer. He has tried to create a preliminary use case diagram A4T01T02_CoffeeMaker based on the notes he had taken during the interview. Unfortunately he got fired before he is able to complete his work. Congratulations to your recent promotion.

Assignment 5 - created

Daniel Speicher — 2013-05-14T13:23:19+02:00

Task XX: Analysis Object Model 3 points Use your use case model (task 01) and your domain object model (task 03) to create an analysis object model. Tip: We described a straightforward strategy for creating an analysis object model in the Requirements Analysis slides. See slide 51-59.

Black Box Testing

Daniel Speicher — 2013-05-14T11:34:40+02:00

( Object Oriented Programming ) - ( Black Box Testing ) - ( Small Refactoring ) - ( Refactoring the Three Key Cup App ) Code for this tutorial: Theory * Imagine you have to test the class Triangle, whose source code you do not know. * The class's only public method of interest is Triangle.contains(Triangle t) and it is supposed to check if the triangle contains some other triangle t. For example the green triangle on the right cont…

Small Refactoring

Daniel Speicher — 2013-05-14T11:34:01+02:00

( Object Oriented Programming ) - ( Black Box Testing ) - ( Small Refactoring ) - ( Refactoring the Three Key Cup App ) Code for this tutorial: * Before extracting a method extract those expression you want to become parameters into local variables. * Before moving a part of a method to another class, you should extract this part into an own method in the current class. * If you need more tips: Ask on the mailing list! :-…

Refactoring the Three Key Cup App

Daniel Speicher — 2013-05-14T11:33:42+02:00

( Object Oriented Programming ) - ( Black Box Testing ) - ( Small Refactoring ) - ( Refactoring the Three Key Cup App ) Code for this tutorial: Part 0: Get it running Clone the repository and import it into your workspace. Run the application. If you run into problems, don't hesitate to ask questions on the mailing list. Configurations problems are frequent and we are unable to…

Object Oriented Programming

Daniel Speicher — 2013-05-14T11:25:12+02:00

( Object Oriented Programming ) - ( Black Box Testing ) - ( Small Refactoring ) - ( Refactoring the Three Key Cup App ) Code for this tutorial: introduction into the basic OOP concepts Videos

Three Key Cup Refactoring Hints

Daniel Speicher — 2013-05-14T10:38:01+02:00

( Object Oriented Programming ) - ( Black Box Testing ) - ( Small Refactoring ) - ( Refactoring the Three Key Cup App ) (Hints for Refactoring the Three Key Cup App.) Here we collected some hints. Use them as you like. The hints are in no special order. Therefore it might be a good idea to pick them at random. We are also open to your suggestions for improvement, especially if you can name a bad smell. A few hints point to more than one problem. The hints , , , , , , , mainly point you to…

Tennis - created

Jan Nonnen — 2013-05-13T15:36:48+02:00

Implement a simple tennis game score counter with one set. The scoring system is rather simple: * Each player can have either of these points in one game 0 15 30 40 * If you have 40 and you win the ball you win the game, however there are special rules. * If both have 40 the players are deuce. * If the game is in deuce, the winner of a ball will have advantage and game ball. * If the player with advantage wins the ball he wins the game * If the player without advantage wins t…

Coding Katas

Jan Nonnen — 2013-05-13T15:36:21+02:00

A coding Kata is a simple problem that one can solve using TDD techniques. These exercises help to practice unit testing and test driven development, as well as development with various programming languages. I think all programmers have seen the “Hello World” coding kata ;). In the following I'll present a small list of Katas that can be used to practise. The idea is to do a task regularly, so that it functions like a warm up practice in sports.

Time is Relative - created

Jan Nonnen — 2013-05-13T15:36:01+02:00

Write a Facebook-style method that returns time qualitatively. * If the difference between two timestamps is less then 5 seconds, return “Just moments ago”. * If less than a minute, return “X seconds ago”. * If less than an hour, return “X minutes ago”.

Prime Factors - external edit

2013-05-13T15:30:37+02:00

Factorize a positive integer number into its prime factors. Example 2 -> [2] 3 -> [3] 4 -> [2,2] 6 -> [2,3] 9 -> [3,3] 12 -> [2,2,3] 15 -> [3,5]

Fizz Buzz

Jan Nonnen — 2013-05-13T15:29:58+02:00

Write a program that prints the numbers from 1 to 100. But for multiples of three print “Fizz” instead of the number and for the multiples of five print “Buzz”. For numbers which are multiples of both three and five print “FizzBuzz”. Example

Roman Numerals - created

Jan Nonnen — 2013-05-13T15:29:00+02:00

Given a positive integer number (eg 42) determine its Roman numeral representation as a String (eg “XLII”). The Roman 'letters' are: 1 -> "I" | 10 -> "X" | 100 -> "C" | 1000 -> "M" 2 -> "II" | 20 -> "XX" | 200 -> "CC" | 2000 -> "MM" 3 -> "III" | 30 -> "XXX" | 300 -> "CCC" | 3000 -> "MMM" 4 -> "IV" | 40 -> "XL" | 400 -> "CD" | 4000 -> "MMMM" 5 -> "V" | 50 -> "L" | 500 -> "D" 6 -> "VI" | 60 -> "LX" | 600 -> "DC" 7 -> "VII" | 70 -> "LXX" | 700 -> "D…

Bowling Game - created

Jan Nonnen — 2013-05-13T15:27:24+02:00

Write a program, to calculate the score for a game of Ten-Pin Bowling. The scoring rules: * Each game, or “line” of bowling, includes ten turns, or “frames” for the bowler. * In each frame, the bowler gets up to two tries to knock down all ten pins. * If the first ball in a frame knocks down all ten pins, this is called a “strike”. The frame is over. The score for the frame is ten plus the total of the pins knocked down in the next two balls. * If the second ball in a frame knocks do…

Anagrams - created

Jan Nonnen — 2013-05-13T15:23:20+02:00

Write a program to generate all potential anagrams of an input string. For example, the potential anagrams of “biro” are biro bior brio broi boir bori ibro ibor irbo irob iobr iorb rbio rboi ribo riob roib robi obir obri oibr oirb orbi orib

teaching:labs:sidebar

Daniel Speicher — 2013-05-12T16:46:13+02:00