SMI S4 FSAC. Série1 Les listes chaînées. Langage C. SMI S4 Les listes chaînées & 1

Size: px
Start display at page:

Download "SMI S4 FSAC. Série1 Les listes chaînées. Langage C. SMI S4 Les listes chaînées www.sitedutout.com & www.smia.ma 1"

Transcription

1 SMI S4 FSAC Langage C Série1 Les listes chaînées Dernière modification le : 5 avril 2012 à 11h22 Correction proposée par & SMI S4 Les listes chaînées & 1

2 Exo 1 : struct cellule int val; else return (1+longeur(l->suiv)); struct cellule *suiv; ; typedef struct cellule* liste; int vide(liste l) if(l==null) return 1; else return 0; Exo 2: struct cellule int val; struct cellule *suiv; ; typedef struct cellule* liste; int longeur(liste l) int cpt=0; liste p=l; while(p!=null) cpt++; return cpt; Exo 2 Version recursive: int longeur (liste l) If (l==null) return 0; Exo 3 : struct cellule int val; struct cellule *suiv; ; typedef struct cellule* liste void en tete (liste*l,int x) liste q; q=malloc(sizeof(struct cellule)); q->val=x; q->suiv=*l; *l=q ; Exo 4 : struct cellule int val; struct cellule *suiv; ; typedef struct cellule* liste void ajoute_au_milieu (liste l,int a, int x) liste p=l, nouveau ; SMI S4 Les listes chaînées & 2

3 while(p!=null && p->val!=a) if (P!=NULL) nouveau=malloc(sizeof(struct cellule)); nouveau->val=x; nouveau->suiv=p->suiv; p->suiv=nouveau; Exo 6 : struct cellule int val; struct cellule *suiv; ; typedef struct cellule* liste void supprime_milieu (liste l,int a) liste q,p=l; Exo 5 : struct cellule int val; struct cellule *suiv;; typedef struct cellule *liste void supprimer_en_tete (liste *l) liste p; if(*l==null) printf("pas de suppression") ; else p= *l; while(p!=null && p->val!=a) if (p!=null && p->suiv!=null) q=p->suiv; p->suiv=q->suiv; free(q); l= *l->suiv; free(p); Exo 7 (1): liste position(liste l,int n) liste p=l,q; int cpt=0; if (n==0) return NULL; else while (p!=null) && (cpt!=n) SMI S4 Les listes chaînées & 3

