CS-250 / 8 credits

Teacher(s): Kapralov Mikhail, Svensson Ola Nils Anders

Language: English


Summary

The students learn the theory and practice of basic concepts and techniques in algorithms. The course covers mathematical induction, techniques for analyzing algorithms, elementary data structures, major algorithmic paradigms such as dynamic programming, sorting and searching, and graph algorithms.

Content

Keywords

Algoriths, data structures, efficiency, problem solving

Learning Prerequisites

Recommended courses

CS-101 Advanced ICC I

Learning Outcomes

By the end of the course, the student must be able to:

  • Illustrate the execution of algorithms on example inputs
  • Describe basic data structures such as arrays, lists, stacks, queues, binary, search trees, heapas, and hash tables
  • Analyze algorithm efficiency
  • Compare alternative algorithms and data structures with respect to efficiency
  • Choose which algorithm or data structure to use in different scenarios
  • Use algorithms and data structures taught in the course on concrete problem instances
  • Design new algorithms and data structures bases on known methods
  • Prove the corrrectness of an algorithm

Teaching methods

Ex cathedra lecture, exercises in classroom

Assessment methods

Continous assessment with final exam.

Resources

Moodle Link

In the programs

  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Algorithms I
  • Lecture: 4 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Algorithms I
  • Lecture: 4 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Algorithms I
  • Lecture: 4 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Algorithms I
  • Lecture: 4 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Algorithms I
  • Lecture: 4 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Algorithms I
  • Lecture: 4 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Algorithms I
  • Lecture: 4 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Algorithms I
  • Lecture: 4 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Algorithms I
  • Lecture: 4 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Algorithms I
  • Lecture: 4 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks

Reference week

 MoTuWeThFr
8-9     
9-10     
10-11    CM1
CM1100
CM1106
CM1104
CM1105
11-12  RLC E1 240 
12-13    
13-14 RLC E1 240   
14-15    
15-16     
16-17     
17-18     
18-19     
19-20     
20-21     
21-22     

Tuesday, 13h - 15h: Lecture RLC E1 240

Wednesday, 11h - 13h: Lecture RLC E1 240

Friday, 10h - 12h: Exercise, TP CM1
CM1100
CM1106
CM1104
CM1105