The course is included in these curricula and study modules

  • It 2001 - 2004 - Programming methodology
  • Media technology 2001 - 2004 - Programming

Level/category

Professional studies

Teaching language

Swedish

Type of course

Compulsory

Recommended year of study

1

Total number of ECTS

3 cr

Learning outcomes

In-depth C programming skills

Course contents

Algorithms
- conceptual description
- structuring (sub-algorithms, recursion)
- modularity
- complexity
- example algorithms (using linear data structures, search, sorting)
Data Structures
- pointers
- dynamic data structures
- linear data structures (stack and queue)
- linked data structures (linked lists, trees snd graphs)
- file structures
Data Type Concept
- elementary data types
- data type declarations
- structured data types (fields, records and unions)

Prerequisites and co-requisites

C Programming 1

Previous course names

Algorithms and Data Structures

Additional information

Final exam is a programming test.
Exercises to hand in have deadlines

Recommended or required reading

Bilting, U. och Skansholm, J. : Vägen till C, Studentlitteratur, Sverige, 1987

Weiss, M.A., Data Structures and Algorithm Analysis in C, Benjamin/Cummings Publishing, Redwood City California, 1993, ISBN 0-8053-5440-9

Aho, Hopcroft and Ullman: Data Structures and Algorithms, Addison-Wesley, USA, 1983

Study activities

  • Lectures
  • Exercises

Workload

  • Total workload of the course: 0 hours
  • Of which autonomous studies: 0 hours
  • Of which scheduled studies: 0 hours

Mode of Delivery

Participation in tuition

Assessment methods

Written tests

Examiner

Pulkkis Göran

Group size

No limit

Assignments valid until

Until further notice

Course and curriculum search