4 q=p; cpt++; Exo 8: struct cellule int val; struct cellule *suiv;; if (cpt==n) return(q); return NULL; typedef struct cellule *liste liste concatener(liste La,liste Lb) liste p=la,q=lb; if(la==null) return q; else while(p->suiv!=null) Exo 7 (2): struct cellule int val; struct cellule *suiv; ; p->suiv=q; return la; void incrementer(liste l) liste p=l,q; if(l!=null) while(p!=null && p->val==1) q=p; p->val=0; Exo 8 Version recursive: Liste concatene(liste La, liste Lb) liste p=la; if (La==NULL) return Lb ; else p=malloc(sizeof(struct cellule)); if(p==null) p=malloc(sizeof(struct cellule)): p->val=1; p->suiv=null; q->suiv=p; else p->val=1; p->val = La->val; p->suiv=concatene(la->suiv, Lb); return p ; Exo 9: struct cellule int val; struct cellule *suiv; ; liste(creer(t[],int n) int i; liste l,p,q; l=malloc(sizeof(struct cellule); l->val=t[o]; l->occ=1; SMI S4 Les listes chaînées & 4

5 l->suivant=null; i=1; while(p!=null && p->val!=t[i]) p=p->suivant; printf( %f, &Treel[i]); for(i=0;i<10;i++) scanf( %f,&timag[i]); if(p==null) p=malloc(sizeof(struct cellule)); p->occ=1; p->suiv=l; l=p; i++; else p->occ++; i++; b- struct cellule float reel; float img; struct cellule *suiv; ; typedef struct cellule *liste return(l); Exo 10: #include<stdio.h> a- void main() struct complexe float R; float I; ; struct complexe Tab[10]; float Treel[10], Timag[10]; Int i, j=0,k=0; for(i=o;i<10;i++) Scanf( %d,&tab[i]); for(i=0;i<10;i++) if(tab[i].i==0) Treel[j]=Tab[i].R; j++; elseif(tab[i].r==0) Timag[k]=Tab[i].I; k++; for(i=0;i<10;i++) struct Rcellule float Rval; struct cellule *suivant; ; typedef struct cellule *Rliste struct Icellule float Ival; struct cellule *lien; ; typedef struct cellule *Iliste void main() liste q=l; Rliste r,k=null; liste i,f=null; while(q!=null) r=malloc(sizeof(struct Rcellule)); i=malloc(sizeof(struct Icellule)); r->suivant=k; SMI S4 Les listes chaînées & 5

6 i->lien=f; k=r; f=i; q=q->suiv; typedef struct cellule* pliste ; pliste valide(liste l) liste q=l; pliste p=null, r ; Exo 11 : a- struct cellule int cne; int un; int deux; struct cellule *suiv;; typedef struct cellule* liste; b- int valide(liste l) liste p=l; int cpt=0; while (p!=null) if(p->un=1 && p->deux=1) cpt++; while(q!=null) if(q->un==0 && q->deux==1) r=malloc(sizeof(struct pcellule)); r->pcne=q->cne; r->pun=q->cne; r->pdeux=q->cne; r->lien=p p=r q=q->suiv; Exo 12 : a- struct celf char prenom[10]; int age; struct cellule *lien;; typedef struct celf * penfant; return cpt; c- struct cellule int cne; int un; int deux; struct cellule* suiv; ; typedef struct cellule* liste; struct pcellule int pcne; int pun; int pdeux; struct cellule *lien; ; struct celm char nom[10]; int pere; int mere; penfant enfant; struct cellule *suiv; ; SMI S4 Les listes chaînées & 6

7 typedef struct celm* liste; C Version Récursive: Int nombre (liste L) b- void naissance(liste l,char N,char pren) if(l==null) return 0; liste p=l; penfant q,r; else if (L->pere ==1 && L->mere==1) while(p!=null && p->non!=n) if(p!=null) q=p->enfant ; return (1+nombre(p->suiv)); else return (nombre(l->suiv)); if(q==null) q=malloc(sizeof(struct celf)); q->prenom=pren; q->age=0; p->enfant=q ; q->lien=null ; else while(q!=null) r=q; q=q->lien; q=malloc(sizeof(struct celf)); q->age=0; q->prenon=pren; q->lien=null; r->lien=q ; c- int occ(list l) if(l==null) return 0; else if(p->pere==1 && p->mere==1) return(1+occ(l->suiv)); else return(occ(l->suiv)); Exo 13 : Int a ; do printf( Entrer un entire ); scanf( %d, &a); while(a==0) l=malloc(sizeof(struct cellule)); l->val=a; l->suiv= NULL; scanf( %d,&a); while (a!=0) q=malloc(sizeof(struct cellule)); q->val=a; p=l; while (p!=null && a>=p->val) s=p; if(p!=null) if(p==null) SMI S4 Les listes chaînées & 7

8 q->suiv=p; l=q; else s->suiv=q; elseif(p==null) q->suiv=p; Exo 15 : Void supprimer(liste *l, int x) Liste p=*l,q ; s->suiv=q; q->suiv=null; scanf( %d, &a); While(p!=NULL && p->val==x) q=p ; P=P->suiv ; If(p!=NULL) p->preced=null; Free(q); Exo 14 : Typedef struct cellulefloat val ; Struct cellule*suiv ; Strcut cellule*preced ; *liste ; Void inserer(liste l, float x, float a) liste l, nouveau ; while(p!=null && p->val!=a) if(p!=null) nouveau=malloc(sizeof(strcut clllule)) ; nouveau->val=x; *l=p While(p!=NULL) If(p->val==x) q=p; (p->preced)->suiv)=p->suiv; If(p->suiv!=NULL) ( p->suiv)->preced=p->preced; free(q); else nouveau->suiv=p->suiv; nouveau->preced=p ; p->suiv=nouveau ; if((nouveau->suiv)->preced=nouveau; SMI S4 Les listes chaînées & 8

1. Constants. 2. Variables. 3. Reserved words or key words. 4. Constants. Character set in C

1. Constants. 2. Variables. 3. Reserved words or key words. 4. Constants. Character set in C Character set in C We should use only the following characters in writing a C program. These characters can be combined to create C words. Alphabet: A, B, C, D.. Z, a, b, c, d..z Numeric digits: 0, 1,

More information

Output: 12 18 30 72 90 87. struct treenode{ int data; struct treenode *left, *right; } struct treenode *tree_ptr;

Output: 12 18 30 72 90 87. struct treenode{ int data; struct treenode *left, *right; } struct treenode *tree_ptr; 50 20 70 10 30 69 90 14 35 68 85 98 16 22 60 34 (c) Execute the algorithm shown below using the tree shown above. Show the exact output produced by the algorithm. Assume that the initial call is: prob3(root)

More information

TP : Système de messagerie - Fichiers properties - PrepareStatement

TP : Système de messagerie - Fichiers properties - PrepareStatement TP : Système de messagerie - Fichiers properties - PrepareStatement exelib.net Une société souhaite mettre en place un système de messagerie entre ses employés. Les travaux de l équipe chargée de l analyse

More information

Optimizing and interfacing with Cython. Konrad HINSEN Centre de Biophysique Moléculaire (Orléans) and Synchrotron Soleil (St Aubin)

Optimizing and interfacing with Cython. Konrad HINSEN Centre de Biophysique Moléculaire (Orléans) and Synchrotron Soleil (St Aubin) Optimizing and interfacing with Cython Konrad HINSEN Centre de Biophysique Moléculaire (Orléans) and Synchrotron Soleil (St Aubin) Extension modules Python permits modules to be written in C. Such modules

More information

Pro3 1 : listes chaînées

Pro3 1 : listes chaînées Initiation à l algorithmique, L2 2005-2006, JC Fournier 3.1 Pro3 1 : listes chaînées Spécification : 1 generic 2 type element i s private ; 3 package l i s t e s c h a i n is 4 5 type position is private

More information

Tail call elimination. Michel Schinz

Tail call elimination. Michel Schinz Tail call elimination Michel Schinz Tail calls and their elimination Loops in functional languages Several functional programming languages do not have an explicit looping statement. Instead, programmers

More information

Tutorial on C Language Programming

Tutorial on C Language Programming Tutorial on C Language Programming Teodor Rus rus@cs.uiowa.edu The University of Iowa, Department of Computer Science Introduction to System Software p.1/64 Tutorial on C programming C program structure:

More information

Lex et Yacc, exemples introductifs

Lex et Yacc, exemples introductifs Lex et Yacc, exemples introductifs D. Michelucci 1 LEX 1.1 Fichier makefile exemple1 : exemple1. l e x f l e x oexemple1. c exemple1. l e x gcc o exemple1 exemple1. c l f l l c exemple1 < exemple1. input

More information

The C Programming Language course syllabus associate level

The C Programming Language course syllabus associate level TECHNOLOGIES The C Programming Language course syllabus associate level Course description The course fully covers the basics of programming in the C programming language and demonstrates fundamental programming

More information

E ROADS Number of lanes end/fin 1990 end/fin 1995 ROUTES E Nombre de voices 254.3 km 244.8 a) Up to/jusqu'a 5.99m TOTAL. Normal

E ROADS Number of lanes end/fin 1990 end/fin 1995 ROUTES E Nombre de voices 254.3 km 244.8 a) Up to/jusqu'a 5.99m TOTAL. Normal Country/Pays: R.Macedonia I. E - 65.. By width of ROUTES E Nombre de voices 5. km.8 a) Up to/jusqu'a 5.99m b) 6m - 6.99m 66.5 66.5 75.5 66.0.. Selon la c) 7m - 8.99m d) 9m - 0.9m f) m -.99m g) m and over

