EPN-V2

DATS2300 Algorithms and Data Structures Course description

Course name in Norwegian
Algoritmer og datastrukturer
Study programme
Bachelor in Applied Computer Technology
Bachelor's Degree Programme in Software Engineering
Bachelor's Degree Programme in Mathematical Modelling and Data Science
Bachelor's Degree Programme in Information Technology
Weight
10.0 ECTS
Year of study
2022/2023
Curriculum
FALL 2022
Schedule
Course history

Introduction

None.

Recommended preliminary courses

The course builds on DAPE1300 Discrete Mathematics, DAPE1400 Programming and DATS1600/DATS1600 Program Development.

Required preliminary courses

After completing the course, the student is expected to have achieved the following learning outcomes defined in terms of knowledge, skills and competence:

Knowledge

The student

  • is capable of identifying common mechanical components and structural components and explaining what they are used for
  • is familiar with the systematic work involved in constructing parts, and putting the parts together to form components and products
  • knows the production documentation requirements
  • knows the rules for machine drawing

Skills

The student is capable of

  • digitally modelling parts, components and products, and generating correct detailed drawings and assembly drawings based on the digital models
  • carrying out power analysis and stress calculations
  • constructing and dimensioning common machine parts and components such as screws and screw connections, welds and welded assemblies, shafts, shaft bearings, shaft-hub connections and simple shafting/transmissions
  • carrying out simple fatigue calculations for machine parts based on infinite service life
  • conducting simple element analysis

General competence

The student is capable of

  • correctly documenting his or her own work and presenting them digitally

Learning outcomes

After completing the course, the student is expected to have achieved the following learning outcomes defined in terms of knowledge, skills and competence:

Knowledge

The student is capable of:

  • explaining the structure and purpose of data structures such as tables, lists, stacks, different types of queues, heaps, hash tables, different types of trees, graphs and files
  • explaining the function and efficiency of different variants of algorithms for counting, entering, searching for, deleting, traversing, sorting, optimising and compressing data

Skills

The student is capable of:

  • analysing, designing, and implementing data structures, and evaluate which;data structures are suited for;specific tasks
  • analysing, designing, implementing and using the algorithms required to solve specific tasks
  • using both self-developed and standardised algorithms and data structures to solve complex and complicated problems

General competence

The student is capable of:

  • participating in discussions and providing advice on what data structures and algorithms are most expedient in different situations
  • communicating the importance and necessity of using good structures and efficient algorithms in programming projects

Teaching and learning methods

The following coursework is compulsory and must be approved before the student can take the exam:

  • a compulsory measurement laboratory workshop

Course requirements

Portfolio assessment of four individual construction projects. Students are expected to work on the assignments for four hours per week throughout the semester. The assignments must be submitted on Canvas.

The exam result can be appealed.

Assessment

All aids are permitted.

Permitted exam materials and equipment

Pass/fail.

Grading scale

One internal examiner. External examiners are used regularly.

Examiners

The course builds on MAPE1300 Mechanics.

Overlapping courses

Emnet er ekvivalent (overlapper 10 studiepoeng) med: ITPE2300, LO140A og LO140I.

Ved praktisering av 3-gangers regelen for oppmelding til eksamen teller forsøk brukt i ekvivalente emner.