Algorithmique et Structures de Données

Aperçu des sections

• 

  Généralités
• 

  🏛️ 1. University Information

  1. 🏫 University: University Centre Abdelhafid Boussouf-Mila
  2. 🏢 Institute: Mathematics and Computer Science Institute
  3. 💻 Department: Computer Science Department
• 

  📘 2. Description Sheet

  2.1 📚 Course Information
  

  1. 🏷️ Course Name: Algorithm and Data Structure
  2. ⏳ Total Hours: 120 hours per semester
  3. 🧾 Fundamental Unit: uefl21
  4. 🏫 Teaching Mode: Face to face
  5. 🎯 Coefficient: 04
  6. 🎓 Credits: 06
  7. 💻 Tools & Software: Coding C++ (Android), Dev C++ (Computer)

  2.2 🎯 Target Audience
  

  1. 👥 Beginners with no prior programming experience
  2. 🎓 First-year Bachelor/university students
  3. 👨‍🎓 Students interested in algorithms and data structures

  2.3 🎓 Learning Outcomes
  

  1. ✅ Understand variables and constants
  2. ✅ Master control structures
  3. ✅ Manipulate data structures
  4. ✅ Design and trace simple algorithms

  2.4 🧪 Assessment Methods
  

  1. 📝 Exams: 60%
  2. ✍️ Directed Work (Quiz): 20%
  3. 👨‍💻 Practical Coding Tasks: 20%

  2.5 ⏱️ Time Allocation
  

  1. 📘 Courses: 2 sessions × 3 hours
  2. 🧑‍🏫 Directed Work: 2 sessions × 3 hours
  3. 🧪 Practical Work: 2 sessions × 3 hours

  2.6 🕒 Evaluation Durations
  

  1. 🧪 Midterm Exam: 1.5 hours
  2. 📋 Directed Work Quiz: 0.5–1.5 hours
  3. 👨‍💻 Practical Coding: 0.5–1.5 hours

  2.7 📊 Final Evaluation
  

  1. ✅ Summative score from all assessments
  2. ✅ Grading aligns with institutional scale
  3. 🧾 Feedback provided on exam performance

  
  

  • Descriptive file word Fichier
  • Descriptive file html Fichier
• 

  🎯 3. Course Objectives

  🎯General objective of the course🎯:

  By the end of this course, the learner will be able to understand the basic concepts of general computing and design and interpret simple sequential algorithms, using fundamental algorithmic structures.

  Additionally, the learner will be able to:

  1. 🖥️ Understand basic algorithms and the basic concepts of general computing
  2. 🧮 Design and interpret simple sequential algorithms using fundamental algorithmic structures
  3. 📚 Understand basic algorithms
  4. ✍️ Write clean and readable code
  5. ⚙️ Optimize simple programming solutions
  6. 🧠 Improve logical thinking and problem-solving skills
• 

  🧱 4. Pre-requisites

  📘 Prerequisites 💡

  Before starting this course, learners should:

  1. ✅ Logical Thinking : Understand basic logic operations (e.g., AND, OR, NOT) and be able to follow instructions step by step.
  2. ➕ Mathematical Foundations : Be comfortable with simple math (addition, subtraction) and number systems like decimal and binary.
  3. 🖥️Basic Programming Knowledge : Know basic computer usage and identify key components like the keyboard, screen, and mouse.
• 

  🧪 5. Test of Pre-requisites
• 

  📖 🗂️ 6. Course Content/Plan

  • 📚 Chapters:
    1. 📄 chapter1-algorithmic(introduction)
    2. ▶️ chapter2-sequential algorithms
    3. ❓ chapter3-conditional structures
    4. 🔄 chapter4 Loops
  • 🗓️ October Weeks:
    1. 🔢 Variables and constants
    2. ⌨️ Input/output
    3. ✅ if statement
    4. 🔀 switch
    5. 1️⃣ loops 01
    6. 2️⃣ loops 02
  • 🍂 November Weeks:
    1. 📦 Arrays
    1. 🔡 Strings
    1. 📊 tables
  • ❄️ December Weeks:
    1. 🔢 Matrices

  
  

  • Mind Card Fichier
• 

  📗 7. Chapter 01: Generalities on Computing

  🎯Specific Objectives – Chapter 1: Introduction to General Computing🎯

  By the end of this chapter (01), the learner will be able to:

  1. 💡 Define basic computer science concepts (computer science, computer, data, information)
  2. 🧠 Distinguish between memory types and computer components
  3. 🗂️ Classify software according to type (system, application)
  4. 🧾 Identify the different programming languages (machine, assembler, high-level)
  5. 🖥️ Describe how a computer system works according to Von Neumann architecture

  📑 Course Plan:

  • 💡 Introduction to Informatics

  • 🖥️ Definition of a Computer

  • 📏 Information Representation

    • Decimal, Binary

  • 🧩 Computer System

    • Hardware (Central Unit, Memory, etc.)

    • Software

  • 🗣️ Programming Languages

    • Machine, Assembly, High-level

  • 📝 Exercises

  • 🚪 Exit Test

  • ASD chapter 1 Fichier
• 

  📘 8. Chapter 02: Sequential Algorithms

  🎯Specific Objectives – Chapter 2 : Sequential Algorithms 🎯

  By the end of this chapter, the student will be able to:

  1. 🧾 Define an algorithm and understand its characteristics
  2. 🔍 Analyze a problem to identify the input data, expected results, and the solution method
  3. 🖋️ Formulate a simple algorithm using algorithmic language
  4. ➗ Apply precedence rules in arithmetic expressions
  5. 🧑‍💻 Design an algorithm using input/output, assignment, and comment statements

  📑 Course Plan:

  1. 🧠 Definition of Algorithm

  2. 🕰️ Historical Overview

  3. 🔍 Algorithm Characteristics

     1. Keywords, Structure, Logic

  4. 🏗️ Algorithm Construction

     1. Tracing, Flow

  5. 🧮 Variables & Constants

     1. Naming, Types

  6. ➕ Operators & Expressions

  7. 🧾 Instructions

  8. 🧑‍💻 Exercises

  9. 🚪 Exit Test

  10. ✅ Solutions

  
  

  • ASD chapter 2 Fichier
• 

  Final evaluation
• 

  Section 10

  Week	Topic	Type	Duration
  1	Introduction to Informatics	Lecture	3h
  2	Computer System & Representation	Lecture	3h
  3	Programming Languages	Lecture + TD	3h
  4	Chapter 1 Exercises	TD	3h
  5	Definition & History of Algorithms	Lecture	3h
  6	Algorithm Structure & Logic	Lecture + TD	3h
  7	Variables, Constants & Operators	Lecture + TD	3h
  8	Chapter 2 Exercises & Review	TD	3h
  9	Midterm Evaluation	Exam	1.5h

  
  
• 

  Section 11
• 

  Section 12
• 

  Section 13