 
|
|
|
|
|
|
|
|
|
SMD073 Data Structures 6.0 ECTS credits | |
|
TIMEPERIOD: I LANGUAGE:English/Swedish EXAMINER S Carlsson Prof PREREQUISITES SMD011/SMD012/SMD038 Imperative Programming or SMD091 Computer Science Project course. 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/CREDITS | |
| Laboratory work | 1.50ECTS |
| Written exam | 4.50ECTS |
|
COURSE LITTERATURE Cormen, Th. H, Leiserson, C. E., Rivest, R. L.: Introduction to Algorithms, McGraw-Hill, 1991. Further information: Svante Carlsson |
Web Editor: Birgitta.Hakansson@dc.luth.se
| The University | Student | Research | Search | Contact us | In Swedish |
 LULEÅ UNIVERSITY OF TECHNOLOGY University Campus, Porsön, 971 87 Luleå. Tel. +46 (0) 920-91 000, fax +46 (0) 920-91 399 |