NDAA09012U Data Structures: Theory and Practice

Volume 2013/2014
Education
MSc Programme in Computer Science
Content
The purpose of this course is to build a bridge between the theory and practice in the area of data structures. One is supposed to learn to transform theoretical designs into efficient programs.

In the first part of the course, the teachers present some theoretical results on data structures and data-structuring techniques. In the second part of the course, the students will apply the theory in practice and implement some advanced components to a program library.
 
We cover the basic material on advanced data structures skipped in our earlier courses (B-trees, Fibonacci heaps, van Emde Boas trees). This year we will put a special focus on: 1) data structures that are used in data-compression systems (Huffman coding, arithmetic coding) and 2) compact data structures that can be used efficiently without decompression (in-place data structures, succinct data structures, data structures for memory-constrained algorithms).
Learning Outcome
Knowledge, skills, and competences.
See Absalon when the course is set up.
A course on algorithms and data structures; knowledge of C++ programming language
  • Category
  • Hours
  • Class Instruction
  • 206
  • Total
  • 206
Credit
7,5 ECTS
Type of assessment
Continuous assessment
Written examination, 4 timer under invigilation
Course elements: active participation, 4 assignments, presentation, 2-weeks project, and written test. Submission via Absalon. Continuous assessment: In the final grade the weight of the course elements is as follows: assignments 25%, participation and presentation 20%, project 25%, and final 4-hours written test 30%. Internal grading: according to the 7-step scale.
Marking scale
7-point grading scale
Censorship form
No external censorship
Re-exam
Grading is based on the same course elements; selected course elements can be reused or remade completely.
Criteria for exam assesment
See learning outcome.