Architecture and Computer System

40 hours
Material description
This subject describes how computers work by synthesizing the
elements that play an important role in their hardware and software
structures.
Objective of the subject
This subject aims to teach students:
§ The main architectures of computers.
§ The technology of computer units and micro I / O circuits.
§ Number systems and Boolean algebra.
§ Description and operation of software.
§ General information on operating systems.
Prerequisites
Computer initiation
Skills and Abilities (Learning Outcomes)
At the end of this subject, students will be able to:
- Identify the internal and external components of the computer.
- Assist in the assembly of computers
- Understand the synchronization between the different elements of
the computer.
- Understand the basic functioning of operating systems.
Contents
2 periods per week

<Guided No
Chapters
exercises> <TP> week

Chapter 1: Computer architecture and structure (12 hrs)

1. Introduction
1.1 Interests of IT.
1st
1.2 Some definitions
week
1.2.1 Information and its representations.
1.2.2 Information technology.
1.2.3 The computer: general diagram.
2. The elements of a computer
2.1 The central unit
2.1.1 Processor: description, role, examples of processors.
2.1.2 Clock: role. 2nd
week
2.1.3 Main memory: types, role.
:
2.1.4 Cache memory.
2.1.5 Bus: types, role.
2.6 Auxiliary memories
2.6.1 Hard disk: description, operating principle, advantages and
disadvantages.
2.6.2 Diskette: description, operating principle, drive, advantages and 3rd
disadvantages. week
2.6.3 Compact Disc (CD): description, operating principle, drive,
advantages and disadvantages.
2.6.4 Latest news.
2.7 Input / output adapter: types, role. 4th
2.8 The connections (interfacing: serial, parallel, USB, SCSI, etc.) week
2.9 Input devices
2.9.1 Keyboard: grouping and functions of the keys.
2.9.2 Mouse: role and functioning. 5th
2.9.3 Optical reader: role and operation. week
2.9.4 Scanner: role and operation.
2.9.5 Latest news.
2.10 Output devices
2.10.1 Screen: types and operation.
6th
2.10.2 Printers: types and operation.
week
2.10.3 Plotter: role and operation.
2.10.4 Latest news.
Chapter 2: Number systems and Boolean algebra (24 h) Exercises
- Conversions in the
1. Number systems
bases.
7th
1.1 Representation of numbers (integers, fixed-point reals, floating-
week
point reals, negatives).
1.2 Conversions.
1.3 Binary arithmetic operations - Binary arithmetic 8th
1.3.1 Addition (example of a byte adder circuit) operations. week
- Binary arithmetic 9th
1.3.2 Subtraction (2's complement method)
operations week

1.3.3 Division (recursive subtraction method) - Binary arithmetic 10th

operations week
- Binary arithmetic 11th
1.3.4 Multiplication (method of shifts and additions)
operations week
- Octal arithmetic 12th
1.4. Octal arithmetic operations (addition, subtraction, etc.)
operations. week
- Hexadecimal
:
1.5. Hexadecimal arithmetic operations (addition, subtraction, etc.) arithmetic 13th
operations. week

2. Boolean algebra
2.1 Boolean functions of n variables
- Simplification of 14th
2.2 canonical disjunctive form
logic functions week
2.3 Functions and formulas
2.4 Basic logic gates: NOT, OR, AND

2.5 Combined logic gates: NOR, NAND, XOR, EQV (NOT-XOR) - Simplification of 15th
logic functions week
2.6 Conversion of logic gates: NOT, OR, AND to NAND
2.7 The problem of simplification.
- Construction of 16th
2.7.1 Polynomial formulas logic circuits. week
2.7.2 Karnaugh method
- Construction of 17th
2.8 Converting simplified logic functions to NAND functions
logic circuits. week
2.9 Examples of combinational logic circuits (adder, encoder,
decoder, multiplexer, demultiplexer) - Construction of 18th
logic circuits. week
2.10 Concept of sequential logic circuits (RS, JK flip-flops).
Chapter 3: The software production chain (4 hrs)
1. Operating system.
2. Charger. 19th
3. Translator. week
3.1 The different types of translator: interpreter, compiler and
assembler.
3.2 The compilation phases
§ 3.2.1 Lexical analysis.
§ 3.2.2 Syntax analysis. 20th
§ 3.2.3 Semantic analysis. week
§ 3.2.4 Code generation and optimization.
4. Link editor.
Teaching methods
Lecture given in class and supported by
Power Point slides to expose representative figures and diagrams of
the computer structure.
Assessment methods
Continuous written examinations and examinations during the school
year.
Bibliographical references
- Structured computer organization / Andrew S. Tanenbaum /
:
Fourth edition, 1999, International edition.
- Computer Architecture / Andrew S. Tanenbaum / Fourth
Edition, Translation into French.
Web references
See 'Andrew TANENBAUM' website

Data base
80 hours (40 lessons + 40 TP)
Material description

This subject is an introduction to database systems. It covers the

concepts of databases and database management systems; in
particular, it presents the relational model, the SQL query language,
the design and standardization of a relational schema.
The practical work of this subject involves using two software
programs Microsoft Access and Oracle. The objective is to use, first
of all, Microsoft Access to clarify the notions of the relational model
presented in the course part, then we use Oracle to learn the functions
of a DBMS and the SQL language.
Objectives of the subject
The objective of this subject is to introduce students to:
- The concepts of relational databases and their advantages.
- Defining the parameters for creating a new relational database.
- To create, maintain, and modify a relational database structure with
all these elements: tables, relations, attributes, ...
- To ensure the integrity of the database.

- To build and use in conversational mode data interrogation requests

by using SQL-type data manipulation and interrogation languages.

Prerequisites
Computer initiation
Skills and Abilities (Learning Outcomes)
At the end of this subject the student will be able to:
- Creation of a database.
- Handling through SQL queries.
Contents
2 periods per week
<Guided No
Chapters
exercises> <TP> week
Chapter 1: File Management Systems (8h)
:
1. The concept of file 1st
2. Definition: of a character, a field, a record, a file week
3. Data access: sequential and direct
Exercises: 2nd
4. The blocking factor, saving physical space
Blocking factor week
- Physical storage 3rd
5. File operations
of recordings week
- File 4th
5.1 At the file level
manipulation week
5.1.1 Create, delete
5.1.2 Copy, move, save
5.1.3 Sort, merge, explode
5.2 At article level
5.2.1 Insert, delete
5.2.2 Read, modify

Chapter 2: Databases and database management systems (8h)

1. The concept of databases
2. Database characteristics
2.1 Data independence 5th
week
2.2 Data redundancy check
2.3 Data consistency
2.4 Data sharing
2.5 Simultaneous data access control
2.6 Data security
2.6.1 User and password management
6th
2.6.2 Access and authorization control
week
2.6.3 Data backup and restore functions
2.7 Checking integrity constraints
3. Definition of Database Management Systems (DBMS)
4. The main characteristics of a DBMS
4.1 Data integrity
4.2 Portability
7th
4.3 Security
week
5. The database administrator
6. Data views
6.1 The data schema
6.2 The data subschema
7. Classification of databases
7.1 Centralized / distributed databases
:
7.2 Homogeneous / heterogeneous databases 8th
7.3 Single / multiple databases week
8. Presentation of the components of a DBMS
8.1 The data dictionary: role, composition and content.
8.2 SQL (Structured Query Language). Example.
Chapter 3: The relational data model (12 hrs)
- Database design
1. The concepts of the relational model with tables and
relationships
2. Domain, Attributes and Relations 9th
2.1 Attributes week
2.1.1 Compound / Atomic Attributes
2.1.2 Existing / Calculated Attributes
2.2 Set of values (Domain) of attributes
2.3 The key attribute of an entity (Candidate, Primary, Foreign and
Superkey) - Database design
2.4 Relations with tables, 10th
2.4.1 Definition relationships and week
2.4.2 The degree of a relationship keys
2.4.3 Cardinalities
3. Relational constraints
- Database design
3.1 Constraint of key and uniqueness 11th
with tables and
3.2 Referential integrity constraint week
keys
3.3 Domain constraint
4. Database design
- Functional 12th
4.1 Functional dependencies
dependence week
4.3 Boyce Codd Normal Form (4FN)
13th
4.2 The first three normal forms (1FN, 2FN & 3FN) - Standardization
week
14th
4.3 Boyce Codd Normal Form (4FN) - Standardization
week
Chapter 4: Basic operations of relational algebra (12 hrs) Exercises:
15th
1. The projection - Queries
week
16th
2. Selection - Queries
week
17th
3. The join - Queries
week
18th
4. The Cartesian product - Queries
week
:
5. Functions - Queries 19th
week
20th
6. Union, difference and intersection - Queries
week
Teaching methods
- Lecture given in class.
- Practical work
Assessment methods
Continuous written examinations and examinations during the school
year.
Bibliographical references
- Fundamentals of Database Systems / Ramez Elmasri / 3d Edition,
Addison & Wesley.
- Databases, object & relational / Georges Gardarin / Second edition,
Eyrolles.
- Database Management Systems / Raghu Ramakrishman / 2d Edition,
Mc Graw-Hill, 1999.
- The Essence of Databases / FD Rolland / Prentice Hall, 1998.
- Database Management Systems / Gerald Post / Mc Graw-Hill, 1998.
- An Introduction to Database Systems / CJ Date / 7th Edition,
Addison & Wesley.
- Database Design and Programming Access, SQL and Visual Basic /
John Carter / Mc Graw-Hill.

Algorithm and data structures 40

hours
Material description
This subject is an initiation to algorithms and data structures. It covers
the basics of algorithmic structure as well as sequential and iterative
structures. This subject also covers two data structures tables and
sequential files. Practical work in C language will be associated with
this subject in order to teach students the transformation of algorithms
into programs.
Objective of the subject
The objective of this subject is to introduce students to understand and
solve the logical structure of an algorithm without taking into account
programming languages. In addition, this subject aims to familiarize
students with handling data structures such as tables and sequential
files.
:
Skills and Abilities (Learning Outcomes)
At the end of this subject, the student will be able to:
- Knowing how to break down a problem in order to better solve it.
- To be able to move from a problem to its algorithmic solution.
- Establish a simple, fair, efficient and fast algorithm.
- Know how to translate an established algorithm into a correct
program.
Contents
2 periods per week
<Guided No
Chapters
exercises> week
Chapter 1: General introduction to algorithms and programming
(4h)
1.1 Definition and basic concepts.
1.2 The concept of coding and instruction. Exercises
- Declaration of 1st
1.3 The notion of variable (mutable objects and basic affection). variables and week
assignment
1.4 From algorithm to program (specification, program).
1.5 The operators (logical, arithmetic, relation,…).
2nd
1.6 Expressions (logical, arithmetic,…). Exercises
week
1.7 The parameters.
Chapter 2: Structure of the algorithm (10 h)
Sequence exercises 3rd
2.1 Sequences.
week
2.2 Alternativity (if ... then ... otherwise) 4th
Exercises on choice
2.3 Selection and choice (case) week
2.4 Iterativity: 5th
Exercises on While
2.4.1 As long as week
2.4.2 For
Exercises on For 6th
2.4.3 Repeat and Repeat week
Exercises on 7th
2.4.4 Recursion
Recursion week
Chapter 3: Nested structures (6 hrs)
Exercises 8th
3.1 Nested alternatives (if… then… if… then… if not… if not,).
week
9th
3.2 Nested loops. Exercises
week
3.3 Complex structures: 10th
Exercises
3.3.1 Use of: function and procedure week
:
Chapter 4: Tables (20 periods)
11th
4.1 One-dimensional arrays Exercises
week
4.1.1 Presentation in memory and vocabulary.
4.1.2 Route and search.
12th
4.1.3 Insertion. Exercises
week
13th
4.1.4 Deletion. Exercises
week
14th
4.1.5 Permutation. Exercises
week
15th
4.1.6 Triage. Exercises
week
4.1.7 Concatenation 16th
Exercises
4.1.8 Merge week
4.2 Two-dimensional arrays
17th
4.2.1 Presentation in memory. Exercises
week
4.2.2 Route and search.
18th
4.2.3 Insertion Exercises
week
19th
4.2.4 Deletion. Exercises
week
20th
4.2.5 Transfer, permutation and sorting. Exercises
week
Teaching methods
Application course
Methodical verification, step by step, of each of the algorithms
studied in class. Methods of finding errors in an algorithm.
Assessment methods
Controls and examinations.
Homework and small projects
Bibliographical references
- Introduction to algorithms and data structures, Volumes 1, 2
and 3 / Jacques COURTIN and Irène KOWARSKI / Dunod.
- Programming, lessons and exercises / Guy CHATY and Jean
VICARD / Ellipses, 1992.
- Reasoning to program, A. GRAM / Dunod.
- Algorithms + Data Structures = Programs, N. WIRTH /
Prentice-Hall.
:
 Algorithm and data structures
TP 40 hours
Material description
This subject is an introduction to the programming language C and it
contains a series of practical works dealing with the algorithms seen
in class.
Objective of the subject
The objective of this subject is to introduce students to a structured
language such as C in order to be able to write programs with the
syntax of this language.
Skills and Abilities (Learning Outcomes)
At the end of this subject the student will be able to:
- Write a formal specification with an algorithm and then
translate it into a well-compiled and executable C language
program.
Contents
<Guided No
Chapters
exercises> week
Chapter 1: Structure of a C language program (4 hrs)
1st
1.1 General structure of a program in C.
week
1.2 Include files. Applications:
Declaration of
1.3 Comments. variables and
assignment
1.4 Primitive type
1.4.1Integer types (char, short, int, long, unsigned char, unsigned int,
unsigned short, unsigned long).
1.4.2 Real data types (float, double, long double).
1.5 Constants (integers, floating point, character type, character string
Applications:
type).
2nd
Declaration of
week
1.6 Variables. variables and
assignment
Chapter 2: Entry and Exit (4 hrs) Applications:
3rd
2.1 Formatted entry. Entries exits
week
2.2 Formatted output.
2.3 Unformatted entry in character mode. Applications: 4th
2.4 Unformatted display in character mode. Entries exits week
Chapter 3: Expressions and operators (6 hrs) Applications:
:
3.1 Definition of a C expression Operators 5th
3.2 Operators week
3.2.1 Arithmetic operators (elementary computation operators,
compound expressions, conversion of types, priorities).
3.2.2 Comparison operators (relational operators).
6th
3.2.3 Assignment operators (simple assignment, combined
week
assignment, increment and decrement, priorities).
7th
3.2.4 Conditional operator.
week
Chapter 4: Flow control structures (8 hrs) TP
Iterative and
8th
sequential
4.1 Alternative instructions: if test, if-else test, multiple test (switch). week
structures

9th
Iterative and week
4.2 Repetitive statements (iterations): while statement, for statement,
sequential
do while statement. 10th
structures
week
Iterative and
11th
4.3 Branching instructions: break instruction, continue instruction. sequential
week
structures
Chapter 5: Complex Data Types (12 hrs) 12th
Handling arrays
5.1 One-dimensional array. week
13th
5.2 Table with several dimensions. Handling arrays
week
14th
5.3 Character string
Handling character week
5.3.1 Input-output operations: input and display with scanf, and strings 15th
printf, input and display with gets and puts. week
16th
5.3.2 Assignment operation.
week
17th
5.3.3 Comparison operation.
week
Chapter 6: File Management (6 hrs)
High level operations. 18th
6.1 Opening files. week
6.2 Closing files.
6.3 Read and write operations (in character mode, in string mode, 19th
formatted read and write, read and write in blocks). week
20th
6.4 Direct access.
week
:
Teaching methods
§ The teacher must present to the student the way of passing from the
algorithm to the program and make him learn how to draw a program
to validate it.
§ The algorithms treated in class will be translated into program C.
§ The logic of analysis of a program is acquired by the application of
exercises which deal with similar problems.
§ You should not go into the details of the language so as not to
disturb the student. To do this, applications must be straightforward
and easy to remember
Assessment methods
TP report
Small projects
Bibliographical references
- The great book of programming in C language / Gerhard
Willms, Translated from English by Georges-Louis Kochar /
Editions Micro Application.
- The C language / Brian W. KERNIGHAN and Dennis M.
RITCHIE, Translated from the English by Jean-François
GROFF and Eric ALLARD / Masson, Paris.
- Programming with C / Byron S. Gottfried, Translated from
English by Bernard DECOURBE / McGraw-Hill (Schaum
series), New York.

Analysis methodology
80 hours
Material description

The Merise method is a method of analysis, design, development and

realization for IT projects. Based on a very methodological plan and a
rigorous language, its goal is to facilitate the design of IT projects and
to link IT solutions to user needs.
This material describes the three abstraction axes of the MERISE
method (decision, life cycle, abstraction).
Objective of the subject
The objectives of this subject are to make students understand the
original concepts of Merise and the bases of conceptual and
organizational modeling in order to achieve clear and easy to
implement relational patterns.
Skills and Abilities (Learning Outcomes)
At the end of this subject the student will be able to:
:
- understand the objectives of the MERISE method and the
different levels of its approach,
- know the specific vocabulary of the method,
- know how to formalize the conceptual and organizational
models of MERISE,
- identify the roles and responsibilities of the different actors
involved in the design process.
Contents
Chapters No week
Chapter 1: Information system
1 Systems concepts and basics 1st week
1.1. What is a system?
1.2. The business as a system.
2 The subsystems
2.1. Steering system
2.2. Operating system
2.3. Information System (IS)
Chapter 2: Approach of the MERISE method
1 The cycles of an IS
1.1. Life cycle,
1.2. Cycle of abstraction,
1.3. Decision cycle.
2 The stages of the IS development process
2.1. Blueprint
2.2. Preliminary study
2.3. Detailed study
2.4. Technical study
2.5. Realization of programs
2.6. Implementation
2.7. Maintenance.
Chapter 3: Data Design (36 hrs)
1 Objective of the CDM. 2nd week
2 Compendium of the existing.
2.1 Management interviews
2.2 Workstation interviews
2.3 Summary of interviews:
2.3.1 Expressions of objectives and constraints
2.3.2 List of tasks
2.3.3 Inventory of data and documents.
3 Data dictionary
:
3.1 Notion of attribute and domain (occurrence of an attribute)
3.2 Nature of an attribute (movement, stable, situation) 3rd week
3.3 Characteristics of the simple / repetitive attribute; elementary /
decomposable; compulsory / optional; derived attribute.
3.4 Examples and exercises.
4 The entities
4.1 Properties, entities, occurrences
4.2 Identifiers
4.3 Construction of an entity 4th week
4.4 Enumeration rule
4.5 Direct dependency rule
4.6 Examples and exercises.
5 Associations (relationships)
5.1 Definition
5.2 Occurrence of an association
5th week
5.3 Cardinalities
5.4 Binary, reflexive associations
5.5 Examples and exercises.
5.6 Ternary associations
5.7 N-ary associations 6th week
5.8 Examples and exercises.
5.9 Any attributes of an association
5.10 Rules of associations
5.10.1 Uniqueness of an occurrence of an association in relation to
7th week
the occurrences of entities participating in the association
5.10.2 Full dependency rule
5.11 Examples and exercises.
5.13 Inheritance and entity subtypes
5.14 Aggregation and dependency 8th week
5.15 Examples and exercises.
6 Some MCD Problems

6.1 Representation of the date

6.2 Decomposition of relations
6.3 Choice of identifiers
6.4 Examples and exercises.
7 The constraints
7.1 Functional integrity constraints 9th week
7.2 Exclusion constraints
7.2.1 Excluding relationships
7.2.2 Exclusion between entity occurrences
:
7.3. Inclusion constraints
7.3.1 Inclusion of relationships
7.4 Examples and exercises
8 Summary and Global Applications and Exercises 10th week
Chapter 4: Logical Data Model (16 hrs)
1 Objective
2 Rules for converting MCD to MLD
11th week
2.1 Binary association transformations
2.2 Transformations of ternary and n-ary associations
2.3 Examples and exercises.
2.4 Transformations of inheritances and aggregations
2.5 Check that the relations obtained are in 3FN 12th week
3 Examples and exercises.
4 Optimization of the LDM
4.1 Deletion of unusable relations / Reference relations 13th week
5 Examples and exercises.
6 Examples and exercises on LDM 14th week
Chapter 5: Application and exercises combining MCD and MLD 15th week
Chapter 6: Conceptual treatment modeling (20 h)
1 Objective
2 Basic concepts
2.1. Event, type of event, messages 16th week
2.2. Field of activity
2.3. Domain processing rule
2.4. Examples.
3 Information Flow Diagram (Conceptual Communication Model)
3.1. Actors: Internal and external
3.2. Domain process
3.3. Information flow between external actors and processes
17th week
3.4. Internal flows between the different processes
3.5. Examples.
4 Event scheduling graph
4.1. Examples and exercises.
5 Operations
5.1. Definition,
5.2. Issuing rules,
5.3. Trigger messages, 18th week
5.4. Synchronization,
5.5. Results,
5.6. Examples and exercises.
:
6 MCT graph by process
19th week
6.1. Exercises.
7 The rules of MCT
7.1. No redundancy of operations,
7.2. Non redundancy of events,
7.3. Conflict elimination,
7.4. Homogeneity of operations,
7.5. Continuity of the process,
20th week
7.6. Examples.
8 Validation of the MCT against the MCD
8.1. Consistency of operations with the MCD,
8.2. Actions of operations on the basis of information,
8.3. Examples.
9 Exercises.
Bibliographical references
- The MERISE method, Principles and tools Tome 1 and 2 /
Tardieu H., Rochfeld A., Coletti R. / Organization editions
- Training in MERISE conceptual modeling / Gérald LOUVET /
Organization editions
- Understanding MERISE / Jean-Patrick Matheron / Editions
Eyrolles
- Merise / 2, Panet & Letouche, 1994 (Organizational Editions)
- Engineering of information systems MERISE second
generation (4th edition), D. NANCI, B. ESPINASSE, Vuibert
editions. 2001
Web references
- http: //perso.wanadoo.fr/matthieu.vidal/
- www.scribd.com/doc/7472422/Cours-de-Merise
- deptinfo.cnam.fr/new/spip.php?pdoc6023

VB.net programming
80 hours
Material description
This subject describes the syntax of the Visual Basic .NET language
as well as the manipulation of graphic objects and forms. It also
describes the management of events associated with these objects. At
the end of this subject, an overview on the use of ADO in order to be
able to connect to a database.
Objective of the subject
The objective of the course is to teach students to carry out programs
:
in Visual Basic (VB) and to develop a management application with a
database.
Prerequisites
Algorithmic knowledge and databases
Skills and Abilities (Learning Outcomes)
At the end of this subject the student will be able to:
- Create a program in VB.net.
- Manage forms (creation of form, call for programs, etc.).
- Control data entered in forms.
- Connect to a database.
- Manage and manipulate the data of the database.
Contents
4 periods per week
<Guided No
Chapters
exercises> week
Chapter 1: Visual Basic Environment
1st
1 The Visual Basic splash screen
week
2 The toolbar.
3 The leaves.
4 Visual Basic program code.
5 Controls and toolboxes.
6 The project explorer.
7 Examples.
Chapter 2: Visual Basic Software
1 Objects and events.
2 Object-oriented programming.
3 The properties (the properties window, program using the
properties, change the properties interactively).
4 Event handlers.
5 Create an executable file (interpreted code and compiled code,
change the program icon).
2nd
6 Forms
week
- Definition
- Properties
Chapter 3: The Visual Basic language (18 hrs) Practical work
- Declaration and
1 Variables assignment of
variables.
1.1 Declaration of variables,
:
1.2 Type of variables,
1.3 Numerical variables (Integer, Single, Double, Long, Currency),
1.4 The Byte type,
1.5 String type variables, 3rd
1.6 Boolean type variables, week
1.7 Date type variables,
1.8 Object variables,
1.9 Variant type variables,
1.10 Variable type conversion,
1.11 User-defined types,
1.12 The Explicit option,
1.13 Lifespan of a variable,
1.14 Special values (Empty, Null, Nothing, Error).
2 The constants.
3 Declaration of static variables.
4 Tables Practical work
- Declaration and
4.1 Declaration of an array,
assignment of tables 4th
4.2 Multidimensional arrays, week
4.3 Dynamic tables,
4.4 Tables of tables.
5 The collections Practical work
- Handling of
5.1 Adding an element to a collection,
collections
5th
5.2 Deleting an element from a collection,
week
5.3 Returning an element to a collection,
5.4 Processing of the elements of a collection,
5.5 Counting a collection.
6 Procedures Practical work
6.1 Subroutines, - Use of procedures
6.2 Functions,
6th
6.3 Appeal of proceedings,
week
6.4 Passage of arguments (by value, by reference),
6.5 The optional arguments,
6.6 Passing a variable number of arguments.
7 Flow control instructions Practical work
- Handling of
7.1 The If statement. then, sequential and
iterative structures.
7.2 The If statement. then. else,
7.3 The multiline If statements,
:
7.4 The multiple selection instruction: 7th
7.4.1 The Select Case instruction, week
7.4.2 Select options based on different conditions,
7.4.3 Select character strings,
7.5 The rehearsal instructions:
7.5.1 The Do instruction. Loop.
7.5.2 The For statement. Next.
7.5.3 The While statement. Wend.
Chapter 4: Controls (12 hrs) Practical work
- Creation of forms
1 Using the controls and association of
graphic objects.
1.1 The toolbox, 8th
week
1.2 Positioning of controls on the sheets,
1.3 Resize the controls,
1.4 The alignment grid,
1.5 Lock the controls.
2 Definition of controls (windows, properties and events). Practical work
- Creation of forms
3 The command button. and association of
graphic objects.
4 The Name property and the Caption and Text properties.
5 The properties of the text box control.
6 The events of the text zone control. 9th
week
7 Label control (label property and label events).
8 The Checkbox controls.
9 Option button controls.
10 The Enabled properties and the focus.
11 OLE.
12 The List Box, Combo Box controls: Definition and properties
13 The menus Practical work
- Creation of forms
13.1 Concept of a menu. and association of
graphic objects.
13.2 Operation of drop-down menus.
13.3 Design a menu with the menu creator.
13.4 The properties of a menu (Name, Index) 10th
week
13.5 Activate menu items,
13.6 Assign a keyboard shortcut,
13.7 The menu separators.
13.8 Add a code to menu items.
:
14 The Popup menus.
15 Dynamic menus (add menu items during execution).
Chapter 5: Events (10 hrs) Practical work
- Associate events
1 Definition and overview with graphic
objects. 11th
2 Common events: week

(click, DblClick, Change, GetFocus, LostFocus, KeyPress,

KeyDown, KeyUp, MouseDown, MouseUp, MouseMove…)
3 Form Events:
(Initialize, Load, Resize, Activate, Deactivate, QueryUnLoad,
Unload, Terminate)
4 Text Box Events
12th
5 Command button events
week
6 Frame Events
7 Events Option Buttons
8 Check Box Events
9 Picture Control events
10 Image Control Events
11 List Box Events 13th
12 Combo Box Events week
13 Events Menu
Chapter 6: Dialog boxes (4 hrs) Practical work
- Handle dialog
1 Introduction.
boxes.
2 Message boxes
2.1 Select the type of message boxes,
2.2 The MsgBox function.
3 The entry boxes
3.1 Use,
3.2 Positioning of the input box,
14th
3.3 Data types and entry boxes.
week
4 Common dialog boxes
4.1 Use of common dialog boxes,
4.2 Open and Save file dialog boxes,
4.3 Configure the file open dialog box,
4.4 The Color dialog box,
4.5 The Font dialog box,
4.6 The Print dialog box,
4.7 The Flags property of common dialog boxes.
:
5 Custom dialog boxes.
Chapter 7: ADO (Activex Data Objects) (26 h) Practical work
- Configure and
1 Definition and overview connect to a
database.
- Handling the
2 Service Provider for OLE / DB database data 15th
through the ADO. week
- Native Supplier
- ODBC provider
- ODBC setup
3 Configure the ODBC data source

4 Connect to Microsoft Access MDB and Oracle DB

5 ADO Data Control
5.1 Move between registers by Data controls 16th
5.2 RecordSet week
Types of Cursors (forward-only, dynamic, keyset, static, ..)
5.3 ADO properties of Data Controls
5.4 The Properties of RecordSets
Recordset object properties: BOF, Bookmark, EditMode, EOF,
RecordCount, ... 17th
5.5 Methods of recordset objects: week
AddNew, ancelUpdate, Close, Delete, Find, MoveFirst, MoveLast,
MoveNext, MovePrevious, Requery, Update,….
5.6 ADO Data Control Events: EndOfRecordset, Error,
WillChangeField, FieldChangeComplete, WillMove, 18th
WillChangeRecord, MoveComplete, WillChangeRecordset, week
RecordChangeComplete, RecordSetChangeComplete.
5.7 Order of Events
5.8 Modify Data programmatically: Add, Insert, Delete Records,
Cancel Changes
5.9 Find the changes in the Data
5.10 Additional Topics on Safety Controls
Data, Data-bound Combo Box, Data-Bound List Box 19th
5.11 Data-Bound Grid Control, Property of Pages week
5.12 Collection:
Definition and General View
Form Collection
For Each… Next
Collection of Controls
Chapter 8: Development utilities (6 h) Practical work
:
 - Work with
1 Multiple Document Interface (MDI)
multiple forms.
Definition
Create an MDI Form
MDI Child Form
20th
2 Magic Data Form (Wizard)
week
3 Magic Application (Wizard)
4 Data Environment Designer
Connect to Microsoft Access
Connect to the Oracle Database
Add Orders
5 Create a data-bound form
Teaching methods
This subject must be taught in a computer lab, most of it is a practical
part, exercises applied on computers.
A computer equipped with Visual Studio software (VB.net) and a
database.
Assessment methods
- Report on practical work.
- Mini-projects, controls
Bibliographical references
- Database Programming with Visual Basic .NET and ADO.NET
- Tips, Tutorials, and Code (Sams)
- Sams_Teach_Yourself_VISUAL_BASIC_.NET_in_24_Hours
- Visual Basic .NET How to Program 2E - Dietel and Dietel
- [eBook] Beginning Visual Basic .NET Database Programming
(Wrox (

Second year (TS2)

Data base
80 hours (40 LESSONS + 40 TP)
Material description
This subject aims to deepen the concepts of Databases approached in
the subject TS1 Databases and to present the functions of a DBMS
(Oracle) through the description of the SQL language, the use of a
procedural language with SQL ( Oracle PL / SQL) and the
presentation of concepts: data security, concurrency control and data
storage.
Objectives of the subject
:
The objective of this subject is to initiate students to master:
- SQL language with its different aspects.
- The use of the procedural language PL / SQL.
- The main functions of a DBMS ...
Prerequisites
TS1 databases.
Skills and Abilities (Learning Outcomes)
At the end of this subject the student will be able to:
- Master the functions of a DBMS
- Master the SQL language
- Use a procedural language with SQL
Contents
4 periods per week
<Guided No
Chapters
exercises> week
Chapter 1: Introduction to the Oracle database. (2 hrs)
1st
1. The concepts for starting an Oracle database.
week
2. Text editor, SQL * Plus.
Chapter 2: SQL language
1. The creation of BDD: The interactive tools for the definition and
creation of BDD.
2. The Data Definition Language (LDD).
Use the LDD:
creation,
2.1. Data types.
modification and
deletion of tables 2nd
Handling week
2.2. Creation, modification and deletion of tables).
constraints
2.3. Integrity constraints for tables: Unique, Primary key, Foreign,
Check.
2.4. Create, delete, activate and inactivate a constraint.
2.5. Create a new table with records from another table.
2.6. Index of a table: 3rd
Handling indexes
2.6.1. Types: automatic and manual week
2.6.2. Creation and deletion.
3. Data Modification Language (DML)
3.1. Adding, modifying and deleting data.
Using LMD 4th
3.2. Use of Select in the LDM.
commands. week
3.3. Transactional processing: Commit, Rollback, Savepoint.
3.4. Comparison between: Delete, Drop, Truncate.
:
4. The Data Query Language (DML)
Building queries
4.1. The Syntax of Queries and applying on
existing tables 5th
4.2. The basic commands of the language (Select, From, Where, week
Order by,…).
4.3. Selecting data from a table.
4.4. Sorting query results.
4.5. Simple queries.
4.6. The Cartesian product
Building queries
4.7. Joins: use of several tables. and applying on
existing tables 6th
4.7.1. Equi-join. week
4.7.2. Non-Equijoin.
4.7.3. Joining a table to itself.
4.7.4. Outer join.
4.8. Simple expressions and functions, arithmetic, character strings, Building queries 7th
dates, etc. and applying week
Building queries 8th
4.9. Conversion functions
and applying week
9th
4.10. Group functions: MAX, MIN, SUM, COUNT, AVG. Building Queries
week
4.11. Subqueries and set operators.
4.12. The sub-questions:
4.12.1. Subqueries returning a single value.
Building nested 10th
4.12.2. Subqueries bringing together several lines.
queries week
4.12.3. Subqueries bringing together several columns.
4.12.4. Subqueries returning at least one row.
4.12.5. Multiple subqueries.
4.13. Set operators:
4.13.1. UNION Building queries 11th
4.13.2. INTERSECT and applying week
4.13.3. MINUS
4.14. External variables: with or without Accept Using External 12th
4.14.1. Creation and use Variables week
5. Views.
Creating and Using
5.1. Definition of a view.
Views 13th
5.2. Benefits of views. week
5.3. Types of views and characteristics: simple and complex
:
5.4. Creation of views (Create - Replace).
5.5. Finding data from views.
14th
5.6. Data modification by views. Using views
week
5.7. Delete views.
6. Sequences.
6.1. Creation
Creating and using 15th
6.2. Modification
sequences week
6.3. Deletion
6.4. Using sequences with DML.
Chapter 3: Data Security
Creation and
1. Objectives. management of
users and roles. 16th
2. Types: System Privileges and Object Privileges. week
3. User, Password.
4. Role.
5. Grant and Revoke.
Chapter 4: The PL / SQL language (2 p.m.)
1. The basics of PL / SQL
- Objectives 17th
Creating blocks (if)
- Declaration of data types: variables, constants, etc. week
- PL / SQL Block syntax
- If syntax (if, then, else, elsif)
Creating blocks 18th
- Syntax of the different types of Loop
(loop) week
- Subprograms (procedures and functions) Creation of
19th
- Use of stored procedures functions and
week
- Data search using PL / SQL procedures
2. Cursors
Creation and
- Definition of a cursor manipulation of
cursors
- Types of cursors 20th
week
- Use of implicit cursors
- Sliders with parameters

- Extraction of rows of data using cursors

- Update and delete lines with cursors
Teaching methods
Lectures enriched by examples and practical work.

Assessment methods
:
Written checks and exams.
Practical work (60 h)
The practical sessions must begin with a reminder of SQL from TS1
and then they must follow the course and the guided exercises.
Bibliographical references
- Fundamentals of Database Systems / Ramez Elmasri / 3d Edition,
Addison & Wesley, 2000.
- Databases, object & relational / Georges Gardarin / Second edition,
Eyrolles, 2000.
- Database Management Systems / Raghu Ramakrishman / 2d Edition,
Mc Graw-Hill, 1999.
- The Essence of Databases / FD Rolland / Prentice Hall, 1998.
- Database Management Systems / Gerald Post / Mc Graw-Hill, 1998.
- An Introduction to Database Systems / CJ Date / 7th Edition,
Addison & Wesley, 1999.
- Oracle8i the Reference / Kevin Loney / George Koch / Campus
Press 02/2001

Algorithm and Data Structures II

40 hours
Material description
This material is a continuation of that seen in the first year. It
describes the representation and manipulation of strings as well as
particular data structures such as lists, stacks and trees.
Learning algorithms is learning to handle the logical structure of a
computer program. This dimension is present regardless of the
programming language; but when programming in a language (in C,
in Visual Basic, etc.) we must also grapple with the problems of
syntax, or types of instructions, specific to this language. Learning
algorithms separately is therefore to classify the difficulties in order to
better overcome them.
Objective of the subject
The objective of this subject is to initiate the student to manipulate
and optimize advanced data structures.
Prerequisites
The student must have already acquired:
- Introduction to algorithms.
- Structure of an algorithm.
Skills and Abilities (Learning Outcomes)
At the end of this subject the student will be able to:
- gradually become aware of the principles of research, use and
:
complexity of algorithms;
- acquire the fundamental principles which make it possible to
analyze and program concrete problems;
- learn the structured design process, learn to write a program in
algorithmic language in order to translate it into a programming
language;
- adapt an algorithm to different data structures.
Contents
2 periods per week
Chapters No week
Chapter 1: Procedures and Functions
1.1 Notions and introduction. 1st week
1.2 Principles and methods:
1.2.1. Mechanism
1.2.2. Functioning
1.2.3 Parameter setting
1.2.4 Appeal
1.3 Iterative and recursive methods.
2nd week
1.4 Exercises.
Chapter 3: Linear Chained Lists
3.1 Notions: cell and pointer, dynamic memory management, free
3rd week
lists.
3.2 Linked lists:
- Manipulation (iterative and recursive methods) 4th week
- Application exercises
- Search (iterative and recursive methods)
5th week
- Application exercises
- Copy, Sort, Merge
6th week
- Application exercises
- Concatenation, bursting
7th week
- Application exercises
- Deletion
8th week
- Application exercises
- Insertion
9th week
- Application exercises
Chapter 4: Specific linked lists
4.1 Circular lists or rings: 10th week
- Search (iterative and recursive methods)
- Application exercises
- Merge, concatenation, splitting, etc.
:
 11th week
- Application exercises
- Insertion
- Deletion 12th week
- Application exercises
4.2 Bidirectional lists:
- Search (iterative and recursive methods) 13th week
- Application exercises
- Sorting, merging, concatenation, splitting, etc.
14th week
- Application exercises
- Insertion
- Deletion 15th week
- Application exercises
4.3 Queues (FIFO):
- Chained representation
- Processing of expressions (Infixed, Prefixed, Postfixed) 16th week
o Evaluation of expressions
o Application exercises
o Switching from one performance to another
17th week
o Application exercises
Chapter 5: Trees
5.1 Notions: definition, representations (binary, degenerate, n-ary,
18th week
etc.).
5.2 Representation of arithmetic expressions
5.3 Browsing a binary tree: application exercises (prefixed, postfixed,
infixed, etc.) 19th week
- Methods: iterative and recursive.
5.4 Ordered binary tree: search, insertion, deletion. 20th week
Teaching methods
§ The teacher must present to the student the way of passing from the
algorithm to the program and make him learn how to draw a program
to validate it.
§ The algorithms treated in class will be translated into program C.
§ The logic of analysis of a program is acquired by the application of
exercises which deal with similar problems.
§ You should not go into the details of the language so as not to
disturb the student. To do this, applications must be straightforward
and easy to remember
Assessment methods
Written checks and exams.
Bibliographical references
:
- Introduction to algorithms and data structures, Volumes 1, 2
and 3 / Jacques COURTIN and Irène KOWARSKI / Dunod.
- Programming, lessons and exercises / Guy CHATY and Jean
VICARD / Ellipses, 1992.
- Reasoning to program, A. GRAM / Dunod.
- Algorithms + Data Structures = Programs, N. WIRTH /
Prentice-Hall.

Object Oriented Programming

(Java)
80 hours (40 lessons + 40 TP)
Material description
This subject is an initiation to the object approach and object-oriented
programming through the presentation of the Java language and the
realization of Java applications.
Objective of the subject
• Study the concepts related to object oriented programming (OOP)
• Introduce the Java language and study its concepts and
characteristics
• Apply the concepts of the Java language on practical cases
Prerequisites
Algorithm and structured programming.
Skills and Abilities (Learning Outcomes)
At the end of this subject the student will be able to:
• Know the evolutions of programming trends
• Master the basic concepts of OOP and understand its usefulness
• Write programs in the Java language.
Contents
4 periods per week
<Guided No
Chapters
exercises> week
Chapter 1: Presentation of the Object Oriented approach and the
Java language (4h)
1st programs making it possible 1st
- Java Development Kit (JDK)
to carry out:
week
- Compiler (Javac) and Interpreter (Java) - read operations,

- Notion of the Java virtual machine - write operations,

- General structure of a Java program - simple calculations.

- Introduction to Java applications

· Variables: Declaration, Assignment and initialization.

:
Blocks, instructions and expressions

Write methods (System.out.println and System.out.print)

Using the Scanner class and the nextInt () method

Comments

Chapter 2: Basics (2 p.m.)

- The primitive types of Java: byte, short, int, long, float, double, char, boolean. Programs allowing:

- Use of different primitive

- The operators
types

Binary operators (+, -, *, /,%) - Use of different operators 2nd

week
Unary operators (-, -, ++) - Use of Math methods

Relational operators (==,! =, <,>, <=,> =)

Logical operators (!, &, |, ^, &&, ||)

Assignment operators (=, + =, * =,… ..)

Precedence rules

- The alternatives Programs allowing:

The if and if-else statements

- Use of control instructions 3rd
(alternatives)
week
Nested yews
- Buckles Programs allowing:

The while and do-while statements - Use of loops

The for statement

4th
Nested loops
week
Connection instructions: continue, break
Chapter 3: Classes and Objects (6 p.m.)
- Class declaration Definition of classes
representing real objects with 5th
- Declaration Variables members of the class
instance variables, methods and
simple constructors.
week
- Definition of methods
- Definition of constructors

- Creation of object instances, notion of reference, new operator, the null variable Programs with multiple classes
6th
Use of access modifiers and set
- Use of object instances
and get methods. week
- Access control modifiers (private, public)

- The set and get methods

- Using this Use of access modifiers and set 7th

and get methods.
- Pass values to methods week
- Pass by reference and pass by value
- Returns values and objects from a method

- Static variables and methods

- Declaration of constants (final) 8th

Applications
- Overloading of methods week
- Overloading of manufacturers

Programs using the different

Chapter 4: Characters and strings (6 hrs) constructors and methods of the
:
 String class.
9th
- The String class String operations: week
- Creation and initialization of string (use of different constructors)
- Concatenation operator

Programs using the different

constructors and methods of the
10th
- Some methods of the String class (length, charAt, equals, toString, indexOf, substring)
String class. week

Chapter 5: Arrays and Vectors (12 hrs)

- The tables
- Creation and use of tables
11th
Definition and declaration
week
Initialization of tables
Allocation of tables

Multidimensional arrays
The length variable - Perform operations on tables
12th
week
Pass from arrays to methods
- The vectors
Vector builders - Creation of instances of 13th
Vector and use of its methods
· Vector methods: addElement, insertElementAt, elementAt, setElementAt, removeElementAt, size, week
contains, indexOf, lastIndexOf.

Creation of superclasses and

Chapter 6: Legacy (4 p.m.) subclasses

Using super and redefined

- The basics of inheritance
methods

Super classes and subclasses

14th
Access control and inheritance
week
References of superclass and subclass instances
Use of the keyword super
- Multi-level inheritance

- Overriding methods
Dynamic method dispatch Applications
15th
- The protected access modifier
week
- Abstract classes and methods (abstract modifier).
Using abstract superclasses
16th
- Inheritance and the final modifier
- The Object class, some methods of this class (equals, toString,)
week
- The instanceof operator

17th
- The subclasses of Number (Integer, Double): constructors and constants MIN_VALUE, Applications
MAX_VALUE; Double's methods: parseDouble; Integer's parseInt method. week

Chapter 7: Interfaces and packages (6 hrs)

- Interface and class
Definition of an interface
Using interfaces
18th
Characteristics of an interface week
Implementation of an interface
Interface and heritage
:
- Packages Creating packages

Creation of a package Import the classes of a package 19th

Using the members of a package (import) week
Hierarchy and Packages

Chapter 8: Exceptions (4 hrs) Programs for:

- Capture and process
- What is an exception
exceptions

- Use several catch blocks with

- The Throwable class and the exception hierarchy, the Exception and Error subclasses
a try block 20th
- Types of exceptions, the RuntimeException class and examples of its subclasses - Generate exceptions week
- The try and catch blocks - Use finally block
- The throws instruction
- The finally block

Practical work
The first two sessions are reserved for the installation of Java
- Installation constraints
- Installation of a Java editor

- Presentation of the main tasks of the editor: Writing a program, saving, compilation and execution

The other practical sessions must follow the course and the tutorial
exercises.
Teaching methods
Lessons: Two sessions of 2 periods per week, one for the lesson and
the other for the guided exercises.
Practical work: One session of 2 periods per week.
Assessment methods
Written exams
Bibliographical references
- Java programming / Jean François Macary - Cederic Nicolas / Eyrolles 1996.
- From C / C ++ to java / ETEKS 1997-2000

- Java programming, concepts and application / Patrick naughton - Rita Noumeir Chenelière / McGraw
Hill Montreal - Toronto

- Java2 - Le MAGNUM / Laura Lemay and Rogers Cadenhead /

CAMPUSPRESS editions
- Programming in Java, Claude Delanny, Edidition Eyrolle 2004
Web references
http://docs.oracle.com/javase/tutorial/java/TOC.html
http://java.developpez.com/cours/
Bruce Eckel, Thinking in Java, downloadable from http:
//www.bruceeckel.com

Operational research
40 hours
Material description
:
This course provides an introduction to modeling and solving decision
and optimization problems using the tools of operations research.
Objective of the subject
This course deals with optimization problems using scientific methods
and techniques made available to the analyst-programmer to find
optimal solutions to management problems (linear programming,
transport networks, queues, …), Marketing (game theory,…),
corporate finance (network analysis, allocation problem,…),
production, etc. It makes it possible to formalize and structure a
decision problem, to find and interpret the solutions.
Prerequisites
Basics of linear algebra
Skills and Abilities (Learning Outcomes)
The course aims to provide an introduction to operations research and
more particularly to aspects of mathematical modeling, through tools
such as linear programming and integer programming. Emphasis will
be placed on general modeling methodology and applications
Contents
2 periods per week
<Guided No
Chapters
exercises> week
Chapter 1: Decision-making in operations research
Exercises on the
1st
1.1 Definition of operational research steps to follow to
week
study an OR
1.2 Optimization problems.
problem.
1.3 The formulation of the problems.
Chapter 2: Linear Programming (16 hrs)
2nd
2.1 Formulation of linear programs. Applications
week
2.2 Construction of a mathematical model.
Exercises on the 3rd
2.3 Method of graphic resolution of a linear programming problem.
graphic method week
Exercises on the 4th
2.4 The simplex table
simplex method: week
2.5 Simplex resolution algorithm
Exercises on the 5th
2.5.1 Case of a maximization with constraints of the smaller or equal
simplex method: week
type.
2.5.2 Case of a minimization with constraints of the greater or equal Applications 6th
type. week
2.5.3 Model of resolution in the general case. 7th
Applications
2.5.3.1 Penalty technique M. week
8th
:
2.5.3.2 Two-phase technique. Applications
week

Chapter 3: The Transportation Problem (10 hrs)

3.1 Definition of the transport problem. 9th
Applications
3.2 Model with a single asset week
3.2.1 Balanced model.
10th
3.2.2 Unbalanced model. Applications
week
11th
3.3 Model with several goods. Applications
week
12th
3.4 Optimal solution (maximization and minimization) of transport Applications
week
Exercises on
3.4.1 Basic solution (initial solution or starting solution)
methods:
3.4.1.1 Northwest corner method. 1) Northwest 13th
3.4.1.2 Least cost method. 2) Lower costs. week
3) Vogel
3.4.1.3 Penalty method or Vogel method.
approximation
14th
3.5 The optimization test. Applications
week
Chapter 4: Graph Theory (10 hrs)
4.1 Definition of graphs.
15th
4.2 Definition of a network. Applications
week
4.3 Field of use of graphs in operations research.
4.4 The valued graphs.
4.5 Representation of graphs (sagittal, tables, matrices,…). Exercises to
determine the tree 16th
4.6 Minimum distance tree technique. at minimum week
distance
Exercises to
4.7 Problem of the shortest path.
determine: 17th
4.8 Problem of the longest path. - shortest path. week
- the longest way.
Exercises to
18th
4.9 Maximum flow problem. determine the
week
maximum flow.
Exercises to build
Chapter 5: Scheduling problem (10 hrs)
the PERT graph
Exercises to give
5.1 Concept of a project. the critical path,
critical tasks 19th
5.2 Concept of an activity. week
:
5.3 Representation of a project by a PERT network.
5.4 Critical activity.
5.5 Critical path and non-critical path.
5.6 Evaluation and interpretation of margins. Exercises to
determine the total 20th
5.7 Improving a project at the lowest cost. margin and the free week
margin.
Teaching methods
Classes and Exercises
Assessment methods
Written exams
Bibliographical references
- Operational research / Doctor Wadad SAAD / edition: Dar Bilal,
1998
- Operations research / Richard BRONSON, Govindasami
NAADIMUTHU
Edition: Schaum's Outline Series, McGRAW-HILL

