Correction Bac pratique 28/05/2012 8h30

Size: px
Start display at page:

Download "Correction Bac pratique 28/05/2012 8h30"

Transcription

1 Correction Bac pratique 28/05/2012 8h30 program tp _8h30; uses wincrt; type tab=array[1..20] of integer; n,p:integer; t:tab; procedure saisie( n:integer); writeln('=====================donner la taille du tableau ================'); readln(n); until n in [5..20]; procedure lecture( p:integer); writeln('donner un entier de 4 chiffres '); readln(p); until (p>=1000) and (p<=9999); procedure remplir( t:tab; n:integer); for i:=1 to n do t[i]:=random(9000)+1000; procedure afficher(t:tab; n:integer); writeln('==============affichge du tableau=============='); for i:=1 to n do write(t[i]:8); function recherche (t:tab; n,p:integer):boolean; Correction du bac pratique ème les Sections Scientifiques

2 until (i=n) or (t[i]=p); recherche:=t[i]=p; function rech_part (t:tab; n,p:integer):boolean; until (i=n) or ((t[i] div 10)=(p div 10)); rech_part:=((t[i] div 10)=(p div 10)); procedure afficher_rech(t:tab; n,p:integer); if recherche(t,n,p)=true then writeln(p,' appartient totalement à T') else if rech_part(t,n,p)=true then writeln(p,' appartient partiellement à T') ELSE writeln(p,' n''appartient pas à T'); writeln('****************sujet pratique Lundi 28/05/2012 à 8h30****************'); writeln(' '); saisie(n); remplir(t,n); afficher(t,n); writeln('===============lecture de l''élément à rechercher============'); lecture(p); afficher_rech(t,n,p); end. Correction de bac pratique ème Sciences de l Informatique

3 Correction Bac pratique 28/05/ h program tp _10h; uses wincrt; type tab=array[1..20] of string[20]; n,p:integer; t:tab; procedure saisie( n:integer); writeln('=====================donner la taille du tableau ================'); readln(n); until n in [5..20]; function verif (ch:string):boolean; test:boolean; test:=true; if not(ch[i] in ['A'..'Z',' ']) then test:=false; until (test=false) or (i=length(ch)); verif:=test; procedure remplir( t:tab; n:integer); writeln('=====================remplissage du tableau ================'); for i:=1 to n do writeln('donner l''élément numéro ',i); readln(t[i]); until verif (t[i])=true and (length(t[i]) in [1..20]); function voyelle(ch:string):integer; nb, Correction de bac pratique ème Sciences de l Informatique

4 nb:=0; for i:=1 to length(ch) do if ch[i] in ['A','E','U','Y','O','I'] then nb:=nb+1; voyelle:=nb; function maximum(t:tab; n:integer):integer; max, max:=0; for i:=1 to n do if max<voyelle(t[i]) then max:=voyelle(t[i]); maximum:=max; procedure afficher(t:tab; n:integer); max, writeln('==============affichge =============='); max:=maximum(t,n); for i:=1 to n do if max=voyelle(t[i]) then writeln(t[i]); writeln('*****************sujet pratique Lundi 28/05/2012 à 10h*****************'); writeln(' '); saisie(n); remplir(t,n); afficher(t,n); end. Correction de bac pratique ème Sciences de l Informatique

5 Correction Bac pratique 28/05/ h program tp _14h; uses wincrt; ch:string; function verif (ch:string):boolean; test:boolean; test:=true; if not(ch[i] in ['0'..'9']) then test:=false; until (test=false) or (i=length(ch)); verif:=test; procedure saisie( CH:string); writeln('=====================donner le numéro ================'); readln(ch); until (verif (ch)=true) and (length(ch)=15); function IMEI (ch:string):boolean; s,x,e, s:=0; for i:=1 to length(ch) do val(ch[i],x,e); if (i mod 2 =0) then x:=x*2; if (x>9) then x:=(x mod 10)+(x div 10); s:=s+x; writeln(s); If s mod 10=0 then IMEI:=true else IMEI:=false; Correction de bac pratique ème Sciences de l Informatique

6 procedure afficher(ch:string); max, writeln('==============affichge =============='); if IMEI(ch)=true then writeln(ch,' est un IMEI') else writeln(ch,' n''est pas un IMEI'); writeln('****************sujet pratique Lundi 28/05/2012 à 14h**************'); writeln(' '); saisie(ch); afficher(ch); end. Correction de bac pratique ème Sciences de l Informatique

7 Correction Bac pratique 28/05/ h30 program tp _15h30; uses wincrt; ch:string; function verif (ch:string):boolean; test:boolean; test:=true; if not(ch[i] in ['0'..'9']) then test:=false; until (test=false) or (i=length(ch)); verif:=test; procedure saisie( CH:string); writeln('=====================donner le numéro ================'); readln(ch); until (verif (ch)=true) and (length(ch)=13); function ENA13 (ch:string):boolean; cc,p,s,x,e, s:=0; for i:=1 to length(ch) do val(ch[i],x,e); if (i mod 2 =0) then x:=x*3; s:=s+x; p:=10-(s mod 10); val(ch[length(ch)],cc,e); If p=cc then ENA13:=true else ENA13:=false; Correction de bac pratique ème Sciences de l Informatique

8 procedure afficher(ch:string); max, writeln('==============affichge =============='); if ENA13(ch)=true then writeln(ch,' est un code ENA13') else writeln(ch,' n''est pas un code ENA13'); writeln('**************sujet pratique Lundi 28/05/2012 à 15h30****************'); writeln(' '); saisie(ch); afficher(ch); end. Correction de bac pratique ème Sciences de l Informatique

9 Correction Bac pratique 29/05/2012 8h30 program tp _8h30; uses wincrt; ch:string; p,q:integer; function verif (ch:string):boolean; test:boolean; test:=true; if not(ch[i] in ['A'..'Z',' ']) then test:=false; until (test=false) or (i=length(ch)-1); verif:=test; procedure saisie( CH:string); writeln('=====================donner une chaine ================'); readln(ch); until (verif (ch)=true) and (ch[length(ch)]='.'); procedure Lecture( n:integer); writeln('=====================donner un entier ================'); readln(n); until (n in [2..10]); procedure afficher(p,q:integer; ch:string); k,j, writeln('==============affichge =============='); for k:=1 to length(ch)-1 do if ch[k] in ['A'..'Z'] then Correction de bac pratique ème Sciences de l Informatique

