Syllabus 

(Course Outline)


Course Unit: UEF11 (Fundamental)

Subject: Algorithmics and Data Structures 1

Field/Branch: Mathematics and Computer Sciences

Semester: 1,   Academic Year: 2023/2024

Credits: 6,      Coefficient: 4

Total Weekly Hours: 07H30

  • Lectures (03H  per week)
  • Tutorials (01H30  per week)
  • Practical Work (03H  per week)

Language of Instruction: English

Course Instructor: Dr. Abderrahmane KEFALI, Title: MCA

Office:, Teachers Rooms, Department of Computer Science (E8)

Email: kefali.abderrahmane@univ-guelma.dz

Course Objectives:

To present the concepts of algorithms and data structures.

Recommended Prerequisite Knowledge:

Basic knowledge of computer science and mathematics.

Course Content:

Chapter 1: Introduction

  • Brief history of computer science.
  • Introduction to algorithms.

Chapter 2: Simple Sequential Algorithm

  • Notion of language and algorithmic language.
  • Parts of an algorithm.
  • Data: variables and constants.
  • Data types.
  • Basic operations.
  • Basic instructions.
  • Construction of a simple algorithm.
  • Representation of an algorithm using a flowchart.
  • Translation into the C language.

Chapter 3: Conditional Structures (in algorithmic language and in C)

  • Introduction.
  • Simple conditional structure.
  • Compound conditional structure.
  • Multiple choice conditional structure.
  • Branching.

Chapter 4: Loops (in algorithmic language and in C)

  • The While loop.
  • The Repeat loop.
  • The For loop.
  • Nested loops.

Chapter 5: Arrays and Strings

  • Introduction. The array type.
  • Multidimensional arrays.
  • Strings.

Chapter 6: Custom Types

  • Introduction.
  • Enumerations.
  • Records (Structures).
  • Other type definition possibilities.
Assessment Method: Knowledge Assessment & Weightings

Assessment Method

Weight (%)

Final examen

60%

Tutorial works

20%

Practical works

20%

Total

100%


Bibliography:
  1. Thomas H. Cormen, Algorithmes Notions de base Collection : Sciences Sup, Dunod, 2013.
  2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest Algorithmique - 3ème édition - Cours avec 957 exercices et 158 problèmes Broché, Dunod, 2010.
  3. Rémy Malgouyres, Rita Zrour et Fabien Feschet. Initiation à l'algorithmique et à la programmation en C : cours avec 129 exercices corrigés. 2ième Edition. Dunod, Paris, 2011. ISBN : 978-2-10-055703-5.
  4. Damien Berthet et Vincent Labatut. Algorithmique & programmation en langage C - vol.1 : Supports de cours. Licence. Algorithmique et Programmation, Istanbul, Turquie. 2014, pp.232.
  5. Damien Berthet et Vincent Labatut. Algorithmique & programmation en langage C - vol.2 : Sujets de travaux pratiques. Licence. Algorithmique et Programmation, Istanbul, Turquie. 2014, pp.258. <cel- 01176120>
  6. Damien Berthet et Vincent Labatut. Algorithmique & programmation en langage C - vol.3 : Corrigés de travaux pratiques. Licence. Algorithmique et Programmation, Istanbul, Turquie. 2014, pp.217. <cel-01176121>
  7. Claude Delannoy. Apprendre à programmer en Turbo C. Chihab- EYROLLES, 1994.

آخر تعديل: السبت، 4 نوفمبر 2023، 3:09 PM