Msc Cs Restructured Syllabus With Modfied List of Practicals (1)

8/12/2019 Msc Cs Restructured Syllabus With Modfied List of Practicals (1)

1/24

1

University ofMumbai

Restructured

Syllabus for M.Sc. SemestersI

and II

Program: M. Sc.

Course: Computer Science(Credit Based Semester and Grading System with

effect from the academic year 201213)


2/24

2

1. Course Structure & Distribution of Credits.This syllabus is the extension of the existing syllabus which is currently being taught at MSc

Computer Science of University of Mumbai for the last few years, but modified to be placed within the

credit based system to be implemented from the academic year 2012 2013. However, there are few

changes incorporated in the existing syllabus based on the feedback of the teaching and student

community as well as to incorporate recent trends.

The syllabus proposes four subjects a t each of the semesters. Each subject has theory as well as

practical components. The theory component offers 4 credits and practical component offers 2credits.

Thus, each semester is of 24 credits. The four subjects in the first semester are Principles of Compiler

Design- I, Digital Signal Processing- I, Mobile Computing, and Data warehousing and mining. The second

semester offers Principles of Compiler Design-II, Digital Signal Processing- II, Computer Simulation and

Modeling, and Advanced Database Systems. Each of the theory c o u r s e s has FOUR units and is

expected to cover in 60 lecture periods. Each of the practical c o u r s e s is of 60 hours duration.

Theory Courses:

Course -1 Course-2 Course-3 Course-4

Semester I Principles ofCompiler Design-I

Digital Signal

Processing-I

Mobile Computing Data Warehousing

and Mining

Semester II Principles ofCompiler Design-II

Digital Signal

Processing-IIComputer Simulation

and ModelingAdvanced Database

Systems

Practical Lab courses:

Course -1 Course-2 Course-3 Course-4

Semester I Principles ofCompiler DesignLab I

Digital Signal

Processing Lab I

Mobile Computing

Lab IData Warehousing

and Mining Lab I

Semester II Principles ofCompiler DesignLab II

Digital Signal

Processing Lab IIComputer Simulation

and Modeling Lab II

Advanced Database

Systems Lab II


3/24

3

Semester I

M.Sc. in Computer Science Program of SemesterI consists of four theory courses

and four practical courses. The details are as follows:

Theory Courses:

TheoryCourses Title of Subject Lectures in Hours Credits

PSPH101 Principles of Compiler Design-I 60 04

PSPH102 Digital Signal Processing-I 60 04

PSPH103 Mobile Computing 60 04

PSPH104 Data Warehousing and Mining 60 04

Total 24

Practical courses:x

PracticalCourses Title of Subject Hours. Credits

PSCS-P1 Principles of Compiler Design-I 60 02

PSCS-P2 Digital Signal Processing-I 60 02

PSCS-P3 Mobile Computing 60 02

PSCS-P4 Data Warehousing and Mining 60 02

Total 12

Semester II

M.Sc. in Computer Science Program of SemesterII consists of four theory courses

and four practical courses. The details are as follows:Theory Courses:

Theory

Course

Subjects Lectures in Hours Credits

PSPH201 Principles of Compiler Design-II 60 04

PSPH202 Digital Signal Processing-II 60 04

PSPH203 Computer Simulation and 60 04

PSPH204 Advanced Database Systems 60 04

Total 24

Practical courses:Practical

Course

Subjects Hours. Credits

PSCS-P5 Principles of Compiler Design-II 60 02

PSCS-P6 Digital Signal Processing-II 60 02

PSCS-P7 Computer Simulation and 60 02

PSCS-P8 Advanced Database Systems 60 02

Total 12


4/24

4

MSc Computer Science

Detailed Syllabus of Semester I

Course Code Title Credits

PSCS 101 Principles of Compiler Design-I [60 Lectures] 4

Unit I: Introduction to Compilers and Programming Languages [15 L]

Introduction to Compiler: Compilers and translators, Why do we need translators?, The

structure of a compiler, Lexical analysis, Syntax analysis, Intermediate code generation,

Optimization, Code generation, Book keeping, Error handling, Compiler writing tools.Programming Languages: High-level programming languages, Definitions of

programming languages, The lexical and syntactic structure of a language, Data

elements, Data structures, Operators, Assignment, Statements, Program units, Dataenvironments, Parameter transmission, and Storage management.

Unit II: Finite automata and lexical analysis: [15 L]

The role of the lexical analyzer, A simple approach to the design of lexical analyzers,

Regular expressions, Finite automata, From regular expressions to finite automata,

Minimizing the number of states of a DFA, A language for specifying lexical analyzers,Implementation of a lexical analyzer.

Unit III: Syntactic specification of Programming Languages and Basic Parsing

Techniques: [15 L]

Context-free grammars, Derivations and parse trees, Capabilities of context-free grammars,

Parsers, Shift-reduce parsing, Operator-precedence parsing, Top-down parsing, Predictive

parsers.

