A. I. Cuza University of Iaşi


Algebraic Foundations of Computer Science

Course nameAlgebraic Foundations of Computer Science CodeCS1209
Class Undergraduate, 2011 - 2014
Level Licenţă Year 1 Semester 2 Status Compulsory
Hours per weekTotal hours per semesterTotal hours of individual workCreditsEvaluation typeTeaching language
CSLPr
2 2 0 0 56 94 5 E ro
Taught byAcademic and scientific title, name
Required courses
ObjectivesThe course deals with those topics from mathematics that have proven to be particularly relevant to students in computer science.
General thematicsThe course covers basic elements on set theory (sets, relations and functions, induction and recursion), partially ordered sets (posets, lattices), number theory (divisibility, prime numbers, congruences), semigroups and monoids, groups, rings, vector spaces and linear mappings. Relevant applications of each chapter of the course to computer science, are disccused.
Seminary / Laboratory thematicsSeminars and laborators are grouped around the chapter currently discused in the course. They are aimed to illustrate the topics of the chapter mainly by practical applications.
Teaching methodsOn-line and blackboard presentation.
Bibliography
  1. H. Cohen. A Course in Computational Algebraic Number Theory, Springer-Verlag, third printing, 1996.
  2. P.M. Cohn. Algebra, vol. 1, John Wiley & Sons, 1982.
  3. P.M. Cohn. Algebra, vol. 2, John Wiley & Sons, 1989.
  4. P.M. Cohn. Algebra, vol. 3, John Wiley & Sons, 1991.
  5. F.L. Tiplea. Introduction to Set Theory, "Al.I.Cuza" University Press, 1998.
Evaluationconditions
criterias
modes6 homeworks and a final exam
formula60% from the homeworks and 40% from the final exam

© 2006-2010 FII | about | intranet