Networks
80 hours
Material description
This subject is an introduction to the world of computer networks. It
constitutes a basic core of “network” knowledge, the understanding of
which is essential, because all the concepts presented are used in
current and future networks.
Objective of the subject
Definitions, motivations, applications, architectures
Physical transmission of information: signal processing, digital /
analog signal, coding, data circuit, signal multiplexing
· Transmission reliability: error control, security.
Standardization: OSI models
Local networks: wiring plan, topology, addressing, methods of
access to the communication medium,
· Network interconnection: interconnection equipment (routers,
switches, bridges, concentrators). Illustration with Ethernet.
· Long-distance networks: switching techniques, addressing,
routing.
TCP / IP protocols
· Examples of applications: http, mail; network access for users.
Prerequisites
:
Computer skills.
Skills and Abilities (Learning Outcomes)
At the end of this course, the student will be able to analyze, design,
identify the elements of a network and configure a small local
network and be familiar with the advanced notions of the network
concept.
Contents
4 periods per week
<Guided No
Chapters
exercises> week
Chapter 1: Introduction (4 hrs)
1st
1.1. Course objective
week
1.2. Remote data processing
1.2.1. In deferred time
1.2.2. In real time
1.3. The contribution of telecommunications to IT
1.3.1. Remote access to computer systems
1.3.2. Interconnection of IT systems
1.3.2.1. Resource sharing
1.3.2.2. Load sharing
1.3.2.3. Exceeding the limitations of timetables and geographical
distances.
Chapter 2: Telecommunications (2 p.m.)
2.1. Communication techniques
2.1.1. Communication patterns Exercise on
2.1.2. Definition Amplitude, 2nd
2.1.3. Coding and signals frequency and week
2.1.3.1. Analog signals phase modulation
2.1.3.2. Digital signals (NRZ, NRZI, Bipolar, Manchester,
Manchester Differential)
Exercise on
Amplitude,
2.1.4. Signal transmission
frequency and
phase modulation
2.1.4.1. Modulation and coding
2.1.4.1.1. Bandwidth: Definition, frequency, hertz
2.1.4.1.2. Signal transmission media
Knowing how to
2.1.4.1.3. Guided signal propagation
manufacture cables
2.1.4.1.4. Coaxial cables 3rd
week
2.1.4.1.5. Twisted peer cables
:
2.1.4.1.6. Optical fibers
2.1.4.1.7. Free signal propagation
2.1.4.1.7.1. Radio links
2.1.4.1.7.2. Hertzian links
2.1.4.1.7.3. Infrared links