Unit IV: Automatic Construction of Efficient Parsers: [15 L]LR parsers, The canonical collection of LR(0) items, Constructing SLR parsing tables,Constructing canonical LR parsing tables, Constructing LALR parsing tables, Using

ambiguous grammars, An automatic parser generator, Implementation of LR parsing

tables, Constructing LALR sets of items.

References:

Principles of Compiler Design, Alfred V. Aho & Jeffrey D. Ullman


5/24

5


PSCS 102 Digital Signal Processing I [60 Lectures] 4

Unit I: Theory of Discrete-Time Linear Systems

Sequences-Representation of arbitrary sequences-Linear time variant systems-causality, stability-

difference equations-frequency response-first order systems-second order systems- Discrete Fourier

series-relation between continuous and discrete Systems. The z Transform-the Relation between the

z Transform and the Fourier transform of a sequence-Solution of differences equation using

one sided transform-geometric evaluation of the Fourier Transform- Digital Filter Realizations-

structures for all zero filters-the discrete Fourier transform convolution of sequences-linear

convolution of finite duration sequences-the discrete Hilbert transform.

[15 L]

Unit II: The Theory and approximation of Finite Duration Impulse, [15 L]

Response digital filters Issues in Filter design-FIR filters Design techniques for Linear phase FIR

filters-windowing- issues with windowing-frequency sampling-solution for optimization-linear

programming-linearphase filters-Maximal ripple FIR Filters Remez exchange algorithm- Multiple

band optimal FIR Filters-Design of filters with simultaneous constrains on the time and

frequency response.

Unit III: Theory and approximation of Infinite Impulse, Response digital filters [15 L]

IIR filters-filter coefficient-Digital Filter Design Mapping of differentials-Transformations-Direct

design of digital filters-comparison between FIR filters and IIR filters.

Finite word length effects in digital filters

Analog to digital conversions-digital to analog conversions-types of Arithmetic in digital

systems. Types of quantization in digital filters-Dynamic range Constraints-Realizations-

ordering and pairing in cascade realizations-round of noise-fixed point analysis-Coefficient quantization

Limit cycle oscillations.

Unit IV: Spectrum Analysis and the Fast Fourier Transform [15 L]

Introduction to Radix-2 FFTs-data shuffling and bit reversal-FFT computer programming- Decimationin-Frequency Algorithm Computing an Inverse DFT by doing a Direct DFT- Radix2

Algorithm-Spectrum analysis at a single point in the z plane-spectrum analysis in FFT Analysis-

Windows in spectrum Analysis-Bluesteins Algorithm-The chirp z transform algorithm-

convolution and correlation using number theoretic transforms.

References:

1) Theory and application of Digital signal processing Lawrence R. Rabiner Bernard Gold-

prentice hall of India.

2) Digital Signal Processing: Principles, Algorithms, and Applications by J. G. Proakis and

D. G. Manolakis.

3) Digital Signal Processing: A Practical Guide for Engineers and Scientists, Steven Smith4) Discrete-Time Signal Processing by A. V. Oppenheim and R. W. Schafer.

5) Understanding Digital Signal Processing by Richard G. Lyons.


6/24

6


PSCS 103 Mobile Computing [60 Lectures] 4

Unit I: Introduction, Wireless Transmission and Medium Access Control: [15 L]

Applications, A short history of wireless communication. Wireless Transmission: Frequency for radio

transmission, Signals, Antennas, Signal propagation, Multiplexing, Modulation, Spread spectrum,

Cellular systems. Medium Access Control: Motivation for a specialized MAC: Hidden and Exposed

terminals. Near and Far terminals; SDMA, FDMA, TDMA: Fixed TDM, Classical Aloha, Slotted Aloha,

Carrier sense multiple access, Demand assigned multiple access, PRMA packet reservation multiple

access, Reservation TDMA, Multiple access with collision avoidance, Polling, Inhibit sense multiple

access; CDMA: Spread Aloha multiple access.

Unit II: Telecommunication, Satellite and Broadcast Systems: GSM: [15 L]

Mobile services, System architecture, Radio interface, Protocols, Localization And Calling, Handover,

security, New data services; DECT: System architecture, Protocol architecture; ETRA, UMTS and IMT-

2000: UMTS Basic architecture, UTRA FDD mode, UTRA TDD mode

Satellite Systems: History, Applications,Basics: GEO, LEO, MEO; Routing, localization, Handover,

Examples Broadcast Systems: Overview, Cyclic repetition of data, Digital audio broadcasting:

Multimedia object transfer protocol; Digital video broadcasting.

Unit III: Wireless LAN and ATM: [15 L]Infrared vs. Radio transmission, Infrastructure and Ad hoc Networks, IEEE 802.11: System architecture,

Protocol architecture, Physical layer, Medium access control layer, MAC management, Future

development; HIPERLAN: Protocol architecture, Physical layer, Channel access control. Sublayer,

