 
|
|
|
|
|
|
|
|
|
SMD087 Algorithms 6.0 ECTS credits | |
|
TIMEPERIOD: LANGUAGE:English/Swedish EXAMINER Jingsen Chen Univ lektor PREREQUISITES SMD073 Data Structures. COURSE AIM To develop skills in constructing and efficiency analysing algorithms and data structures and to study algorithms and data structures applied to sets, graphs, arithmetic, network and geometry. CONTENTS Analysis Correctness and Efficiency. Construction techniques Approximation, dynamic, on-line, parallel and probabilistic algorithms. 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 | 3.00ECTS |
| Written examn | 3.00ECTS |
|
COURSE LITTERATURE Scientific articles. Cormen, Th. H, Leiserson, C. E., Rivest, R. L.: Introduction to Algorithms, McGraw-Hill, 1991. Further information: Jingsen Chen |
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 |