Skip to main content

Data Structures and Algorithms (5 cr)

Code: TT00CN71-3003

General information


Enrollment
24.07.2024 - 09.09.2024
Registration for the implementation has ended.
Timing
02.09.2024 - 15.12.2024
Implementation has ended.
Number of ECTS credits allocated
5 cr
Local portion
5 cr
Mode of delivery
Contact learning
Unit
Engineering and Business
Campus
Kupittaa Campus
Teaching languages
English
Seats
30 - 65
Degree programmes
Degree Programme in Information and Communications Technology
Degree Programme in Business Information Technology
Degree Programme in Information and Communication Technology
Teachers
Ali Khan
Teacher in charge
Ali Khan
Scheduling groups
Group 1 (Size: 35 . Open UAS : 0.)
Group 2 (Size: 35 . Open UAS : 0.)
Groups
PTIVIS23I
Data Engineering and Artificial Intelligence
PTIETS23deai
Data Engineering and Artificial Intelligence
Small groups
Group 1
Group 2
Course
TT00CN71

Realization has 35 reservations. Total duration of reservations is 47 h 0 min.

Time Topic Location
Fri 06.09.2024 time 10:00 - 12:00
(2 h 0 min)
Theory, Data Structures and Algorithms TT00CN71-3003 and 5051128-3009
ICT_C1042_Myy MYY
Fri 06.09.2024 time 12:00 - 13:00
(1 h 0 min)
Demonstrations Group 1, Data Structures and Algorithms TT00CN71-3003
LEM_A177 IT-oppimistila Saccharomyces
Fri 13.09.2024 time 10:00 - 12:00
(2 h 0 min)
Theory, Data Structures and Algorithms TT00CN71-3003
LEM_B164 Tapio muunto
Fri 13.09.2024 time 12:00 - 13:00
(1 h 0 min)
Demonstrations Group 1, Data Structures and Algorithms TT00CN71-3003
LEM_A177 IT-oppimistila Saccharomyces
Fri 13.09.2024 time 13:00 - 14:00
(1 h 0 min)
Demonstrations Group 2, Data Structures and Algorithms TT00CN71-3003
LEM_A177 IT-oppimistila Saccharomyces
Fri 20.09.2024 time 10:00 - 12:00
(2 h 0 min)
Theory and Demo, Data Structures and Algorithms
ICT_C1039_Sigma SIGMA
Fri 20.09.2024 time 12:00 - 13:00
(1 h 0 min)
Demonstrations, Data Structures and Algorithms TT00CN71-3003
LEM_A177 IT-oppimistila Saccharomyces
Fri 20.09.2024 time 13:00 - 14:00
(1 h 0 min)
Demonstrations Group 2, Data Structures and Algorithms TT00CN71-3003
LEM_A177 IT-oppimistila Saccharomyces
Fri 27.09.2024 time 10:00 - 12:00
(2 h 0 min)
Theory and Demo, Data Structures and Algorithms
LEM_A309 Oppimistila BYOD
Fri 27.09.2024 time 12:00 - 13:00
(1 h 0 min)
Demonstrations, Data Structures and Algorithms TT00CN71-3003
LEM_A177 IT-oppimistila Saccharomyces
Fri 27.09.2024 time 13:00 - 14:00
(1 h 0 min)
Demonstrations, Data Structures and Algorithms TT00CN71-3003
LEM_A177 IT-oppimistila Saccharomyces
Fri 04.10.2024 time 10:00 - 12:00
(2 h 0 min)
Theory, Data Structures and Algorithms TT00CN71-3003
LEM_A309 Oppimistila BYOD
Fri 04.10.2024 time 12:00 - 13:00
(1 h 0 min)
Demonstrations, Data Structures and Algorithms TT00CN71-3003
LEM_A177 IT-oppimistila Saccharomyces
Fri 04.10.2024 time 13:00 - 14:00
(1 h 0 min)
Demonstrations, Data Structures and Algorithms TT00CN71-3003
LEM_A177 IT-oppimistila Saccharomyces
Fri 11.10.2024 time 10:00 - 12:00
(2 h 0 min)
Theory, Data Structures and Algorithms TT00CN71-3003
LEM_A309 Oppimistila BYOD
Fri 11.10.2024 time 12:00 - 13:00
(1 h 0 min)
Demonstrations, Data Structures and Algorithms TT00CN71-3003

Fri 11.10.2024 time 13:00 - 14:00
(1 h 0 min)
Demonstrations, Data Structures and Algorithms TT00CN71-3003

