Following textbook is the primary source of information in this course:
Robert L. Kruse, Alexander J. Ryba: Data Structures and Program Design in C ++.
Prentice Hall, 1999.
Clifford A. Shaffer: A Practical Introduction to Data Structures and Algorithm Analysis.
Second Edition. Prentice Hall, 2001.
William Ford, William Topp: Data Structures with C ++ Using STL. Second Edition. Prentice Hall, 2002.
Data Structures and Algorithm Analysis in C
Mark Allen Weiss
The Benjamin / Cummings Publishing Company, Inc.
Data Structures and Algorithm Analysis in C ++,
Mark Allen Weiss
Data Structures and Algorithms
Ilkka Kokkarinen and Kirsti Ala-complex
Satku - Kauppakaari
The course materials will be published to tabula area of this course.
Tabula usage is practised during the first lessons of this course.
The course lecture / exercise material is in English, as well as the course
The three-hour block begins with theory lesson. After that we go
through homework exercises and the rest of the time is used to begin new
homeworks or continuing programming projects. In this phase teacher acts
as a consultant / coach.
Course performance is evaluated on the basis of exercise activity and
programming projects made in the course. Both of these are evaluated on
the scale of 0-5 and the course grade is the average of these two
In exercise activity following scale is used:
- 0 - 20% of all exercises made => score is 0
- 20 - 35% of all exercises made => score is 1
- 35-50% of all exercises made => score is 2
- 50-65% of all exercises made => score is 3
- 65-80% of all exercises made => score is 4
- 80% or over of all exercises made => score is 5
There will be three programming projects in the course. Each of these
are graded as points between 0 - 5 and your total point of programming
projects is the average of these rounded upward. Requirements of each
project are spesified separately during the course. The more work you do
for each project the better points value you get from it. Projects are
made in an incremental way: first you do a very simple program and after
that you add increments and so on.
02.09.2019 - 20.12.2019
03.06.2019 - 06.09.2019
Degree Programme in ICT Engineering, students who began in 2014-2018
TAMK Main Campus
There is no exam in this course.
See above. Time for independent / group work outside of class lessons should be reserved same amount as time for contact hours in the course.
Course topics include following areas - subjects are straight from course textbook
- Programming Principles
- Introduction to Stacks
- Linked Stacks and Queues
Course schedule and division of topics in it are published to a separate Excel file,
which will be published to tabula.
Can solve given tasks with the help of examples and ready made solutions.
Manages the whole and knows how to apply examples in different situations.
Can combine given information in a clever way and can analyze her/his own solutions.
Not able to cope with the tasks entrusted even with assistance.