More information

Remote Method Invocation

Remote Method Invocation 1 / 22 Remote Method Invocation Jean-Michel Richer jean-michel.richer@univ-angers.fr http://www.info.univ-angers.fr/pub/richer M2 Informatique 2010-2011 2 / 22 Plan Plan 1 Introduction 2 RMI en détails

More information

POB-JAVA Documentation

POB-JAVA Documentation POB-JAVA Documentation 1 INTRODUCTION... 4 2 INSTALLING POB-JAVA... 5 Installation of the GNUARM compiler... 5 Installing the Java Development Kit... 7 Installing of POB-Java... 8 3 CONFIGURATION... 9

More information

Molecular Dynamics Simulations with Applications in Soft Matter Handout 7 Memory Diagram of a Struct

Molecular Dynamics Simulations with Applications in Soft Matter Handout 7 Memory Diagram of a Struct Dr. Martin O. Steinhauser University of Basel Graduate Lecture Spring Semester 2014 Molecular Dynamics Simulations with Applications in Soft Matter Handout 7 Memory Diagram of a Struct Friday, 7 th March

More information

Modifier le texte d'un élément d'un feuillet, en le spécifiant par son numéro d'index:

Modifier le texte d'un élément d'un feuillet, en le spécifiant par son numéro d'index: Bezier Curve Une courbe de "Bézier" (fondé sur "drawing object"). select polygon 1 of page 1 of layout "Feuillet 1" of document 1 set class of selection to Bezier curve select Bezier curve 1 of page 1

More information

OPTIMAL BINARY SEARCH TREES

OPTIMAL BINARY SEARCH TREES OPTIMAL BINARY SEARCH TREES 1. PREPARATION BEFORE LAB DATA STRUCTURES An optimal binary search tree is a binary search tree for which the nodes are arranged on levels such that the tree cost is minimum.

More information

Stacks. Linear data structures

Stacks. Linear data structures Stacks Linear data structures Collection of components that can be arranged as a straight line Data structure grows or shrinks as we add or remove objects ADTs provide an abstract layer for various operations

More information

Technical Service Bulletin

Technical Service Bulletin Technical Service Bulletin FILE CONTROL CREATED DATE MODIFIED DATE FOLDER OpenDrive 02/05/2005 662-02-25008 Rev. : A Installation Licence SCO sur PC de remplacement English version follows. Lors du changement

More information

Lecture 18-19 Data Types and Types of a Language

Lecture 18-19 Data Types and Types of a Language Lecture 18-19 Data Types and Types of a Language April 29, 2014 Data Types and Types of a Language Data, Data Types and Types Type: Generalities Type Systems and Type Safety Type Equivalence, Coercion

More information

