1 6th Workshop "SEERE", Ravda, 18-23 September 2006 Evolution of the MouseMaze case study and its assessment M. Ivanovic, K. Bothe.

Slides:



Advertisements
Similar presentations
Primary MCQ Course Evaluation September 2010 Mean score, maximum being 5.
Advertisements

Mobile Robot ApplicationsMobile Robot Applications Textbook: –T. Bräunl Embedded Robotics, Springer 2003 Recommended Reading: 1. J. Jones, A. Flynn: Mobile.
Microsoft ® Office Word 2007 Training Table of Contents III: Use fields to create a TOC and create multiple TOCs Neeginan Institute of Applied Technology.
Programming Paradigms and languages
A seminar on e-business – Was it worthwhile? Zoran Budimac, Zoran Putnik.
An Object-Oriented Approach to Programming Logic and Design
Introduction to C Programming
Chapter 8 and 9 Review: Logical Functions and Control Structures Introduction to MATLAB 7 Engineering 161.
Humboldt University Berlin, University of Novi Sad, University of Plovdiv, University of Skopje, University of Belgrade, University of Niš, University.
DAAD project “Joint Course on OOP using Java” Humboldt University Berlin, University of Novi Sad, ‘Polytehnica’ University of Timisoara, University of.
Two e-Learning elective seminars in Novi Sad Putnik Z., Komlenov Ž., Budimac Z. DMI, Faculty of Science University of Novi Sad.
COMP171 Data Structure & Algorithm Tutorial 1 TA: M.Y.Chan.
Humboldt University Berlin, University of Novi Sad, University of Plovdiv, University of Skopje, University of Belgrade, University of Niš, University.
Chapter 1 Program Design
Chapter 14: Event-Driven Programming with Graphical User Interfaces
CIS101 Introduction to Computing Week 12 Spring 2004.
1 OO Java, Baile Herculane, Romania, 2005 OO Java Requirements Specification - Produce highly adaptable teaching materials - 1 st step: collect all useful.
Microsoft ® Office Word 2007 Training Mail Merge II: Use the Ribbon and perform a complex mail merge [Your company name] presents:
New experiences with teaching Java as a second programming language Ioan Jurca “Politehnica” University of Timisoara/Romania
Platforms for Learning in Computer Science July 28, 2005.
EXPERIENCE WITH TWO OOP LANGUAGES IN ONE COURSE Ana Madevska Bogdanova, FCSE, Skopje, Macedoia.
DAAD project “Joint Course on OOP using Java” Design Patterns in the course ‘OOP in Java’ - first experiences Ana Madevska Bogdanova Institute of informatics.
Effective Teaching of Health Reporting: Lectures and More Barbara Gastel, MD, MPH Texas A&M University Train the Trainer Workshop: Health Reporting for.
Research talk 1.1 Claudette M. Jones, M.Ed. KAISERSLAUTERN HS APLAC
Nachos Phase 1 Code -Hints and Comments
BIM211 – Visual Programming Objects, Collections, and Events 1.
© The McGraw-Hill Companies, 2006 Chapter 4 Implementing methods.
Chapter 1 What is Programming? Lecture Slides to Accompany An Introduction to Computer Science Using Java (2nd Edition) by S.N. Kamin, D. Mickunas, E.
G050: Lecture 02 Evaluating Interactive Multimedia Products
University of Toronto Department of Computer Science CSC444 Lec05- 1 Lecture 5: Decomposition and Abstraction Decomposition When to decompose Identifying.
An analysis of exam results in the Object-Oriented Programming course at „Politehnica” University of Timisoara Ioan Jurca.
7th Workshop SEERE, Risan, 8-15 September, "New Java course material and available pool of.ppt presentations" D. Pešović, M. Ivanović, Ž. Komlenov.
Introduction Algorithms and Conventions The design and analysis of algorithms is the core subject matter of Computer Science. Given a problem, we want.
1 Software Design Reference: Software Engineering, by Ian Sommerville, Ch. 12 & 13, 5 th edition and Ch. 10, 6 th edition.
Programming for Beginners Martin Nelson Elizabeth FitzGerald Lecture 5: Software Design & Testing; Revision Session.
Presenting in Prof. Eckert’s Classes Please make sure your presentation gives an opinion or argument on some idea: for example, evaluate the book, or.
DAAD project “Joint Course on OOP using Java” Humboldt University Berlin, University of Novi Sad, ‘Polytehnica’ University of Timisoara, University of.
Humboldt University Berlin, University of Novi Sad, ‘Polytehnica’ University of Timisoara, University of Plovdiv, University of Belgrade DAAD project “Joint.
Documentation. Your documentation must fit the needs of your audience. It’s always better to say one thing that is useful, as opposed to many things that.
G050 – Lecture 05a Task A & B Feedback 2010 Mr C Johnston ICT Teacher
Preset and custom animation
1 6th Workshop "SEERE", Ravda, September 2006 OOJava course materials – what happened during last year? M. Ivanovic, K. Bothe.
90-723: Data Structures and Algorithms for Information Processing Copyright © 1999, Carnegie Mellon. All Rights Reserved. 1 Lecture 1: Introduction Data.
Intro to CIT 594
A Puzzle for You. Puzzle Someone is working for you for 7 days You have a gold bar, which is segmented into 7 pieces, but they are all CONNECTED You have.
Delphi Evaluation Results PBA Back-End development, Autumn 2012.
SEG 4110 – Advanced Software Design and Reengineering Topic T Introduction to Refactoring.
Agent program is the one part(class)of Othello program. How many test cases do you have to test? Reversi [Othello]
PROGRAMMING TESTING B MODULE 2: SOFTWARE SYSTEMS 22 NOVEMBER 2013.
CSM06: Information Retrieval Notes about writing coursework reports, revision and examination.
Supporting the design of interactive systems a perspective on supporting people’s work Hans de Graaff 27 april 2000.
Structure A Data structure is a collection of variable which can be same or different types. You can refer to a structure as a single variable, and to.
CSCE 240 – Intro to Software Engineering Lecture 3.
Notices Assn 2 is due tomorrow, 7pm. Moodle quiz next week – written in the lab as before. Everything up to and including today’s lecture: Big Topics are.
AP Biology Note-taking Methods.
Research Introduction to the concept of incorporating sources into your own work.
Nonogram Solver Cs491b Software Design Prepared by :
Create A Title Slide To Introduce
Unit 13 – Reports (pp92-97) Professional Writing.
Create A Title Slide To Introduce
Computer Programming.
adapted from Recursive Backtracking by Mike Scott, UT Austin
Create A Title Slide To Introduce
The non-trivial Java example ‘Mouse in a Maze’
Experiment with course materials concerning ‘Threads’
Objects First with Java A Practical Introduction using BlueJ
Research Methods Technical Writing Thesis Report Writing
Objects First with Java A Practical Introduction using BlueJ
Summary Writing Access prior knowledge-
Presentation transcript:

