Algebraic Foundations of Computer Science
| Course name | Algebraic Foundations of Computer Science | Code | CS1209 |
| Class | Undergraduate, 2008 - 2011 | ||||||
| Level | Licenţă | Year | 1 | Semester | 2 | Status | Compulsory |
| Hours per week | Total hours per semester | Total hours of individual work | Credits | Evaluation type | Teaching language | |||
| C | S | L | Pr | |||||
| 2 | 2 | 0 | 0 | 56 | 94 | 5 | M | ro |
| Taught by | Academic and scientific title, name |
|
Professor, PhD,
Ferucio Laurenţiu Ţiplea
|
| Required courses |
| Objectives | The course deals with those topics from mathematics that have proven to be particularly relevant to students in computer science. |
| General thematics | The 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 thematics | Seminars 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 methods | On-line and blackboard presentation. |
| Bibliography |
|
| Evaluation | conditions | |
| criterias | ||
| modes | 6 homeworks and a final exam | |
| formula | 60% from the homeworks and 40% from the final exam |
A. I. Cuza University of Iaşi