Medium access control Sublayer, Information bases And Networking; Bluetooth: User scenarios, Physical

layer, MAC layer, Networking. Security, Link management. Wireless ATM: Motivation for WATM,

Wireless ATM working group, WATM services, Reference model: Example configurations, Generic

reference model; Functions: Wireless mobile terminal side, Mobility supporting network side; Radio

access layer: Requirements, BRAN;

Handover: Handover reference model, Handover requirements, Types of handover, Handover scenarios,

Backward handover, Forward handover; Location management: Requirements for location management,

Procedures and Entities; Addressing, Mobile quality of service, Access point control protocol.

Unit IV: Mobile Network, Transport Layers and Support for Mobility [15 L]

Mobile Network Layer: Mobile IP, Goals, assumptions and requirements, Entities and Terminology, IP

packet delivery, Agent advertisement and discovery, Registration, Tunneling and Encapsulation ,

Optimizations, Reverse tunneling, Ipv6; Dynamic host configuration protocol, Ad hoc networks: Routing,

Destination sequence distance vector, Dynamic source routing, Hierarchical algorithms, Alternative

metrics,

Mobile Transport Layer: Traditional TCP: Congestion control, Slow start, Fast retransmit/fast recovery,

Implications on mobility; Indirect TCP, Snooping TCP, Mobile TCP, Fast retransmit/fast recovery,

Transmission/time-out freezing, Selective retransmission, Transaction oriented TCP.

Support for Mobility: File systems: Consistency, Examples; World Wide Web: Hypertext transfer

protocol, Hypertext markup language, Some approaches that might help wireless access, Systemarchitectures; Wireless application protocol: Architecture, Wireless datagram protocol, Wireless transport

layer security, Wireless transaction protocol, Wireless session protocol, Wireless application environment,

Wireless markup language, WML script, Wireless telephony application, Examples Stacks with Wap,

Mobile databases, Mobile agents


7/24


8/24

8

(3) E.G. Mallach, Decision Support and Data Warehouse systems, TMH.2006.

(4) Han and Kamber, Data Mining: Concepts and Techniques, Second Edition, Morgan Kaufmann,

(5) Berry, Browne, Lecture Notes in Data Mining, World Scientific, 2006.

(6) Berry and Linoff, Data Mining Techniques, Second Edition, Wiley, 2004.

(7) Inmon, Building the Data Warehouse, Wiley, 1993.

List of practical Experiments of Semester I

Sr

No.

Course: PSCS- P1

Principles of Compiler Design1; Write the source code in C/C++/JAVA to convert the given Right Linear Grammar to Left Linear

Grammarform. Perform the following

1. Accept the grammar and print the terminal and non terminals of the light linear grammar2. Convert the input grammar to its equivalent Left Linear form and pint the new grammar

with new set of productions.

3. Prepare the transition table for both the grammars.2: WWrriitteeaaCC//CC++++//JJAAVVAApprrooggrraammttooccoonnvveerrtttthheeggiivveennNNDDFFAAttooDDFFAA..PPeerrffoorrmmtthheeffoolllloowwiinngg

11.. PPiinntttthheetteerrmmiinnaallaannddnnoonntteerrmmiinnaallssoofftthheeiinnppuuttNNDDFFAA..22.. SShhoowwtthheesstteeppbbyysstteeppccoonnvveerrssiioonnooffttooiittsseeqquuiivvaalleennttDDFFAAiinntthheeffoorrmmooffttaabbllee..33.. PPiinntttthheenneewwssttaatteessoofftthheeDDFFAAoobbttaaiinneedd..

3: Write a C/C++/JAVA program to perform removal of /from the transition diagram. Perform the

following in sequence

1. Prepare production rules from the given transition diagram.2. Print the transition table for the original automaton.3. Perform step by step removal of /from the diagram.4. Prepare and print the transition table on the screen for newly obtained automaton without /

moves.

4: Write a C/C++ /JAVAprogram for construction of minimum automatonfor the given automaton.

(Given as transition diagram or transition able). Perform the following1. Accept DFA from user as production rule /transition table.2. Print the transition table, terminal symbols, non-terminal symbols.3. Show step by step minimization by using partition method and print each set of partitions

after each step.

5: Write a C/C++/JAVA code to implement the Warshalls Algorithmon the following (the Boolean

matrix is given) matrix B and perform the following in the sequence.

1. Accept the Boolean matrix from the user and store it it in a suitable data structure.2. Print the input matrix on the screen.3. Compute B+ the transitive closure (warshall method) on the matrix and print th result on the

screen.

6: Write a C/C++/JAVA code to illustrate the generation on SPMfor the input grammar. Perform the

following in the sequence.1. Input the grammar from the user. Print the Terminals and Non-Terminals and Start state.2. Obtain and print FIRST, FIRST+, LAST and LAST+matrices and print them on the screen.3. Compute FIRST*and LAST*and Print them.4. Calculate () , () and () matrices using suitable formula. Writ the formula separately.5. Superimpose () , () and () matrices obtain SPM. (Find if It is SPG?)


