Text

Course syllabus - Data Structures, Algorithms and Program Development

Scope

7.5 credits

Course code

DVA104

Valid from

Autumn semester 2013

Education level

First cycle

Progressive Specialisation

G1F (First cycle, has less than 60 credits in first-cycle course/s as entry requirements).

Main area(s)

Computer Science

School

School of Innovation, Design and Engineering

Ratified

2013-02-13

Status

This syllabus is not current and will not be given any more

Literature lists

Course literature is preliminary up to 8 weeks before course start. Course literature can be valid over several semesters.

    • Ratified date: 2017-03-01
    • Latest update: 2017-03-06

    Reference Literature

    Gilberg, Richard F.; Forouzan, Behrouz A.

    Data structures : a pseudocode approach with C

    2nd ed. : Boston, Mass. : Thomson/Course Technology, c2005. - xvi, 720 p.

    ISBN: 0534390803 (hbk) LIBRIS-ID: 14792755

    • Ratified date: 2016-10-21
    • Latest update: 2017-03-07

    Books

    Gilberg, Richard F.; Forouzan, Behrouz A.

    Data structures : a pseudocode approach with C

    2nd ed. : Boston, Mass. : Thomson/Course Technology, c2005. - xvi, 720 p.

    ISBN: 0534390803 (hbk) LIBRIS-ID: 14792755

    • Ratified date: 2015-03-09
    • Latest update: 2015-03-09

    Books

    Gilberg, Richard F.; Forouzan, Behrouz A.

    Data structures : a pseudocode approach with C

    2nd ed. : Boston, Mass. : Thomson/Course Technology, c2005. - xvi, 720 p.

    ISBN: 0534390803 (hbk) LIBRIS-ID: 14792755

    • Ratified date: 2014-10-15
    • Latest update: 2014-10-15

    Books

    Gilberg, Richard F.; Forouzan, Behrouz A.

    Data structures : a pseudocode approach with C

    2nd ed. : Boston, Mass. : Thomson/Course Technology, c2005. - xvi, 720 p.

    ISBN: 0534390803 (hbk) LIBRIS-ID: 14792755

    • Ratified date: 2014-03-07
    • Latest update: 2014-03-17

    Reference Literature

    Skansholm, Jan

    Ada från början : med Ada 95 standard

    3., [rev.] uppl. : Lund : Studentlitteratur, 1995 - [2], v, [1], 616 s.

    ISBN: 91-44-25233-1 ; LIBRIS-ID: 7277391

    Beidler, John

    Data structures and algorithms : an object-oriented approach using Ada 95

    New York : Springer, cop. 1997 - 364 s.

    ISBN: 0-387-94834-1 LIBRIS-ID: 4878174

    Janlert, Lars-Erik; Wiberg, Torbjörn

    Datatyper och algoritmer

    2., [rev.] uppl. : Lund : Studentlitteratur, 2000 - x, 387 s.

    ISBN: 91-44-01364-7 ; 513:00 LIBRIS-ID: 8352915

    Kingston, Jeffrey H.

    Algorithms and data structures : design, correctness, analysis

    2. ed. : Harlow : Addison-Wesley, cop. 1998 - xi, 380 s.

    ISBN: 0-201-40374-9 (hft.) ; LIBRIS-ID: 4703883

    • Ratified date: 2013-11-08
    • Latest update: 2013-11-11

    Books

    Gilberg, Richard F.; Forouzan, Behrouz A.

    Data structures : a pseudocode approach with C

    2nd ed. : Boston, Mass. : Thomson/Course Technology, c2005. - xvi, 720 p.

    ISBN: 0534390803 (hbk) LIBRIS-ID: 14792755

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:
- be able to use abstract data types in programming assignments
- be able to define and implement abstract data types when given informal problem statements
- be able to implement algorithms given descriptions as pseudocode
- 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
- be familiar with the concept of time complexity, and be able to compute the time complexity on some simple code
- 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
- common algorithms for sorting and searching

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.

Examination

Exercise, laboratory work (LAB1), 4.5 credits, marks Pass (G)
Examination (TEN1), 3 credits, marks 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

Pass with distinction, Pass with credit, Pass, Fail