Syllabus for preparing for MSc course?

I am searching for the University of Pune M.Sc. (Computer Science) syllabus? Can you please tell me from where I can download the University of Pune M.Sc. (Computer Science) syllabus?

[Arun Vats]

You are asking for the University of Pune M.Sc. (Computer Science) syllabus. The University of Pune M.Sc. Computer Science consists of the following subjects:

Semester 1
CS-101(New) : Principles of Programming Languages
CS-102(New) : Advanced Networking
CS-103(New) : Distributed Database Concepts
CS-104(New) : Design and Analysis of Algorithms
CS-105(New) : Laboratory Course (Departmental)

Semester 2
CS-201(New) : Digital Image Processing
CS-202(New) : Advanced Operating Systems
CS-203(New) : Data Mining and Data Warehousing
CS-204(New) : Elective Course(Departmental)
CS-205(New) : Laboratory Course (University)

Semester 3
CS-301(New) : Software Metrics & Project Management
CS-302(New) : Mobile Computing
CS-303(New) : Soft Computing
CS-304(New) : Elective Course(Departmental)
CS-305(New) : Laboratory course (Departmental)

Semester 4
CS-401(New) : Full time Industrial Training

Here I am uploading a file that contains the M.Sc. (Computer Science) syllabus of the University of Pune. You can download it from here. Here I am also providing you the some content of file. This is looks like as follows:


Introduction 4
Definition of Digital Image Processing, The Origins of Digital Image Processing, Examples of
Fields that Use Digital Image Processing - X-ray Imaging, Ultraviolet Band, Visible and Infrared
Bands, Microwave Band, and Radio Band Imaging; Fundamental Steps in Digital Image Processing,
Components of an Image Processing System

List of Elective Courses
1. Advanced Algorithms
2. Functional Programming
3. Linux Kernel Programming and Introduction to Device Drivers
4. Natural Language Processing
5. Program Analysis
6. DOT NET
7. Information Systems Security
8. Software Architecture and Design Patterns
9. Software Testing Tools & Methodologies
10. Modeling and Simulations
11. Embedded System Programming
12. Language Processors
13. Artificial Intelligence

CS-101(New): Principles of Programming Languages
[Total Lectures: 48 Hours]
Course Prerequisites:
It is assumed that student learning this course have the following background:
Experience with an OOP language (such as Java or C++)
Experience with a procedural language (such as C)
Working knowledge of C, C++, and Java programming.
Basic algorithms and data structure concepts.

Why to study this course?
To allow Informed Design Decisions
Gives insight when debugging
Permits effective use of compilers/linkers interpreters and language oriented tools.
Helps to understand how language features work.
Learn features, emulate missing features.
Develop a greater understanding of the issues involved in programming language
design and implementation
Develop an in-depth understanding of functional, logic, and object-oriented
programming paradigms
Implement several programs in languages other than the one emphasized in the
core curriculum (Java/C++)
Understand design/implementation issues involved with variable allocation and
binding, control flow, types, subroutines, parameter passing
Develop thorough understanding of the compilation process
To introduce several different paradigms of programming
To gain experience with these paradigms by using example programming
languages
To understand concepts of syntax, translation, abstraction, and implementation

Course Objectives:
This course will prepare you to think about programming languages analytically:
- Separate syntax from semantics
- Compare programming language designs
- Learn new languages more quickly
- Use standard vocabulary when discussing languages
- Understand basic language implementation techniques
This course focuses on both:
- Theory is covered by the textbook readings, lectures, and on the tests
- Implementation is covered by the homework assignments

1. Introduction [ T1 chap. 1] [2]
The Art of Language Design [ T1 1.1]
The Programming Language Spectrum [ T1 1.2]
Why Study Programming Languages? [ T1 1.3]
Compilation and Interpretation [ T1 1.4]
Programming Environments [ T1 1.5]

2. Non-Imperative Programming Models: Functional, Logic Languages
[ Text books 3, 4] [10]
Common LISP
Basic LISP Primitives ( FIRST, REST, SETF, CONS, APPEND, LIST,
NTHCDR, BUTLAST,LAST, LENGTH, REVERSE, ASSOC)
Procedure definition and binding, DEFUN, LET
Predicates and Conditional,
EQUAL, EQ, EQL, =, MEMBER, LISTP, ATOM, NUMBERP,
SYMBOLP, NIL, NULL, IF, WHEN, UNLESS,
COND, CASE
Procedure Abstraction and Recursion

Turbo Prolog
Introduction, facts, Objects and Predicates, Variables, Using Rules, Controlling
execution fail and cut predicates
[ T3 chapter 1 through 9 except chapter 2 ]

3. Names, Scopes, and Bindings [ T1 chap.3] [5]
The Notion of Binding Time [ T1 chap.3.1]
Object Lifetime and Storage Management : [ T1 chap. 3.2]
Static Allocation, Stack-Based Allocation, Heap-Based Allocation, Garbage
Collection
Scope Rules [ T1 chap. 3.3]
Static Scoping, Nested Subroutines, Declaration Order, Dynamic Scoping
The meaning of Names in a Scope [ T1 chap. 3.5]
Aliases, Overloading, Polymorphism and Related Concepts
The Binding of Referencing Environments [ T1 chap. 3.6]
Subroutine Closures, First-Class Values and Unlimited Extent, Object
Closures
Macro Expansion [ T1 chap. 3.7]

4. Control Flow [ T1 chap.6] [5]
Expression Evaluation [ T1 6.1]
Precedence and Associativity, Assignments, Initialization, Ordering Within
Expressions, Short-Circuit Evaluation
Structured and Unstructured Flow [ T1 6.2]
Structured Alternatives to goto
Sequencing [ T1 6.3]
Selection [ T1 6.4]
Short-Circuited Conditions, Case/Switch Statements
Iteration [ T1 6.5]
Enumeration-Controlled Loops, Combination Loops, Iterators, Logically
Controlled Loops
Recursion [ T1 6.6]
Iteration and Recursion, Applicative- and Normal-Order Evaluation

5. Data Types [ T2 chap.6] [8]
Introduction [T2 6.1]
Primitive Data Types [T2 6.2]
Numeric Types [T2 6.2.1]
Integer [T2 6.2.1.1]