Informatics I (Functional Programming, algorithms, Descriptive Statistics) Description

Key Elements


MATH 107


BS Mathematics





Number of Teaching Hours


Number of Tutoring Sessions


Number of Laboratory Sessions




The purpose of this course is to familiarise the students with the computer functionalities and introduces the concept of writing algorithms. It allows also the student to have a good use of digits. It proposes to lead the student to have a step back regarding real data observed and to allow him enumerating all the possible cases theoretically possible for a specific situation. Pedagogic objectives: The course objective is: • to familiarise the student about computer functionalities • to introduce the information technology in its different components: concepts, software and hardware components. • to introduce the concept of writing algorithms: concepts, basic vocabularies and writing algorithms • to give the students the basic concepts for a statistic study in its descriptive part. At the end of the course, we will be able to read data, to represent them, to synthesize them, to summarize them and to analyze them.


Computer Science 1 (36h = 18h + 18h) a) Introduction Components of a computer system, configurations of computer system, history of computer system: first mechanics, first electronics (first generation, second generation, third generation, fourth generation, fifth generation). b) Data representation Data representation: Number systems and arithmetic operations (binary, decimal, octal, hexadecimal). Representation of negative binary numbers. Alphanumeric codes (BCD, A.S.C.I.I., E.B.C.D.I.C, UNICODE). c) Software system Software system type, operating system tasks, operating systems categories, operating system characteristics, operating systems: Windows, Mac OS, Unix and Linux. d) System unit Motherboard, microprocessor, memories, bus, clock, ports, connectors, extension cards and machine cycle. e) Peripherals units Removable disks, hard disks, optical disks. f) Introduction to writing algorithms Definition of an algorithm, basic operators and priority, variable and constant, input and output operations, application exercises. g) Selection and repetition structures Selection instructions: if… end if, switch … end switch. Repetition instructions: for… end for, while (condition)… end while, repeat…while (condition), application exercises. h) Arrays and string of characters Manipulation of one dimensional array, and two dimensions. String of characters manipulation and one dimensional array sorting, application exercises. i) Functions Function creation, local and global variables, passing arrays to functions, application exercises. II. Descriptive statistics (24h = 12h + 12h) a) Generalities  Definitions and vocabulary: population, statistical unit, individual, sample, characteristics, variable, discrete statistical variable, continuous statistical variable, modality, value, observations, data, census, survey.  Count and frequency (cumulative), raw statistical series, statistical series grouped into table. b) Graphical Representation  Statistical Tables.  Bar chart, pie chart, bar diagram, cumulative curves, histogram, polygon of counts cumulative frequencies. c) Graphical and Analytical Determination of Distribution Characteristics  Characteristics of central tendency: mode, median, quartiles, arithmetic mean, geometric mean, harmonic mean.  Characteristics of dispersion: range, interquartile range, mean deviation, standard deviation, variance, coefficient of variation.  Shape characteristics: Kurtosis and skewness.  Properties of aggregated means and variances, properties of change of variables, comparison of several standard deviations. d) Characteristics of a Two Joint Distribution  Cross-tabulation.  Marginal and conditional distributions, calculation of their characteristics, and plotting of corresponding graphs.  Independence and correlation.  Correlation ratio.  Regression and linear correlation coefficient.  Fitting lines by least squares method.