Selected topics of algorithms and computing in general. Topics include information theory, principles of data compression, arithmetic coding, JPEG, combinatoric optimization algorithms, and travelling salesperson problem. The course is suitable to PhD students and advanced MSc students seeking deeper knowledge in algorithms.
Video lectures: 9
Weekly excerices (Monday 14-16)
Venue is 180 in Joensuu, F213 in Kuopio.
Credits: 3 cp (9 lectures + exercises), or 5 cp (14 lectures or small project work).
Video lectures (Youtube) and Exercises (Room 180 and Teams)
Teacher: Pasi Fränti
Teaching assistants: Jimi Tuononen and Juhani Järviö
Schedule: Starting: 9.1.2023
Mon 9.1.: Tutorial lecture
Mon 16.1.: MST to TSP
Mon 23.1.: Combinatoric optimization
Mon 23.1.: Local search for TSP
Mon 30.1.: Information theory, entropy, compression
Mon 30.1.: Arithmetic coding
Mon 6.2.: User similarity
Mon 6.2.: Extracting representative image
Mon 13.2.: Computer chess
Mon 20.2.: JPEG
Mon 27.2.: Oral examination
Select 5 out of these.
Submit your weekly exercises via Moodle by 14:00 every Monday.
MST to TSP
Combinatoric optimization
Local search for TSP
Basics of information theory
User similarity
Extracting images
Genetic algorithms
Algorithms in Chess
JPEG
Image quality
Keyword extraction from web pages
Soft precision and recall
Averaging GPS segments
Design and Analysis of Algorithms
Format: Oral
Grading: Passed/Failed
Passing the course will require:
- Watch all videos
- Pass all exercises
- Oral (or written if >10 students) examination (classroom)
- Grading (1-5) available only via request.
- Optional course project deadline: 28.3.2023
Register via Peppi
Some random Peppi link
Material is available in this page. If not found, then scroll up----^