### MA6453  PQT 2marks-16marks

Anna University Regulation 2013 Computer Science Engineering (CSE) MA6453  PQT 2marks & 16marks for all 5 units are provided below. Download link for CSE 4th SEM MA6453  PROBABILITY AND QUEUEING THEORY Short answers, Question Bank are listed down for students to make perfect utilization and score maximum marks with our study materials.

MA6453   PROBABILITY AND QUEUEING THEORY QUESTION BANK

UNIT-III 2-marks

RANDOM PROCESSES

1. Define random process and its classification

Random process is a function of time and the outcomes of a random experiment. There are four types of random process

1. Discrete Random sequence

2. Continuous Random sequence

3. Discrete random process

4. Continuous random process.

2. Define (i) Continuous time random process (2) Discrete random process.

In Continuous random process, X and Time set T are continuous. Ex. The maximum temperature of a place at (0,t). In discrete random process, X is

In discrete random process, X is discrete and the time set is continuous. Ex. Number of telephone calls in (0,t).

3. Define stationary process

A random process is called stationary if all its statistical properties do not change with time.

5. Define wide sense stationary process.

A random process X(t) is called WSS if E[X(t)]=constant and Rxx;t,t+τͿ is a fuŶctioŶ of τ.

6. Define Markov process

A random process in which the future value depends only on the present value but not on the past value is called Markov process.

7. Define Transition probability matrix.

The TPM of a markov chain is P=(Pij) where Pij≥0 aŶd ¦Pij 1. Here Pij denote the one step transition probability.

If you require any other notes/study materials, you can comment in the below section.