#1
15th May 2015, 10:23 AM
| |||
| |||
Calicut University M Tech Computer Science Syllabus
Is the syllabus of M Tech Computer Science of Calicut University changed from last time? Provide me the syllabus of M Tech Computer Science of Calicut University in PDF format as I will be giving the exam? Provide me the previous year question paper of M Tech Computer Science Exam too?
|
#2
15th February 2020, 07:11 PM
| |||
| |||
Re: Calicut University M Tech Computer Science Syllabus
Can you provide me the syllabus/course structure for M.Tech Programme in Computer Science and Engineering Program offered by University of Calicut?
|
#3
15th February 2020, 07:13 PM
| |||
| |||
Re: Calicut University M Tech Computer Science Syllabus
The syllabus/course structure for M.Tech Programme in Computer Science and Engineering Program offered by University of Calicut is as follows: Semester I MCS10 101 Advanced Mathematical Structures Prerequisite: Discrete Computational Structures Teaching scheme: Credits: 4 3 hours lecture & 1 hour tutorial per week Objective: To familiarize the students with the advanced concepts in mathematical structures like Markov models, Queuing Networks etc. And these concepts will help the students in their master research project work. Module1: 13Hrs . Stochastic Processes: Renewal Processes- Reward and Cost Models, Poisson Process, Point Process Regenerative Processes, Renewal Theorems Module 2 : 12 Hrs Markov Models: Discrete Time Markov Chain- Transition Probabilities Communication Classes- Irreducible Chains Continuous Markov ChainPure Jump Continuous- Time Chains, Regular Chains, Birth and Death Process SemiMarkov Processes Module 3 : 13Hrs . Single Class and Multi class Queuing Networks: Simple Markovian queues- M/G/1 queue – Open Queuing Networks Closed Queuing NetworksMean Value Analysis- Multi- class traffic Model- Service Time distributions- BCMP Networks- Priority Systems Module 4: 13 Hrs Time delays and blocking in queuing Networks- Time delays in single server queue- time delays in networks of queues- Types of Blocking – Two finite queues in a closed network- aggregating Markovian States. References 1. Ronald W. Wolff, stochastic Modeling and Theory of Queues, Prentice- Hall International Inc 1989 2. Peter G Harrison and Naresh M Patel, Performance Modeling of Communication Networks and Computer Architectures, Addison – Wesley, 1992 3. Gary N Higginbottom, Performance Evaluation of Communication Networks, Artech House, 1998 4. Anurag Kumar, D. Manjunath and Joy Kuri, Communication Networking: An Analytical Approach, Morgan Kaufman Publ. 2004 5. D. Bertsekas and R. Gallager, Data Networks, Prentice- Hall of India 2001 6. Ross K W, Multiservice Loss Models for Broadband Telecommunication Networks, Springer- Verlag, 1995 7. Warland J, An Introduction to Queuing Networks, Prentice- Hall,1988 8. Cinlar E, Introduction to Stochastic Processes, Prentice- Hall , 1975 9. Karlin S and Taylor H, A first Course in Corse in Stochastic Processes, 2nd Edition Academic Press, 1975 Syllabus M.Tech Programme in Computer Science and Engineering University of Calicut |
|