drop table Aeroport cascade constraints; create table Aeroport ( codeaeroport char(3), -- Utilisé le code IATA

drop table Aeroport cascade constraints; create table Aeroport ( codeaeroport char(3), -- Utilisé le code IATA ------------------------------------------------------------ -- Universite de Sherbrooke -- Sarah Lamothe, Matricule 14080601 -- Simon Therrien, Matricule 14058814 -- IFT187 - Travail pratique 1 partie

More information

Do not open the exam until instructed

Do not open the exam until instructed Ryerson University Department of Computer Science CPS125 Winter 2009 Final Exam April 27, 2009 12 p.m. - Duration: 120 minutes Family Name: Given Name: Student #: Section number : Your Ryerson E-mail:

More information

C++FA 5.1 PRACTICE MID-TERM EXAM

C++FA 5.1 PRACTICE MID-TERM EXAM C++FA 5.1 PRACTICE MID-TERM EXAM This practicemid-term exam covers sections C++FA 1.1 through C++FA 1.4 of C++ with Financial Applications by Ben Van Vliet, available at www.benvanvliet.net. 1.) A pointer

More information

LECTURE NOTE on PROGRAMMING IN C

LECTURE NOTE on PROGRAMMING IN C LECTURE NOTE on PROGRAMMING IN C COURSE CODE: MCA 101 By Asst. Professor Mrs Etuari Oram Asst. Prof. Mr Bighnaraj Naik SYLLABUS Module I C Language Fundamentals. Character set, Identifiers, keyword, data

More information

Thursday, February 7, 2013. DOM via PHP

Thursday, February 7, 2013. DOM via PHP DOM via PHP Plan PHP DOM PHP : Hypertext Preprocessor Langage de script pour création de pages Web dynamiques Un ficher PHP est un ficher HTML avec du code PHP

More information

4. OTTAWA REGIONAL CANCER FOUNDATION LOAN REPAYMENT EXTENSION

4. OTTAWA REGIONAL CANCER FOUNDATION LOAN REPAYMENT EXTENSION 30 COMITÉ DES FINANCES ET DU 4. OTTAWA REGIONAL CANCER FOUNDATION LOAN REPAYMENT EXTENSION PROLONGATION DU DÉLAI DE REMBOURSEMENT DU PRÊT CONSENTI À LA FONDATION DU CANCER DE LA RÉGION D OTTAWA COMMITTEE

More information

Algorithms and Data Structures Exercise for the Final Exam (17 June 2014) Stack, Queue, Lists, Trees, Heap

Algorithms and Data Structures Exercise for the Final Exam (17 June 2014) Stack, Queue, Lists, Trees, Heap Algorithms and Data Structures Exercise for the Final Exam (17 June 2014) Stack, Queue, Lists, Trees, Heap Singly linked list (1) Data about exam results are stored into a singly linked list. Each list

More information

CS 241 Data Organization Coding Standards

CS 241 Data Organization Coding Standards CS 241 Data Organization Coding Standards Brooke Chenoweth University of New Mexico Spring 2016 CS-241 Coding Standards All projects and labs must follow the great and hallowed CS-241 coding standards.

More information

Keywords are identifiers having predefined meanings in C programming language. The list of keywords used in standard C are : unsigned void

Keywords are identifiers having predefined meanings in C programming language. The list of keywords used in standard C are : unsigned void 1. Explain C tokens Tokens are basic building blocks of a C program. A token is the smallest element of a C program that is meaningful to the compiler. The C compiler recognizes the following kinds of

More information

C Dynamic Data Structures. University of Texas at Austin CS310H - Computer Organization Spring 2010 Don Fussell

C Dynamic Data Structures. University of Texas at Austin CS310H - Computer Organization Spring 2010 Don Fussell C Dynamic Data Structures University of Texas at Austin CS310H - Computer Organization Spring 2010 Don Fussell Data Structures A data structure is a particular organization of data in memory. We want to

More information

Lecture 12 Doubly Linked Lists (with Recursion)

Lecture 12 Doubly Linked Lists (with Recursion) Lecture 12 Doubly Linked Lists (with Recursion) In this lecture Introduction to Doubly linked lists What is recursion? Designing a node of a DLL Recursion and Linked Lists o Finding a node in a LL (recursively)

More information

Aucune validation n a été faite sur l exemple.

Aucune validation n a été faite sur l exemple. Cet exemple illustre l utilisation du Type BLOB dans la BD. Aucune validation n a été faite sur l exemple. using System; using System.Collections.Generic; using System.ComponentModel; using System.Data;

More information

TP N 10 : Gestion des fichiers Langage JAVA

TP N 10 : Gestion des fichiers Langage JAVA TP N 10 : Gestion des fichiers Langage JAVA Rappel : Exemple d utilisation de FileReader/FileWriter import java.io.*; public class Copy public static void main(string[] args) throws IOException File inputfile

More information

CSE 211: Data Structures Lecture Notes VII

CSE 211: Data Structures Lecture Notes VII CSE 211: Data Structures Lecture Notes VII LINKED LISTS In the previous lectures we have seen the representation of ordered lists using an array and sequential mapping. These representations had the property

More information

"Internationalization vs. Localization: The Translation of Videogame Advertising"

Internationalization vs. Localization: The Translation of Videogame Advertising Article "Internationalization vs. Localization: The Translation of Videogame Advertising" Raquel de Pedro Ricoy Meta : journal des traducteurs / Meta: Translators' Journal, vol. 52, n 2, 2007, p. 260-275.

More information

Installation procedure And Technical specifications

Installation procedure And Technical specifications Installation procedure And Technical specifications 1. Required configuration Minimum Windows version : XP SP3 Minimum Framework.Net version : 4 Minimum Internet Explorer version : 9 Minimum Java version

More information

St S a t ck a ck nd Qu Q eue 1

St S a t ck a ck nd Qu Q eue 1 Stack and Queue 1 Stack Data structure with Last-In First-Out (LIFO) behavior In Out C B A B C 2 Typical Operations Pop on Stack Push isempty: determines if the stack has no elements isfull: determines

More information

The Basics of C Programming. Marshall Brain

The Basics of C Programming. Marshall Brain The Basics of C Programming Marshall Brain Last updated: October 30, 2013 Contents 1 C programming 1 What is C?................................. 2 The simplest C program, I........................ 2 Spacing

More information

GSAC CONSIGNE DE NAVIGABILITE définie par la DIRECTION GENERALE DE L AVIATION CIVILE Les examens ou modifications décrits ci-dessous sont impératifs. La non application des exigences contenues dans cette

More information

CSE 303: Concepts and Tools for Software Development

CSE 303: Concepts and Tools for Software Development CSE 303: Concepts and Tools for Software Development Dan Grossman Spring 2005 Lecture 25 Memory-Management Idioms Dan Grossman CSE303 Spring 2005, Lecture 25 1 No tools or rule today Review: Java and C

More information

REQUEST FORM FORMULAIRE DE REQUÊTE

REQUEST FORM FORMULAIRE DE REQUÊTE REQUEST FORM FORMULAIRE DE REQUÊTE ON THE BASIS OF THIS REQUEST FORM, AND PROVIDED THE INTERVENTION IS ELIGIBLE, THE PROJECT MANAGEMENT UNIT WILL DISCUSS WITH YOU THE DRAFTING OF THE TERMS OF REFERENCES

More information

SET SQL_MODE = "NO_AUTO_VALUE_ON_ZERO";! SET time_zone = "+00:00";!

SET SQL_MODE = NO_AUTO_VALUE_ON_ZERO;! SET time_zone = +00:00;! -- phpmyadmin SQL Dump -- version 4.1.3 -- http://www.phpmyadmin.net -- -- Client : localhost -- Généré le : Lun 19 Mai 2014 à 15:06 -- Version du serveur : 5.6.15 -- Version de PHP : 5.4.24 SET SQL_MODE

More information

Basic Common Unix commands: Change to directory d

Basic Common Unix commands: Change to directory d Basic Common Unix commands: cd d Change to directory d mkdir d rmdir d mv f1 [f2...] d mv d1 d2 ls [d] [f...] ls -1 [f...] vi [f] emacs [f] more f cp f1 f2 mv f1 f2 rm f gcc [-o f1] f2 gnuplot Create new

More information

Module 816. File Management in C. M. Campbell 1993 Deakin University

Module 816. File Management in C. M. Campbell 1993 Deakin University M. Campbell 1993 Deakin University Aim Learning objectives Content After working through this module you should be able to create C programs that create an use both text and binary files. After working

More information

BSc (Hons) Business Information Systems, BSc (Hons) Computer Science with Network Security. & BSc. (Hons.) Software Engineering

BSc (Hons) Business Information Systems, BSc (Hons) Computer Science with Network Security. & BSc. (Hons.) Software Engineering BSc (Hons) Business Information Systems, BSc (Hons) Computer Science with Network Security & BSc. (Hons.) Software Engineering Cohort: BIS/05/FT BCNS/05/FT BSE/05/FT Examinations for 2005-2006 / Semester

More information

Benin Business visa Application

Benin Business visa Application Benin Business visa Application Please enter your contact information Name: Email: Tel: Mobile: The latest date you need your passport returned in time for your travel: Benin business visa checklist Filled

More information

Introduction. GEAL Bibliothèque Java pour écrire des algorithmes évolutionnaires. Objectifs. Simplicité Evolution et coévolution Parallélisme

Introduction. GEAL Bibliothèque Java pour écrire des algorithmes évolutionnaires. Objectifs. Simplicité Evolution et coévolution Parallélisme GEAL 1.2 Generic Evolutionary Algorithm Library http://dpt-info.u-strasbg.fr/~blansche/fr/geal.html 1 /38 Introduction GEAL Bibliothèque Java pour écrire des algorithmes évolutionnaires Objectifs Généricité

More information

Certificate of Incorporation Certificat de constitution

Certificate of Incorporation Certificat de constitution Request ID: 014752622 Province of Ontario Date Report Produced: 2012/10/30 Demande n : Province de ('Ontario Document produit le: Transaction ID: 0491 1 1 718 Ministry of Government Services Time Report

More information

Note concernant votre accord de souscription au service «Trusted Certificate Service» (TCS)

Note concernant votre accord de souscription au service «Trusted Certificate Service» (TCS) Note concernant votre accord de souscription au service «Trusted Certificate Service» (TCS) Veuillez vérifier les éléments suivants avant de nous soumettre votre accord : 1. Vous avez bien lu et paraphé

More information

Data Structure with C

Data Structure with C Subject: Data Structure with C Topic : Tree Tree A tree is a set of nodes that either:is empty or has a designated node, called the root, from which hierarchically descend zero or more subtrees, which

More information

AS PUBLISHED IN THE SUPPLEMENT OF THE BULLETIN OF THE CVMQ OF JULY 11, 2003, VOL. 34 N 27

AS PUBLISHED IN THE SUPPLEMENT OF THE BULLETIN OF THE CVMQ OF JULY 11, 2003, VOL. 34 N 27 AS PUBLISHED IN THE SUPPLEMENT OF THE BULLETIN OF THE CVMQ OF JULY 11, 2003, VOL. 34 N 27 RÈGLEMENT MODIFIANT LA VERSION ANGLAISE DU RÈGLEMENT 21-101 SUR LE FONCTIONNEMENT DU MARCHÉ PARTIE 1 MODIFICATIONS

More information

Licence Informatique Année 2005-2006. Exceptions

Licence Informatique Année 2005-2006. Exceptions Université Paris 7 Java Licence Informatique Année 2005-2006 TD n 8 - Correction Exceptions Exercice 1 La méthode parseint est spécifiée ainsi : public static int parseint(string s) throws NumberFormatException

More information

The University of Alabama in Huntsville Electrical and Computer Engineering CPE 112 01 Test #4 November 20, 2002. True or False (2 points each)

The University of Alabama in Huntsville Electrical and Computer Engineering CPE 112 01 Test #4 November 20, 2002. True or False (2 points each) True or False (2 points each) The University of Alabama in Huntsville Electrical and Computer Engineering CPE 112 01 Test #4 November 20, 2002 1. Using global variables is better style than using local

More information

Introduction Les failles les plus courantes Les injections SQL. Failles Web. Maxime Arthaud. net7. Jeudi 03 avril 2014.

Introduction Les failles les plus courantes Les injections SQL. Failles Web. Maxime Arthaud. net7. Jeudi 03 avril 2014. Maxime Arthaud net7 Jeudi 03 avril 2014 Syllabus Introduction Exemple de Requête Transmission de données 1 Introduction Exemple de Requête Transmission de données 2 3 Exemple de Requête Transmission de

More information

Statistical NLP Spring 2008. Machine Translation: Examples

Statistical NLP Spring 2008. Machine Translation: Examples Statistical NLP Spring 2008 Lecture 11: Word Alignment Dan Klein UC Berkeley Machine Translation: Examples 1 Machine Translation Madame la présidente, votre présidence de cette institution a été marquante.

More information

TP1 : Correction. Rappels : Stream, Thread et Socket TCP

TP1 : Correction. Rappels : Stream, Thread et Socket TCP Université Paris 7 M1 II Protocoles réseaux TP1 : Correction Rappels : Stream, Thread et Socket TCP Tous les programmes seront écrits en Java. 1. (a) Ecrire une application qui lit des chaines au clavier

More information

System Calls and Standard I/O

System Calls and Standard I/O System Calls and Standard I/O Professor Jennifer Rexford http://www.cs.princeton.edu/~jrex 1 Goals of Today s Class System calls o How a user process contacts the Operating System o For advanced services

More information

TOURIST VISA REQUIREMENTS GHANA (Multiple Entry), TOGO and BENIN

TOURIST VISA REQUIREMENTS GHANA (Multiple Entry), TOGO and BENIN TOURIST VISA REQUIREMENTS GHANA (Multiple Entry), TOGO and BENIN Total cost One person 5 $538 Total cost Two people $1058 Cost includes, consular fees* and return shipping For delivery outside the contiguous

More information

Computer Programming. Loops(2) do-while, for

Computer Programming. Loops(2) do-while, for Computer Programming Loops(2) do-while, for Topics Repeating Statements (review) while loop (review) do-while loop for loop Infinite loops Examples Repeating Statements In many cases same operations are

More information

Configuration Guide. SafeNet Authentication Service. SAS Agent for AD FS

Configuration Guide. SafeNet Authentication Service. SAS Agent for AD FS SafeNet Authentication Service Configuration Guide SAS Agent for AD FS Technical Manual Template Release 1.0, PN: 000-000000-000, Rev. A, March 2013, Copyright 2013 SafeNet, Inc. All rights reserved. 1

More information

Congo Republic Tourist visa Application

Congo Republic Tourist visa Application Congo Republic Tourist visa Application Please enter your contact information Name: Email: Tel: Mobile: The latest date you need your passport returned in time for your travel: Congo Republic tourist visa

More information

NVIS Form. In December 2006, this form and standard was approved by the CCMTA Board of Directors.

NVIS Form. In December 2006, this form and standard was approved by the CCMTA Board of Directors. NVIS Form This is the final version of the CCMTA NVIS form from the Partial Electronic NVIS Project and includes the suggested changes from the CCMTA-Industry Liaison Session on September 18, 2006. In

More information

Gabon Tourist visa Application for citizens of Canada living in Alberta

Gabon Tourist visa Application for citizens of Canada living in Alberta Gabon Tourist visa Application for citizens of Canada living in Alberta Please enter your contact information Name: Email: Tel: Mobile: The latest date you need your passport returned in time for your

More information

Phys4051: C Lecture 2 & 3. Comment Statements. C Data Types. Functions (Review) Comment Statements Variables & Operators Branching Instructions

Phys4051: C Lecture 2 & 3. Comment Statements. C Data Types. Functions (Review) Comment Statements Variables & Operators Branching Instructions Phys4051: C Lecture 2 & 3 Functions (Review) Comment Statements Variables & Operators Branching Instructions Comment Statements! Method 1: /* */! Method 2: // /* Single Line */ //Single Line /* This comment

More information

60-141 Introduction to Programming II Winter, 2014 Assignment 2

60-141 Introduction to Programming II Winter, 2014 Assignment 2 60-141 Introduction to Programming II Winter, 2014 Assignment 2 Array In this assignment you will implement an encryption and a corresponding decryption algorithm which involves only random shuffling of

More information

The following themes form the major topics of this chapter: The terms and concepts related to trees (Section 5.2).

The following themes form the major topics of this chapter: The terms and concepts related to trees (Section 5.2). CHAPTER 5 The Tree Data Model There are many situations in which information has a hierarchical or nested structure like that found in family trees or organization charts. The abstraction that models hierarchical

More information

Lecture 3. Arrays. Name of array. c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] c[10] c[11] Position number of the element within array c

Lecture 3. Arrays. Name of array. c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] c[10] c[11] Position number of the element within array c Lecture 3 Data structures arrays structs C strings: array of chars Arrays as parameters to functions Multiple subscripted arrays Structs as parameters to functions Default arguments Inline functions Redirection

