PROBABILITY for CS, Fall 2023 - Syllabus
-
Instructor:
-
Daniel Berend
Office hours: Sun 12:00-14:00, (37, 213)
Tel.: 6461605 (office), 6430588 (home)
e-mail: berend@cs.bgu.ac.il
-
Teaching assistant:
-
Michel Abramoff
Office hours: Wed 15-17 (58, -121)
e-mail: abramoff@post.bgu.ac.il
-
Class hours:
-
Section 1:
Mon 10-12 (35, 211)
Thu 10-12 (92, 002)
-
Section 2:
Mon 8-10 (92, 001)
Tue 8-10 (26, 6)
-
Section 3:
Mon 16-18 (32, 307)
Tue 12-14 (32, 308)
-
Quiz sections:
11: Tue 10-11 (34, 9)
12: Wed 14-15 (90, 138)
13: Thu 12-13 (90, 138)
21: Mon 10-11 (90, 138)
22: Tue 13-14 (90, 138)
23: Thu 10-11 (90, 138)
31: Mon 09-10 (90, 138)
32: Mon 11-12 (90, 138)
33: Tue 09-10 (90, 138)
-
Exams: We plan to hold a midterm if classes can be
provide.
In that case, it will count for 20% of the final grade if the grade is higher than
that of the final exam and 10% otherwise. The final will count for the
other 80% or 90%, respectively. If there will be no
rooms, the final will count for 100% of the grade.
-
Homework:
We recommend that you do at least some of the problems
in the exercises bank.
However, there is no submission of homework.
-
Bibliography:
1. W. Feller, An Introduction to Probability Theory and its
Applications, 3rd ed., Vol. 1, Wiley, New York, 1968.
2. S. Ross, A First Course in Probability, 8th ed.,
Prentice-Hall, Upper Saddle River, 2006.
3. K. Trivedi, Probability and Statistics with Reliability, Queuing,
and Computer Science Applications, 2nd ed., Wiley, New
York, 2002.
4. B. V. Gnedenko, The Theory of Probability, 6th ed.,
Gordon and Breach. (There is a Russian original
also.)
5. M. Harchol-Balter, Performance Modeling and Design of Computer
Systems: Queueing Theory in Action, 1st ed., Cambridge University
Press, New York, 2013.
6. U. Lieberman, Introduction to Probability Theory,
Dekel, Tel-Aviv, 1980
(Hebrew).
7. E. Merzbach and A. Shimron, Probability Theory,
Academon, Jerusalem, 1994 (Hebrew).