BS: Mathematics and Computer Science - Actuarial Science Double Major Program

Double Major

The aim of this by-law is to determine the principles of an educational program of getting another undergraduate diploma from the same department or another department in EMU for students who have successful academic performance in their registered undergraduate programs.

In this by-law; “First Major Program” refers to the undergraduate program of a student’s registered department.

“Second Major Program” means the undergraduate program of the second department that students want to get the second undergraduate diploma in addition to the first diploma.

“Double-major Program” refers to the educational program formed as a combination of the first and the second major programs, giving students the chance of receiving the first and the second major program diplomas at the same time.

Please read Rules and Regulations for more information.

Courses to be taken by a Mathematics and Computer Science Student from Actuarial Science Curriculum

Semester

Ref
Code

Course
Code

Full Course Title

Course Category

Credit

Pre-req.

ECTS

Lec.

Lab.

Tut.

Total

2

4A724

ACTS102

Principles of Insurance. And Actuary

AC

3

0

1

3

6

3

4A732

ACCT201

Principles of Accounting I

AC

3

0

1

3

6

3

4A734

ACTS201

Principles of Life Insurance

AC

3

0

1

3

6

4

4A741

ACTS202

Actuarial Mathematics

AC

3

0

1

3

6

4

4A742

MATH222

Financial Mathematics

AC

3

0

1

3

6

4

4A743

ACTS204

Insurance Accounting

AC

3

0

1

3

6

5

4A752

ACTS205

Insurance Law

AC

3

0

1

3

6

6

4A761

MATH326

Stochastic Analysis

AC

3

0

1

3

6

6

4A767

BANK400

Internship

AC

0

0

0

0

0

ELECTIVES

5

4A753

FINA301

Financial Management

AC

3

0

0

3

6

5

4A754

ACTS305

Non-Life Insurance

AC

3

0

1

3

6

6

4A762

MATH348

Regression Analysis

AC

3

0

1

3

6

6

4A764

FINA302

Money And Banking

AC

3

0

0

3

6

6

4A763

FINA308

International Finance

AC

3

0

0

3

6

6

4A765

FINA325

Investments

AC

3

0

0

3

6

7

4A772

ACTS302

Reinsurance

AC

3

0

1

3

6

7

4A771

ACTS401

Risk Theory

AC

3

0

0

3

6

8

4A781

FINA416

Portfolio Management

AC

3

0

0

3

6

8

4A782

FINA462

Financial Modelling

AC

3

0

0

3

6

8

4A784

FINA418

Behavioral Finance

AC

3

0

0

3

6

Total Credits (a minimum of 36 is required)

24+12(4 electives)=36

Total ECTS

72

Contact

Tel: +90 392 630 1227
Fax: +90 392 365 0416
E-mail: math@emu.edu.tr
Web: https://math.emu.edu.tr

* You can contact the department and / or faculty for detailed information about elective courses.

Semester 1

Credit: 4 | Lecture Hour (hrs/week): 4 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: -
Sets, set operations and numbers. Polynomials, factorization, equations and root finding. Real axis, labeling integers, rationals and some irrationals on the number axis. Cartesian coordinates. Lines. Graphs of equations and quadratic curves. Functions and graphs of functions. Limits and continuity. Derivatives. Rules of differentiation. Higher order derivatives. Chain rule. Related rates. Rolle's and the mean value theorem. Critical Points. Asymptotes. Curve sketching. Integrals. Fundamental Theorem. Techniques of integration. Definite integrals. Application to geometry and science. Indeterminate forms. L'Hospital's Rule. Improper integrals, infinite series. Geometric series. Power series. Taylor series and binomial series.

Calculus - I (MATH151)

