Data Structures and AlgorithmsLaajuus (4 cr)
Code: AE00CM74
Objective
Student can implement fundamental data structures and algorithms and compare their properties. Student can use different data structures, such as lists, sets, dictionaries, trees and hashing, and algorithms associated to them. Student can develop applications, which utilizes different kind of data structures and algorithms efficiently.
Content
- Lists, stack, queue
- Dictionaries
- Trees
- Sorting
- Searching
- Hashing
- Principles of algorithm analysis
- Collection classes of C#, Java or C++
Assessment criteria, satisfactory (1)
Student can implement fundamental data structures and algorithms. Student can use lists and dictionaries, and algorithms associated to them.
Assessment criteria, good (3)
Student can implement fundamental data structures and algorithms and compare their properties. Student can use different data structures, such as lists, sets, dictionaries, trees and hashing, and algorithms associated to them. Student can develop applications, which utilizes different kind of data structures and algorithms.
Assessment criteria, excellent (5)
Student can implement fundamental data structures and algorithms and compare their properties. Student can use different data structures, such as lists, sets, dictionaries, trees and hashing, and algorithms associated to them. Student can develop applications, which utilizes different kind of data structures and algorithms efficiently. Student can analyze the running time of the algorithms.
Enrollment
13.11.2023 - 17.01.2024
Timing
08.01.2024 - 25.02.2024
Credits
4 op
Teaching languages
- English
Degree programmes
- Bachelor of Engineering, Automation Engineering
Teachers
- Raine Kauppinen
Student groups
-
AE22Bachelor of Engineering, Automation Engineering
Objective
Student can implement fundamental data structures and algorithms and compare their properties. Student can use different data structures, such as lists, sets, dictionaries, trees and hashing, and algorithms associated to them. Student can develop applications, which utilizes different kind of data structures and algorithms efficiently.
Content
- Lists, stack, queue
- Dictionaries
- Trees
- Sorting
- Searching
- Hashing
- Principles of algorithm analysis
- Collection classes of C#, Java or C++
Materials
Information about the materials are in Moodle.
Teaching methods
Contact teaching and independent work.
Student workload
4 cu * 27 h/cu = 108 hours, of which around one third is contact teaching and two thirds independent work.
Evaluation scale
1-5
Assessment criteria, satisfactory (1)
Student can implement fundamental data structures and algorithms. Student can use lists and dictionaries, and algorithms associated to them.
Assessment criteria, good (3)
Student can implement fundamental data structures and algorithms and compare their properties. Student can use different data structures, such as lists, sets, dictionaries, trees and hashing, and algorithms associated to them. Student can develop applications, which utilizes different kind of data structures and algorithms.
Assessment criteria, excellent (5)
Student can implement fundamental data structures and algorithms and compare their properties. Student can use different data structures, such as lists, sets, dictionaries, trees and hashing, and algorithms associated to them. Student can develop applications, which utilizes different kind of data structures and algorithms efficiently. Student can analyze the running time of the algorithms.
Assessment methods and criteria
Activities and exam.
Enrollment
14.11.2022 - 19.03.2023
Timing
06.03.2023 - 30.04.2023
Credits
4 op
Teaching languages
- English
Degree programmes
- Bachelor of Engineering, Automation Engineering
Teachers
- Raine Kauppinen
Student groups
-
AE21Bachelor of Engineering, Automation Engineering
Objective
Student can implement fundamental data structures and algorithms and compare their properties. Student can use different data structures, such as lists, sets, dictionaries, trees and hashing, and algorithms associated to them. Student can develop applications, which utilizes different kind of data structures and algorithms efficiently.
Content
- Lists, stack, queue
- Dictionaries
- Trees
- Sorting
- Searching
- Hashing
- Principles of algorithm analysis
- Collection classes of C#, Java or C++
Evaluation scale
1-5
Assessment criteria, satisfactory (1)
Student can implement fundamental data structures and algorithms. Student can use lists and dictionaries, and algorithms associated to them.
Assessment criteria, good (3)
Student can implement fundamental data structures and algorithms and compare their properties. Student can use different data structures, such as lists, sets, dictionaries, trees and hashing, and algorithms associated to them. Student can develop applications, which utilizes different kind of data structures and algorithms.
Assessment criteria, excellent (5)
Student can implement fundamental data structures and algorithms and compare their properties. Student can use different data structures, such as lists, sets, dictionaries, trees and hashing, and algorithms associated to them. Student can develop applications, which utilizes different kind of data structures and algorithms efficiently. Student can analyze the running time of the algorithms.