Computer Science, Electrical Engineering

SMD073 Data Structures 6.0 ECTS credits

DENNA SIDA FINNS OCKSÅ PÅ SVENSKA

General information about studying at Luleå University
TIMEPERIOD: I

LANGUAGE: English/Swedish

EXAMINER
S Carlsson Prof

PREREQUISITES
Imperative Programming.

COURSE AIM
To develop skills in designing and analysing algorithms and data structures and to introduce algorithms and data structures for some typical algorithmic problems in computer science.

CONTENTS
Mathematical methods and models of computation Recurence equations, efficiency meassures, upper and lower bounds. Construction techniques Divide-and-conquer, dynamic programming, greedy algorithms. Algorithms and data structures Sorting, searching, priority queues, dictionaries, and graphs. Coplexity classes The problem classes P, NP, and NPC.

TEACHING
Lectures and assignments.

EXAMINATION
Examination consists of oral and written presentations of assignments and a written final exam.
COURSE GRADE SCALE: U,3,4,5

ITEMS AND CREDITS 
Laboratory work                                             	1.5 ECTS
Written exam                                                	4.5 ECTS

COURSE LITERATURE
Cormen, Th. H, Leiserson, C. E., Rivest, R. L.: Introduction to Algorithms, McGraw-Hill, 1991.

REMARKS
Last modified 97-03-05
Further information: Svante Carlsson
Back to departement menu