9/24


10/24

10

Sr

No.

Course: PSCS- P2

Digital Signal Processing

1 Generate the basic functions like unit impulse, unit step, ramp, exp, sin, cos and display the

output on the screen.

2 Generate the signal given below, display the plots, magnitude and phase response. Also plot

he frequency content of it

a. sn = 3.5 * sin(2 * pi * (0.15) * n) + sin(2 * pi * (0.4) * n)b. sn = 3 + 5.657 * cos(2*pi*(0.1)*n) where array n = 0,1,2..256

3 Compute the z transform of the following using partial fraction method and display the polezero plot.

a. X(z)=z-1/pow((z-0.7071),2)b. X(z)=pow(z,4)-1/pow(z,4)+1c. X(z)=pow(z,3)-pow(z,2)+z-1/pow((z+0.9),3)

4 Compute the N-point DFT of the following, vary the value of N and visualize the effect withN = 8,16,24,64,128,256.

a. s(n) = 3 * pow(e,-0.1 * n)b. s(n) = 2 * cos(2 * pi * (0.15) * n) + sin(2 * pi * (0.4) * n)c. s(n) = 4 * sin(4 * pi * (0.4) * n) + sin(2 * pi * (0.2) * n)

5 Compute 4-point DFT using Twiddle matrix. Accept an input sequence x(n) from the user anddisplay the output sequence y(n). Compute N-point DFT without using Twiddle matrix.

Accept N and an input sequence x(n) from the user and display the output sequence y(n).

6 Write a program for determining the Linear Convolution of a finite duration sequence x(n)

and h(n) from the user. Display the output sequence y(n). Plot all three sequences. Test on

input:x(n)=[1 1 1 1 1], h(n)=[1 2 3 4 5 6 7 8]

7 Write a program for determining a Circular Convolution of the sequence x(n) and h(n).Acceptthe sequences x(n) and h(n) from the user. Calculate and display the output sequence

y(n).Plot all the three sequences. Test on input : x(n)=[1 2 4],h(n)=[1 2].

8 Design an N-point FIR low-pass filter with the cutoff frequency 0.2 * pi using Rectangular,

Hamming, Kaiser windows. Plot for N =16, 32, 64, 128, 256. Compare with N = 1024 andrecord your observations. Input the Fourier Series:

x(n) = 4*sin(2*pi*f*t) + (4/3)*sin(2*pi*3*f*t) + (4/5)*sin(2*pi*5*f*t) +

(4/7)*sin(2*pi*7*f*t)and obtain the output when f=0.8, 0.6, 0.4, 0.2 and display. Plot the magnitude and phase

response of the filter.

9 Design an N-point FIR high-pass filter with the cutoff frequency 0.2 * pi using Blackman,

Hanning and Kaiser windows. Plot for N =16,32, 64, 128, 256. Compare with N

= 1024 and record your observations. Input the Fourier Series: x(n) = 4*sin(2*pi*f*t) +(4/3)*sin(2*pi*3*f*t) + (4/5)*sin(2*pi*5*f*t) + (4/7)*sin(2*pi*7*f*t) and obtain the output

when f=0.8, 0.6, 0.4, 0.2 and display. Plot the magnitude and phase response of the filter.

10 Design low-pass and high-pass filters for the following input and find the output of the filter.

Plot the input and output.a. sn = 3.5 * sin(2 * pi * (0.15) * n) + sin(2 * pi * (0.4) * n)b. s(n) = 3 * pow(e,-0.1 * n)c. s(n) = 2 * cos(2 * pi * (0.15) * n) + sin(2 * pi * (0.4) * n)

11 Design a Band-Pass and Band-Stop FIR filter using Chebyshev window to meet the following


11/24

11

specification.

Passband frequency:- 900 1100 Hz, Passband ripple: - < 0.87 dB, Stop band attenuation: - >

30 dB, Sampling frequency: - 15 kHz, Stopband frequency: - 4500 HzPlot the filter spectrum. Magnitude and Phase response.

12 Design Buttorworth low-pass, high-pass, Band-pass and Band-stop digital IIR filters. Create

pass-band ripple, stop-band ripple, pass-band frequency, stop-band frequency and sampling

frequency as part of design using the specifications in 11 as reference. Plot the magnitude and

phase response of the filters. Test the filter by creating suitable inputs.

13 Plot the spectrogram of the signal x = cos(2*pi*f *t) + randn(size(t)) and analyze the

spectrum for f = 200, 2000, 20000.

14 Design a linear-phase FIR filter using the remez algorithm implemented as remez(n,f,a)where n is the total no. of coefficients, f is the normalized frequency and a is the desired

amplitude response. Test on the input: f = [0 0.3 0.4 0.6 0.7 1] , a = [0 0 1 1 0 0], n = 17.

15 Write a program in MATLAB to implement Radix2 Decimation In Frequency (DIF) FFTAlgorithm.