More information

The wolf who wanted to change his color Week 1. Day 0. Day 1. Day 2. Day 3. - Lecture de l album

The wolf who wanted to change his color Week 1. Day 0. Day 1. Day 2. Day 3. - Lecture de l album The wolf who wanted to change his color Week 1. Day 0. Day 1. Day 2. Day 3. - Lecture de l album - Lecture simplifiée de l album - Découverte des affiches des - Exercice de reconnaissance de - Découverte

More information

Gabon Business visa Application for citizens of Canada living in Alberta

Gabon Business visa Application for citizens of Canada living in Alberta Gabon Business visa Application for citizens of Canada living in Alberta Please enter your contact information Name: Email: Tel: Mobile: The latest date you need your passport returned in time for your

More information

C Primer. Fall Introduction C vs. Java... 1

C Primer. Fall Introduction C vs. Java... 1 CS 33 Intro Computer Systems Doeppner C Primer Fall 2016 Contents 1 Introduction 1 1.1 C vs. Java.......................................... 1 2 Functions 1 2.1 The main() Function....................................

More information

"Templating as a Strategy for Translating Official Documents from Spanish to English"

Templating as a Strategy for Translating Official Documents from Spanish to English Article "Templating as a Strategy for Translating Official Documents from Spanish to English" Sylvie Lambert-Tierrafría Meta : journal des traducteurs / Meta: Translators' Journal, vol. 52, n 2, 2007,