Credit: 4 | Lecture Hour (hrs/week): 4 | Lab (hrs/week): 1 | Tutorial (hrs/week): - | ECTS: 6
Limits and continuity. Derivatives. Rules of differentiation. Higher order derivatives. Chain rule. Related rates. Rolle's and the mean value theorem. Critical Points. Asymptotes. Curve sketching. Integrals. Fundamental Theorem. Techniques of integration. Definite integrals. Application to geometry and science. Indeterminate forms. L'Hospital's Rule. Improper integrals. Infinite series. Geometric series. Power series. Taylor series and binomial series.

Analytic Geometry (MATH131)

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: 6
Sets and relations, Cartesian coordinates in 2 and 3 dimensional spaces, vectors, equations of lines and planes, conics, polar, cylindrical and spherical coordinates, quadric surfaces.
Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: 6
Sets and set operations. Relations and functions: binary relation, equivalence relation, partial order, types of functions, composition of functions, inverse function. Integers and their properties: integers, primes, divisibility, fundamental theorem of arithmetic. Logic and proofs: propositions, theorem, tautology and contradiction, direct proof, proof by contradiction, proof by contraposition, proof by induction. Recursion: recursively defined sequences, homogeneous and inhomogeneus recursive relations, characteristic polynomial, solving recurrence relations. Principles of counting: the addition and multiplication rules, the principle of inclusion-exclusion, the pigeonhole principle. Introduction to Combinatorics: permutations and combinations, repetitions, derangements, the binomial theorem. Boolean algebra: basic Boolean functions, digital logic gates, minterm and maxterm expansions, the basic theorems of Boolean algebra, simplifying Boolean function with Karnaugh maps.
Credit: 4 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 2 | ECTS: 6
Organization of a digital computer. Number systems. Algorithmic approach to problem solving. Flowcharting. Concepts of structured programming. Programming in at least one of the programming languages. Data types, constants and variable declarations. Expressions. Input/output statements. Control structures, loops, arrays.
Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: 6
ENGL191 is a first-semester freshman academic English course. It is designed to help students improve the level of their English to B1+ level, as specified in the Common European Framework of Reference for Languages. The course connects critical thinking with language skills and incorporates learning technologies such as IQ Online. The purpose of the course is to consolidate students’ knowledge and awareness of academic discourse, language structures, and lexis. The main focus will be on the development of productive (writing and speaking) and receptive (reading) skills in academic settings.
Credit: 3 | Lecture Hour (hrs/week): 5 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: 6
ENGL 181 is a first-semester freshman academic English course. It is designed to help students improve the level of their English to B1+ level, as specified in the Common European Framework of Reference for Languages. The course connects critical thinking with language skills and incorporates learning technologies such as IQ Online. The purpose of the course is to consolidate students’ knowledge and awareness of academic discourse, language structures, and lexis. The main focus will be on the development of productive (writing and speaking) and receptive (reading) skills in academic settings.

Atatürk İlkeleri ve İnkilap Tarihi (HIST280)

Credit: 2 | Lecture Hour (hrs/week): 2 | Lab (hrs/week): - | Tutorial (hrs/week): - | ECTS: 3

Turkish as a Second Language (TUSL181)

Credit: 2 | Lecture Hour (hrs/week): 2 | Lab (hrs/week): - | Tutorial (hrs/week): - | ECTS: 3

Semester 2

Calculus - II (MATH152)

Credit: 4 | Lecture Hour (hrs/week): 4 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: 6
Vectors in R3. Lines and Planes. Functions of several variables. Limit and continuity. Partial differentiation. Chain rule. Tangent plane. Critical Points. Global and local extrema. Lagrange multipliers. Directional derivative. Gradient, Divergence and Curl. Multiple integrals with applications. Triple integrals with applications. Triple integral in cylindrical and spherical coordinates. Line and surface integrals. Independence of path. Green's Theorem. Conservative vector fields. Divergence Theorem. Stokes' Theorem.