2.1.4.1.7.4. Microwave
2.1.4.1.7.5. Satellites
Maximum
2.1.4.2. The transmission transmission
capacity exercise
2.1.4.2.1. Analogue or digital
2.1.4.3. The quality of service
Calculation of the
2.1.4.3.1. The quality of the transmission 4th
Error Rate
week
2.1.4.3.2. Errors in transmission
Single and double
2.1.4.3.2.1. Noise in messages, definition and examples
parity
2.1.4.3.2.2. Error rate
2.1.4.3.2.3. Error detection
2.1.4.3.2.4. Correction of errors
2.1.4.4. The direction of transmission
2.1.4.4.1. Simplex
2.1.4.4.2. Half Duplex
2.1.4.4.3. Full Duplex 5th
Applications
2.1.4.5. Switching techniques week
2.1.4.5.1. Circuits
2.1.4.5.2. Packages
2.1.4.6. Routing and addressing

Chapter 3: Telecommunication networks (24h)

3.1. Standardization of data network access interfaces

3.1.1. The seven layers of the OSI model, with diagram
3.1.1.1. Definition
3.1.1.2. Schematics
3.1.1.3. Roles of the main layers 1, 2, 3
3.1.1.3.1. Layer 1 (Physical)
Error detection /
3.1.1.3.1.1. Means of transmission
correction exercises
3.1.1.3.1.2. Analogue and digital transmission
3.1.1.3.1.3. Transmission and switching
3.1.1.3.2. Layer 2 (Bond) SNMP
:
3.1.1.3.2.1. Model 6th
3.1.1.3.2.2. Error detection and corrections week
3.1.1.3.2.3. Physical addressing (MAC)
3.1.1.3.3. Layer 3 (Network)
3.1.1.3.3.1. Model
3.1.1.3.3.2. Logical addressing (IP)
3.1.2. The TCP / IP model
3.1.2.1. The 4 layers of the TCP / IP model, with diagram
3.1.2.1.1. Definition
3.1.2.1.2. Schematics
3.1.2.1.3. Roles of layers
3.1.2.1.3.1. Application (http, smtp, ftp, DNS, ..)
3.1.2.1.3.2. Transport (TCP, UDP)
3.1.2.1.3.3. Internet (IPv4, IPv6)
3.1.3. Standardization bodies
3.1.3.1. Definition
3.1.3.2. Role
7th
3.2. Local area networks (LAN) Applications
week
3.2.1. General characteristics
3.2.1.1. Definition
3.2.1.2. Functioning
3.2.2. The architecture of local networks
3.2.2.1. Flow of information conveyed
3.2.2.2. Sharing of network resources, multiplexing.
3.2.2.3. Access protocols (introduction and example)
8th
3.2.2.3.1. Token ring (IBM) Applications
week
3.2.2.3.2. TCP (Transmission Control Protocol: Datagram and
application services)
3.2.2.4. Ethernet
3.2.2.5. Fast Ethernet
3.2.2.6. Gigabit Ethernet
3.2.2.6.1. Random or CSMA / CD (Carrier Sense Multiple Access
with Collisions Detection)
3.2.2.6.2. Time Division Multiplexing (TDMA)
3.2.2.6.3. Optical transmission WDM (WaveLength Division
Multiplexing)
3.2.2.6.4. FDM (Frequency Division Multiplexing) Applications
9th
week
3.2.2.7. The topology of local networks
3.2.2.7.1. The ring configuration
3.2.2.7.2. Linear bus configuration
3.2.2.7.3. The star configuration
:
3.2.2.7.4. The active tree
3.2.2.7.5. The backbone
3.2.2.8. Examples of network management software
3.2.2.9. Equipments
3.2.2.9.1. The wiring
3.2.2.9.2. The connectors
3.2.2.9.3. The network card 10th
Applications
3.2.2.9.4. The terminals week
3.2.2.9.5. Hubs, switches, bridges.
3.2.2.10.Cabling plans
3.2.2.11. Installation constraints
3.2.2.12. Current market trends
3.3. IP addressing
3.3.1. Classful
IP Addressing
3.3.2. Cassless Exercises (VLSM -
CIDR) 11th
3.3.2.1. VLSM week
3.3.2.2. CIDR
3.3.3. Internal subnets
3.3.4. Assignment of IP addresses
3.3.5. Resolving an IP address - hardware address
Chapter 4: Network interconnection (10 hrs)
4.1 Introduction.
4.2 LAN to LAN Direct application
4.2.1 Definition
4.2.2 Examples
12th
4.3 LAN to WAN.
week
4.3.1 Definition
4.3.2 Routing
4.3.2.1 Direct and indirect routing
4.3.2.2 Static and dynamic routing
4.3.3 Examples
4.4 WAN to WAN.
4.4.1 Definition
4.4.2 Examples 13th
Direct application
4.5 Interconnection functions week
4.5.1 Problem of different protocols: list the cases.
4.5.2 Error handling.
Chapter 5: Network security (4 p.m.)
5.1 Risks and threats on the networks (definition, examples).
:
5.1.1 Incorrect routing.
5.1.2 Trojan Horse.
5.1.3 Logic bomb.
5.1.4 Compromise.
5.1.5 Fraud.
5.1.6 Backdoor.
14th
5.1.7 Viruses.
week
5.1.8 Denial of Service
5.2 Services (definition and example)
5.2.1 Confidentiality of transmission.
5.2.2 Authentication of the issuer.
5.2.3 Non-repudiation of a message.
5.2.4 Data integrity
5.2.5 Authorization
5.2.6 Availability
5.3 Electronic signature.
5.3.1 Definition.
5.3.2 Example.
5.4 Risk assessment.
5.4.1 Definition.
5.4.2 Difficulties. 15th
5.5 VLAN (Concept and purpose) week
5.6 Firewalls
5.6.1 Definition.
5.6.2 Utilities.
5.6.3 Uses.
5.6.4 Examples.
5.7 Proxies
5.7.1 Definition.
16th
5.7.2 Utilities.
week
5.7.3 Uses.
5.7.4 Examples.
5.8 Intrusion detectors:
5.8.1 Definition.
17th
5.8.2 Utilities.
week
5.8.3 Uses.
5.8.4 Examples.
Chapter 6: The Internet World (10 hrs)
6.1 Internet.
6.1.1 Definition.
:
6.1.2 Internet network utilities. 18th
6.1.3 Areas of use. week
6.1.4 Network management.
6.1.5 Topology.
6.1.6 Examples.
6.1.7 Internet Service Provider.
6.2 Intranet.
6.2.1 Definition.
6.2.2 Utilities of the Intranet network.
6.2.3 Areas of use.
6.2.4 Examples.
19th
6.3 Extranet.
week
6.3.1 Definition.