More information

Travaux publics et Services gouvernementaux Canada. Title - Sujet Performance Analysis System. Solicitation No. - N de l'invitation EN869-122636/A

Travaux publics et Services gouvernementaux Canada. Title - Sujet Performance Analysis System. Solicitation No. - N de l'invitation EN869-122636/A Public Works and Government Services Canada Travaux publics et Services gouvernementaux Canada 1 1 RETURN BIDS TO: RETOURNER LES SOUMISSIONS À: Bid Receiving - PWGSC / Réception des soumissions - TPSGC

More information

Networks and Protocols Course: 320301 International University Bremen Date: 2004-11-24 Dr. Jürgen Schönwälder Deadline: 2004-12-03.

Networks and Protocols Course: 320301 International University Bremen Date: 2004-11-24 Dr. Jürgen Schönwälder Deadline: 2004-12-03. Networks and Protocols Course: 320301 International University Bremen Date: 2004-11-24 Dr. Jürgen Schönwälder Deadline: 2004-12-03 Problem Sheet #10 Problem 10.1: finger rpc server and client implementation

More information

ExempleRMI.java. // Fichier de defintion des droits et proprietes // System.setProperty("java.security.policy","../server.java.

ExempleRMI.java. // Fichier de defintion des droits et proprietes // System.setProperty(java.security.policy,../server.java. ExempleRMI.java import java.lang.*; import java.rmi.registry.*; import java.rmi.server.*; import java.io.*; import java.util.*; ExempleRMI.java import pkgexemple.*; public class ExempleRMI public static

More information

11520 Alberta CALGARY 6 6. 11161 Nova Scotia / Nouvelle-Écosse HALIFAX 5 5. 13123 Quebec / Québec MONTREAL 26 23. 15736 Ontario OTTAWA 162 160

