Скачать 0.87 Mb.

CS04 705A : DIGITAL SIGNAL PROCESSING (Common with IT04 705A) 3 hours lecture and 1 hour tutorial per week [Objective: Current communication technology is based on digital signal processing. Here the fundamental principles of various transforms and the tools used in analysis and design of discretetime systems for signal processing are introduced.] Module I (12 hours) Discrete time signals and systems  discrete signal sequences  linear shift invariant systems  discrete signals  stability and casualty  difference equations –frequency domain representations  fourier transform and its properties  relationship between system representations, review of Ztransforms. Module II (15 hours) Discrete fourier transform  representation of discrete fourier series  properties of discrete fourier series  periodic convolution  DFT  properties of DFT computation of DFT  circular convolution  linear convolution using DFT FFTs  DITFFT and DIFFFT  FFT algorithm for composite N. Module III (13 hours) Design of digital filters  IIR and FIR filters  low pass analog filter design Butterworth and Chebyshev filters  design examples  bilinear transformation and impulse invariant techniques  FIR filter design  linear phase characteristics  window method. Module IV (12 hours) Realization of digital filters discrete form I and II  cascade and parallel formfinite word length effects in digital filters  quantizer characteristics  saturation overflow  quantization in implementing systems  zero input limit cycles introduction to DSP processors. Reference books
University examination pattern QI  8 short type questions of 5 marks each, 2 from each module QII  2 questions of 15 marks each from module l with choice to answer any one QIII  2 questions of 15 marks each from module II with choice to answer any one QIV  2 questions of 15 marks each from module III with choice to answer any one Q V  2 questions of 15 marks each from module IV with choice to answer any one. CS04 705B: ADVANCED TOPICS IN DATABASE SYSTEMS (Common with IT04 705B) 3 hours lecture and 1 hour tutorial per week [Objective: The course is intended to impart knowledge on the latest advancements in implementations of database management systems. This imparts sound idea on the latest methodologies such as object oriented, distributed and deductive database systems along with comparisons supported by some case studies. By the end of the course, it enables the student to analyze, design and implement modern database systems, especially for a distributed environment.] Module I (11 hours) Overview of relational database concept  object oriented database  overview of object oriented concepts  object definition language  object query languages  object database conceptional design  overview of CORBA standard for distributed objects. Module II (13 hours) Distributed database concepts  data fragmentation replication and allocation types of distributed database system  query process  concurrency control for distributed database  overview of client  server architecture and its relationship to distributed database. Module III (13 hours) Deductive database  introduction to deduction database prolog/datalog notation  interpretation of rules  basic inference mechanism for logic programs  datalog programs and their evaluation  deduction database systems  data Warehousing and data mining  database on World Wide Web  multimedia database  mobile database  geographic information system  digital libraries Module IV (15 hours) Oracle and microsoft access  basic structure of the oracle system  database structures and its manipulation in oracle  storage organization programming oracle applications  oracle tools  an overview of Microsoft access features and functionality of access  distributed databases in oracle. Text book 1. Elmasri & Navathe, Fundamentals of Database Systems, Addison Wesley Reference books
University examination pattern QI  8 short type questions of 5 marks each, 2 from each module QII  2 questions of 15 marks each from module I with choice to answer any one Q III  2 questions of 15 marks each from module II with choice to answer any one QIV  2 questions of 15 marks each from module III with choice to answer any one QV  2 questions of l5 marks each from module IV with choice to answer any one. CS2K 705C: SIMULATION & MODELING 3 hours lecture and 1 hour tutorial per week [Objective: In simulation scientists try to reproduce realworld events or process under ontrolled laboratory conditions, using mainly mathematical models. Some of the most important scientific discoveries stem from the use of computers tosimulate the complex natural phenomena. Hence, both from research perspective and from application perspective, study of the course is inevitable.] Module I (10 hours) Introduction  systems and models  computer simulation and its applications continuous system simulation  modeling continuous systems  simulation of continuous systems  discrete system simulation  methodology – event scheduling and process interaction approaches  random number generation testing of randomness  generation of stochastic variates  random samples from continuous distributions  uniform distribution  exponential distribution mErlang distribution  gamma distribution  normal distribution  beta distribution  random samples from discrete distributions  Bernoulli  discrete uniform binomial  geometric and poisson. Module II (12 hours) Evaluation of simulation experiments  verification and validation of simulation experiments  statistical reliability in evaluating simulation experiments confidence intervals for terminating simulation runs  simulation languages programming considerations  general features of GPSS  SIM SCRIPT and SIMULA. Module III (15 hours) Simulation of queueing systems  parameters of queue  formulation of queueing problems  generation of arrival pattern  generation of service patterns Simulation of single server queues  simulation of multiserver queues simulation of tandom queues. Module IV (15hours) Simulation of stochastic network  simulation of PERT network  definition of network diagrams  forward pass computation  simulation of forward pass backward pass computations  simulation of backward pass  determination of float and slack times determination of critical path  simulation of complete network  merits of simulation of stochastic networks. Note to the question paper setter  programming questions must be based on 'C ' language or specified simulation languages in the syllabus. Reference books
University examination pattern QI  8 short type questions of 5 marks each, 2 from each module QII  2 questions of 15 marks each from module I with choice to answer any one QIII  2 questions of 15 marks each from module II with choice to answer any one QIV  2 questions of 15 marks each from module HI with choice to answer any one Q V  2 questions of 15 marks each from module IV with choice to answer any one. CS04 705D : STOCHASTIC PROCESSES (Common with IT04 705D) 3 hours lecture and 1 hour tutorial per week [Objective: Dynamic indeterminism is to be analyzed in any field of Science and Technology with reference to time, which is in other words defined as random processes. Students are introduced to various methods to model and analyze such systems.] Module I (12 hours) Markov chains and poisson processes (a brief revision)  continuous time Markov chains  definition transition probability function  Chapman Kolmogorov equations  rate matrix  Kolmogorov forward and backward equations  computing the transition probabilities  limiting probabilities  pure birth process  birth and death process  M/ M/ 1 queue. Module II (12hours) Renewal theory and its applications  the renewal process N(t)  distribution of N(t)  renewal function  renewal equation  limit theorems and their applications  elementary renewal theorem (without proof)  applications of renewal theorem  central limit theorem of renewal processes (without proof)  renewal reward processes  regenerative processes  delayed renewal processes – alternating renewal processes. Module III (12 hours) Queueing theory I: introduction  preliminaries  cost equations  Little's formula steady state probability.  exponential models  single server exponential queueing system  single server exponential  system having finite capacity – a queueing system with bulk service  network of queues  open systems – closed systems  the system M/G/l  preliminaries  work and cost identity – applications of work to M/G/I  busy periods  discussion ofM/D/1 model and M/Ek/l model. Module IV (12 hours) Queueing theory II: variations on the M/G/l  the M/G/I with random sized batch arrivals  priority queues  the model G/M/I  the G/M/l busy and idle periods  multi server queues  Erlang loss system  the M/M/k queue the G/M/ k queue  the M/G/k queue  M/G/oo queue. Text books 1. Ross S.M., Introduction to Probability Models, Sixth edition, Harcourt AsiaPvt. Ltd. and Academic Press Chapter 6 Sections 6.1,6.2,6.3,6.4,6.5, 6.8; Chapter 7 Sections 7.1,7.2,7.3,7.4,7.5; ChapterS Section 8.1 to 8.5 for module III and remaining for module IV Reference books 1. Ross S.M., Introduction to Probability Models, Sixth edition, Harcourt Asia Pvt. Ltd. and Academic Press 2. Medhi J., Stochastic Processes, Wiley Eastern Ltd.
University examination pattern QI  8 short type questions of 5 marks each, 2 from each module QII  2 questions of 15 marks each from module l with choice to answer any one Q III  2 questions of 15 marks each from module II with choice to answer any one QIV  2 questions of 15 marks each from module III with choice to answer any one Q V  2 questions of 15 marks each from module IV with choice to answer any one. 