6.3.2 Utilities of the Extranet network.

6.3.3 Areas of use.
6.3.4 Examples.
6.4 Infranet.
6.4.1 Definition.
6.4.2 Utilities of the Infranet network.
6.4.3 Areas of use.
6.4.4 Examples. 20th
6.5 VPNs (Virtual Private Network). week
6.5.1 Definition.
6.5.2 Utilities of a VPN.
6.5.3 Areas of use.
6.5.4 Examples.
Teaching methods
Lecture.
Assessment methods
Written tests and exams
Bibliographical references
· Computer Networks / Andrew S. Tanenbaum / Prentice Hall
Publishing.
French versions: Networks: Architectures, protocols, applications
· Computer Networks and Internets / Douglas E. Comer /
Second Edition.
· The Networks / Guy Pujolle / Editions Eyrolles.
Internetworking, a guide to networks communications / Mark A.
Miller, PE
IT for Accounting and Management / Eliane Bernard.Fanouillet
:
and Faouzi Boufares / Editions Eska
· Computer and Network Technology (corrected courses and
exercises) / Dunod.
Web references
http://cours.toocharger.com/cours/informatique/reseaux/
http://ressources.iamm.fr/udet/udet2000/udet2000/ressources/thomas/internet/internet.pdf
http://www.commentcamarche.net/