10 i:=ord(ch[k])-64; j:=(p*i+q) mod 26+1; ch[k]:=chr(j+64); writeln(ch); writeln('***************sujet pratique Lundi 29/05/2012 à 8h30***************'); writeln(' '); saisie(ch); lecture(p); lecture(q); afficher(p,q,ch); end. Correction de bac pratique ème Sciences de l Informatique

11 Correction Bac pratique 29/05/ h program tp _10h; uses wincrt; type tab=array[1..12] of string; t:tab; function verif (ch:string):boolean; test:boolean; test:=true; if not(ch[i] in ['A'..'Z']) then test:=false; until (test=false) or (i=length(ch)); verif:=test; procedure remplir( t:tab); writeln('==============remplissage =============='); for i:=1 to 12 do writeln('donner l''élément numéro ',i); readln(t[i]); until (verif(t[i])=true) and (length(t[i])>=3); procedure trier( t:tab); p, aux:string; permut:boolean; writeln('==============tri =============='); p:=random(3)+1; permut:= false; Correction de bac pratique ème Sciences de l Informatique

12 for i:=1 to 11 do if t[i][p]>t[i+1][p] then aux:=t[i]; t[i]:=t[i+1]; t[i+1]:=aux; permut:=true; until permut=false; procedure afficher(t:tab); writeln('==============affichge =============='); for i:=1 to 12 do if i mod 3 =0 then writeln (t[i]:10) else write(t[i]:10); writeln('*****************sujet pratique Lundi 29/05/2012 à 10h**************'); writeln(' '); remplir(t); trier(t); afficher(t); end. Correction de bac pratique ème Sciences de l Informatique

13 Correction Bac pratique 29/05/ h program tp _14h; uses wincrt; ch:string; function verif (ch:string):boolean; test:boolean; test:=true; if not(ch[i] in ['A'..'Z']) then test:=false; until (test=false) or (i=length(ch)); verif:=test; procedure saisie( CH:string); writeln('=====================donner une chaine ================'); readln(ch); until (verif (ch)=true); procedure afficher( ch:string); chr,c:string; writeln('==============affichge =============='); for i:=1 to length(ch) do str(ord(ch[i]),c); chr:=chr+c; C:=''; for i:=1 to length(chr) do c:=chr[i]+c; writeln(c); Correction de bac pratique ème Sciences de l Informatique

14 writeln('*****************sujet pratique Lundi 29/05/2012 à 14h***************'); writeln(' '); saisie(ch); afficher(ch); end. Correction de bac pratique ème Sciences de l Informatique

15 Correction Bac pratique 29/05/ h30 program tp _15h30; uses wincrt; ch:string; function verif (ch:string):boolean; test:boolean; test:=true; if not(ch[i] in ['A'..'Z']) then test:=false; until (test=false) or (i=length(ch)); verif:=test; procedure saisie( CH:string); writeln('=====================donner une chaine ================'); readln(ch); until (verif (ch)=true); function occurence(c:char; ch:string):integer; i,n:integer; n:=0; for i:=1 to length(ch) do if ch[i]=c then n:=n+1; occurence := n; procedure afficher( ch:string); n,i,k:integer; mc:string; writeln('==============affichge =============='); mc:=''; Correction de bac pratique ème Sciences de l Informatique

16 for i:=1 to length(ch) do n:=occurence(ch[i],ch); if n mod 2 <> 0 then k:=2*n else k:=n div 2; if ord(ch[i])+k<=90 then mc:=mc+chr(ord(ch[i])+k) else mc:=mc+chr(ord(ch[i])+k-26); writeln(mc); writeln('*************sujet pratique Lundi 29/05/2012 à 15h30****************'); writeln(' '); saisie(ch); afficher(ch); end. Correction de bac pratique ème Sciences de l Informatique

Correction proposée par Mr Najeh SOUGUIR 1/8

Correction proposée par Mr Najeh SOUGUIR 1/8 Corrigés Bac pratique Informatique Sections Math, Sciences et Technique 28 mai 2012(8h30, 10h,14h, 15h30) lundi 28 mai 2012 à 8h30 program Lundi_28_05_2012_8h30; type tab= array [1..20] of integer; var

More information

Corrections proposées par Mr Adnen Smii. Propositions de correction Bac Pratique informatique 4 scientifiques -27 mai h

Corrections proposées par Mr Adnen Smii. Propositions de correction Bac Pratique informatique 4 scientifiques -27 mai h Propositions de correction Bac Pratique informatique 4 scientifiques -27 mai 2014-8h Program BP_2014_27_Mai_8H; uses wincrt; Type Tab=Array[1..50] of integer; VAR T1,T2:Tab; N1,N2,N,M,A1,A2:integer; Procedure

More information

sujet1: Correction Des Epreuves D Informatique _--Pratique--_ MEDDEB Mohamed Page 1 Devoirs et examens :

