IS-211 Algorithms and Data Structures
- ECTS Credits:
- 7.5
- Responsible department:
- Faculty of Social Sciences
- Course Leader:
- Pouria Akbarighatar
- Lecture Semester:
- Spring
- Teaching language:
- English
- Duration:
- 1 term
The course is connected to the following study programs
- Bachelor's Programme in IT and Information Systems
Teaching language
EnglishRecommended prerequisites
The course presupposes that the students have acquired basic programming skills, by taking IS-110, or equivalent.
Course contents
The following five modules will be covered in this course:
Module 1: Introduction, the application of this course in real world, and time complexity and Big-O notation (worse-case scenario),
Module 2: Basic Data Structures: Arrays, Linked Lists, Stacks, Queues
Module 3: Advance Data Structures: Tress, Binary search trees, AVL trees, Hash Tables
Module 4: Sorting & Searching Algorithms: Selection sort, insertion sort, bubble sort, Merge sort, Linear search, binary search, Binary search trees.
Module 5: Graph Algorithms: BFS, DFS, Shortest paths (Dijkstra, Bellman-Ford)
Learning outcomes
Upon successful completion of the course the students will have:
-
Understanding og fundamental algorithms and data structures commonly used in programming.
-
Understanding of how to analysis the resource consumption of these algorithms and how it can be expressed in Big-O notation.
-
The ability to use this knowledge to make rational choices of algorithms and data structures to optimize performance and memory usage in programming.
Examination requirements
Mandatory assignments. Further information is provided in Canvas at the start of the semester.
Teaching methods
Organized teaching with lectures and supervised lab. Estimated workload 210 hours.
Evaluation
The person responsible for the course decides, in cooperation with student representative, the form of student evaluation and whether the course is to have a midway or end of course evaluation in accordance with the quality system for education, chapter 4.1.
Admission for external candidates
No
Offered as Single Standing Module
Yes. Subject to availability or capacity.
Admission Requirement if given as Single Standing Module
Higher Education Entrance Qualification and basic programming skills, equivalent to IS-110.
Assessment methods and criteria
A 4-hour written, individual exam with graded marks, A-F.
Reduction of Credits
This course’s contents overlap with the following courses. A reduction of credits will occur if one of these courses is taken in addition:
| Course | Reduction of Credits |
|---|---|
| IS-207 – Algorithms and Data Structures | 7.5 |