Web programming
80 hours
Material description
This topic describes the HTML5 markup language and JavaScript
language syntax.
Objective of the subject
This subject provides students with the basic knowledge of Internet
application development using HTML5 and CSS3 and JavaScript.
Prerequisites
Computer literacy on the use of browsers
Skills and Abilities (Learning Outcomes)
At the end of this subject the student will be able to:
- Create an HTML document, establish an appropriate format for
the subject and highlight it.
- Capture, insert images and model them.
- Insert and manipulate tables.
- Ensure internal and external links with the available tools.
- Insert and adopt multimedia objects.
- Manage forms (creation of form, call for programs, etc.).
- Interact with the HTML document
Contents
4 periods per week
No
Chapters <Practical work>
week
Part 1: Basics of HTML5 (2 p.m.)
1st
1. How do you go about creating websites? (2 hrs)
week
1.1. How do websites work?
1.2. HTML and CSS: two languages for creating a website
1.3. The role of HTML and CSS
1.4. The different versions of HTML and CSS
1.5. The text editor
:
1.6. Browsers
1.7. Why the browser is important
1.8. Computer browsers
1.9. Mobile browsers
2. Your first web page in HTML (2 hrs)
2.1 Create a web page with the editor
2.2 Tags and their attributes
2.3 Tags
2.4 Attributes
2.5 Basic structure of an HTML5 page
2.6 The doctype
2.7 The <html> tag
2.8 The header <head> and the body <body>
2.9 Comments
2.10 Insert a comment
3. Organize your text (4 h)
3.1 Paragraphs
3.2 Skip a line
3.3 Titles
2nd
3.4 Development
week
3.5 Mark the text
3.6 Bulleted lists
3.7 Unordered list
3.8 Ordered list
4. Create links (4 hrs)
4.1 A link to another site
4.2 A link to another page of its site
4.3 Two pages located in the same folder
4.4 Two pages located in different folders
3rd
4.5 A link to an (internal) anchor
week
4.6 Link to an anchor located on another page
4.7 Practical cases for the use of links
4.8 A link that opens in a new window
4.9 A link to send an email
4.10 A link to download a file
5. The images (2 h) Half
4th
5.1 The different image formats
week
5.2 JPEG
5.3 PNG
5.4 GIF
:
5.5 Mistakes to avoid
5.6 Insert an image
5.7 Add a tooltip
5.8 Clickable thumbnail
Part 2: formatting with CSS. (8 p.m.)
6. Set up the CSS (6 hrs) Half
4th
6.1 The short history of CSS
week
6.2 What is CSS for? +
5th
6.3 CSS: difficult beginnings
week
6.4 CSS: browser support
6.5 Where do we write CSS?
6.6 In a .css file (recommended)
6.7 In the <head> header of the HTML file
6.8 Directly in the tags
6.9 Which method to choose?
6.10 Apply a style: select a tag
6.11 Apply a style to multiple tags
6.12 Comments in CSS
6.13 Apply a style: class and id
6.14 Universal beacons
6.15 Applying a style: advanced selectors