1 6th Workshop "SEERE", Ravda, September 2006 Evolution of the MouseMaze case study and its assessment M. Ivanovic, K. Bothe

6th Workshop "SEERE", Ravda, September Contents  Overview and reminder  From 1st to 2nd version  Towards the 3rd version  Assessment by students from Novi Sad

6th Workshop "SEERE", Ravda, September Plan: experiments with certain Java topics Mira in Berlin, February Basic Concepts of Object-Orientation: Objects, Classes, Abstract Data Types 2.Objects and Classes: Additional Useful Features 3.Inheritance, Polymorphism, Dynamic Binding 4.Exception handling 5.Interfaces 6.Event handling 7.Threads & Processes 8.MouseMaze

6th Workshop "SEERE", Ravda, September Mouse movements according to the wall-follower algorithm entry exit A simple software development process from specification, to design, implementation, and test To remember the case study

6th Workshop "SEERE", Ravda, September MouseMaze versions Klaus: MouseMaze, 1 st version 93 slides, Zagreb workshop 2004 Mira: Used MouseMaze, 2005/06  students feedback Mira: modify + extend, Febr. '06 2 nd version, 104 slides  students feedback Klaus: Extended 1 st version May 2006 Klaus: compare + unite, Aug slides 3 rd version

6th Workshop "SEERE", Ravda, September Contents  Overview and reminder  From 1st to 2nd version  Towards the 3rd version  Assessment by students from Novi Sad

6th Workshop "SEERE", Ravda, September Two steps towards the 2 nd version Klaus: MouseMaze, 1 st version 93 slides, Zagreb workshop 2004 Mira: Used MouseMaze, 2005/06  students feedback Mira: modify + extend, Febr. '06 2 nd version, 104 slides  students feedback Klaus: Extended 1 st version May 2006 Klaus: compare + unite, Aug slides 3 rd version