11520 Alberta CALGARY 6 6. 11161 Nova Scotia / Nouvelle-Écosse HALIFAX 5 5. 13123 Quebec / Québec MONTREAL 26 23. 15736 Ontario OTTAWA 162 160 Table S1 - Service to the Public by Bilingual Office / Point of Service as of March 31st of year Tableau S1 - Service au public par bureau bilingue /point de service en date du 31 mars de l'année Office

More information

หน วยการเร ยนร ท 3 สร างสรรค งานด วยภาษาซ ใบความร ท 9 เร อง วนซ าก บภาษาซ (คาส ง while และ do-while)

หน วยการเร ยนร ท 3 สร างสรรค งานด วยภาษาซ ใบความร ท 9 เร อง วนซ าก บภาษาซ (คาส ง while และ do-while) หน วยการเร ยนร ท สร างสรรค งานด วยภาษาซ ใบความร ท 9 เร อง วนซ าก บภาษาซ (คาส ง while และ do-while) โครงสร างแบบวนซ า เป นโครงสร างท ใช สาหร บกาหนดให ม การประมวลผลคาส งซ า ๆ ก น ต งแต คร งข นไป ท งน ข นอย

More information

Illustration 1: Diagram of program function and data flow

Illustration 1: Diagram of program function and data flow The contract called for creation of a random access database of plumbing shops within the near perimeter of FIU Engineering school. The database features a rating number from 1-10 to offer a guideline

More information

REQUEST FORM FORMULAIRE DE REQUÊTE

REQUEST FORM FORMULAIRE DE REQUÊTE REQUEST FORM FORMULAIRE DE REQUÊTE ON THE BASIS OF THIS REQUEST FORM, AND PROVIDED THE INTERVENTION IS ELIGIBLE, THE PROJECT MANAGEMENT UNIT WILL DISCUSS WITH YOU THE DRAFTING OF THE TERMS OF REFERENCES

More information

N 2007-0108 INDICES EURONEXT PARIS EURONEXT PARIS INDEXES

N 2007-0108 INDICES EURONEXT PARIS EURONEXT PARIS INDEXES 39 rue Cambon 75001 PARIS EURONEXT PARIS NOTICES 12 juin / June 12, 2007 N 2007-0108 INDICES EURONEXT PARIS EURONEXT PARIS INDEXES A compter du 18 juin 2007, les modifications suivantes seront apportées

More information

Congo Republic Tourist visa Application

Congo Republic Tourist visa Application Congo Republic Tourist visa Application Please enter your contact information Name: Email: Tel: Mobile: The latest date you need your passport returned in time for your travel: Congo Republic tourist visa

More information

INNOVATIVE APPROACHES TO PREVENTION OF FALLS POSITIVE DEVIANCE AND FRONTLINE OWNERSHIP. Guest Presenter: Dr. Michael Gardam

INNOVATIVE APPROACHES TO PREVENTION OF FALLS POSITIVE DEVIANCE AND FRONTLINE OWNERSHIP. Guest Presenter: Dr. Michael Gardam INNOVATIVE APPROACHES TO PREVENTION OF FALLS POSITIVE DEVIANCE AND FRONTLINE OWNERSHIP Guest Presenter: Dr. Michael Gardam Thank you for joining us. Nous vous remercions de votre participation. Your line

More information

1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++

1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++ Answer the following 1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++ 2) Which data structure is needed to convert infix notations to postfix notations? Stack 3) The

More information

EXFO INC. FORM 6-K. (Report of Foreign Issuer) Filed 03/03/10 for the Period Ending 03/03/10

EXFO INC. FORM 6-K. (Report of Foreign Issuer) Filed 03/03/10 for the Period Ending 03/03/10 EXFO INC. FORM 6-K (Report of Foreign Issuer) Filed 03/03/10 for the Period Ending 03/03/10 Telephone 418-683-0211 CIK 0001116284 Symbol EXFO SIC Code 3825 - Instruments for Measuring and Testing of Electricity

More information

Retour vers le futur des bibliothèques de squelettes algorithmiques et DSL

Retour vers le futur des bibliothèques de squelettes algorithmiques et DSL Retour vers le futur des bibliothèques de squelettes algorithmiques et DSL Sylvain Jubertie sylvain.jubertie@lri.fr Journée LaMHA - 26/11/2015 Squelettes algorithmiques 2 / 29 Squelettes algorithmiques

More information

"Simultaneous Consecutive Interpreting: A New Technique Put to the Test"

Simultaneous Consecutive Interpreting: A New Technique Put to the Test Article "Simultaneous Consecutive Interpreting: A New Technique Put to the Test" Miriam Hamidi et Franz Pöchhacker Meta : journal des traducteurs / Meta: Translators' Journal, vol. 52, n 2, 2007, p. 276-289.

More information

What is COM/DCOM. Distributed Object Systems 4 COM/DCOM. COM vs Corba 1. COM vs. Corba 2. Multiple inheritance vs multiple interfaces

What is COM/DCOM. Distributed Object Systems 4 COM/DCOM. COM vs Corba 1. COM vs. Corba 2. Multiple inheritance vs multiple interfaces Distributed Object Systems 4 COM/DCOM Piet van Oostrum Sept 18, 2008 What is COM/DCOM Component Object Model Components (distributed objects) à la Microsoft Mainly on Windows platforms Is used in large

More information

Coding Rules. Encoding the type of a function into the name (so-called Hungarian notation) is forbidden - it only confuses the programmer.

Coding Rules. Encoding the type of a function into the name (so-called Hungarian notation) is forbidden - it only confuses the programmer. Coding Rules Section A: Linux kernel style based coding for C programs Coding style for C is based on Linux Kernel coding style. The following excerpts in this section are mostly taken as is from articles

More information