Fri 25.10.2024 time 10:00 - 12:00
(2 h 0 min)
Theory, Data Structures and Algorithms
LEM_A174 IT-oppimistila Tiera
Fri 25.10.2024 time 12:00 - 13:00
(1 h 0 min)
Demonstrations, Data Structures and Algorithms TT00CN71-3003
Online
Fri 25.10.2024 time 13:00 - 14:00
(1 h 0 min)
Demonstrations, Data Structures and Algorithms TT00CN71-3003
Online
Fri 01.11.2024 time 10:00 - 12:00
(2 h 0 min)
Theory, Data Structures and Algorithms TT00CN71-3003
LEM_A177 IT-oppimistila Saccharomyces
Fri 01.11.2024 time 12:00 - 13:00
(1 h 0 min)
Demonstrations, Data Structures and Algorithms TT00CN71-3003
LEM_A177 IT-oppimistila Saccharomyces
Fri 01.11.2024 time 13:00 - 14:00
(1 h 0 min)
Demonstrations Group 2, Data Structures and Algorithms TT00CN71-3003
Fri 08.11.2024 time 10:00 - 12:00
(2 h 0 min)
Theory, Data Structures and Algorithms TT00CN71-3003
LEM_A306 Oppimistila BYOD
Fri 08.11.2024 time 12:00 - 13:00
(1 h 0 min)
Demonstrations, Data Structures and Algorithms TT00CN71-3003
LEM_A177 IT-oppimistila Saccharomyces
Fri 08.11.2024 time 13:00 - 14:00
(1 h 0 min)
Demonstrations, Data Structures and Algorithms TT00CN71-3003
Fri 15.11.2024 time 10:00 - 12:00
(2 h 0 min)
Theory, Data Structures and Algorithms TT00CN71-3003
ICT_C1027_Lambda LAMBDA
Fri 15.11.2024 time 12:00 - 13:00
(1 h 0 min)
Demonstrations, Data Structures and Algorithms TT00CN71-3003
LEM_A177 IT-oppimistila Saccharomyces
Fri 15.11.2024 time 13:00 - 14:00
(1 h 0 min)
Demonstrations, Data Structures and Algorithms TT00CN71-3003
Fri 22.11.2024 time 10:00 - 12:00
(2 h 0 min)
Demo, Data Structures and Algorithms TT00CN71-3003
ICT_C2033_2034 Teoriatila muunto
Fri 22.11.2024 time 12:00 - 13:00
(1 h 0 min)
Demonstrations, Data Structures and Algorithms TT00CN71-3003
LEM_A177 IT-oppimistila Saccharomyces
Fri 22.11.2024 time 13:00 - 14:00
(1 h 0 min)
Demonstrations, Data Structures and Algorithms TT00CN71-3003
Fri 29.11.2024 time 10:00 - 12:00
(2 h 0 min)
Theory (Optional), Data Structures and Algorithms TT00CN71-3003
LEM_A177 IT-oppimistila Saccharomyces
Fri 29.11.2024 time 12:00 - 13:00
(1 h 0 min)
Q&A (Optional), Data Structures and Algorithms TT00CN71-3003
LEM_A177 IT-oppimistila Saccharomyces
Fri 29.11.2024 time 13:00 - 14:00
(1 h 0 min)
Q&A (Optional), Data Structures and Algorithms TT00CN71-3003
Changes to reservations may be possible.

Evaluation scale

H-5

Content scheduling

Week 36: Course introduction

Session from Weeks 36 - 48
- Algorithms and algorithmic thinking
- Data structures
- Search algorithms
- Sorting algorithms

Contact hours according to lukkari.turkuamk.fi.

Objective

After completing the course the student can:
- explain the most common data structures
- apply the most common data structures and algorithms connected to the use of these structures
- evaluate the efficiency of algorithms.

Content

- lists, stacks, queues, trees, graphs and hash tables
- analysing and evaluating algorithms
- designing algorithms
- sorting methods
- search algorithms

Materials

Material available via the learning environment (ITS).

Teaching methods

Weekly contact 3 hours sessions for theory and practical exercises.
Additionally, if needed weekly 1h sessions for questions and support in exercises.

Exam schedules

No exam, and retake not possible after evaluation grade is published.

Pedagogic approaches and sustainable development

The course has 12 three-hour contact sessions where teacher present theory and examples and students work with practical tasks.
Additionally, students are able to receive extra guidance for exercises.

Electronic materials are used in the course. In addition, guidance is also organized online in order to reduce the carbon footprint caused by movement.

Completion alternatives

Not possible

Student workload

Contact hours
- Course introduction: 3 hours
- 13 times 2h theory: 13 x 2h = 26 hours
- 13 times 1h demo 13 x 1h = 13 hours - Group 1
- 13 times 1h demo 13 x 1h = 13 hours - - Group 2
- FLIP Classroom 10 X 1h = 10h
Home work:
- Working with assignments: approximately 80 hours


Total: approximately 130 hours

Evaluation methods and criteria

The course is graded on a scale of 0-5.

You can achieve 80 points from practical exercises in class room and home work exercises.
Around half of the exercises are done during the contact hours.

Demonstrations of exercises during the contact session is mandatory without demonstration you will lose 50% of your marks.


Additionally, there is a group project of 20 points, passing group project is mandatory to pass the course.

Lastly, to pass the course the student need to get at least 40 marks in the exercises and at least 10 marks in the project.

Failed (0)

Less than 50% points in the exercises OR Student does not passed the group project.

Assessment criteria, satisfactory (1-2)

50 points -> 1
60 points -> 2

Assessment criteria, good (3-4)

70 points -> 3
80 points -> 4

Assessment criteria, excellent (5)

90 points -> 5

Qualifications

Introduction to Programming, or equivalent programming skills

Further information

ITS and Teams.

Go back to top of page