6th Workshop "SEERE", Ravda, September MouseMaze: 2 nd version by additions to the 1 st version Mira: I have done for MouseMaze: 1.I added lecture notes connected to some more important slides. 2.On slide 41, I added code from slide 36. The idea is to follow every step in code (by animation: 1.With writing text about every step 2.Pointing to appropriate statement in the code 3.On the slide 66 I put Algorithm for mouse movement(MouseMaze) instead of Algorithm for mouse movement, just to make connection with latter implementation. 4.After Klaus’ slide 81, I added new slide about east walls of maze, just to cover both parts of maze. 5.After Klaus’ slide 83 I added 3 new slides with a whole code of class Maze. My students like to see all fields and methods, as complete implementation. During presentation it is necessary to explain code in more details. 6.After Klaus’ slide 86, I added whole code of MazeTest class. It makes that part clearer. 7. After Klaus’ slide 90 I added 3 new slides with a whole code of class Mouse. My students like to see whole code. During presentation it is necessary to explain code in more details. 8.After Klaus’ slide 92 I added 3 new slides with a whole code of class MouseMaze. My students like to see whole code. During presentation it is necessary to explain code in more details.

6th Workshop "SEERE", Ravda, September Mouse movements: graphical and textual output entryexit step forward turn right step forward turn right turn left step forward turn right turn left step forward turn right step forward step forward; /* enter the maze */ WHILE(NOT outside the maze?) BEGIN /*do next step*/ turn right; WHILE (facing a wall?) DO turn left; ENDWHILE step forward; END ENDWHILE

6th Workshop "SEERE", Ravda, September MouseMaze Mira: I have done for MausMaze: 1.I added lecture notes connected to some more important slides. 2.On slide 41, I added code from slide 36. The idea is to follow every step in code (by animation: 1.With writing text about every step 2.Pointing to appropriate statement in the code 3.On the slide 66 I put Algorithm for mouse movement(MouseMaze) instead of Algorithm for mouse movement, just to make connection with latter implementation. 4.After Klaus’ slide 81, I added new slide about east walls of maze, just to cover both parts of maze. 5.After Klaus’ slide 83 I added 3 new slides with a whole code of class Maze. My students like to see all fields and methods, as complete implementation. During presentation it is necessary to explain code in more details. 6.After Klaus’ slide 86, I added whole code of MazeTest class. It makes that part clearer. 7. After Klaus’ slide 90 I added 3 new slides with a whole code of class Mouse. My students like to see whole code. During presentation it is necessary to explain code in more details. 8.After Klaus’ slide 92 I added 3 new slides with a whole code of class MouseMaze. My students like to see whole code. During presentation it is necessary to explain code in more details.

6th Workshop "SEERE", Ravda, September boolean [][] sWall = {{true, true, true, false}, {false, false, false, true}, {false, false, false, false}, {true, true, true, true}} South walls of the maze: example (0,0)(1,0)(2,0)(3,0)(4,0)(5,0) (0,1)(1,1)(2,1)(3,1)(4,1)(5,1) (0,2)(1,2)(2,2(3,2)(4,2)(5,2) (0,3)(1,3)(2,3)(3,3)(4,3)(5,3) (0,4)(1,4)(2,4)(3,4)(4,4)(5,4) Original slide of 1st version

6th Workshop "SEERE", Ravda, September boolean[][] eWall = {{true, false,false,false,true}, {false,true,true,false,true}, {true,true,false,true,true}} East walls of the maze: example (0,0)(1,0)(2,0)(3,0)(4,0)(5,0) (0,1)(1,1)(2,1)(3,1)(4,1)(5,1) (0,2)(1,2)(2,2)(3,2)(4,2)(5,2) (0,3)(1,3)(2,3)(3,3)(4,3)(5,3) (0,4)(1,4)(2,4)(3,4)(4,4)(5,4) Added slide to the 2nd version

6th Workshop "SEERE", Ravda, September MouseMaze (2) Mira: I have done for MausMaze: 1.I added lecture notes connected to some more important slides. 2.On slide 41, I added code from slide 36. The idea is to follow every step in code (by animation: 1.With writing text about every step 2.Pointing to appropriate statement in the code 3.On the slide 66 I put Algorithm for mouse movement(MouseMaze) instead of Algorithm for mouse movement, just to make connection with latter implementation. 4.After Klaus’ slide 81, I added new slide about east walls of maze, just to cover both parts of maze. 5.After Klaus’ slide 83 I added 3 new slides with a whole code of class Maze. My students like to see all fields and methods, as complete implementation. During presentation it is necessary to explain code in more details. 6.After Klaus’ slide 86, I added whole code of MazeTest class. It makes that part clearer. 7. After Klaus’ slide 90 I added 3 new slides with a whole code of class Mouse. My students like to see whole code. During presentation it is necessary to explain code in more details. 8.After Klaus’ slide 92 I added 3 new slides with a whole code of class MouseMaze. My students like to see whole code. During presentation it is necessary to explain code in more details.

6th Workshop "SEERE", Ravda, September Implementation of the Maze – code import java.awt.*; class Maze { // Representation of a maze object final int NORTH=0, EAST=1, SOUTH=2, WEST=3; // record the walls to the east private boolean[][] eWall = {{true,false,false,false,true }, {false,true,true,false,true }, {true,true,false,true,true }}; // record the walls to the south private boolean[][] sWall = {{true,true,true,false}, {false,false,false,true }, {false,false,false,false}, {true,true,true,true }}; private int height = 3, width = 4; private Point size = new Point(width, height);

6th Workshop "SEERE", Ravda, September Implementation of the Maze – code // Where is the starting location? public Point getStartLocation() {return new Point(0,2);} // In which direction do you face to enter? public int getStartDirection() {return EAST;} public Point getSize() {return size;} // Is a given position outside the maze? public boolean outside (Point pos) { return ((pos.x < 1) || (pos.x > width) || (pos.y < 1) || (pos.y > height) ); }

6th Workshop "SEERE", Ravda, September Implementation of the Maze – code // Is there a wall to the 'dir' direction // of location (row,col)? public boolean checkWall(int dir, int col, int row) { switch (dir) { case NORTH: return sWall[row-1][col-1]; case SOUTH: return sWall[row][col-1]; case EAST: return eWall[row-1][col]; default: return eWall[row-1][col-1]; } // Alternative version of checkWall public boolean checkWall(int dir, Point location) { return checkWall(dir, location.x, location.y); }

6th Workshop "SEERE", Ravda, September Summary Mira: added slides  Students in Novi Sad want more information concerning the implemented program  Some more program code  Added some explanations which "normally" are part of the lecture notes  Useful new animations illustrating the contents

6th Workshop "SEERE", Ravda, September Contents  Overview and reminder  From 1st to 2nd version  Towards the 3rd version  Assessment by students from Novi Sad

6th Workshop "SEERE", Ravda, September rd version: merge two versions Klaus: MouseMaze, 1 st version 93 slides, Zagreb workshop 2004 Mira: Used MouseMaze, 2005/06  students feedback Mira: modify + extend, Febr. '06 2 nd version, 104 slides  students feedback Klaus: Extended 1 st version May 2006 Klaus: compare + unite, Aug slides 3 rd version

6th Workshop "SEERE", Ravda, September MouseMaze: 3 rd version Klaus: I have done for MouseMaze 1. Slide 13 added (including lecture notes): picture of a real garden maze 2. Slide 18 modified: new animation of mouse appearance (just for fun) 3. Slide 19 modified: some information added (start position) 4. Slide 34 modified: Name of the algorithms added (wall-follower algorithm) 5. Slide 43 added: Extended version of Mira's new slide to stress the correspondence between code and output (one of the slides 42 or 43 could be deleted) 6. Slide 46 added: picture of a rescue robot 7. Slide 47 added: discuss the problems of a garden maze 8. Slide 95 modified: some information added(Test) 9. Slide 96 added 10. Slides added: Differences between 'Maze' and 'Labyrinth' -General knowledge concerning mazes and labyrinths - Better illustration of the contents - Some pictures (jpg)

6th Workshop "SEERE", Ravda, September How does a maze look like? Glendurgan Garden, Cornwall, England Real-life maze

6th Workshop "SEERE", Ravda, September Mouse movements: graphical and textual output entryexit step forward turn right step forward turn right turn left step forward turn right turn left step forward turn right step forward step forward; /* enter the maze */ WHILE(NOT outside the maze?) BEGIN /*do next step*/ turn right; WHILE (facing a wall?) DO turn left; ENDWHILE step forward; END ENDWHILE ENTER WHILE Mira's slide extended

6th Workshop "SEERE", Ravda, September Model of a rescue robot: Mouse replaced by a technical device Source: Wikipedia Motivation: Maze problems are real-life

6th Workshop "SEERE", Ravda, September How to solve this real-world maze problem? Glendurgan Garden, Cornwall, England Data representation problem Another task: Find the house Algorithm does not work anymore

6th Workshop "SEERE", Ravda, September Maze = Labyrinth?  Maze: Tour puzzle in the form of a complex branching passage with choices of path and direction through which the solver must find a route. This is different from a labyrinth. Source: Wikipedia  Labyrinth: Has an unambiguous through-route to the centre and back and is not designed to be difficult to navigate. Some general education

6th Workshop "SEERE", Ravda, September Maze examples Source: Wikipedia

6th Workshop "SEERE", Ravda, September Labyrinth examples (1) Source: Wikipedia A Roman mosaic showing Theseus and the Minotaur. From Rhaetia, Switzerland Roman representation of the Minotaur (as a man's head and torso joined to a bull's body) in a labyrinth engraved on an ancient gem

6th Workshop "SEERE", Ravda, September Labyrinth examples (2) Source: Wikipedia Medieval labyrinth Both images come from the 1st or 2nd edition of Nordisk familjebok (1904–1926). The copyrights for that book have expired and these images are in the public domain.Nordisk familjebokcopyrights Classical labyrinth

6th Workshop "SEERE", Ravda, September Contents  Overview and reminder  From 1st to 2nd version  Towards the 3rd version  Assessment by students from Novi Sad

6th Workshop "SEERE", Ravda, September Assessment by students in Novi Sad Mira Ivanovic, Novi Sad, based on 2nd version  Questionnaire - students opinion  37 students, 21 filled questionnaire (problem: motivation?)  II (IV semester) year students  After finishing Java

6th Workshop "SEERE", Ravda, September Questionnaire I Contents of the lecture 1. Do you consider the amount of knowledge offered in the lecture too much      too few 2. How do you consider the contents of the lecture? too easy       too difficult 3. Is the topic well-structured? very well       unstructured 4. Are there any special requirements (pre-knowledge) to be able to understand the course? If yes, which ones: General remarks and suggestions concerning section I:

6th Workshop "SEERE", Ravda, September Questionnaire II Style of the lecture: 1. Is the presentation of the topic too fast      too slow? 2. Does the presentation style encourage you to follow the lecture? very well      not so much General remarks and suggestions concerning section II:

6th Workshop "SEERE", Ravda, September Questionnaire III Using media 1. Is the amount of information on the slides adequate? very well      not so much 2. Are the slides well-structured and clearly-arranged? very well      not so much 3. What do you think about presence of sources on slides? A – necessary B – useful C – pseudo-code is enough 4. Do you need additional texts-explanations (lecture notes) attached to the slides? A – Yes B – Not necessaryC – NO General remarks and suggestions concerning section III (especially concerning style of slides, animations, effects,…) :

6th Workshop "SEERE", Ravda, September Questionnaire IV Benefit of the lecture (or value, profit, usefulness) 1. Did you satisfied with topic (did you learn some new, useful things)? much      not so much 2. Do you think the contents of the lecture is useful? completely      not so much 3. What is you overall rank of the topic? very well      bad Please comment this topic with respect to the other Java topics (e.g., too late, too much repeating of known concepts, a good overview/conclusion of the study, indispensable course, etc …). General remarks and suggestions concerning section IV (e. g. which are not so important or not so interesting, which deserved more and which less attention/duration). Final general remarks to the lecture/topic:

6th Workshop "SEERE", Ravda, September I Contents of the lecture 1. Do you consider the amount of knowledge offered in the lecture too much      too few How do you consider the contents of the lecture? too easy      too difficult Is the topic well-structured? very well      unstructured Are there any special requirements (pre-knowledge) to be able to understand the course? Basic Java programming For the understanding the lecture, it’s not necessary to know the Java syntax, or any other part of programming in Java, but for source code it’s necessary to know Java syntax, statements, classes… It is understandable with basic Java knowledge Questionnaire Results

6th Workshop "SEERE", Ravda, September Questionnaire Results I Contents of the lecture General remarks and suggestions concerning section I:  More colors on slides would be useful, and a color of background is very uninviting because students like more colors, animations.  Although the topic is very well structured, sometimes easy concepts are explained in detail and some more complicated are left unclear. Less time should be used for discussing the requirements.  First part describing Maze and Mouse movements is very well structured and organized.  It doesn’t give students any practical knowledge, i.e. it isn’t very useful.  It is interesting when we have problem like this one, because this lecture offers some new knowledge presented in a more interesting way. But this style and way is not useful for presenting whole Java.

6th Workshop "SEERE", Ravda, September Questionnaire Results II Style of the lecture: 1. Is the presentation of the topic too fast      too slow? Does the presentation style encourage you to follow the lecture? very well      not so much General remarks and suggestions concerning section II:  A lecture was very nice explained, because it wasn’t too hard to understand  More animations and more talking to the students would be useful

6th Workshop "SEERE", Ravda, September Questionnaire Results III Using media 1. Is the amount of information on the slides adequate? very well      not so much Are the slides well-structured and clearly-arranged? very well      not so much What do you think about presence of sources on slides? A – necessary B – useful C – pseudo-code is enough 18 3 (Our students definitely like more concrete programs and code ) 4. Do you need additional texts-explanations (lecture notes) attached to the slides? A – Yes B – Not necessaryC – NO

6th Workshop "SEERE", Ravda, September Questionnaire Results III Using media General remarks and suggestions concerning section III (especially concerning style of slides, animations, effects,…) :  I think that using more colors on slides would be useful for students, and more source codes, as well.  Slides feature too much “comments”, that should be transformed into lecture notes. Slides have very good organization. Also, testing should be explained on more slides, in as much detail as design.  Presentation is done qualitatively. But it is necessary to make them more dynamic with different effects to keep students’ attention until the end of class. Style of slides is a little bit dreary (lifeless). (scold-zakeralo )  Animations and effects are good, but the fact that there isn’t enough code in slides, makes slides less worthy that they maybe should be.  Sources are not necessary but they are very useful, maybe it would be better that we saw whole implementation. ( a little bit contradiction)

6th Workshop "SEERE", Ravda, September Questionnaire Results IV Benefit of the lecture (or value, profit, usefulness) 1. Did you satisfied with topic (did you learn some new, useful things)? much      not so much Do you think the contents of the lecture is useful? completely      not so much What is you overall rank of the topic? very well      bad

6th Workshop "SEERE", Ravda, September Questionnaire Results IV Benefit of the lecture (or value, profit, usefulness) Please comment this topic with respect to the other Java topics (e.g., too late, too much repeating of known concepts, a good overview/conclusion of the study, indispensable course, etc …).  It’s useful to learn more about programming in Java and this topic is shown us in nice time, and it would be too early to show at the beginning of the course of Java.  Nice introduction to process of software design and development. It should feature more object-oriented concepts (class hierarchy is simplified).  It is not necessary to have such example for understanding Java concepts.  This was the right time to present this topic because in this point of course we can understand problem very easily.

6th Workshop "SEERE", Ravda, September Questionnaire Results IV Benefit of the lecture (or value, profit, usefulness) General remarks and suggestions concerning section IV (e. g. which are not so important or not so interesting, which deserved more and which less attention/duration).  Source code is useful, but not too interesting, animations with mouse are very nice, it would be more interesting with more animations on slides.  Requirements should have been presented more clearly and design phase explained with more details. Maze design and implementation deserve less attention and more attention should be paid to the design of the algorithm (connection between steps of the algorithm and “input/output” methods of the mouse should be emphasized, for example with introduction of UML sequence diagram).  The lecture should have more source code for the problem because it’s much closer to students for understanding.  Topic is very interesting, and it would be better that we had more lectures like this. (suggestion for me).

6th Workshop "SEERE", Ravda, September Questionnaire Results IV Benefit of the lecture (or value, profit, usefulness) Final general remarks to the lecture/topic:  It’s very useful, but it could be better! (scold-zakeralo ) HOW??? |(There aren’t suggestions and ideas)  Topic is very useful; it gives clear overview of the process of software development, although too much information is “hard-coded” into the maze class. This example would be very useful for practical exercising, when we are already familiar with basic Java concepts. It could be done better, with more source codes, which are more useful for our students. I would like to see final program running, because it is always more interesting to see how program works.

6th Workshop "SEERE", Ravda, September General Conclusions  Students need more explanations for more complicated parts (they think that too much time is devoted to requirements analysis, not to the implementation details)  This style and way is not useful for presenting whole Java (they expect more details, explanations, examples – with a lot of code).  It’s useful to learn more about programming in Java and this topic is shown them in nice time, and it would be too early to show at the beginning of the course of Java.  Animations and effects are good, but the fact that there isn’t enough code on slides, makes slides less worthy that they maybe should be.  “Maybe it would be better that we saw whole implementation.”  The lecture should have more source code for the problem because it’s much closer to students for understanding.  “I would like to see final program running, because it is always more interesting to see how program works.” GENERALY: our students expect that presented material is enough for practical programming and passing exam – not necessary to use additional books and sources for self-studying.