Sr.

No.

Course: PSCS P3

Mobile Computing1 Create J2ME application to demonstrate a simple calculator with addition, multiplication subtraction

& division functionalities.

1. Use option buttons to select the operator.2. Show results in the text area called Result.3. Clear the text boxes on reset.

2 Create J2ME application to demonstrate key press event. Create an exit button to exit application.1. Capture the key press and display the key pressed.2. Store all key pressed in order in an array3. Display all the pressed keys on exit of application.

3 Create a J2ME application to demonstrate use of graphics primitives in drawing 2D figures.1. Display graphical objects like line, circle and rectangle on simulator screen.2. Draw House with the help of line, circle and rectangle.

4 Write J2ME program to draw simple text and perform following operations:

a. Draw a simple text in a device screen.b. Change the background color.c. Change the text color.d. Changing the font style and font size of a displayed text.

5 Write J2ME program to handle multiple forms.

Every form must have a Command Button to navigate through the forms. Every form should have a textbox to accept the student info.

Fields for Form1 : Student Name, City, Tel. No.

Fields for Form2 : Stream (Science, Commerce, Arts)

Fields for Form3 : Student Details from Form1 and Form2.

6 Write J2ME application to demonstrate timers by completing the following tasks:


12/24

12

(i) Draw a filled rectangle.(ii) Change the color of the rectangle after the specified interval of time.

7 Create J2ME application to demonstrate bouncing ball in a mobile device by creating a menu for the

above demonstration with items: start and stop.

StartTo start the application

StopTo stop the application

Allow user to change the color of the ball by providing them two options RED and BLACK

8 Create J2ME application to move a ball on the screen as per the keys pressed.a. The direction keys move the ball in that direction.b. The ball should not go outside the screen.

9 Create a J2ME application to demonstrate button click event. On click of command button

display a geometrical figure (lines, circles, rectangles etc.) on screen.a. Allow user to draw the geometrical figure.b. Translate the geometrical figure from one part of the screen to other.

10 Create J2ME application to develop following forms.

a. First Form: Customer Name, Customer Telephone No.b. Second Form: Qty Of Pencils, Pens, and Erasers.c. Third Form: Display input from the first 2 forms, and display the sum of the total qtys

ordered.

11 Create J2ME application to send & receives messages from one mobile device to another mobile

device.

12 Create J2ME application to demonstrate multiple bouncing balls. Provide Start And Stop commands

to pause / continue the bouncing.

13 Create a J2ME application to demonstrate different input boxes based on the given application theme

(with input boxes such as edit box, button, radio buttons and check box).

Enter name in the edit box and select the check boxes. On click of ok button, display

corresponding subject name(s) and student name on the screen.

14 Create a J2ME application to demonstrate a dialog box


13/24


14/24

14

10. Data pre-processing.

11. Data discretization.

12. Classification problems.

13. Clustering Analysis.

14. Association Rule Mining.

15. Data visualization.


15/24

15

MSc Computer Science

Detailed Syllabus of Semester II


PSCS201 Principles of Compiler Design-II 4

Unit I: Syntax-Directed Translation [15 L]

Syntax-directed translation schemes, Implementation of syntax-directed translators, Intermediate code,

Postfix notation, Parse trees and syntax trees, Three-address code, quadruples, and triples ,Translation of

assignment statements, Boolean expressions, Statements that alter the flow of control, Postfix

translations

Unit II: More about Translation, Symbol Tables and Error detection and recovery [15 L ]

Array references in arithmetic expressions, Procedure calls, Declarations, Case statements, Record

structures.

Symbol Tables: The contents of a symbol table, Data structures for symbol tables, Representing scope

information, Implementation of block-structured languages, Storage allocation in FORTRAN, Storage

allocation in block-structured languages

Errors, Lexical-phase errors, Syntactic-phase errors, Semantic errors.

Unit III: Code Optimization [15 L ]

Code Optimization: The principle sources of optimization, Loop optimization, The DAG representation

of basic blocks, Global data-flow analysis.

Loop optimization: Dominators, Reducible flow graphs, Depth-first search, Loop-invariant

computations, Induction variable elimination ,Some other loop optimizations

Unit IV: Data Flow Analysis and Code generation [15 L ]

Data-flow analysis: Reaching definitions again, Available expressions, Copy propagation, Backward

flow problems, Very busy expressions and code hoisting, The four kinds of data-flow analysis problems.

Code Generation: Object programs, Problems in code generation, A machine model, A simple codegenerator, Register allocation and assignment, Code generation from DAGs, Peephole optimization

References:

Principles of Compiler Design, Alfred V. Aho & Jeffrey D. Ullman


PSCS202 Digital Signal Processing -II 4

Unit I: An introduction to the theory of two dimensional signal processing and Digital

hardware:Two-dimensional signals-systems-causality- seperability -stability-difference equations-Frequency

Domain Techniques- Z Transforms-finite sequences-Two dimensional DFT-Two dimensional windows-

