Course syllabus - Data Structures, Algorithms and Program Development with C

Objectives

This course will give a deeper skill in the problem solving area of computer science, by working with abstract data types.

Learning outcomes

After fulfilling the course, the student should:
1. be able to use abstract data types in programming assignments
2. be able to define and implement abstract data types when given informal problem statements
3. be able to implement algorithms given descriptions as pseudocode
4. be sufficiently familiar with some common algorithms for sorting and searching to be able to implement a thus far unkown variant of the algorithm based on an informal description of the change
5. be familiar with the concept of time complexity, and be able to compute the time complexity on some simple code
6.be sufficiently familiar with some specific abstract data types in order to be able to add new operations on theses. Some examples of such abstract data types are dynamic lists, direct access lists various seach data structures, graphs

Course content

Abstract data types, dynamic data structures, search- and sorting agorithms. Time complexity for algorithms.

Tuition

Tutoring concerning the programming assignments will be given in computer rooms.
Lectures that may but must not include exercises.

Specific requirements

A basic course in programming of 7,5 credits, which contains the programming language C.

Examination

Laboratory work (LAB1), 4,5 credits, examines the learning objectives 1-4 and 6, marks Fail (U) or Pass (G)
Written examination (TEN1), 3 credits, examines the learning objectives 1-6, marks Fail (U), 3, 4 or 5

A student who has a certificate from MDU regarding a disability has the opportunity to submit a request for supportive measures during written examinations or other forms of examination, in accordance with the Rules and Regulations for Examinations at First-cycle and Second-cycle Level at Mälardalen University (2020/1655). It is the examiner who takes decisions on any supportive measures, based on what kind of certificate is issued, and in that case which measures are to be applied.

Suspicions of attempting to deceive in examinations (cheating) are reported to the Vice-Chancellor, in accordance with the Higher Education Ordinance, and are examined by the University’s Disciplinary Board. If the Disciplinary Board considers the student to be guilty of a disciplinary offence, the Board will take a decision on disciplinary action, which will be a warning or suspension.

Grade

Grading scale: 5, 4, 3

Interim Regulations and Other Regulations

The course completely overlaps with DVA104 Data Structures, Algorithms and Program Development 7,5 credits and DVA245 Data Structures, Algorithms and Program Development with Python 7,5 credits.