Data Structures and Algorithms (5 op)
Toteutuksen tunnus: TT00CN71-3003
Toteutuksen perustiedot
- Ilmoittautumisaika
-
24.07.2024 - 09.09.2024
Ilmoittautuminen toteutukselle on päättynyt.
- Ajoitus
-
02.09.2024 - 15.12.2024
Toteutus on päättynyt.
- Opintopistemäärä
- 5 op
- Lähiosuus
- 5 op
- Toteutustapa
- Lähiopetus
- Yksikkö
- Tekniikka ja liiketoiminta
- Toimipiste
- Kupittaan kampus
- Opetuskielet
- englanti
- Paikat
- 30 - 65
- Koulutus
- Degree Programme in Information and Communications Technology
- Tietojenkäsittelyn koulutus
- Tieto- ja viestintätekniikan koulutus
- Opettajat
- Ali Khan
- Vastuuopettaja
- Ali Khan
- Ajoitusryhmät
- Group 1 (Koko: 35 . Avoin AMK : 0.)
- Group 2 (Koko: 35 . Avoin AMK : 0.)
- Ryhmät
-
PTIVIS23IData Engineering and Artificial Intelligence
-
PTIETS23deaiData Engineering and Artificial Intelligence
- Pienryhmät
- Group 1
- Group 2
- Opintojakso
- TT00CN71
Toteutuksella on 35 opetustapahtumaa joiden yhteenlaskettu kesto on 47 t 0 min.
Aika | Aihe | Tila |
---|---|---|
Pe 06.09.2024 klo 10:00 - 12:00 (2 t 0 min) |
Theory, Data Structures and Algorithms TT00CN71-3003 and 5051128-3009 |
ICT_C1042_Myy
MYY
|
Pe 06.09.2024 klo 12:00 - 13:00 (1 t 0 min) |
Demonstrations Group 1, Data Structures and Algorithms TT00CN71-3003 |
LEM_A177
IT-oppimistila Saccharomyces
|
Pe 13.09.2024 klo 10:00 - 12:00 (2 t 0 min) |
Theory, Data Structures and Algorithms TT00CN71-3003 |
LEM_B164
Tapio muunto
|
Pe 13.09.2024 klo 12:00 - 13:00 (1 t 0 min) |
Demonstrations Group 1, Data Structures and Algorithms TT00CN71-3003 |
LEM_A177
IT-oppimistila Saccharomyces
|
Pe 13.09.2024 klo 13:00 - 14:00 (1 t 0 min) |
Demonstrations Group 2, Data Structures and Algorithms TT00CN71-3003 |
LEM_A177
IT-oppimistila Saccharomyces
|
Pe 20.09.2024 klo 10:00 - 12:00 (2 t 0 min) |
Theory and Demo, Data Structures and Algorithms |
ICT_C1039_Sigma
SIGMA
|
Pe 20.09.2024 klo 12:00 - 13:00 (1 t 0 min) |
Demonstrations, Data Structures and Algorithms TT00CN71-3003 |
LEM_A177
IT-oppimistila Saccharomyces
|
Pe 20.09.2024 klo 13:00 - 14:00 (1 t 0 min) |
Demonstrations Group 2, Data Structures and Algorithms TT00CN71-3003 |
LEM_A177
IT-oppimistila Saccharomyces
|
Pe 27.09.2024 klo 10:00 - 12:00 (2 t 0 min) |
Theory and Demo, Data Structures and Algorithms |
LEM_A309
Oppimistila BYOD
|
Pe 27.09.2024 klo 12:00 - 13:00 (1 t 0 min) |
Demonstrations, Data Structures and Algorithms TT00CN71-3003 |
LEM_A177
IT-oppimistila Saccharomyces
|
Pe 27.09.2024 klo 13:00 - 14:00 (1 t 0 min) |
Demonstrations, Data Structures and Algorithms TT00CN71-3003 |
LEM_A177
IT-oppimistila Saccharomyces
|
Pe 04.10.2024 klo 10:00 - 12:00 (2 t 0 min) |
Theory, Data Structures and Algorithms TT00CN71-3003 |
LEM_A309
Oppimistila BYOD
|
Pe 04.10.2024 klo 12:00 - 13:00 (1 t 0 min) |
Demonstrations, Data Structures and Algorithms TT00CN71-3003 |
LEM_A177
IT-oppimistila Saccharomyces
|
Pe 04.10.2024 klo 13:00 - 14:00 (1 t 0 min) |
Demonstrations, Data Structures and Algorithms TT00CN71-3003 |
LEM_A177
IT-oppimistila Saccharomyces
|
Pe 11.10.2024 klo 10:00 - 12:00 (2 t 0 min) |
Theory, Data Structures and Algorithms TT00CN71-3003 |
LEM_A309
Oppimistila BYOD
|
Pe 11.10.2024 klo 12:00 - 13:00 (1 t 0 min) |
Demonstrations, Data Structures and Algorithms TT00CN71-3003 |
|
Pe 11.10.2024 klo 13:00 - 14:00 (1 t 0 min) |
Demonstrations, Data Structures and Algorithms TT00CN71-3003 |
|
Pe 25.10.2024 klo 10:00 - 12:00 (2 t 0 min) |
Theory, Data Structures and Algorithms |
LEM_A174
IT-oppimistila Tiera
|
Pe 25.10.2024 klo 12:00 - 13:00 (1 t 0 min) |
Demonstrations, Data Structures and Algorithms TT00CN71-3003 |
Online
|
Pe 25.10.2024 klo 13:00 - 14:00 (1 t 0 min) |
Demonstrations, Data Structures and Algorithms TT00CN71-3003 |
Online
|
Pe 01.11.2024 klo 10:00 - 12:00 (2 t 0 min) |
Theory, Data Structures and Algorithms TT00CN71-3003 |
LEM_A177
IT-oppimistila Saccharomyces
|
Pe 01.11.2024 klo 12:00 - 13:00 (1 t 0 min) |
Demonstrations, Data Structures and Algorithms TT00CN71-3003 |
LEM_A177
IT-oppimistila Saccharomyces
|
Pe 01.11.2024 klo 13:00 - 14:00 (1 t 0 min) |
Demonstrations Group 2, Data Structures and Algorithms TT00CN71-3003 |
|
Pe 08.11.2024 klo 10:00 - 12:00 (2 t 0 min) |
Theory, Data Structures and Algorithms TT00CN71-3003 |
LEM_A306
Oppimistila BYOD
|
Pe 08.11.2024 klo 12:00 - 13:00 (1 t 0 min) |
Demonstrations, Data Structures and Algorithms TT00CN71-3003 |
LEM_A177
IT-oppimistila Saccharomyces
|
Pe 08.11.2024 klo 13:00 - 14:00 (1 t 0 min) |
Demonstrations, Data Structures and Algorithms TT00CN71-3003 |
|
Pe 15.11.2024 klo 10:00 - 12:00 (2 t 0 min) |
Theory, Data Structures and Algorithms TT00CN71-3003 |
ICT_C1027_Lambda
LAMBDA
|
Pe 15.11.2024 klo 12:00 - 13:00 (1 t 0 min) |
Demonstrations, Data Structures and Algorithms TT00CN71-3003 |
LEM_A177
IT-oppimistila Saccharomyces
|
Pe 15.11.2024 klo 13:00 - 14:00 (1 t 0 min) |
Demonstrations, Data Structures and Algorithms TT00CN71-3003 |
|
Pe 22.11.2024 klo 10:00 - 12:00 (2 t 0 min) |
Demo, Data Structures and Algorithms TT00CN71-3003 |
ICT_C2033_2034
Teoriatila muunto
|
Pe 22.11.2024 klo 12:00 - 13:00 (1 t 0 min) |
Demonstrations, Data Structures and Algorithms TT00CN71-3003 |
LEM_A177
IT-oppimistila Saccharomyces
|
Pe 22.11.2024 klo 13:00 - 14:00 (1 t 0 min) |
Demonstrations, Data Structures and Algorithms TT00CN71-3003 |
|
Pe 29.11.2024 klo 10:00 - 12:00 (2 t 0 min) |
Theory (Optional), Data Structures and Algorithms TT00CN71-3003 |
LEM_A177
IT-oppimistila Saccharomyces
|
Pe 29.11.2024 klo 12:00 - 13:00 (1 t 0 min) |
Q&A (Optional), Data Structures and Algorithms TT00CN71-3003 |
LEM_A177
IT-oppimistila Saccharomyces
|
Pe 29.11.2024 klo 13:00 - 14:00 (1 t 0 min) |
Q&A (Optional), Data Structures and Algorithms TT00CN71-3003 |
Arviointiasteikko
H-5
Sisällön jaksotus
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.
Tavoitteet
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.
Sisältö
- lists, stacks, queues, trees, graphs and hash tables
- analysing and evaluating algorithms
- designing algorithms
- sorting methods
- search algorithms
Oppimateriaalit
Material available via the learning environment (ITS).
Opetusmenetelmät
Weekly contact 3 hours sessions for theory and practical exercises.
Additionally, if needed weekly 1h sessions for questions and support in exercises.
Tenttien ajankohdat ja uusintamahdollisuudet
No exam, and retake not possible after evaluation grade is published.
Pedagogiset toimintatavat ja kestävä kehitys
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.
Toteutuksen valinnaiset suoritustavat
Not possible
Opiskelijan ajankäyttö ja kuormitus
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
Arviointimenetelmät ja arvioinnin perusteet
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.
Hylätty (0)
Less than 50% points in the exercises OR Student does not passed the group project.
Arviointikriteerit, tyydyttävä (1-2)
50 points -> 1
60 points -> 2
Arviointikriteerit, hyvä (3-4)
70 points -> 3
80 points -> 4
Arviointikriteerit, kiitettävä (5)
90 points -> 5
Esitietovaatimukset
Introduction to Programming, or equivalent programming skills
Lisätiedot
ITS and Teams.