Memory management. Announcements. Safe user input. Function pointers. Uses of function pointers. Function pointer example

Memory management. Announcements. Safe user input. Function pointers. Uses of function pointers. Function pointer example Announcements Memory management Assignment 2 posted, due Friday Do two of the three problems Assignment 1 graded see grades on CMS Lecture 7 CS 113 Spring 2008 2 Safe user input If you use scanf(), include

More information

Programmation Orientée Objets. et langage Java

Programmation Orientée Objets. et langage Java Programmation Orientée Objets et langage Java Programmation procédurale Construire(Maison m){ creuser(fouilles); commander(béton) couler(fouilles); commander(parpaings); while(!fini(sous-sol)){poser(parpaings);

More information

«Object-Oriented Multi-Methods in Cecil» Craig Chambers (Cours IFT6310, H08)

«Object-Oriented Multi-Methods in Cecil» Craig Chambers (Cours IFT6310, H08) «Object-Oriented Multi-Methods in Cecil» Craig Chambers (Cours IFT6310, H08) Mathieu Lemoine 2008/02/25 Craig Chambers : Professeur à l Université de Washington au département de Computer Science and Engineering,

More information

niveau : 1 ere année spécialité : mécatronique & froid et climatisation AU : 2014-2015 Programmation C Travaux pratiques

niveau : 1 ere année spécialité : mécatronique & froid et climatisation AU : 2014-2015 Programmation C Travaux pratiques École Supérieure Privée d Ingénieurs de Monastir niveau : 1 ere année spécialité : mécatronique & froid et climatisation AU : 2014-2015 Programmation C Travaux pratiques Correction Exercice 1 TP3 long

More information

EXEC SQL CONNECT :userid IDENTIFIED BY :passwd;

EXEC SQL CONNECT :userid IDENTIFIED BY :passwd; SQL with C Test Program 1: Select a row with one column int value; EXEC SQL select max (b) into :value from r; printf ("connected\n"); printf ("max (b) = %d\n", value); Ensure that your library path is

More information

SCHOLARSHIP ANSTO FRENCH EMBASSY (SAFE) PROGRAM 2016 APPLICATION FORM

SCHOLARSHIP ANSTO FRENCH EMBASSY (SAFE) PROGRAM 2016 APPLICATION FORM SCHOLARSHIP ANSTO FRENCH EMBASSY (SAFE) PROGRAM 2016 APPLICATION FORM APPLICATION FORM / FORMULAIRE DE CANDIDATURE Applications close 4 November 2015/ Date de clôture de l appel à candidatures 4 e novembre

More information

Tous les documents de la présente réunion se trouvent sur le site internet du FMC : www.fmc.be, rubrique services. Login : ourdata Password : areyours

Tous les documents de la présente réunion se trouvent sur le site internet du FMC : www.fmc.be, rubrique services. Login : ourdata Password : areyours Ordre du jour Approbation du procès verbal de l assemblée générale du 25 avril 2008 Rapport d activité 2008 Futurs des bases de données en Belgique Rapport du trésorier et approbation des comptes de l

More information

C++ DATA STRUCTURES. Defining a Structure: Accessing Structure Members:

C++ DATA STRUCTURES. Defining a Structure: Accessing Structure Members: C++ DATA STRUCTURES http://www.tutorialspoint.com/cplusplus/cpp_data_structures.htm Copyright tutorialspoint.com C/C++ arrays allow you to define variables that combine several data items of the same kind

More information

Practical Test 2 Semester 3 04/05

Practical Test 2 Semester 3 04/05 CS2281 National University of Singapore School of Computing Practical Test 2 Semester 3 04/05 Instructions PLEASE READ THE INSTRUCTIONS CAREFULLY. You have THREE (3) hours to complete this test. This is

More information

8.5. ...26 9. Cppcheck addons...27 9.1. Using Cppcheck addons...27 9.1.1. Where to find some Cppcheck addons...27 9.2.

8.5. <summary>...26 9. Cppcheck addons...27 9.1. Using Cppcheck addons...27 9.1.1. Where to find some Cppcheck addons...27 9.2. Cppcheck 1.72 Cppcheck 1.72 Table of Contents 1. Introduction...1 2. Getting started...2 2.1. First test...2 2.2. Checking all files in a folder...2 2.3. Excluding a file or folder from checking...2 2.4.

More information

Circular Linked List. Algorithms and Data Structures

Circular Linked List. Algorithms and Data Structures Circular Linked List EENG212 Algorithms and Data Structures Circular Linked Lists In linear linked lists if a list is traversed (all the elements visited) an external pointer to the listmust be preserved

More information

Audit de sécurité avec Backtrack 5

Audit de sécurité avec Backtrack 5 Audit de sécurité avec Backtrack 5 DUMITRESCU Andrei EL RAOUSTI Habib Université de Versailles Saint-Quentin-En-Yvelines 24-05-2012 UVSQ - Audit de sécurité avec Backtrack 5 DUMITRESCU Andrei EL RAOUSTI

More information

Brazil + JDBC Juin 2001, douin@cnam.fr http://jfod.cnam.fr/tp_cdi/douin/

Brazil + JDBC Juin 2001, douin@cnam.fr http://jfod.cnam.fr/tp_cdi/douin/ Brazil + JDBC Juin 2001, douin@cnam.fr http://jfod.cnam.fr/tp_cdi/douin/ version du 26 Mai 2003 : JDBC-SQL et Brazil pré-requis : lecture de Tutorial JDBC de Sun Bibliographie Brazil [Bra00]www.sun.com/research/brazil

More information

Embedded Programming in C/C++: Lesson-1: Programming Elements and Programming in C

Embedded Programming in C/C++: Lesson-1: Programming Elements and Programming in C Embedded Programming in C/C++: Lesson-1: Programming Elements and Programming in C 1 An essential part of any embedded system design Programming 2 Programming in Assembly or HLL Processor and memory-sensitive

More information