Machine Structure بنية الآلة

Course objectives   أهداف الدرس

• Presentation and deepening of concepts regarding number systems and information representation (numeric or character).
 تقديم وتعمق في المفاهيم المتعلقة بأنظمة العد وتمثيل المعلومات (رقمي أو حرفي).

• In-depth study of Boolean algebra.
 دراسة متعمقة للجبر البولي.

• Introduction to synthesis methods for combinational and sequential logic circuits.
 مقدمة في طرق تركيب الدوائر المنطقية المجمعة والمتسلسلة.

• Acquisition of basic knowledge about computer architecture and the functioning of its components.
اكتساب المعرفة الأساسية حول هندسة الحواسيب ووظيفة مكوناتها.

• These concepts serve as a foundation for more advanced topics related to computer science (programming, operating systems, networks, etc.).
هذه المفاهيم تشكل أساسًا لمواضيع أكثر تقدمًا تتعلق بعلوم الحاسوب (البرمجة، أنظمة التشغيل، الشبكات، إلخ).

The course syllabus consists of the following chapters:

Chapter 1: General Introduction
Introduction to the fundamental concepts of numerical systems and the organization of the content.

Chapter 2: Number Systems
Presentation of number systems and the conversion operations between decimal, binary, octal, and hexadecimal bases.

Chapter 3: Information Representation
Explanation of different binary codes and methods of representing numbers and characters in computing.

Chapter 4: Binary Boolean Algebra
Introduction to Boolean algebra and the fundamental logic operators, along with the simplification of logical functions.

Chapter 5: Combinatorial Logic
Design and analysis of common combinatorial circuits such as adders, multiplexers, and decoders.

Chapter 6: Sequential Logic
Study of sequential circuits, including flip-flops, registers, and automata.

Chapter 7: Memories
Introduction to different types of memories, such as RAM and ROM, along with their design and usage.

Chapter 8: Pedagogical computer architecture
Analysis of the functioning of an educational machine with its components, instructions, and execution cycle.


Pr. Mohammed Kamal BENHAOUA


Analysis 01

Subject: Mathematical Analysis 1

Teaching Objectives:

The objective of this module is to familiarize students with set theory vocabulary, and to cover the different methods of convergence for real sequences and various aspects of the analysis of functions of a single real variable.

Course Content:

  • Chapter 1: The Set of Real Numbers
  • Chapter 2: Complex Numbers
  • Chapter 3: Sequences of Real Numbers
  • Chapter 4: Real Functions of a Real Variable
  • Chapter 5: Differentiable Functions
  • Chapter 6: Usual Functions

Assessment Method: Exams (60%), Continuous Assessment (40%)


Algorithms and Data structures 1 (Moved to new platform)

Algorithmic  and Data Structures 1 is a foundational course in computer science that introduces students to the fundamental concepts and techniques used to design, analyze, and implement efficient algorithms for solving computational problems.

Public:  First year  Computer science engineers

Key Topics:

  1. Introduction
  2. Algorithms: Step-by-step procedures for solving problems.
  3. describing algorithms.
  4. Conditional statements
  5. Iterative statements.
  6. Arrays data structures.
  7. Strings
  8. Personalized data structures

Main Objectives:

  1. Problem-Solving Skills: Develop students' ability to analyze problems, identify appropriate algorithms, and design efficient solutions.
  2. Data Structures Understanding: Introduce students to fundamental data structures and their applications in various problem domains.
  3. Algorithm Analysis: Teach students how to analyze the time and space complexity of algorithms to evaluate their efficiency.
  4. Programming Implementation: Provide hands-on experience in implementing algorithms using C  programming language.

Pr. Mohammed SALEM