7. Text formatting (4 hrs)

7.1 Size
7.2 An absolute size
7.3 A relative value
7.4 Police
7.5 Changing the font used
7.6 Using a custom font with @ font-face
6th
7.7 Italics, bold, underline ...
week
7.8 Italicize
7.9 Make bold
7.10 Underlining and other decorations
7.11 Alignment
7.12 Floats
7.13 Floating an image
7.14 Stop a float
8. The color and the background (4 h)
8.1 Text color
:
8.2 Indicate the name of the color
8.3 Hexadecimal notation
8.4 The RGB method
8.5 Background color
8.6 CSS and inheritance
7th
8.7 Example of inheritance with the <mark> tag
week
8.8 Background images
8.9 Apply a background image
8.10 Options available for the background image
8.11 Combine properties
8.12 Multiple background images
8.13 Transparency
8.14 The opacity property
8.15 The RGBa notation
9. Borders and shadows (4 hrs)
9.1. Standard borders
9.2. Rounded edges 8th
9.3. The shadows week
9.4. box-shadow: the shadows of the boxes
9.5. text-shadow: the shadow of the text
10. Creating dynamic appearances (2 hrs)
10.1. On the fly.
10.2. On click and on selection
10.3. : active: when clicked

10.4. : focus: when the element is selected