sujet1: Correction Des Epreuves D Informatique _--Pratique--_ MEDDEB Mohamed Page 1 Devoirs et examens : Correction Des Epreuves D Informatique sujet1: Program bac_2017_25_mai_s1; Uses Wincrt; Type tab = Array [1..20] Of Integer; n: Integer; T: tab; _--Pratique--_ 2017 Procedure saisir( n:integer); write('donner

More information

Correction bac pratique 2012 g1

Correction bac pratique 2012 g1 Bac pratique 2012 g1 Correction bac pratique 2012 g1 program FactPrem; uses wincrt; type fdat=file of integer; tab=array[1..20] of string; var fd:fdat; ft:text;n,p,d:integer;decomp:tab; {***** fonction

More information

TD 2. Correction TP info

TD 2. Correction TP info TP 2 Exercice 3 : Impôts Sub impot() Dim montant As Integer montant = Cells(1, 1).Value Dim montanttot As Integer Select Case montant Case 0 To 1000 montanttot = 0.1 * montant Case 1001 To 5000 montanttot

More information

SERIE N 1. 4 ème Année informatiques. Exercice 3. Exercice 4 (Manuel Scolaire) Page [1] Les enregistrements & Les fichiers Infoslpm.e-monsite.

SERIE N 1. 4 ème Année informatiques. Exercice 3. Exercice 4 (Manuel Scolaire) Page [1] Les enregistrements & Les fichiers Infoslpm.e-monsite. Exercice 3 SERIE N 1 program exercice3; uses wincrt; type st = string[30]; fch = file of st; var f:fch; nom: st; b : integer; procedure saisie(var f:fch); var vil:st; rep:char; write('donner le nom d''une

More information

CSE443 Compilers. Dr. Carl Alphonce 343 Davis Hall

CSE443 Compilers. Dr. Carl Alphonce 343 Davis Hall CSE443 Compilers Dr. Carl Alphonce alphonce@buffalo.edu 343 Davis Hall www.cse.buffalo. edu/faculty/alphonce/sp18/cse443 piazza.com/buffalo/spring2018/cse443 BUILD A COMPILER! Assessment plan Homework

More information

with Ada.Numerics.Float_Random; with Ada.Containers.Vectors; procedure CalculDeMatrices is

with Ada.Numerics.Float_Random; with Ada.Containers.Vectors; procedure CalculDeMatrices is Page 1 of 8 NOM DU CSU (principal) : calculdematrices.adb AUTEUR DU CSU : Pascal Pignard VERSION DU CSU : 1.1c DATE DE LA DERNIERE MISE A JOUR : 25 avril 2013 ROLE DU CSU : Opérations sur les matrices.

More information

... ; ako je a n parno. ; ako je a n neparno

... ; ako je a n parno. ; ako je a n neparno Zadaci vezani za ciklus sa preduslovom (WHILE) Zad. Napisati program za izračunavanje n_tog stepena broja a. Zad2. Napisati program za izračunavanje sume S kvadrata parnih i kubova neparnih prirodnih brojeva

More information

Préparation au concours ACM TP 2

Préparation au concours ACM TP 2 Préparation au concours ACM TP 2 Christoph Dürr Jill-Jênn Vie September 25, 2014 Quelques conseils Entraînez-vous à identifier les problèmes les plus faciles. Lisez bien les contraintes d affichage : faut-il

More information

Corrigé. Leçon A Exercices : Tutoriel a. Dim strmois(1 to 6) as String

Corrigé. Leçon A Exercices : Tutoriel a. Dim strmois(1 to 6) as String Corrigé Tutoriel 10 Leçon A Exercices : 1. a. Dim strmois(1 to 6) as String b. StrMois(1) = "Janvier" StrMois(2) = "Février" StrMois(3) = "Mars" StrMois(4) = "Avril" StrMois(5) = "Mai" StrMois(6) = "Juin"

More information

VLANs. Commutation LAN et Wireless Chapitre 3

VLANs. Commutation LAN et Wireless Chapitre 3 VLANs Commutation LAN et Wireless Chapitre 3 ITE I Chapter 6 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 1 Objectifs Expliquer le rôle des VLANs dans un réseau convergent. Expliquer le rôle

More information

Latest information prior to deployment of "Dialogys V7.5.6" Contents. What is Dialogys? How often is data updated?... 5

Latest information prior to deployment of Dialogys V7.5.6 Contents. What is Dialogys? How often is data updated?... 5 Latest information prior to deployment of "Dialogys V7.5.6" Contents What is Dialogys?... 5 How often is data updated?... 5 What will the November 2014 delivery with the new Dialogys application contain

More information

Input parameters. Function. An ideal black-box representation of a function

Input parameters. Function. An ideal black-box representation of a function 7 Functions 7. Introduction Functions are identifiable pieces of code with a defined interface. They are called from any part of a program and allow large programs to be split into more manageable tasks,

More information

Verification and Validation

Verification and Validation Cycle Ingénieur 2 ème année Département Informatique Verification and Validation Part IV : Proof-based Verification (I) Burkhart Wolff Département Informatique Université Paris-Sud / Orsay 2013-2014 What

More information

Verification and Validation

Verification and Validation 2017-2018 Cycle Ingénieur 2 ème année Département Informatique Verification and Validation Part IV : Proof-based Verification (I) Burkhart Wolff Département Informatique Université Paris-Sud / Orsay Difference

More information

(************************ Instructions de base ************************)

(************************ Instructions de base ************************) (**********************************************************************) (* Corrige du TD "Graphisme" *) (**********************************************************************) (************************

More information

Laboratoire de l Informatique du Parallélisme

Laboratoire de l Informatique du Parallélisme Laboratoire de l Informatique du Parallélisme École Normale Supérieure de Lyon Unité Mixte de Recherche CNRS-INRIA-ENS LYON n o 8512 SPI Multiplication by an Integer Constant Vincent Lefevre January 1999

More information

CERTIFICAT D'ESSAI OC. Switching Power Supply XP POWER L L C RED HILL AVE, SUITE 100 TUSTIN CA 92780, USA

CERTIFICAT D'ESSAI OC. Switching Power Supply XP POWER L L C RED HILL AVE, SUITE 100 TUSTIN CA 92780, USA US-26019-UL IEC SYSTEM FOR MUTUAL RECOGNITION OF TEST CERTIFICATES FOR ELECTRICAL EQUIPMENT (IECEE) CB SCHEME SYSTEME CEI D'ACCEPTATION MUTUELLE DE CERTIFICATS D'ESSAIS DES EQUIPEMENTS ELECTRIQUES (IECEE)

More information

Programing in C. Pierre-Alain FOUQUE

Programing in C. Pierre-Alain FOUQUE Programing in C Pierre-Alain FOUQUE Summary 1 - The C Language 2 - Layout of a program 3 - Data Typing 4 - Conditions 5 - Conditional loops while 2 Programming Language The processor controls everything,

More information

Bs. in Computer Science and Operational Research, rank : 1st Université Blaise Pascal, Clermont II, Clermont-Ferrand, France

Bs. in Computer Science and Operational Research, rank : 1st Université Blaise Pascal, Clermont II, Clermont-Ferrand, France Mathieu LACROIX Laboratoire LAMSADE Université Paris Dauphine Bureau C605 Place du Maréchal de Lattre de Tassigny 75775 Paris cedex 16 - France Tél : +33 (0)1 44 05 48 53 E-mail : lacroix@lamsade.dauphine.fr

More information

Analyse statique de programmes avioniques

Analyse statique de programmes avioniques June 28th 2013. Forum Méthodes Formelles Cycle de conférences: Analyse Statique : «Retour d expériences industrielles» Analyse statique de programmes avioniques Presenté par Jean Souyris (Airbus Opérations

More information

(************************ Instructions de base ************************) #open "graphics";; open_graph " 800x ";; (* SORTIE : - : unit = () *)

(************************ Instructions de base ************************) #open graphics;; open_graph  800x ;; (* SORTIE : - : unit = () *) (**********************************************************************) (* Corrige du TD 4 *) (**********************************************************************) (************************ Instructions

More information

Switching Power Supply DELTA ELECTRONICS INC 3 TUNGYUAN RD CHUNGLI INDUSTRIAL ZONE TAOYUAN COUNTY TAIWAN

Switching Power Supply DELTA ELECTRONICS INC 3 TUNGYUAN RD CHUNGLI INDUSTRIAL ZONE TAOYUAN COUNTY TAIWAN DK-48554-A2-UL IEC SYSTEM FOR MUTUAL RECOGNITION OF TEST CERTIFICATES FOR ELECTRICAL EQUIPMENT (IECEE) CB SCHEME SYSTEME CEI D ACCEPTATION MUTUELLE DE CERTIFICATS D ESSAIS DES EQUIPEMENTS ELECTRIQUES (IECEE)

More information

ILLUSTRATION DES EXCEPTIONS

ILLUSTRATION DES EXCEPTIONS ILLUSTRATION DES EXCEPTIONS Exemple 1: Capture d'une exception prédéfinie package exception1; public class PrintArgs public static void main ( String[ ] args ) System.out.println ( " Affichage des paramètres

More information

# Project Tracker Status Priority Subject Updated Category Target version 559 Auto Multiple 05/09/2018 1/10

# Project Tracker Status Priority Subject Updated Category Target version 559 Auto Multiple 05/09/2018 1/10 Issues # Project Tracker Status Priority Subject Updated Category Target version 559 Auto Multiple Support New Normal automatisation de l'identification des questions 05/08/2018 11:44 557 Auto Multiple

More information

DK UL. Ref. Certif. No. Date: Signature:

DK UL. Ref. Certif. No. Date: Signature: DK-54446-UL IEC SYSTEM FOR MUTUAL RECOGNITION OF TEST CERTIFICATES FOR ELECTRICAL EQUIPMENT (IECEE) CB SCHEME SYSTEME CEI D'ACCEPTATION MUTUELLE DE CERTIFICATS D'ESSAIS DES EQUIPEMENTS ELECTRIQUES (IECEE)

More information

ASMLib. Hakim Benameurlaine. Janvier Hakim Benameurlaine 1

ASMLib. Hakim Benameurlaine. Janvier Hakim Benameurlaine 1 ASMLib Hakim Benameurlaine Janvier 2014 2014 Hakim Benameurlaine 1 Table of Contents 1 ASMLib... 3 1.1 Installer ASMLib... 3 1.2 Configurer ASMlib... 5 1.3 Créer les disques ASM... 7 2014 Hakim Benameurlaine

More information

IEC SYSTEM FOR MUTUAL RECOGNITION OF TEST CERTIFICATES FOR ELECTRICAL EQUIPMENT (IECEE) CB SCHEME. Additional Information on page 2.

IEC SYSTEM FOR MUTUAL RECOGNITION OF TEST CERTIFICATES FOR ELECTRICAL EQUIPMENT (IECEE) CB SCHEME. Additional Information on page 2. DK-68856-M1-UL IEC SYSTEM FOR MUTUAL RECOGNITION OF TEST CERTIFICATES FOR ELECTRICAL EQUIPMENT (IECEE) CB SCHEME CB TEST CERTIFICATE Product Switching Power Supply for Building In Name and address of the

More information

IEC SYSTEM FOR MUTUAL RECOGNITION OF TEST CERTIFICATES FOR ELECTRICAL EQUIPMENT (IECEE) CB SCHEME. Additional Information on page 2

IEC SYSTEM FOR MUTUAL RECOGNITION OF TEST CERTIFICATES FOR ELECTRICAL EQUIPMENT (IECEE) CB SCHEME. Additional Information on page 2 DK-69361-UL IEC SYSTEM FOR MUTUAL RECOGNITION OF TEST CERTIFICATES FOR ELECTRICAL EQUIPMENT (IECEE) CB SCHEME CB TEST CERTIFICATE Product Switching Power Supply for Building In Name and address of the

More information

IEC SYSTEM FOR MUTUAL RECOGNITION OF TEST CERTIFICATES FOR ELECTRICAL EQUIPMENT (IECEE) CB SCHEME. Switching Power Supply for Building In

IEC SYSTEM FOR MUTUAL RECOGNITION OF TEST CERTIFICATES FOR ELECTRICAL EQUIPMENT (IECEE) CB SCHEME. Switching Power Supply for Building In DK-68856-M1-UL IEC SYSTEM FOR MUTUAL RECOGNITION OF TEST CERTIFICATES FOR ELECTRICAL EQUIPMENT (IECEE) CB SCHEME CB TEST CERTIFICATE Product Switching Power Supply for Building In Name and address of the

More information

Quality of Service Enhancement by Using an Integer Bloom Filter Based Data Deduplication Mechanism in the Cloud Storage Environment

Quality of Service Enhancement by Using an Integer Bloom Filter Based Data Deduplication Mechanism in the Cloud Storage Environment Quality of Service Enhancement by Using an Integer Bloom Filter Based Data Deduplication Mechanism in the Cloud Storage Environment Kuo-Qin Yan, Yung-Hsiang Su, Hsin-Met Chuan, Shu-Ching Wang, Bo-Wei Chen

More information

Case by Case. Chapter 3

Case by Case. Chapter 3 Chapter 3 Case by Case In the previous chapter, we used the conditional expression if... then... else to define functions whose results depend on their arguments. For some of them we had to nest the conditional

More information

IEC SYSTEM FOR MUTUAL RECOGNITION OF TEST CERTIFICATES FOR ELECTRICAL EQUIPMENT (IECEE) CB SCHEME. Additional Information on page 2

IEC SYSTEM FOR MUTUAL RECOGNITION OF TEST CERTIFICATES FOR ELECTRICAL EQUIPMENT (IECEE) CB SCHEME. Additional Information on page 2 DK-69327-UL IEC SYSTEM FOR MUTUAL RECOGNITION OF TEST CERTIFICATES FOR ELECTRICAL EQUIPMENT (IECEE) CB SCHEME CB TEST CERTIFICATE Product Switching Power Supply for Building In Name and address of the

More information

Computer Science II TURBO PASCAL

Computer Science II TURBO PASCAL Computer Science II TURBO PASCAL WEEK4 Program Flow Commands Dr.ELGİN KILIÇ IF THEN ELSE expression: If then Begin End else Begin < Processes when CASE is FALSE> End;

More information

Improved Gomory Cuts for Primal Cutting Plane Algorithms

Improved Gomory Cuts for Primal Cutting Plane Algorithms Improved Gomory Cuts for Primal Cutting Plane Algorithms S. Dey J-P. Richard Industrial Engineering Purdue University INFORMS, 2005 Outline 1 Motivation The Basic Idea Set up the Lifting Problem How to

More information

1. Să se determine de câte ori apare cifra c în scrierea în baza p a numărului n.

1. Să se determine de câte ori apare cifra c în scrierea în baza p a numărului n. Observatii: Codul de mai jos a fost realizat si testat pe pagina online: https://www.tutorialspoint.com/compile_pascal_online.php 1. Să se determine de câte ori apare cifra c în scrierea în baza p a numărului

More information

Programming Language Concepts: Lecture 14

Programming Language Concepts: Lecture 14 Programming Language Concepts: Lecture 14 Madhavan Mukund Chennai Mathematical Institute madhavan@cmi.ac.in http://www.cmi.ac.in/~madhavan/courses/pl2009 PLC 2009, Lecture 14, 11 March 2009 Function programming

More information

Ecole Nationale d Ingénieurs de Brest. Programmation par objets Le langage C++ Type Concret de Données en C++

Ecole Nationale d Ingénieurs de Brest. Programmation par objets Le langage C++ Type Concret de Données en C++ Notes de cours Ecole Nationale d Ingénieurs de Brest Programmation par objets Le langage C++ Type Concret de Données en C++ J. Tisseau 1995/1997 enib c jt......... 1/30 Du TAD au TCD Type Abstrait de Données

More information

The simultaneous number-in-hand communication model on graphs: private coins, public coins and determinism

The simultaneous number-in-hand communication model on graphs: private coins, public coins and determinism The simultaneous number-in-hand communication model on graphs: private coins, public coins and determinism Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca To cite this version: Florent Becker,

More information

Chapter 2.4: Common facilities of procedural languages

Chapter 2.4: Common facilities of procedural languages Chapter 2.4: Common facilities of procedural languages 2.4 (a) Understand and use assignment statements. Assignment An assignment is an instruction in a program that places a value into a specified variable.

More information

Graphes: Manipulations de base et parcours

Graphes: Manipulations de base et parcours Graphes: Manipulations de base et parcours Michel Habib habib@liafa.univ-paris-diderot.fr http://www.liafa.univ-paris-diderot.fr/~habib Cachan, décembre 2013 Notations Here we deal with finite loopless

More information

Private Sub Cours_Load(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles MyBase.Load

Private Sub Cours_Load(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles MyBase.Load Public Class Cours Private nc As Integer Private Sub Cours_Load(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles MyBase.Load 'TODO : cette ligne de code charge les données dans la table

More information

Programming for Experimental Research. Flow Control

Programming for Experimental Research. Flow Control Programming for Experimental Research Flow Control FLOW CONTROL In a simple program, the commands are executed one after the other in the order they are typed. Many situations require more sophisticated

More information

Déclaration du module

Déclaration du module Déclaration du module Imports System.IO Module ModuleStagiaires Public Structure Stagiaire Private m_code As Long Private m_nom As String Private m_prenom As String Public Property code() As Long Get Return

More information

Lecture 5 Tao Wang 1

Lecture 5 Tao Wang 1 Lecture 5 Tao Wang 1 Objectives In this chapter, you will learn about: Selection criteria Relational operators Logical operators The if-else statement Nested if statements C++ for Engineers and Scientists,

More information

Annex A (Informative) Collected syntax The nonterminal symbols pointer-type, program, signed-number, simple-type, special-symbol, and structured-type

Annex A (Informative) Collected syntax The nonterminal symbols pointer-type, program, signed-number, simple-type, special-symbol, and structured-type Pascal ISO 7185:1990 This online copy of the unextended Pascal standard is provided only as an aid to standardization. In the case of dierences between this online version and the printed version, the

More information

Making Decisions In Pascal

Making Decisions In Pascal Making Decisions In Pascal In this section of notes you will learn how to have your Pascal programs choose between alternative courses of action High Level View Of Decision Making For The Computer??? True

More information

Algorithms A Look At Efficiency

Algorithms A Look At Efficiency Algorithms A Look At Efficiency 1B Big O Notation 15-121 Introduction to Data Structures, Carnegie Mellon University - CORTINA 1 Big O Instead of using the exact number of operations to express the complexity

More information

Making Decisions In Pascal In this section of notes you will learn how to have your Pascal programs to execute alternatives

Making Decisions In Pascal In this section of notes you will learn how to have your Pascal programs to execute alternatives Making Decisions In Pascal In this section of notes you will learn how to have your Pascal programs to execute alternatives Decision-Making In Pascal Decisions are questions that are either true or false

More information

Conception Orientée Objet. Romain Rouvoy Licence mention Informatique Université Lille 1

Conception Orientée Objet. Romain Rouvoy Licence mention Informatique Université Lille 1 Conception Orientée Objet Romain Rouvoy Licence mention Informatique Université Lille 1 1 Menu du jour 1. Coder c est douter 2. De la génération 3. À l analyse 2 Mauvaise conception? Où est le problème?

More information

User Guide. for the Transactional Site. belonging to the. Laboratoire de sciences judiciaires et de médecine légale. for

User Guide. for the Transactional Site. belonging to the. Laboratoire de sciences judiciaires et de médecine légale. for User Guide for the Transactional Site belonging to the Laboratoire de sciences judiciaires et de médecine légale for Managing Expert Opinion Requests (GDE) Version 1.7 for External Users Created by Daniel

More information

Discrete Structures Lecture 15

Discrete Structures Lecture 15 Time Complexity:, Examples Introduction The most difficult part of our discussion of time complexity is the computation of, the timing function for a code fragment. Once the timing function is known, it

More information

Summary of Embroidery Patterns Résumé des motifs de broderie Resumen de diseños de bordado

Summary of Embroidery Patterns Résumé des motifs de broderie Resumen de diseños de bordado Summary of Embroidery Patterns Résumé des motifs de broderie Resumen de diseños de bordado Common design patterns Motifs courants Diseños comunes For tutorial practice Pour une pratique d apprentissage

More information

RYERSON UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPS 616 MIDTERM WINTER 2017

RYERSON UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPS 616 MIDTERM WINTER 2017 RYERSON UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPS 616 MIDTERM WINTER 2017 NAME: STUDENT ID: INSTRUCTIONS This exam is 1 hours and 45 minutes long. This exam is out of 50 and is worth 15% of the course

More information

VHDL par Ahcène Bounceur VHDL

VHDL par Ahcène Bounceur VHDL VHDL Ahcène Bounceur 2009 Plan de travail 1. Introduction au langage 2. Prise en main 3. Machine à état 4. Implémentation sur FPGA 1 VHDL Introduction au langage Ahcène Bounceur VHDL VHIC (Very High-speed

More information

New Complexity Results on Array Contraction and Related Problems

New Complexity Results on Array Contraction and Related Problems Laboratoire de l Informatique du Parallélisme École Normale Supérieure de Lyon Unité Mixte de Recherche CNRS-INRIA-ENS LYON n o 5668 New Complexity Results on Array Contraction and Related Problems (Extension

More information

Chapter 3, Selection. Liang, Introduction to Programming with C++, Second Edition, (c) 2010 Pearson Education, Inc. All rights reserved.

Chapter 3, Selection. Liang, Introduction to Programming with C++, Second Edition, (c) 2010 Pearson Education, Inc. All rights reserved. Chapter 3, Selection 1 The bool Type and Operators 2 One-way if Statements if (booleanexpression) { statement(s); } if (radius >= 0) { area = radius * radius * PI; cout

More information

1 PORT HARDENED SERIAL SERVER

1 PORT HARDENED SERIAL SERVER QUICK START GUIDE LES421A 1 PORT HARDENED SERIAL SERVER 24/7 TECHNICAL SUPPORT AT 877.877.2269 OR VISIT BLACKBOX.COM STEP 1 - Check for All Required Hardware 1-Port Hardened Serial Server This Quick Start

More information

C-DIAS Analogue Output Module CAO 082 for eight ±10V DC respectively eight 0 20mA DC outputs

C-DIAS Analogue Output Module CAO 082 for eight ±10V DC respectively eight 0 20mA DC outputs C-DIAS Analogue Output Module CAO 082 for eight ±10V DC respectively eight 0 20mA DC outputs This analogue output module is used for driving components capable of being analogue driven (e.g. proportional

More information

Chapter 11 - The Countdown Problem

Chapter 11 - The Countdown Problem PROGRAMMING IN HASKELL Chapter 11 - The Countdown Problem 1 What Is Countdown? A popular quiz programme on British television that has been running since 1982. Based upon an original French version called

More information

PRO7_TEL ver1_0 FINAL.BS2

PRO7_TEL ver1_0 FINAL.BS2 '{$STAMP BS2} PRO7_TEL ver1_0 FINAL.BS2 ' Programme: TEL.BS2 Simulateur de Ligne Telephonique ' Par: Sylvain Bergeron Date: 2000-FEV ' Versions: ' 0.1 Routines de SelfCheck: 2000-Fev-04 ' 0.2 Routines

More information

Transforming Imperfectly Nested Loops

Transforming Imperfectly Nested Loops Transforming Imperfectly Nested Loops 1 Classes of loop transformations: Iteration re-numbering: (eg) loop interchange Example DO 10 J = 1,100 DO 10 I = 1,100 DO 10 I = 1,100 vs DO 10 J = 1,100 Y(I) =

More information

Algorithmes certifiants

Algorithmes certifiants Michel Habib, LIAFA, Paris Diderot Algorithmique avancée M1 8 février 2010 Schedule of the talk 1 Programme du cours 2010-2011 2 3 Minimum spanning trees and shortest paths Consequences 4 Plan du cours

More information

Read me carefully before making your connections!

Read me carefully before making your connections! CROSS GAME USER GUIDE Read me carefully before making your connections! Warning: The CROSS GAME converter is compatible with most brands of keyboards and Gamer mice. However, we cannot guarantee 100% compatibility.

More information

REFERENCE MATERIALS. Assignment, Display, and Input Evaluates expression and assigns the result to the variable a.

REFERENCE MATERIALS. Assignment, Display, and Input Evaluates expression and assigns the result to the variable a. a expression Assignment, Display, and Input Evaluates expression and assigns the result to the variable a. DISPLAY (expression) Displays the value of expression, followed by a space. INPUT () Accepts a

More information

Grafcet++ AUTOMGEN Grafcet++ multi instance macro steps and encapsulating steps with parameters

Grafcet++ AUTOMGEN Grafcet++ multi instance macro steps and encapsulating steps with parameters Grafcet++ AUTOMGEN 80 Grafcet++ multi instance macro steps and encapsulating steps with parameters These functionalities are available from AUTOMGEN 80 Main concept Automation applications sometimes need

More information

Conception of a static oriented language : an overview of SCOOL

Conception of a static oriented language : an overview of SCOOL Conception of a static oriented language : an overview of SCOOL Thomas Moulard Technical Report n o 0610, June 2006 revision 963 SCOOL is a static oriented language designed to solve the problems encountered

More information

In Delphi script, when values are assigned to variables, the colon-equal operator is used; :=

In Delphi script, when values are assigned to variables, the colon-equal operator is used; := Statements and Operators Old Content - visit altium.com/documentation Modified by on 13-Sep-2017 Parent page: DelphiScript DelphiScript Statements A statement in DelphiScript is considered as simple when

More information

Génie Logiciel Avancé

Génie Logiciel Avancé L3 Mention Informatique Parcours Informatique et MIAGE Génie Logiciel Avancé Part VII : White-Box Test Burkhart Wolff wolff@lri.fr Idea: % Lets exploit the structure of the program!!! (and not, as before

More information

DECLARATIONS OF CONFORMITY, 3200L, 4200L, 4600L, 5500L, ELO- KIT-ESY, ELO-KIT-ECM3

DECLARATIONS OF CONFORMITY, 3200L, 4200L, 4600L, 5500L, ELO- KIT-ESY, ELO-KIT-ECM3 DECLARATIONS OF CONFORMITY, 3200L, 4200L, 4600L, 5500L, ELO-KIT-ESY, ELO-KIT-ECM3 PROPRIETARY INFORMATION MD600031 DECLARATIONS OF CONFORMITY, 3200L, 4200L, 4600L, 5500L, ELO- KIT-ESY, ELO-KIT-ECM3 REVISION

More information

E-Candidat (V2) Online application file Applicant s handbook

E-Candidat (V2) Online application file Applicant s handbook E-Candidat (V2) Online application file Applicant s handbook To apply for a course at the Science Faculty, you have to follow the three steps mentioned in the table of contents and depicted here below.

More information

MARK SCHEME for the October/November 2013 series 9691 COMPUTING. 9691/21 Paper 2 (Written Paper), maximum raw mark 75

MARK SCHEME for the October/November 2013 series 9691 COMPUTING. 9691/21 Paper 2 (Written Paper), maximum raw mark 75 CAMBRIDGE INTERNATIONAL EXAMINATIONS GCE Advanced Subsidiary Level and GCE Advanced Level MARK SCHEME for the October/November 2013 series 9691 COMPUTING 9691/21 Paper 2 (Written Paper), maximum raw mark

More information

ASSIGNMENT 4 SOLUTIONS

ASSIGNMENT 4 SOLUTIONS MATH 71 ASSIGNMENT SOLUTIONS 1. If F : X X is a function, define f (x) to be (f f)(x), and inductively define f k (x) (f f k 1 )(x) for each integer k. (So f (x) (f f )(x) f(f(f(x))) for instance.) We

More information

Tutorial 4: Flow Artificial Intelligence

Tutorial 4: Flow Artificial Intelligence Tutorial 4: Flow Artificial Intelligence G.Guérard Les étudiants doivent faire des groupes de 3-4 afin de faire un brainstorming pour chaque exercice. Il n est pas demandé aux étudiants d avoir une connaissance

More information

Workflow Concepts and Techniques

Workflow Concepts and Techniques Workflow Concepts and Techniques Hala Skaf-Molli Maître de Conférences Université de Nantes Hala.Skaf@univ-nantes.fr http://pagesperso.lina.univ-nantes.fr/~skaf-h Workflow Concepts and Techniques General

More information

Fall Lecture 3 September 4. Stephen Brookes

Fall Lecture 3 September 4. Stephen Brookes 15-150 Fall 2018 Lecture 3 September 4 Stephen Brookes Today A brief remark about equality types Using patterns Specifying what a function does equality in ML e1 = e2 Only for expressions whose type is

More information

Exercise 1 ( = 22 points)

Exercise 1 ( = 22 points) 1 Exercise 1 (4 + 3 + 4 + 5 + 6 = 22 points) The following data structure represents polymorphic lists that can contain values of two types in arbitrary order: data DuoList a b = C a (DuoList a b) D b

More information

TP 2 : Application SnapTchat 20 février 2015

TP 2 : Application SnapTchat 20 février 2015 TP 2 : Application SnapTchat 20 février 2015 SnapTchat : cahier de charges L objectif de ce TP est de développer une simple application d échange de messages courts entre deux utilisateurs. Le cahier des

More information

Introduction au Génie Logiciel Partie3: Test: Static White-Box Test

Introduction au Génie Logiciel Partie3: Test: Static White-Box Test Licence Mention Informatique L3/S6 2009/10 Introduction au Génie Logiciel Partie3: Test: Static White-Box Test Burkhart Wolff Département Informatique Difficulties with Static Unit Tests so far The generation

More information

Computer (Literacy) Skills. Variables, records, and pointers. Lubomír Bulej KDSS MFF UK

Computer (Literacy) Skills. Variables, records, and pointers. Lubomír Bulej KDSS MFF UK Computer (Literacy) Skills Variables, records, and pointers Lubomír Bulej KDSS MFF UK Variable = named storage location Values stored as sequences of bytes Type determines storage size and layout Also

More information

Decision Making and Loops

Decision Making and Loops Decision Making and Loops Goals of this section Continue looking at decision structures - switch control structures -if-else-if control structures Introduce looping -while loop -do-while loop -simple for

More information

o Counter and sentinel controlled loops o Formatting output o Type casting o Top-down, stepwise refinement

o Counter and sentinel controlled loops o Formatting output o Type casting o Top-down, stepwise refinement Last Time Let s all Repeat Together 10/3/05 CS150 Introduction to Computer Science 1 1 We covered o Counter and sentinel controlled loops o Formatting output Today we will o Type casting o Top-down, stepwise

More information

INF 2005 Programmation orientée objet avec C++

INF 2005 Programmation orientée objet avec C++ INF 2005 Programmation orientée objet avec C++ Module 5 - Solutions 1. #include #include double *s_ltab; long ltab_n; void Sommation(double b) double l1b = 1.0 / log(b); double s = 1.0;

More information

Lecture 10: Nested Depth First Search, Counter- Example Generation Revisited, Bit-State Hashing, On-The-Fly Model Checking

Lecture 10: Nested Depth First Search, Counter- Example Generation Revisited, Bit-State Hashing, On-The-Fly Model Checking CS 267: Automated Verification Lecture 10: Nested Depth First Search, Counter- Example Generation Revisited, Bit-State Hashing, On-The-Fly Model Checking Instructor: Tevfik Bultan Buchi Automata Language

More information

The New Territory of Lightweight Security in a Cloud Computing Environment

The New Territory of Lightweight Security in a Cloud Computing Environment The New Territory of Lightweight Security in a Cloud Computing Environment Shu-Ching Wang, Shih-Chi Tseng, Hsin-Met Chuan, Kuo-Qin Yan, Szu-Hao Tsai To cite this version: Shu-Ching Wang, Shih-Chi Tseng,

More information

VHDL Modelling of a Fuzzy Co-processor Architecture

VHDL Modelling of a Fuzzy Co-processor Architecture VHDL Modelling of a Fuzzy Co-processor Architecture Radoslav Raychev, Abdellatif Mtibaa **, Mohamed Abid *** Abstract - The main benefit of hardware fuzzy processors over software implementations is their

More information

CS 320: Concepts of Programming Languages

CS 320: Concepts of Programming Languages CS 320: Concepts of Programming Languages Wayne Snyder Computer Science Department Boston University Lecture 08: Type Classes o o Review: What is a type class? Basic Type Classes: Eq, Ord, Enum, Integral,

More information

About Transferring License Rights for. PL7 V4.5 and Unity Pro V2.3 SP1 Software

About Transferring License Rights for. PL7 V4.5 and Unity Pro V2.3 SP1 Software Page 1 of 38 Click here to access the English Cliquez ici pour accéder au Français Klicken Sie hier, um zum Deutschen zu gelangen Premete qui per accedere all' Italiano Pulse acquì para acceder al Español

More information

ECE 2574: Data Structures and Algorithms - Recursion Part I. C. L. Wyatt

ECE 2574: Data Structures and Algorithms - Recursion Part I. C. L. Wyatt ECE 2574: Data Structures and Algorithms - Recursion Part I C. L. Wyatt Today we will introduce the notion of recursion, look at some examples, and see how to implement them in code. Introduction to recursion

More information

Lecture 3 (02/06, 02/08): Condition Statements Decision, Operations & Information Technologies Robert H. Smith School of Business Spring, 2017

Lecture 3 (02/06, 02/08): Condition Statements Decision, Operations & Information Technologies Robert H. Smith School of Business Spring, 2017 Lecture 3 (02/06, 02/08): Condition Statements Decision, Operations & Information Technologies Robert H. Smith School of Business Spring, 2017 K. Zhang BMGT 404 The modulus operator It works on integers

More information

8.4. Mobile Platform Release Notes

8.4. Mobile Platform Release Notes 8.4 Mobile Platform Release Notes DL RELEASE NOTES WEBRATIO MOBILE PLATFORM 8.4 Copyright 2015 WebRatio s.r.l All rights reserved. This document is protected by copyright and distributed under licenses

More information

USB Interface / USB-HUB Combo Interface

USB Interface / USB-HUB Combo Interface USB Interface / USB-HUB Combo Interface GETTING STARTED: If you have purchased a USB-HUB Combo, proceed by always connecting the standard USB interface which serves as the cash drawer s connectivity first.

More information

Introduction to. Algorithms. Lecture 6. Prof. Constantinos Daskalakis. CLRS: Chapter 17 and 32.2.

Introduction to. Algorithms. Lecture 6. Prof. Constantinos Daskalakis. CLRS: Chapter 17 and 32.2. 6.006- Introduction to Algorithms Lecture 6 Prof. Constantinos Daskalakis CLRS: Chapter 17 and 32.2. LAST TIME Dictionaries, Hash Tables Dictionary: Insert, Delete, Find a key can associate a whole item

More information

Mardi 3 avril Epreuve écrite sur un document en anglais

Mardi 3 avril Epreuve écrite sur un document en anglais C O L L E CONCOURS INTERNE ET EXTERNE DE TECHNICIEN DE CLASSE NORMALE DES SYSTEMES D INFORMATION ET DE COMMUNICATION Ne pas cacher le cadre d identité. Cette opération sera réalisée par l administration

More information

C-DIAS Analog Input Module CAI 086 For eight, ±10V voltage inputs

C-DIAS Analog Input Module CAI 086 For eight, ±10V voltage inputs C-DIAS ANALOG INPUT MODULE CAI 086 C-DIAS Analog Input Module CAI 086 For eight, ±10V voltage inputs This analog input module is used for the input of voltage values in the range of ±100mV / ±1.0V and10v.

More information

Making Decisions In Pascal

Making Decisions In Pascal Making Decisions In Pascal In this section of notes you will learn how to have your Pascal programs choose between alternative courses of action High Level View Of Decision Making For The Computer Is income

More information

Data Structures and Algorithms CSE 465

Data Structures and Algorithms CSE 465 Data Structures and Algorithms CSE 465 LECTURE 4 More Divide and Conquer Binary Search Exponentiation Multiplication Sofya Raskhodnikova and Adam Smith Review questions How long does Merge Sort take on

More information

Functional Programming in Haskell Part I : Basics

Functional Programming in Haskell Part I : Basics Functional Programming in Haskell Part I : Basics Madhavan Mukund Chennai Mathematical Institute 92 G N Chetty Rd, Chennai 600 017, India madhavan@cmi.ac.in http://www.cmi.ac.in/ madhavan Madras Christian

More information