Frequency sampling filters- frequency transformations from one to two dimensions. Digital

Hardware: Design procedure for Digital Signal Processing Hardware- the major logic families-

commercial logic packages- gates, multiplexers and decoders- Flip-Flops-arithmetic Units-

dividers and floating point hardware. [15L]


16/24

16

Unit II: Special purpose hardware for digital filtering and signal generation: [ 1 5 L ]

Direct form FIR hardware- parallelism for direct form FIR- Cascade FIR filters-IIR filters- Digital Touch

Tone Receiver (TTR) - Digital time Division Multiplexing (TDM) to Frequency Division

Multiplexing (FDM) translator partitioning of digital filters for IC Realization- Hardware realization of

a Digital Frequency Synthesizer.

Special purpose hardware for FFT : FFT indexing- bit reversal and digit reversal for fixed radices-

Comparison of computations for radices.Unit III: Introduction to quantization effects in FFT Algorithms. [1 5 L]

Hardware for Radix 2 Algorithm- FFT Computation using Fast Scratch Memory.Radix

2 and Radix 4 Parallel structures using RAMs- Pipeline FFT- Comparison of Pipe line FFTs-

overlapped FFT with random access memory-real time convolution via FFT using a single Ram and one

AE.

General Purpose hardware for signal Processing facilities : Special and general purpose

computers- input output problems for real time processing- methods of improving computer

speed parallel operations of memories, Arithmetic, control and instruction fetches- the Linco

Laboratory Fast Digital Processor(FDP). Doing FFT in FDP- LSP2.

Unit IV: Application of Digital signal processing to Speech and Radar: [15 L]Models of speech production-Short time spectrum analysis- speech analysis-synthesis System based on

short time spectrum analysis- channel vocoder- analyzers-synthesizers- pitch detection and voiced

unvoiced detections- homomorphic processing of speech, vocoder-formant Synthesis- Voiced

Unvoiced Detection- Voiced Fricative excitation network- Linear prediction of speech- Computer Voice

Response system.

Radar: Radar principle and application radar systems and parameter- Signal design and ambiguity

functions- Airborne Surveillance Radar for Air Traffic Control Digital matched Filter for a high

performance Radar.

References:

1) Theory and application of Digital signal processing Lawrence R. Rabiner Bernard Gold-

prentice hall of India.

2) Digital Signal Processing and the Microcontroller by Dale Grover and John R. (Jack) Deller

with illustrations by Jonathan Roth.


PSCS203 Computer Simulation & Modeling [60 Lectures] 4

Unit I :Introduction to Simulation, examples , Principles and Software, statistical models [15 L]

In SimulationIntroduction: System and System environment, Components of system, Type of systems, Type of

models, Steps in simulation study, Advantages and Disadvantages of simulation. Examples:

Simulation of Queueing systems, Other examples of simulation. General Principles: Concepts of

discrete event simulation, List processing. Simulation Software: History of simulation software,

Desirable software features, General-purpose s i m u l a t i o n p a c k a g e s , Object oriented simulation,

Trends in simulation software. Statistical Models: Useful statistical model, Discrete distribution,

Continuous distribution, Poissonprocess, Empirical distribution.


17/24


18/24

18

Unit III: Databases on the Web and active databases: [15 L]

Data versus Documents, Storing and Retrieving Data, Query Languages like Xquery, Storing and

Retrieving Documents, Semi Structured Data Model, Indexes for text data.

Active databases: Languages for rule specification: Events, Conditions, Actions. Execution

model: Rule execution, Conflicts resolution, Coupling modes and termination.

Unit IV: Advanced topics in Databases: [15 L]

Deductive databases: Introduction to recursive queries, Datalog, Least model semantics, The fixedpoint operator, Safe datalog program, Stratification, Evaluating recursive queries.

Spatial Databases: Types of spatial data, R tree structure, Spatial query evaluation, Introduction to

GIS, Comparison between spatial databases and GIS. Data structures in GIS.

Temporal Databases: Transaction time databases, Valid time databases:, Bi-temporal databases,

Temporal queries.Introduction to Mobile databases.

References:

1. Raghu Ramakrishnan, Johannes Gehrke, Database Management Systems, McGraw-Hill

2. Elmasri and Navathe, Fundamentals of Database Systems, Pearson Education

Additional References:

1. Korth, Silberchatz, Sudarshan , Database System Concepts, McGraw-Hill.2. Peter Rob and Coronel, Database Systems, Design, Implementation and Management,

Thomson Learning.

3. C.J.Date, Longman, Introduction To Database Systems, Pearson Education

List of Practical Experiments of Semester II

Sr

No.

Course: PSCS- P5

Principles of Compiler Design1 Write a C/C++/JAVA program to obtain the three address code for the following type of input

arithmetic expressions

a= -(b+c)*d or a= a+b*c/e+1Perform the following.

1. Print the operators and variables/constant on the screen.2. Compute and generate the temporaries Tirequired for generation of three address code.3. show each three address statement on the screen