10.5. When the link has already been visited
Part 3: Site layout (2 p.m.)
11. Structure a page (2 hrs) 9th
11.1. HTML5 structuring tags week
11.2. <header>: the header
11.3. <footer>: the footer
11.4. <nav>: main navigation links
11.5. <section>: a page section
11.6. <aside>: additional information
11.7. <article>: an independent article
11.8. Concrete example of the use of beacons
12. The box model (4 h)
12.1. Block and inline tags
12.2. Some examples
12.3. Universal beacons
:
12.4. The dimensions 10th
12.5. Minimum and maximum week
12.6. Margins
12.7. Center blocks
12.8. When it exceeds ...
12.9. overflow: cut a block
12.10. word-wrap: cut texts that are too wide
13. Positioning in CSS (4 h)
13.1. Floating positioning
13.2. Transform your elements with display
13.3. Inline-block positioning 11th
13.4. Absolute, fixed and relative positioning week
13.4.1. Absolute positioning
13.4.2. Fixed positioning
13.4.3. Relative positioning
14. Practical work: creation of a site step by step (4 h)
14.1. Design mock-up
14.2. Organize content in HTML
14.3. Format in CSS
14.4. Custom fonts
14.5. Definition of main styles
14.6. Header and navigation links
14.7. The banner 12th
14.8. The body week
14.9. The footer

14.10. Ensure compatibility with IE

14.11. Make HTML5 structuring tags work
14.12. Adjust inline-block positioning
14.13. Check validity
14.14. The final code
Part 4: Advanced features (16 hrs)
13th
15. Tables (4 h)
week
15.1. A simple table
15.2. The header row
15.3. Table title
15.4. A structured table
15.5. Divide a big board
14th
16. Forms (8 h)
week
:
16.1. Create a form
15th
16.2. Basic input areas
week
16.3. Single line text box
16.4. The labels
16.5. Some additional attributes
16.6. Password area
16.7. Multiline text box
16.8. The enriched input zones
16.9. File
16.10. E-mail
16.11. URL
16.12. Phone number
16.13. Number
16.14. Rank
16.15. Color
16.16. Dated
16.17. Research
16.18. Option items
16.19. Check boxes
16.20. The options areas
16.21. Drop-down lists
16.22. Finalize and send the form
16.23. Group fields
16.24. Automatically select a field
16.25. Make a field mandatory
16.26. The send button
17. Video and audio (4 hrs)
17.1. Audio and video formats
17.2. Audio formats 16th
17.3. Video formats week
17.4. Inserting an audio clip
17.5. Inserting a video
Part 5: JavaScript (4 p.m.) Practical work
on inserting scripts
18. Introduction to JavaScript (2 hrs) in an HTML Half
document
17th
18.1. Insertion of JavaScript code in the HTML page.
week
18.2. The <SCRIPT> tag
18.3. Comments
:
18.4. The methods, write and writeln
19. Variables, constants and strings (2 h) Half
17th
19.1. The concept of a variable
week
19.2. The variable declaration
19.3. Data types in variables Using variables
19.4. Reserved names
19.5. Global variables and local variables
19.6. Constants
19.7. Strings
20. Operators and conditional structures (4 h) Practical work
on operators and
20.1. Calculation operators
instructions
20.2. Assignment operators
20.3. Increment operators
20.4. Comparison operators
20.5. Logical operators (booleans)
20.6. Concatenation operators 18th
20.7. The priorities week
20.8. If statement
20.9. If ... else statement
20.10. Buckles
20.10.1. For loop
20.10.2. While statement
20.10.3. Unconditional jump
20.10.4. Unconditional stop
21. Operators and conditional structures (4 h) Practical work
on operators and
21.1 Calculation operators
instructions
21.2 Assignment operators
21.3 The increment operators
21.4 Comparison operators
21.5 Logical operators (booleans)
21.6 concatenation operators 19th
21.7 Priorities week
21.8 if statement
21.9 if ... else statement
21.10 Loops
21.10.1 for loop
21.10.2 while statement
21.10.3 Unconditional jump
:
21.10.4 Unconditional shutdown
22. The events (4 h)
21.1. What do we call an event
21.2. Window events
21.2.1. onLoad
21.2.2. onUnload
21.2.3. onResize
21.3. Mouse events
21.3.1. onClick
21.3.2. onDbleClick
Practical work on 20th
21.3.3. onMouseDown
events week
21.3.4. onMouseUp
21.3.5. onMouseOver
21.3.6. onMouseOut
21.4. Form events
2.1.4.1 onFocus
2.1.4.2 onBlur
2.1.4.3 onChange
2.1.4.4 onReset
2.1.4.5 onSubmit
23. Functions (2 h) Practical work
on writing and
23.1 The notion of function
calling a function
23.2 The declaration of a function
23.3 Function call
23.4 The parameters of a function
23.5 The this keyword
23.6 Applications Practical work
on objects with the
association of an
24. Objects (2 hrs)
event and the call of
a function
24.1 Concept of object
21st
24.2 Objects and their hierarchy
week
24.3 Object properties
24.4 Browser objects
24.5 The window object
24.5.1 The properties of the window object
24.5.2 The methods of the window object
24.6 Dialog boxes. A global project.
24.6.1 The alert () method
:
24.6.2 The confirm () method
24.6.3 The prompt () method
24.6.4 The particularities of the string object
24.7 The properties of the string object
24.8 Applications
24.9 Project
Teaching methods
This subject must be taught in a computer lab, most of it is a practical
part, exercises applied on computers.
A computer equipped with a text editor (Notepad, Notepad ++,…) a
browser (IE, Firefox,…)
Assessment methods
- The teaching methods used (practical work, lectures, personal work,
etc.) allow knowledge to be acquired.
- The teacher clearly defines the concepts used.
Bibliographical references
- Special Edition Using Intranet HTML / Mark Surfas, Mark Brown
and John Juge
- Dynamic HTML Web Magic / Jef Douyer - Hayden development
group
- http://www.w3schools.com/html/html5
- Javascript programmer's reference –Alexei White
- Javascript Poket Reference-Oreilly David Flanagan
- Internet & World Wide Web how to program - Dietel & Dietel

Programming in VB.net
40 hours
Goal
The objective of the course is to teach students to carry out programs
in Visual Basic (VB) and to develop a management application using
a database.
Contents
Chapters No week
Chapter 1: Error handling (4 h)
1.1 Definition and general view 1st week
1.2 Error-handling techniques
1.3 The Err Object
2nd week
1.4 Examples
Chapter 2: Creating "Crystal reports" (12 h) 3rd week
2.1 Create a report using Crystal Reports
:
2.2 Display an already created report. 4th week
2.3 Add calculated fields to a report 5th week
2.4 Print or export a report using Visual Basic. NET. 6th week
2.5 Determine which documents will be printed during execution. 7th week
2.6 Label printing and record printing order control. 8th week
Chapter 3: SQL language (2 p.m.)
3.1 The SELECT command 8th week
3.2 The WHERE command 10th week
3.3 The ORDER BY command 11th week
3.4 Merging data from several tables: INNER JOIN 12th week
3.6 The INSERT command 13th week
3.7 The UPDATE command 14th week
3.8 The DELETE command 15th week

Chapter 4: Building a project using Visual basic.net (10 hrs) 5 weeks

