
Detailed information 
Original study plan 
Bachelor's programme Computer Science 2013W 
Objectives 
Mastery of the concepts of linear algebra in modelling geometric problems. Familiarity with the structures from abstract algebra that are used in
coding theory and cryptology, in particular with finite fields.

Subject 
Vectors and matrices for the description of geometric problems, linear systems of equations, projective geometry and homogeneous coordinates.
Vector spaces, linear mappings, matrix representation of linear mappings, determinants.
Finite fields, their construction from polynomial rings, arithmetic and properties of finite fields. Linear Codes.

Criteria for evaluation 
General: Understanding and mastery of the presented solution methods. Acquaintance with the underlying theory and its logical structure. Knowledge and presentation of the proofs contained in the lecture. Correct derivation of methods for solving related problems.
Specifically: Written exam.

Methods 
Lecture

Language 
German 
Study material 
 Kiyek, KarlHeinz and Schwarz, Friedrich, Lineare Algebra,
Teubner, Stuttgart, 1999.
 Lidl, R. and Pilz, G. F., Applied abstract algebra, Springer,
New York, 1998.
 Robinson, D. J. S., An Introduction to Abstract Algebra, Walter de Gruyter,
Berlin, 2003.

Changing subject? 
No 
Corresponding lecture 
^{(*)}ist gemeinsam mit 521THEOALGU13: UE Algebra (1,5 ECTS) und einer LVA aus dem Studienfach Vertiefung (1,5 ECTS) im Bachelor Informatik äquivalent zu INBIPVOALGE: VO Algebra (4,5 ECTS) + INBIPUEALGE: UE Algebra (3 ECTS)