2 Write a C/C++/JAVA program to obtain Quadruple representation for the following type of

input arithmetic expressions

a= -(b+c)*d or a= a+b*c/e+1

Perform the following.1. Print the operators and variables/constant on the screen.2. Compute and generate the temporaries Tirequired for generation of three address code.3. Show each quadruple statement on the screen.

3 Write a C/C++/JAVA program to obtain Triple representation for the following type of input

arithmetic expressions

a= -(b+c)*d or a= a+b*c/e+1

Perform the following.

1. Print the operators and variables/constant on the screen.2. Compute and generate the temporaries Tirequired for generation of three address code.3. Show each triple statement on the screen.


19/24


20/24

20

Sr

No.

Course: PSCS- P6

Digital Signal Processing

(Practical experiments shall be conducted using Matlab)

1 Write a program to determine whether a given system is stable as per Bounded Input

Bounded Output (BIBO) criteria. Supply system coefficients and print the result.

2 Generate the basic functions in two dimensions like unit impulse, unit step, ramp, exp etc.

and display the output on the screen.

3 Write a program for determining the Two-dimensional Linear Convolution of a finiteduration sequence x(n1,n2) and h(n1,n2). Accept the sequences x(n1,n2) and h(n1,n2) from

the user. Display the output sequence y(n1,n2). Plot all the three sequences. Test on suitable

input sequences. Use random input sequences.

4 Write a program to compute cross-correlation of 1-dimensional sequence using the definition

of cross-correlation. Test your program using suitable inputs.

5 Write a program to compute cross-correlation of 2-dimensional sequence using cross-

correlation. Test the program using relevant inputs.

6 Write a program to compute auto-correlation of 1-dimensional sequence using the definition

of auto-correlation. Test your program using suitable inputs.

7 Write a program to compute auto-correlation of 2-dimensional sequence using uto-correlation. Test your program using suitable inputs.

8 Generate a random 2-D signal. Display the plots-magnitude and phase response. Also plot

the frequency content of it.

9 Compute 2- dimensional N-point DFT of a given input sequence. Vary the value of N and

visualize the effect with N = 8,16,24,64,128,256.

10 Design a 2-dimensional N-point FIR with the cutoff frequency range and desired magnitude

response using Rectangular, Hamming and Kaiser windows. Compare with N = 1024 andrecord your observations. Plot the magnitude and phase response of the filter. Use a suitable

input.

11 Design a 2-dimensional N-point FIR with the cutoff frequency range and desired magnitude

response using Blackman and Hanning windows. Compare the filter output with Kaiser

window. Plot the frequency response of the filter. Use a suitable input.

12 Design a Lowpass Chebyshev Type II filter of the given order, stopband attenuation and

stopband edge frequency.

13 Design a Highpass and bandstop Chebyshev Type II analog filter of the given order,

stopband attenuation and stopband edge frequency.

14 Desgin a given order, bandpass, Chebyshev Type II filter with passband frequencies and plot

the impulse response of the filter.

15 Write a program to calculate short time autocorrelation using windowing method on a

speech signal.


21/24

21

Sr

No.

Course: PSCS- P7

Computer Simulation and Mathematical Modeling

1. Write a C/C++/Excel Program to simulate a Single-Channel Queuing Model for a givendata/example. [For C/C++ Programming use the library functions to generate the n-digited

random numbers. For Excel use the in-built function to generate the n-digited random

numbers.]Prepare a simulation table and answer the following queries such as find

i) Avg. waiting time (minutes)ii) Probability that a customer has to waitiii) Probability of idle serveriv) Avg. service time (minutes)v) Avg. time between arrivals (minutes)vi) Avg. waiting time of those who wait (minutes)vii) Avg. time customer spends in the systems (minutes)

2. Write a C/C++/Excel Program to simulate a Multi-Channel Queuing Model (e.g. Able andBaker) with one of the servers getting the higher preference for a given data / example. [For

C/C++ Programming use the library functions to generate the n-digited random numbers.

For Excel use the in-built function to generate the n-digited random numbers.]

Prepare a simulation table and do the subsequent analysis for m service completions andanswer the following queries such as find:

1) Percentage of time Able and Baker individually where busy over totalservice time.

2) Percentage of arrivals had to wait.3) The average waiting time for all the customer4) The average waiting time for the customer who had to wait.

Draw the conclusion regarding the system and cost of waiting.

3. Write a C/C++/Excel Program to simulate an Inventory System Example / data.

(The Newspaper Sellers Problem). Prepare the simulation table and find out the total profi

for the given example.

[For C/C++ Programming use the library functions to generate the n-digited randomnumbers. For Excel use the in-built function to generate the n-digited random numbers.]

4. Write a C/C++/ Excel Program to implement Event-scheduling/time-advance algorithm for Single-

Channel Queue. Show the Simulation Table with the following attributes: (Clock, System State, Futur

Event List, Cumulative Statistics)