Bibliographical references
- [eBook] Beginning Visual Basic .NET Database Programming
(Wrox (
- Database Programming with Visual Basic .NET and ADO.NET
- Tips, Tutorials, and Code (Sams)
- Sams_Teach_Yourself_VISUAL_BASIC_.NET_in_24_Hours
- Visual Basic .NET How to Program 2E

Operating System - Windows

40 hours
Material description
This course is a hands-on introduction to using the Windows
operating system. Class will include lectures and lab sections In this
course, students study the fundamentals of the Windows operating
system, such as managing user accounts and system security (Creating
users, Creating user groups, guarantee groups of Users, guarantee and
revoke access privileges on different files and resources to different
users and user groups.
Objective of the subject
This course aims to familiarize the student with the services provided
by Windows operating systems. The student will have to implement,
by means of these different services, more elaborate applications or
management techniques implemented in certain operating systems. In
addition, this course will allow each student to be more efficient in
:
their work in Windows by using the appropriate tools. At the end of
the course, the TS Informatique de Gestion student may be considered
an informed user.
Prerequisites
In order to follow this course without difficulty, it is advisable to be
familiar with the basic use of an operating system (DOS, Macintosh,
Windows ...).
Contents
No
Chapters <Practical work>
week
Chapter 1: Introducing Windows (2 hrs)
1.1 Historical introduction (historical evolution of Windows 1st
until reaching the last version of Windows). week
1.2 Difference Between Windows Professional, Server.
1.3 The client-server model and the peer-to-peer model.
1.4 Use of administration tools
1.5 Using Windows Help
Chapter 2: Local User Account Configuration (2h)
2.1 Overview of user accounts
Creation of local 2nd
2.2 Requirements for new user accounts
users week
2.3 Defining the requirements for passwords
2.4 Configuring the properties of user accounts
· Creation of local
Chapter 3: Using Groups to Organize User Accounts (2 hrs)
groups
Add users to
3.1 Presentation of groups
groups 3rd
3.2 Implementation of group policies week
3.3 Group implementation
3.4 Implementation of local groups
3.5 Implementation of predefined groups
· Assign NTFS
Chapter 4: Disk Resource Administration (10h) permissions for
users and groups.
· Test NTFS
4.1 Disk partitioning
permissions.
4th
· Explain what
week
happens to NTFS
4.2 Fat, NTFS partitioning permission when
copying or moving
files and folders.
:
4.3 Comparison between Fat and NTFS
4.4 Convert from Fat to NTFS 5th
4.5 NTFS authorization. week
4.6 Using NTFS permissions 6th
4.7 Applying NTFS permissions by Windows week
4.8 Copying and moving files and folders · Share a folder.
· Assign sharing
4.9 Resource sharing permissions for
user and group.
· Connect to a
7th
shared folder.
week
· Finish sharing.
· Determine
effects using
share permissions
and NTFS
permissions.
4.10 Creating shared folders
8th
4.11 NTFS permissions and shared folders
week
4.12 Solving access problems
• Configure a
printer physically
Chapter 5: Administration of printing resources (6h)
attached to a print
server.
9th
• Configure a
week
5.1 Overview of printer administration printer attached to a
network.
• Configure printing
5.2 Managing permissions on printers
permissions.
10th
5.3 Printer management
week
11th
5.4 Managing documents in the print queue
week
• Assign disk quotas
Chapter 6: Managing Data Storage (2 hrs)
for user.
• Encrypt file using 12th
6.1 Managing disk quotas
EFS week
• Decrypt file using
6.2 Data encryption
EFS.
Chapter 7: Introduction to Active Directory in Windows server (2
hrs)
:
7.1 Presentation of Active Directory 13th
7.2 Logical structure of Active Directory week
7.3 Physical structure of Active Directory
7.4 Methods of Administering a Windows Server Network
Chapter 8: Configuring and Administering Users and Groups (8 Create user
hrs) accounts
8.1 Overview of user accounts and groups Create groups
· Create and use
8.2 User logon names "principal name
suffix" 14th
· Create multiple week
user accounts by
import usage.
· Administer
domain user
accounts.
15th
8.3 Creating multiple user accounts
week
8.4 Administering user accounts 16th
8.5 Using groups in Active Directory week
8.6 Strategies for using groups in a domain 17th
8.7 Troubleshooting domain user accounts and groups week
· Publish shared
Chapter 9: Publishing Resources in Active Directory (2 hrs) folders in Active
Directory.
· Publish shared
9.1 Overview of publishing resources printers in Active
Directory. 18th
week
9.2 Configuration and administration of published printers
9.3 Implementing Published Printer Locations
9.4 Configuration and administration of published shared folders
9.5 Comparison of published objects and shared resources
9.6 Resolving issues with publishing resources
· See permissions
Chapter 10: Delegation of administrative control (4 hrs) in "Active
Directory objects".
· Delegate
19th
controls for
10.1 Object security in Active Directory week
"organizational
unit".
:
10.2 Controlling Access to Active Directory Objects
10.3 Delegation of administrative control of Active Directory objects
10.4 Customizing Microsoft Management Console (MMC) 20th
10.5 Configuring task lists week
Teaching methods
Lecture
Directed work and practical work in the laboratory
Assessment methods
Practical tests
Bibliographical references
- Active directory 4th edition / Brian Desmond / joe Richards / Robbie
/ Allen.
- Inside Active directory 2nd edition / Sakari Kouti / Mika Seitsonen
- Microsoft Active Directory Administration / Kevin Kocis / SAMS
- Securing Windows server 2003 / Mike Danseglio
- Microsoft Windows Server 2003 / Brian Komar

System - Unix
40 hours
Material description
This course represents a practical introduction to using the UNIX
operating system with an emphasis on Linux command line skills.
The class will include lectures and laboratory sections. In this course,
students learn about the fundamentals of the UNIX operating system,
such as file editing, data recovery, runtime processes, creating
directories, managing user accounts and groups. , as well as the access
rights to the files. An introduction to shell scripts should be covered
depending on the curriculum.
Objective of the subject
This course aims to familiarize the student with the services provided
by the UNIX / LINUX operating systems. The student will have to
implement, by means of these different services, more elaborate
applications or management techniques implemented in certain
operating systems. In addition, this course will allow each student to
be more efficient in their work under UNIX by using the appropriate
commands. At the end of the course, the TS Informatique de Gestion
student can be considered as an informed user.

Prerequisites
In order to follow this course without difficulty, it is advisable to be
familiar with the basic use of an operating system (DOS, Macintosh,
...) and to have some notions of algorithms.
:
Contents
No
Chapters <Practical work>
week
Chapter 1: Applications to operating systems (2 periods)
1st
1.1 What is an operating system?
week
Installation of the
1.2 UNIX system vs LINUX
Linux system.
1.2.1 History, main characteristics, architecture, ... File creation
1.2.2 Installation Directory creation
Change from one
1.2.3 A Unix / Linux work session: Connection and Disconnection
directory to another
1.3 What is a process in Unix?
1.4 Files and directories in Unix
1.4.1 Nomenclature
1.4.2 Extension (eg letter.txt or letter.text)
1.4.3 Concept of several points (dot)
1.4.3.1 Having multiple extensions (letter.to.jim)
1.4.3.2 Hidden files or directories (.letter)
1.4.4 The root directory
1.4.5 Standard directories in Unix (/ etc, / bin, / usr, / dev, ...)
Chapter 2: The Text Editor VI (4 periods)
2nd
2.1 The two modes
week
Creating the text
2.1.1 The command mode
file using VI
2.1.2 The input method
2.2 Navigation
2.2.1 The arrow keys if possible or the use of the character keys (h, j,
k, l)
2.2.2 Page by page navigation (CTRL-d, CTRL-u, CTRL-b, CTRL-f)
2.2.3 Navigation in the file (start of file, end of file, start of line, end
of line, to a determined line)
2.3 The command mode commands, mainly:
2.3.1 Search for a string (/,?)
2.3.2 Repeat last search (n, N)
2.3.3 Substitute a string in the text (: s) without / with the global
option (/ g)
2.3.4 Save modifications (: w) 3rd
2.3.5 Exit the file with or without saving (: q,: qw,: q!) week
2.3.6 Inserting one text into another (: r)
:
2.3.7 Repeat the last command executed
2.3.8 Copy paragraph (nyy)
2.3.9 Paste (p, P)

Chapter 3: The general commands of 'UNIX'

(12 periods)
3.1 The essential commands
3.1.1 Date
Application on each 4th
3.1.2 Listing (ls) + Metacaracters
order week
3.1.3 Clear screen
3.1.4 Displaying the contents of a file (cat)
3.1.5 Show logged in users (who)
3.1.6 Display process status (ps)
3.1.7 Display the current directory (pwd)
3.1.8 Creating a directory (mkdir)
5th
3.1.9 Change directory (cd)
week
3.1.10 Copy a file (cp)
3.1.11 Move a file (mv)
6th
3.1.12 Delete file / directory (rm, -i, -r, rmdir)
week
3.1.13 Displaying disk usage (df, du)
3.1.14 Compare and differentiate different files (cmp, diff) 7th
3.1.15 Find a string in multiple files (grep) week
3.1.16 Find a file in different directories (find)
3.1.17 Sorting the contents of a file (sort) 8th
3.1.18 head, tail, cut, touch. Ln, less, alias, unalias week
3.2 Online help (man)
3.3 Redirection (standard output, standard input, standard error, etc.) 9th
NB: For orders where the options are not mentioned, they are all week
requested.
Chapter 4: Shell scripts (14 periods)
4.1 Introduction of grouped orders and notion of batch 10th
4.2 The read instruction week
4.3 The display instruction (echo)
4.4 Conditions
4.4.1 Simple choice (if, elif) 11th
4.4.2 Multiple choice (box) week
4.5 The test command (test and its derivatives)
4.6 Loops
12th
4.6.1 The loop for (for)
:
4.6.2 The while loop week
4.6.3 The repeat (until) loop
4.7 Logical operators
Application 13th
4.7.1 Operators on numbers
exercises week
4.7.2 Operators on files
14th
4.8 The 'Expr' instruction and its derivatives
week
15th
4.9 Exercises
week
Chapter 5: Users and groups (8 periods)
5.1 Concept of a user account and Unix
16th
5.1.1 The predefined super user Creating a user
week
5.1.2 Creating a user
5.1.3 Deleting a user
5.1.4 'HOME' directory Creating a group
5.1.5 The 'profile' file Modify a user
17th
5.1.6 The file (/ etc / passwd) Modify a group
week
5.1.7 Commands (id, groups) Change permissions
Change owners
5.2 Concept of user group Creating a group
5.2.1 Predefined groups Modify a group
18th
5.2.2 Add a group
week
5.2.3 Delete a group
5.2.4 The file (/ etc / group)
5.3 Access rights to a file or directory Change permissions
5.3.1 The 'rwx' signs Change owners
5.3.2 Modify these signs 19th
5.3.3 Change owner week
5.3.4 Modify the owner group
5.3.5 The 'umask' command
20th
5.4 Exercises
week
Bibliography
UNIX and operating systems / Michel Divay / Dunod
UNIX administration-programming / Micro application - General
ledger
SCO companion / James Mohr / Prentice Hall PTR.
· Computer systems, Coherent Vision / Christian Carrez /
Dunod.
Operating systems / Andrew tanenbaum / Dunod
:
· Peter Termöllen "Shell-Programmierung im Alleingang"
Springer Verlag ISBN 3-540-56344-X Springer-Verlag Berlin
Heidelberg New York
Web references
Http://www.doc.ic.ac.uk/~wjk/UnixIntro
Http://membres-
liglab.imag.fr/donsez/cours/se/unix_cmdunix.pdf
Http://www.loligrub.be/contrib/tlepoint/BASE
Teaching methods
· Lecture
Practical laboratory work
Assessment methods
Practical tests

Project Graduation
120 hours
Goals
The objective of the project is the realization by the students of a
concrete case in the field of IT management through the
experimentation of a work methodology and the use of the knowledge
acquired during their years of study in IT management.
This project will make it possible to put into practice the theoretical
notions acquired and to realize a real case taken from the world of
management.
Organization of the dissertation
At the end of the project, each group of students will have to hand in a
document and a CD.
The dissertation document must contain the following parts:
- Cover page.
- Summary.
- Foreword.
- Introduction (presentation and objectives of the project).
- Study of Opportunity.
- The different solutions offered.
- Modelization.
- Conclusion.
- Appendices (screens, reports, programs).
- Bibliography.
Some rules
- The style to be used in the production of the thesis is necessarily the
Font Times New Roman, Size 12.
:
- The pagination of the document of memory is obligatory.
- The document must contain at least 60 pages without appendices.
- The programming (source, executable code and data) must be
presented on a CD.
- The volume of work is mediocre (for example a minimum of 12
entities in the MCD model).
Methodology of work
The methodology to be followed for the realization of this project
is as follows:
- A precise definition of the field of the study is to be made in order to
be able to carry out completely the analysis and the development of
the chosen subject.
- An exact definition of the objectives to be achieved must be carried
out.
- You will have to follow the steps of the MERISE method:
Opportunity study (document, circulation, etc.).
Reviews and their new solutions.
Solution (configuration of the chosen RDBMS hardware, chosen
programming language).
Identification of processing rules.
Identification of integrity constraints.
Data dictionary.
Conceptual Data Model.
Conceptual Model of Treatments.
Logical Data Model (long, type,…).
Drawings and sequence of screens (in line with the programming).
Reports (in line with programming).
Programming.
Project implementation
The implementation of the project must meet the following main
criteria:
- The work must be done in groups of 2 or 3 people only.
- All members of a group must participate in all stages of the project.
development tools
- The programming language to use is VB.net.
- The configuration of the chosen material used must be mentioned in
the thesis document.
- The use of a relational database, meeting the criteria of the Database
course is mandatory.
Project volume
- The programming must cover all the part studied (analyzed).
- The project must automate 2 to 4 main tasks of the information
:
system.
Example: for the information system concerning an institute, the tasks
can be:
- Registration management
- Management of exams and grades.
- Management of teachers and their schedules.
: