E ASD1 Advanced Software Development 1 ( efterår 2011 - 5 ECTS )
Rammer for udbud
-
Uddannelsessprog:
engelsk (eller dansk)
-
Niveau:
Bachelor
-
Semester/kvarter:
5 th semester - elective
-
Timer per uge:
15 hours in total. Hours per week varies.
-
Deltagerbegrænsning:
None
-
Undervisningssted:
Herning
-
Hovedområde:
Det Samfundsvidenskabelige Fakultet
-
Udbud ID:
26088
Formål
The student should be able to:
-
construct a single-user-system with a graphical user interface
-
implement selected datastructures (examples: queues, stacks, trees, graphs)
-
evaluate and implement selected algorithms (examples: search, shortest path)
-
implement one or more selected patterns (examples: MVC, observer/observable, singleton)
-
use UML doing the things listed above
Indhold
-
Graphical user interfaces
-
Datastructures
-
Algorithms
-
Time- and space-complexity
-
Patterns
-
UML
Personal development
The course will mainly focus on creativity and power of abstraction.
Faglige forudsætninger
The course ISD1 (Interactive System Development 1) or equvivalent.
Underviser
Martin Olsen
Undervisnings- og arbejdsform
The type of course is a combination of:
Self-study
Lectures
Project-/problem-oriented teaching
Litteratur
Will be announced before the start of the course
The latest research results are included in the course. A list of relevant "papers" is added to the reading list.
Required/recommended reading
-
Graphical user interfaces
-
Datastructures
-
Algorithms
-
Time- and space-complexity
-
Patterns
-
UML
Learning methods in % of ECTS load
Self-study 10 %
Lectures 15 %
Project-/problem-oriented teaching 35 %
Preparation for the course 40 %
IT skills
Programme Level
Visual C++, Eclipse (or equivalent IDE) Construct/combine - able to structure and apply - based on qualifications and required aim (5)
Requirements for passing an examination
Passed/Not passed.
Criteria for achieving objectives
The student should be able to:
-
construct a simple single user system with a graphical user interface
-
implement selected data structures (examples: queues, stacks, trees, graphs, &)
-
evaluate and implement selected algorithms (examples: search, shortest path, &)
-
implement one or more selected patterns (examples: MVC, observer/observable, singleton)
-
use UML doing the things listed above
Studieordning og bedømmelse
-
Hj.opg.ind., bedømt efter 7-skala uden censur
Assignment work excl. oral defense.
Internal censor