#1
16th June 2015, 03:29 PM
| |||
| |||
MSC Computer Science Syllabus Mumbai University
Can you please provide here syllabus of MSC Computer Science course of Mumbai University?
|
#2
17th June 2015, 09:27 AM
| |||
| |||
Re: MSC Computer Science Syllabus Mumbai University
As you want I am here providing you syllabus of MSC Computer Science course of Mumbai University. Syllabus : First year : Section I : Principles of Compiler Design-I Section II : Principles of Compiler Design-II Section I : Digital Signal Processing-I Section II : Digital Signal Processing-II Section I : Mobile Computing Section II : Computer Simulation and Modeling Section I : Data Warehousing and Mining Section II : Advanced Database Systems Second year : Section I : Artificial Intelligence Section II : Image Processing Section I : Distributed Computing Section II : Embedded Systems Term I Introduction to Compilers o Compilers and translators o Why do we need translators? o The structure of a compiler o Lexical analysis o Syntax analysis o Intermediate code generation o Optimization o Code generation o Book keeping o Error handling o Compiler writing tools o Getting started Programming languages o High-level programming languages o Definitions of programming languages o The lexical and syntactic structure of a language o Data elements o Data structures o Operators o Assignment o Statements o Program units o Data environments o Parameter transmission o Storage management Finite automata and lexical analysis o The role of the lexical analyzer o A simple approach to the design of lexical analyzers o Regular expressions o Finite automata o From regular expressions to finite automata o Minimizing the number of states of a DFA o A language for specifying lexical analyzers o Implementation of a lexical analyzer o The scanner generator as Swiss army knife The syntactic specification of Programming Languages o Context-free grammars o Derivations and parse trees o Capabilities of context-free grammars Basic Parsing Techniques o Parsers o Shift-reduce parsing o Operator-precedence parsing o Top-down parsing o Predictive parsers Automatic Construction of Efficient Parsers o LR parsers o The canonical collection of LR(0) items o Constructing SLR parsing tables o Constructing canonical LR parsing tables o Constructing LALR parsing tables o Using ambiguous grammars o An automatic parser generator o Implementation of LR parsing tables o Constructing LALR sets of items UBJECT: PRINCIPLES OF COMPILER DESIGN, Paper I, Term II Syntax-Directed Translation o Syntax-directed translation schemes o Implementation of syntax-directed translators o Intermediate code o Postfix notation o Parse trees and syntax trees o Three-address code, quadruples, and triples o Translation of assignment statements o Boolean expressions o Statements that alter the flow of control o Postfix translations o Translation with a top-down parser More about Translation o Array references in arithmetic expressions o Procedure calls o Declarations o Case statements o Record structures o PL/I-style structures Symbol Tables o The contents of a symbol table o Data structures for symbol tables o Representing scope information Symbol tables o Implementation of a simple stack allocation scheme o Implementation of block-structured languages o Storage allocation in FORTRAN o Storage allocation in block-structured languages Error detection and recovery o Errors o Lexical-phase errors o Syntactic-phase errors o Semantic errors Introduction to code optimization o The principle sources of optimization o Loop optimization o The DAG representation of basic blocks o Value numbers and algebraic laws o Global data-flow analysis More about loop optimization o Dominators o Reducible flow graphs o Depth-first search o Loop-invariant computations o Induction variable elimination o Some other loop optimizations More about data-flow analysis o Reaching definitions again o Available expressions o Copy propagation o Backward flow problems o Very busy expressions and code hoisting o The four kinds of data-flow analysis problems o Handling pointers o Interprocedural data-flow analysis o Putting it all together Code generation o Object programs o Problems in code generation o A machine model o A simple code generator o Register allocation and assignment o Code generation from DAG.s o Peephole optimization Practical Debug C++ / JAVA Programs using debugger provided by different vendors along with IDE Make a comparative study of Different features of at least two Integrated Development Environment(IDE) and compilers Manipulation of IDE.s and restoring the original setting SUBJECT: Digital Signal Processing , Paper II, Term I Term I 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 Transformthe 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. The Theory and approximation of finite duration impulse 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-linear phase 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. Theory and approximation of infinite impulse response digital filters- IIR filters-filter coefficient- Digital Filter Design .Mapping of differentials-Transformations-Direct design of digital filterscomparison 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 Spectrum analysis and the fast fourier Trans form-introduction to Radix-2 FFT.s-data shuffling and bit reversal-FFT computer programming-Decimation .in-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-Bluestein. Algorithm-The chirp z transform algorithm- convolution and correlation using number theoretic transforms. Here is the attachment. |
|