A. I. Cuza University of IaşiAlgorithms and Programming
| Course name | Algorithms and Programming | Code | CS1101 |
| Class | Computer Science, 2006 - 2009 | ||||||
| Level | Undergraduate | Year | 1 | Semester | 1 | Status | Compulsory |
| Hours per week | Total hours per semester | Total hours of individual work | Credits | Evaluation type | Teaching language | |||
| C | S | L | Pr | |||||
| 2 | 1 | 1 | 0 | 56 | 94 | 5 | M | ro |
| Taught by | Academic and scientific title, name |
|
Professor, PhD,
Dorel Lucanu
Professor, PhD,
Gheorghe Grigoraş
|
| Required courses |
| Objectives | Algorithms: Techniques for the design and analysis of efficient algorithms, introduction to a number of fundamental data structures and algorithms (or procedures) for manipulating them, a basic understanding of how common computational problems can be solved efficiently on a computer. Programming: basic skills in using an imperative programming language (C), basic concepts and techniques of program design, the evaluation of the run time. |
| General thematics | Algorithms: algorithmic language, static data structures, dynamic data structures, linear lists, trees, graphs (as data structures), heaps, union-find, sorting, searching, problem solving. Programming: Gradual presentation of the C language (ISO Standard), focusing on the efficient implementation of the fundamental data structures and the case studies presented in the first part. |
| Seminary / Laboratory thematics | Seminar: problem solving using basic algorithms and fundamental data structures Laboratory: Fundamental data types and control flow. Files and input-output operations. Arrays and pointers. Functions and macros. Implementation of the fundamental data structures. |
| Teaching methods | Transparences and video projector. |
| Bibliography | D. Lucanu: Bazele proiectãrii programelor si algoritmilor, Universitatea "Al. I. Cuza", Iasi, 1996 D. Lucanu: Proiectarea algoritmilor - Tehnici elementare, Editura Universităţii "Al. I. Cuza", Iaşi, 1993 T.H. Cormen, C.E. Leiserson, R.L. Rivest: Introducere in Algoritmi, Computer Libris Agora, 2000 Al Kelley, Ira Pohl: A Book on C - Programming in C, Addison Wesley, Reading Herbert Schildt: C Manual Complet, Bucuresti, Ed. Teora 1998 E. Horowitz, S. Sahni, S. Anderson - Freed: Fundamentals of Data Structures in C, Computer Science Press, 1993 |
| Evaluation | conditions | Seminar Activity(AS), Laboratory Activity (AL), Written Tests (TS) |
| criterias | AS ≥ 5, AL ≥ 6, TS ≥ 4 | |
| modes | AS: questions, participation at discussions, original solutions to problems AL: each topic is evaluated with a mark between 1 and 10. TS: 2 written tests (weeks 7, 13), each test including 8 questions and a problem. | |
| formula | Final Mark = 10% AS + 40% AL +50% TS |