Geometry (MATH124)

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: -
Constructions using the straightedge and compass alone. Remarkable points and lines connected with a triangle: Ceva’s theorem, the incircles and excircles, the orthic triangle, the Euler line. Some properties of circles: the radical axis of two circles, the Simpson line, first Ptolemy’s theorem. Collinearity and concurrence: cyclic quadrangles, Menelaus’s theorem, Pappus’s theorem, Desargues’s theorem, Pascal’s theorem. Transformations: translations, rotations, half-turn, reflections, dilatation. Inversive Geometry: Separation, Cross ratio, Inversion, the second Ptolemy theorem. Elements of projective geometry: Reciprocation, Conics, Projective plane. Elements of non-Euclidean geometry.

Linear Algebra (MATH106)

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: 6
Systems of linear equations: elementary row operations, echelon forms, Gaussian elimination method. Matrices: elementary matrices, invertible matrices, symmetric matrices, quadratic forms and Law of Inertia. Determinants: adjoint and inverse matrices, Cramer's rule. Vector spaces: linear independence, basis and dimensions, Euclidean spaces. Linear mappings: matrix representations, changes of bases. Inner product spaces: Cauchy-Schwarz inequality, Gram-Schmidt orthogonalization. Eigenvalues and eigenvectors: characteristic polynomials, Cayley-Hamilton Theorem, Diagonalization, basic ideas of Jordan forms.
Credit: 4 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 2 | ECTS: 6
An overview of C++ programming Language: Data types, constants and variable declarations, expressions, assignment statements, input/output statements. Control structures. Loops. Arrays. Sorting and searching arrays. User defined functions. Pass-by-value and Pass-by-reference methods of call. Recursion. Data Files.
Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): 1 | Tutorial (hrs/week): - | ECTS: 6
ENGL192 is a second-semester freshman academic English course. It is designed to help students improve the level of their English to B2 level, as specified in the Common European Framework of Reference for Languages. The course connects critical thinking with language skills and incorporates learning technologies such as IQ Online. The purpose of the course is to consolidate students’ knowledge and awareness of academic discourse, language structures, and lexis. The main focus will be on the development of productive (writing and speaking) and receptive (reading) skills in academic settings.
Credit: 3 | Lecture Hour (hrs/week): 5 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: 6
ENGL182 is a second-semester freshman academic English course. It is designed to help students improve the level of their English to B2 level, as specified in the Common European Framework of Reference for Languages (CEFR). The course connects critical thinking with language skills and incorporates learning technologies such as IQ Online. The purpose of the course is to consolidate students’ knowledge and awareness of academic discourse, language structures, and lexis. The main focus will be on the development of productive (writing and speaking) and receptive (reading) skills in academic settings.

Semester 3

Real Analysis - I (MATH209)

Credit: 4 | Lecture Hour (hrs/week): 4 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: 6
Review on sets and functions, review on proof techniques, finite and infinite sets, natural numbers system, countable and uncountable sets, rational numbers system, real numbers system and its properties, supremum and infimum, sequences and limits, monotone sequences, subsequences, Bolzano-Weierstrass theorem, limit supremum, limit infimum, Cauchy criterion for convergence, divergence to infinity, continuous functions, examples of discontinuity, combinations of continuous functions, continuous functions on intervals, boundednes theorem, maximum-minimum theorem, Bolzano intermediate value theorem, uniform continuity, uniform continuity theorem, monotone and inverse functions, continuous inverse theorem, derivative and its properties, example of continuous and nowhere differentiable function, chain rule, derivative of inverse function, mean value theorems and their applications, intermediate value property of derivatives., L’Hospital’s rules, Taylor’s theorem, Riemann integration, partitions and integral sums, properties of Riemann integrals, integrability of continuous and monotone functions, fundamental theorem of calculus.
Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: -
Vector spaces, subspaces, basis and dimension, coordinates, row equivalence. Linear transformations, representation by matrices, linear functionals, dual. Algebras, algebra and factorization of polynomials. Commutative rings, determinant function, permutations and properties of determinants. Characteristic values, the Cayley-Hamilton theorem, invariant subspaces, direct-sum decompositions, the primary decomposition theorem, cyclic decompositions and rational form, the jordan form, inner product spaces.
Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: -
Complexity measure. Asymptotic notation. Time-space trade-off. A study of fundamental strategies used in design of algorithm classes including divide and concur, recursion, search and traversal. Backtracking. Branch and bound techniques. Analysis tools and techniques for algorithms. NP-complete problems. Approximation algorithms. Introduction to parallel and fast algorithms. Primitive data structures Linear data structures: stacks, queues, deques and their application. Concept of linking, linked lists. Non-linear data structures: trees, graphs. Algorithmic implementation of data structures.

