Chapters 2 - 5 DB for Licence3 Students (Computer Science Dpt)

Chapter2
https://docs.google.com/file/d/0ByRRP-MOJNvFc0l5VVFUMFMyM3M/edit?usp=sharing

Chapter 3

https://docs.google.com/file/d/0ByRRP-MOJNvFYzZUMDJpZ2tJbnc/edit?usp=sharing

Chapter 4
https://docs.google.com/file/d/0ByRRP-MOJNvFYkVYWW9sZGljVGc/edit?usp=sharing

Chapter 5
https://docs.google.com/file/d/0ByRRP-MOJNvFNVRDalVhTXpMR1E/edit?usp=sharing

Course DataBase L2. Chapter1

This course is intended to the student of Licence 2 (Computer Science Dpt) at univ. of Biskra. Chapter 1 is included with this message : following this link:
https://docs.google.com/file/d/0ByRRP-MOJNvFMDZXVmFlNlYxMU0/edit?usp=sharing

Complex Systems Cours, M2IA (First TP)

Let Vehicle Routing Problem.
1. Using benchmark C101 -and its descriptive file- (two files attached below), propose the appropriate data structure to encode one solution.
2. To solve VRP using a Greedy Approach, develop a C++ program.   
Good luck.

https://docs.google.com/open?id=0ByRRP-MOJNvFdWpEZzVDYUVSYzQ
https://docs.google.com/open?id=0ByRRP-MOJNvFRzRoMmV2MnlFVWc

Présentation de la visio-conférence (en PDF)

Suite à la programmation d'une visio-conférence intitulée: Data warehousing: défis et pistes de solutions, qui aura lieu le Mercredi 22 février 2012 à 15h00 à la salle des visio-conférences (Bloc d'architecture), nous mettons à la disposition de nos chers collègues et étudiants (lien ci-dessous) la présentation sous format PDF https://docs.google.com/open?id=0ByRRP-MOJNvFMThkNDAzMTYtYzNlNC00OWEyLTk5YjMtYWJhM2M5MTllNGU2 .
Merci.

Real time system: First chapter

The link below presents the first chapter intended to the Master 1 student (computer science dpt) 2011/2012.

https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0ByRRP-MOJNvFZDdkMzc1ZDAtMzhkNi00NmQ1LTg3ZDYtZWZhOTU2NWEzZGNk&hl=en

Symetric TSP Complexity

Following the symetric TSP complexity question, it can be calculated as follows:
For Cities: A, B, C, D, E:
The path EABCDE is equal to the path: EDCBAE because of its symetry: (EAB|CDE) --> = <-- (EDC|BAE).
Then, the obteined number 24 paths should be devided by 2 to eliminate the half paths and then, the remainder number is 12 = (5-1)! /2 = (n-1)! /2 where: n is the number of cities.

Data warehouse Fourth Chapter: Data warehouse and data marts modeling

Cours (Chapter): Data warehouse (Fourth Chapter) is intended to Master 2, Option IDM.

Title: Data warehouse and data marts modeling

Language: French

Academic year: 2011/2012

https://docs.google.com/open?id=0ByRRP-MOJNvFMTYwMjQ5NmYtYzlkYy00ZmUzLTlmOGYtOGUzNDlkZDdjMTJj