University of Split

Department of Professional Studies

DATA STRUCTURES AND

ALGOTIRHMS

COURSE SYLLABUS

1
 COURSE DETAILS
Type of study
Professional study - 180 ECTS
programme
Study programme COMPUTER SCIENCE
Course title Data Structures and Algorithms
Course code SIT019
ECTS
(Number of credits 5
allocated)
Course status Optional
Year of study Second
Semester Second (spring)
Course Web site http://moodle.oss.unist.hr/
Lectures 30
Total lesson hours per
Practicals 0
semester
Laboratory exercises & practical demonstration 30
Prerequisite(s) None
Department of Computer Science faculty:
Lecturer(s)
Toma Rončević, lecturer.
Language of instruction Croatian, English

2
 COURSE DESCRIPTION
Course Objectives: • understanding basic data structures and algorithms
1. define basic static and dynamic data structures and relevant
standard algorithms for them: stack, queue, dynamically linked
lists, trees, graphs, heap, priority queue, hash tables, sorting
algorithms, min-max algorithm,
Learning outcomes 2. demonstrate advantages and disadvantages of specific algorithms
and data structures,
On successful 3. select basic data structures and algorithms for autonomous
completion of this realization of simple programs or program parts
course, student should 4. determine and demonstrate bugs in program, recognise needed
be able to: basic operations with data structures
5. formulate new solutions for programing problems or improve
existing code using learned algorithms and data structures,
6. evaluate algorithms and data structures in terms of time and
memory complexity of basic operations.
Introduction: arrays, structures, pointers, memory allocation, iteration
and recursion. Complexity analysis of algorithms. Singly and doubly
linked lists. Queue and stack and their basic operations. Trees, binary
Course content search trees and basic operations. Hash tables. Graphs and basic
algorithms on graphs: depth first and breadth first search, Dijkstra’s
alghoritm. Priority queues. Sorting algorithms: quicksort, bubblesort,
selectionsort, mergesort. Min-max algorithm.

CONSTRUCTIVE ALIGNMENT – Learning outcomes, teaching and

assessment methods

Alignment of students activities with learning outcomes

Student workload Learning

Activity
ECTS credits outcomes
Lectures 30 hours / 1 ECTS 1,2,5,6
Practicals
Laboratory work 30 hours / 1 ECTS 3,4
Self-study 78 hours / 2,6 ECTS 1,2,3,4,5,6

3
Office hours and final exam 12 hours / 0,4 ECTS 1,2,4,5,6

TOTAL: 150 hours / 5 ECTS 1,2,3,4,5,6

CONTINUOUS ASSESSMENT

Performance Grade ratio

Continuous testing indicators
Ai (%) ki (%)
Class attendance and participation 70 - 100 10
Laboratory work 100 10
First mid-term exam 50-100 40
Second mid-term exam 50-100 40

FINAL ASSESSMENT

Testing indicators – final exam (first and second Performance Grade ratio
exam term) Ai (%) ki (%)
Practical exam (written) 50 - 100 40
Theoretical exam (written and/or oral) 50 - 100 50
Previous activities
50 - 100 10
(include all continuous testing indicators)

Testing indicators – makeup exam (third and fourth Performance Grade ratio
exam term) Ai (%) ki (%)
Practical exam (written) 50 - 100 50
Theoretical exam (written and/or oral) 50 - 100 50

4
 PERFORMANCE AND GRADE

Percentage Criteria Grade

od 50% do 61% basic criteria met sufficient (2)
od 62% do 74% average performance with some errors good (3)
od 75% do 87% above average performance with minor errors very good (4)
od 88% do 100% outstanding performance excellent (5)