Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Jordan University of Science and Technology Faculty of Computer & Information Technology Computer Engineering Department CPE 341 Applied Probability and Queuing Theory Spring 2009-2010 Course Catalog Probability principles and sets theory; random variables; operations on random variables; various distribution functions; introduction to random processes; weak stationary; correlation functions, linear processing, and estimation; Poisson processes and Markov chains; queuing analysis Text Book(s) Title Author(s) Publisher Year Edition Probability, Random Variables, and Random Signal Principles Peyton Z. Peebles McGraw-Hill 2000 Fourth Edition References Books Internet Links 1. Introduction to Probability, Dimitri P. Bertsekas and John N. Tsitsiklis, 2nd Edition, Athena Scientific 2. Introduction to Discrete Event Systems, Christos G. Cassandras and Stéphane Lafortune, 2nd Edition, Springer http://elearning.just.edu.jo/ Instructors Instructor Office Location Office Phone Email Dr. Ahmad Al-Hammouri E2 L2 (Next to Nuclear Engineering Department) 7201000 Ext. 22619 [email protected] Class Schedule and Room Section 1: Time: Sundays, Tuesdays, and Thursdays 9:15–10:15am Room: C3018 Section 2: Time: Sundays, Tuesdays, and Thursdays 1:15–2:15pm Room: C2006 Office Hours Sundays, Tuesdays , and Thursdays: 10:15–11:15pm Tuesdays: 11:15–12:15 Mondays: 9:15–10:15 am Wednesdays: 2:15–3:15 pm Teaching Assistant Eng. Ismail Khater Cell Phone: 078-632-1240 E-mail: [email protected] Prerequisites Prerequisites by course MATH 203: Ordinary Differential Equations Topics Covered Topic Review of set definitions and set operations Probability introduced through set theory and relative frequency Joint and conditional probability, independent events, combined experiments, and Bernoulli trials The random variable concept, the density function, and the distribution function The Gaussian, the Binomial, the Poisson, the Uniform, and the Exponential random variables Conditional density and distribution functions Expectation and moments of one random variable Transformation of a random variable of one random variable Joint distribution and its properties, and joint density and its properties Statistical independence and distribution and density of a sum of random variables Expected value of a function of multiple random variables, and joint moments, correlation and covariance of random variables Random processes and the Poisson process Continuous –time Markov chains, Birth-death process and steady-state behavior Queuing systems, single-server queuing systems, steady-state analysis, Little’s formula, and performance metric calculations. Chapter in Text 1.1, 1.2 1.3 1.1, 1.7 2.1 – 2.3 2.4, 2.5 2.6 3.1, 3.2 3.4, 3.5 4.1 – 4.3 4.5 – 4.6 5.1 6.1, 6.2, and class notes Class notes Class notes Week(s) 1, 2 2, 3 3, 4 5 6, 7 7 8, 9 9 10, 11 11 12 13 14 15 Assessment Method Mapping of Course Objectives to Program Outcomes 1. To develop the logical basis of probability theory (ILO 1, ILO 5) 2. To master the mathematical foundations and tools of probability theory (ILO 1, ILO 5) 3. To develop skills necessary to solve practical problems in probability (ILO 1, ILO 5) 4. To develop skills necessary to solve practical problems in random processes and queuing theory (ILO 1, ILO 5) Quizzes and Exams Quizzes and Exams Quizzes and Exams Quizzes and Exams Relationship to Program Outcomes (Score out of 5) ILO 1 ILO 2 ILO 3 ILO 4 4 ILO 5 ILO 6 ILO 7 ILO 8 ILO 9 ILO 10 ILO 11 ILO 12 5 Relationship to Program Objectives CPEO 1 CPEO 2 CPEO 3 CPEO 4 CPEO 5 CPEO 6 X Evaluation Assessment Tool Midterm Exam #1 Expected Due Date To be Scheduled by the Department (14–25/3) Weight 25% Midterm Exam #1 To be Scheduled by the Department (18–29/4) 25 % Quizzes To be announced in class 10 % Final Exam To be Scheduled by the Registrar (6–16/6) 40% Policies Teaching and Learning Methods Makeup Exams Cheating Attendance Other classroom policies Drop Date Class lectures, lectures notes, quizzes, and assignments are designed to achieve the course objectives. Students are expected to read the material as detailed in the textbook, complete the assignments/projects on time, and to participate in class. The course web page is the primary source of information such as class notes, assigned readings, course announcements, and HW assignments. Makeup exam should not be given unless there is a valid excuse. Will not be tolerated and standard JUST policy will be applied. Excellent attendance is expected. JUST policy requires the faculty member to assign ZERO (35%) if a student misses 10% of the classes that are not excused. Attendance will be taken by calling or sign-in sheets will be circulated. If you miss a class, it is your responsibility to find out about any announcements or assignments you may have missed. Be considerate to others: avoid coming to class late, leaving early, and talking to other students. Please turn off your cell phone before the class starts. Last day to drop the course is before the twelfth (12 th) week of the current semester. Last Modified by: Dr. Ahmad T. Al-Hammouri Date: 11/2/2009