5. Write a program in C/C++/Excel to generate code to simulate Discrete Distributions for:i. Bernoulli trials and the Bernoulli distributionii Binomial Distributions

iii Geometric Distributions

iv Poisson Distributions

6.Write a program in C/C++/Excel to generate code to simulate Continuous Distributions for:

a. Uniform Distributionb. Exponential Distributionc. Gamma Distributiond. Erlang Distribution

7. Write a program in C/C++/Excel to generate code to simulate Continuous Distributions for:a. Normal Distributionb. Weibull Distributionc. Triangular Distributiond. Lognormal Distribution


22/24

22

8. Write a C/C++/Excel Program to find Probability Distribution Function (pdf) and CumulativeDistribution Function (cdf) for Uniform DistributionAccept the parameters a and b from the user for

the random variable X which is distributed uniformly between a and b.

Write a C/C++/Excel Program to find Probability Distribution Function (pdf) and Cumulative

Distribution Function (cdf) forExponential Distribution. Accept from the user the parameter of

distribution > 0.

9. Write a C/C++/Excel Program to find Probability Distribution Function (pdf) and Cumulative

Distribution Function (cdf) for Gamma Distribution. Accept the parameters and from the user.Write a C/C++/Excel Program to find Probability Distribution Function (pdf) and Cumulative

Distribution Function (cdf) for Erlang Distribution Accept the order k (When = k) of the

distribution and the parameter kfrom the user.

10. Write a C/C++/Excel Program to find Probability Distribution Function (pdf) and CumulativeDistribution Function (cdf) for Normal Distribution Accept mean , variance

2 and the

transformation variable z = t - / .


Distribution Function (cdf) for Weibull Distribution Accept for a random variable X with the location

parameter , scale parameter > 0, and the shape parameter > 0 from the user.

11. Write a C/C++/Excel Program to find Probability Distribution Function (pdf) and CumulativeDistribution Function (cdf) for Triangular DistributionAccept parameters a,b,c where a b c from

the user.


Distribution Function (cdf) for Lognormal DistributionAccept parameters mean and variance 2

from the user.

12. Write a C/C++/Excel program to generate Random numbers using:1. Linear Congruential method: Accept constant multiplier a, increment c, Modulus m, and seed X0

from the user.

2. Multiplicative Congruential method: Accept constant multiplier a, modulus m, and seed X0 fromthe user.

13. Generate code for testing Random Numbers using1. Frequency Test2. Run Test3. Autocorrelation Test

14. Write a C/C++/Excel Program to simulate a Queuing Model of the form A/B/C/N/K have their usualmeaning and identify Time-Average Number and Average Time Spent in System per Customer.

15. Write a C/C++/Excel Program to implement Acceptance-Rejection Technique for a given

Distribution( Poisson or Gamma distribution).


23/24

23

Sr

No.

Course: PSCS P8

Advanced Database Systems

1. Object oriented databases- Simple examples

2. Object oriented databases- Nested tables

3. Distributed databases- Replications

4. Distributed databases- Horizontal partition

5. Distributed databases- Vertical partition

6. XML databases

7. Spatial databases

8. Temporal databases

9. Active databases- row level triggers

10. Active databases- statement level triggers


24/24

24

Scheme of Examination for Theory Courses

There will be an internal and external examination for the Theory Courses. The weightage of internal/

external and scheme of examination will be as per common guidelines provided by the University for all the

PG courses in the faculty of Science.

Scheme of Examination for Practical Courses

There will not be any internal examination for practical courses.

External Examination for practical courses:

The particulars of the external practical examination for each practical course are given below:

Sr.No.Particulars for External Practical Examination Marks

1 Semester End Practical Examination 50 Marks

Laboratory Work 40 Marks

Journal

05 Marks

Viva 05 Marks

1. Students should maintain a journal for each practical course with at least twelve practicalexperiments from the list of practical experiments.

2. External Examination on practical courses will be clubbed into two groups Group A andGroup B. The pattern of external practical examination for semester I and Semester II is

given below:

Semester I

Group Durationof Exam

Course Credits MaximumMarks

Marks forExperiment

Marksfor Viva

Marks forJournal

Group

A 4 hours

PSCS-P1 2 50 40 5 5

PSCS-P2 2 50 40 5 5

GroupB 4 hours

PSCS-P3 2 50 40 5 5

PSCS-P4 2 50 40 5 5

Semester II

Group Duration

of Exam

Course Credits Maximum

Marks

Marks for

Experiment

Marks

for Viva

Marks for

Journal

GroupA 4 hours

PSCS-P5 2 50 40 5 5PSCS-P6 2 50 40 5 5

Group

B 4 hours

PSCS-P7 2 50 40 5 5

PSCS-P8 2 50 40 5 5

Msc Cs Restructured Syllabus With Modfied List of Practicals (1)

Documents

Transcript of Msc Cs Restructured Syllabus With Modfied List of Practicals (1)