Physics - I (PHYS101)

Credit: 4 | Lecture Hour (hrs/week): 4 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: 6
Physical quantities and units. Vector calculus. Kinematics of motion. Newton`s laws of motion and their applications. Work-energy theorem. Impulse and momentum. Rotational kinematics and dynamics. Static equilibrium.

Logic (MATH231)

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: -

Semester 4

Real Analysis - II (MATH210)

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: -
Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: -
Ordinary differential equations of the first order; separation of variables, exact equations, integrating factors, linear and homogeneous equations. Special first order equations; Bernoulli, Riccati, Clairaut equations. Homogeneous higher order equations with constant coefficients. Nonhomogeneous linear equations; variation of parameters, operator method. Power series solution of differential equations. Laplace transforms. Systems of linear differential equations.
Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: -
Number and counting; odometer principle, principle of induction, order of magnitude, handshaking lemma, set notation. Subsets, partitions, permutations; subset, subset of fixed size, the binomial theorem, pascal's triangle, Lucas' theorem, permutations, estimates for factorials, Cayley's theorem on trees, Bell numbers, generating combinatorial objects. Recurrence relations and generating functions; Fibonacci numbers, linear recurrence relations with constant coefficients, derangements and involutions, Catalan and Bell numbers. The principle of inclusion and exclusion; PIE and its generalization, Stirling numbers and exponentials, even add odd permutations. System of distinct representatives; Hall's theorem. Extremal set theory; intersecting families, Erdos-Ko-Rado theorem, Sperner's theorem, the de Brujin-Erdos theorem. Graphs; trees and forests, Cayley's theorem, minimal spanning tree, Eulerian graphs, Hamiltonian graphs, Ore's theorem, gray codes, the traveling salesman, digraphs, networks, max-flow min-cut theorem , integrity theorem, Menger's theorem, Könsg's theorem, Hall's theorem, diameter and girth. Ramsey's theoremlthe pigeonhole principle, bounds for Ramsey's theorem, Applications, infinite version.
Credit: 3 | Lecture Hour (hrs/week): 2 | Lab (hrs/week): - | Tutorial (hrs/week): 2 | ECTS: 6
Foundations of Computer Networks and Its Architecture, topologies and types of Computer Network, Protocols and Procedures of Computer Network Systems and OSI model, Network connection devices active and passive devices, LAN communication technologies (802.X and Ethernet, token ring FDDI), WAN communication technologies (x25, DSL, ISDN, FR etc.), Network Operating Systems, Communication on Network Systems, Management of Network System, communication on internet: E-Mail, instant message programs, sending and receiving files on internet, using FTP programs, Network security, set up web servers like DHCP, DNS (domain name system), Web server, database server.

Physics - II (PHYS102)

Credit: 4 | Lecture Hour (hrs/week): 4 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: 6
Kinetic theory of ideal gases. Equipartition of energy. Heat, heat transfer and heat conduction. Laws of thermodynamics, applications to engine cycles. Coulombs law and electrostatic fields. Gauss's law. Electric potential. Magnetic field. Amperes law. Faradays law.

University Elective - I (UE01)

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): - | ECTS: 6

Semester 5

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: 6
Introduction to probability and statistics. Operations on sets. Counting problems. Conditional probability and total probability formula, Bayes' theorem. Introduction to random variables, density and distribution functions. Expectation, variance and covariance. Basic distributions. Joint density and distribution function. Descriptive statistics. Estimation of parameters, maximum likelihood estimator. Hypothesis testing.
Credit: 3 | Lecture Hour (hrs/week): 2 | Lab (hrs/week): - | Tutorial (hrs/week): 3 | ECTS: 6
Basics of C++ and control structures. Object-Oriented programming and its specific features. Layout of a simple C++ program (elementary C++ programming). Overview of selection and iteration structures of C and C++ languages. Functions and Arrays. Pointers and dynamic memory allocation with C++ operators new and delete. C strings and C++ string class. C-strings, input/output operations, standard C-string functions, C++ string type (the standard string class). Classes and data abstraction. Structure definition. Accessing members of a structure. Class declarations, constructors, constructor initialization lists. Class destructor, member access specifiers public and private, const member functions, friend functions and classes, static data and function members. Operator Overloading. Composition and Inheritance. Header files.
Credit: 3 | Lecture Hour (hrs/week): 2 | Lab (hrs/week): - | Tutorial (hrs/week): 3 | ECTS: -
Internet-based programming languages, introduction to internet programming architecture and client/server architecture. Process of site design, introduction to HTML, connections and use of internet addresses, use of web editor, use of picture and image with HTML, page design, backgrounds, colors and text with HTML, tables and lists with HTML, borders and layers with HTML, HTML forms and form components, use of HTML templates, XML, RSS, Blog, Cascading Style Sheets (CSS), web site projects and applications, dynamic sites with HTML, JavaScript, JavaScript operators and data types, main concepts in internet based education, theoretical terms in internet based education, use of design principles in internet based education.

Complex Analysis (MATH236)

Credit: 4 | Lecture Hour (hrs/week): 4 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: 6
Complex numbers and complex plane. Analytic functions. Cauchy-Riemann equations, harmonic functions. Elementary functions: exponential and trigonometric functions, logarithmic functions. Contours, contour integrals, Cauchy-Goursat theorem. Liouville?s theorem and the fundamental theorem of algebra. Power series, Taylor series, Laurent series, residues and poles, residue theorems, applications of residues. Linear transformations.

University Elective - II (UE02)

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): - | ECTS: 6

Programming Languages (COMP436)

Credit: 3 | Lecture Hour (hrs/week): 2 | Lab (hrs/week): - | Tutorial (hrs/week): 2 | ECTS: -

Semester 6

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: 6
Numerical error. Solution of nonlinear equations, and linear systems of equations. Interpolation and extrapolation. Curve fitting. Numerical differentiation and integration. Numerical solution of ordinary differential equations.
Credit: 4 | Lecture Hour (hrs/week): 4 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: 6
First-Order Partial Differential Equations. The method of characteristics for solving linear first-order IVP. Nonlinear First-Order PDEs, Compatible Systems and Charpit’s Method. Second-Order Partial Differential. Canonical Forms. Fourier Series. Heat Equation, The Maximum and Minimum Principle. Method of Separation of Variables. The Wave Equation. The Inhomogeneous Wave Equation. The Laplace Equation. The Dirichlet BVP for a Rectangle.
Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): - | ECTS: -
Fundamental objectives of computer security: data and information confidentiality, integrity and availability. Three aspects of security: security attacks, security mechanisms and security services; a model of network security. Classical encryption techniques: cryptanalysis and brute-force attack;substitution techniques: Ceasar's cipher, monoalphabetic ciphers, Playfair cipher, Hill cipher and its modifications; polyalphabetic ciphers: Vigenere cipher; transposition techniques: rail fence and other techniques; rotor machines. Modern encryption techniques – block ciphers: diffusion and confusion principles, DES family, IDEA and blowfish. Basic concepts in number theory. Asymmetric-key cryptography – public-key cryptogrwphy, RSA. Integrity of cryptographic data: message authentication, digital signatures, cryptographic hash functions, message authentication codes, MD5, key management and disctribution.
Credit: 3 | Lecture Hour (hrs/week): 2 | Lab (hrs/week): - | Tutorial (hrs/week): 3 | ECTS: 6
Introduction to database management systems (DBMS), relational database model, mathematical relations, relational algebra, entity relationship (ER) model, entity and entity sets, entity relationship diagram (ERD), normalization, normalization forms, Structured Query Language (SQL), SQL functions, database security and integrity, transaction management, concurrency control, distributed database.

Area Elective I (AE01)

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): - | ECTS: 6

Semester 7

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: -
Groups, subgroups, cyclic groups, homomorphisms and isomorphisms, permutations and Cayley's Theorem, cosets and Lagrange's Theorem, quotient groups and the isomorphism theorems, Sylow's Theorem; Rings and fields, ideals and quotient rings, integral domains, prime and maximal ideals, the field of quotients, properties of integers; rings of polynomials, polynomials over C, R and Q, basic ideas of field extensions.

Big Data (COMP413)

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): - | ECTS: -
Huge amount of unstructured data. Collecting and analyzing data before and after computers and internet. Handling, storing and processing of big data. Elimination of redundant data. 5 V’s in Big Data. Cloud data and computing. Parallel algorithms for cloud computing. Hadoop system. Hadoop training. Modules of Hadoop. Map reduce algorithm. Stream computing. Big data in machine learning. Mining big data. Web search. Big data programming. Text analytics.

Operating Systems (COMP483)

Credit: 4 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 2 | ECTS: -
Operating system and its functions. Interprocess communication, process sequence. Memory management, plural programming, replacement, paging, virtual memory. File system, security and protection mechanisms. Occlusions. Examination of MS DOS and UNIX operating systems.

Statistics (MATH324)

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): 1 | ECTS: 6
Population and sample, central limit theorem, sampling distributions of mean and variance, estimation of parameters, properties of estimators, maximum likelihood estimator, point and interval estimation concerning mean, point and interval estimation concerning variance, hypothesis testing, type I and type II errors, power of test, curve fitting, linear regression, multiple linear regression, analysis of variance.

Area Elective II (AE02)

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): - | ECTS: 6

Semester 8

Data Analytics (COMP414)

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): - | ECTS: -
Descriptive and inferential Statistics. Discrete and continuous random variables. Probability distributions. Regressions analysis. Analysis of Variance (ANOVA). Simple linear regression. Multiple linear regression. Classification. Naïve Bayes classifier. Decision trees. Support Vector Machines (SVM). Learning Vector Quantization (LVQ). Association rules. Apriori algorithm. Cluster analysis methods. Logistic regression.
Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): - | ECTS: -
Vector Spaces. Normed spaces. Banach spaces. Properties of normed spaces. Continuity and convergence in Normed spaces. Topology in Normed spaces. Bounded and continuous linear operators. Linear functionals. Normed Spaces of operators. Dual space. Inner product space. Hilbert Space. Properties of inner product spaces. Orthogonal complements and direct sums. Open mapping theorem. Closed linear operators. Closed graph theorem.

Area Elective III (AE03)

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): - | ECTS: 6

University Elecitive - III (UE03)

Credit: 3 | Lecture Hour (hrs/week): 3 | Lab (hrs/week): - | Tutorial (hrs/week): - | ECTS: 6

Undergraduate Programs

Application and registration system for international students and TRNC citizens with GCE scores.

Apply Online

Postgraduate Programs

Application and registration system for master and doctorate programs.

Apply Online

Agency Login

Agency login for online application and registration system.

Agency Login

BS--Mathematics-and-Computer-Science---Actuarial-Science-Double-Major