Scribd
Upload
22 views

C_fakepathProbability_syllabus

Uploaded by

burzuyevrcb
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views

C_fakepathProbability_syllabus

Uploaded by

burzuyevrcb
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

General and Applied Mathematics Department

Information Technologies and Control Faculty

Course Unit Title Probability theory and mathematical statistics

Course Unit Code SPE-B15

Type of Course Unit Elective

Level of Course Unit 3rd year of CS program

National Credits 0

Number of ECTS Credits Allocated 4

Theoretical (hour/week) 2

Practice (hour/week) 2

Year of Study 3

Semester when the course unit is 5


delivered
Course Coordinator Nigar T. Ismayilova

Name of Lecturer(s) Nigar T. Ismayilova

Name of Assistant (s)

Mode of Delivery Face-to-face learning Seminar.

Language of Instruction English

Prerequisites No prerequisites for this course.

Recommended Optional Programme -


Components
Course description:
Probability is used in a number of contexts, including analyzing the likelihood that various
events will happen, better understanding the performance of algorithms (which are
increasingly making use of randomness), or modeling the behavior of systems that exist in
asynchronous environments ruled by uncertainty (such as requests being made to a web
server). Probability provides a rich set of tools for modeling such phenomena and allows
for precise mathematical statements to be made about the performance of an algorithm or
a system in such situations.
Objectives of the Course:
The goals of the course are (1) to maintain the intellectual rigor of the CS curriculum
while providing flexible ways for you to learn, and (2) to foster and maintain human
connections and a sense of community throughout this course.

Learning Outcomes
Upon successful completion of this course students will be able to: Assessment

1 understand the basic principles of probability spaces and random 1,2,3,4


variables;

2 be able to formulate problems using concepts from probability theory 3,4


and compute or estimate probabilities;
3 be familiar with more advanced concepts such as moments, limit 3, 4
theorems and applications such as parameter estimation.

Assessment Methods: 1. Final Exam, 2. Midterm exam, 3. Assignments, 4. Quizzes


Course’s Contribution to Program
CL
1 Ability to solve complex issues and tasks by using the principles of 4
mathematics

2 Ability to apply the knowledge of mathematics and programming fundamentals 2


to the solution of real-world computer science problems

3 Ability to identify, formulate, review research literature, and analyze real- 3


world computer science problems reaching substantiated conclusions using the
principles of mathematics, natural sciences, and programming technologies

4 Ability to use research-based knowledge and research methods including


design of experiments, analysis and interpretation of data, and synthesis of the 5
information to provide valid conclusions

5 Ability to create, select, and apply appropriate techniques, resources, and


modern engineering and IT tools including prediction and modeling to 2
complex engineering activities with an understanding of the limitations

6 Ability to demonstrate knowledge and understanding of the engineering and 2


management principles and apply these to one’s own work, as a member and
leader in a team, to manage projects and in multidisciplinary environments

7 Ability to understand the structure and development methodologies of software 2


systems. Possess professional skills and knowledge of software design process.
Familiarity and practical competence with a broad range of programming
languages, software packages and frameworks. Use knowledge in various
domains to identify research gaps and hence to provide new ideas and solutions
to them.

8 Ability to apply the acquired knowledge of basic skills, principles of 2


computing, mathematical foundations, algorithmic principles, modeling and
design of computer-based systems in solving real-world engineering problems

9 Ability to use the language skills to exchange and obtain some knowledge 1
gained from the foreign sources.

10 Ability to analyze the problem, to identify the basic requirements, to justify the 3
idea and critically evaluate the results and compare them.
CL:Contribution Level (1:Very Low, 2:Low, 3:Moderate ,4:High,5:VeryHigh)

Course Contents
Week Chapter Topics Exam
Introduction and outline of the course. Events and their
1
probabilities. Rules of probability

Equally likely outcomes. Combinatorics. Conditional


2
probability. Bayes rule. Rule of total probability

Distribution of random variables. Independence of random


3
variables. Expectation and variance

Correlation and covariance. Chebyshev’s inequality.


4
Application to finance

Discrete distributions: Bernoulli, Binomial, Geometrical,


5
Negative Binomial, Poisson

Continuous distributions. Joint and marginal densities.


6
Expectation and variance

Continuous distributions. Uniform, exponential, Gamma.


7
Gamma – Poisson formula

Normal distributions. Central limit theorem. Continuity Midterm


8
correction

Computer simulations. Solving problems by Monte-Carlo


9
simulations

Working with Data. Descriptive statistics. Measures of central


10
tendency and variability. Handling missing values.
Data visualization and pre-processing scatterplots. Bar graphs.
11
Transforming data sorting, flipping and merging

Chi distribution. Categorical Data Analysis. The Chi goodness


12
of fit test. Assumptions of the test.

Comparing two means. Z-test, t-test


13
Comparing several means. Linear regression. ANOVA
14

Bayesian statistics. Conclusion


15

Reading List:

Basic:
1. Probability and statistics for computer scientists / Michael Baron. Third edition. CRC Press, Taylor &
Francis Group, 2019.
2. A first course in probability / Sheldon Ross. Eighth Edition. Pearson Prentice Hall, 2010
3. Learning Statistics with Python / Python Adaptation of “Learning Statistics with R” by Ethan Weed.
https://ethanweed.github.io/pythonbook/landingpage.html
4. Probability & Statistics with Applications to Computing / Alex Tsun, 2020.

Attendance and tardiness


Attendance is an indispensible element of the educational process. In compliance with Azerbaijani
legislation, instructors are required to monitor attendance and inform the Registrar and
the Dean when students miss significant amounts of class time. Azerbaijani legislation mandates that
students who fail to attend at least 75% of classes will fail the course.

Assessment
Attendance 0% At least 75% class attendance is compulsory

Assignments 12%

Team works 18%


Midterm Exam 20% Written Exam
Final Exam 50% Written - Oral Exam

Total 100%
Assessment Criteria
Final grades are determined according to the Academic Regulations of Azerbaijan State Oil and
Industry University Guidelines for Undergraduate Studies .

Course Policies
Attendance of the course is mandatory.
 Late assignments will not be accepted unless an agreement is reached with the
lecturer.
 Cheating and plagiarism will not be tolerated. Cheating will be penalized according to
the Azerbaijan State Oil and Industrial University General Student Discipline
Regulations

ECTS allocated based on Student Workload


Duration Total
Activities Number
(hour) Workload(hour)
Course duration class 14 4 56
Assignments 5 3 15
Preparation for quizzes 3 3 9
Self-study 14 1 14
Midterm Examinations 1 3 3
Preparation for midterm exams 1 10 10
Final Examination 1 3 3
Preparation for final exam 1 15 15
Total Workload 125
Total Workload/30(h) 125/30
ECTS Credit of the course 4.2

You might also like