1

Khandesh College Education Society’s

Moolji Jaitha College, Jalgaon

An “Autonomous College” Affiliated to

KBC North Maharashtra University, Jalgaon

SYLLABUS STRUCTURE OF

M. Sc. Computer Science

Under Choice Based Credit System (CBCS)

[w. e. f. Academic Year: 2019-20]

2

M. Sc.- I (Computer Science)

Term/

Semester

Course

Module

Subject

code

Title of paper No. of Credits No. of Hours

per week

I

DSC CS-101 Digital Image Processing

4 4

DSC CS-102 Advanced Operating

System

4 4

DSC CS-103 Practical Course I 4 8

DSC CS-104 Practical Course II 4 8

SEC CS-105 Advanced C++

programming

4 4

DSE CS-106 Automata Theory and

Computability

4 4

II

DSC CS-201 Software Engineering 4 4

DSC CS-202 Design and Analysis of

Algorithms

4 4

DSC CS-203 Practical Course III 4 8

DSC CS-204 Practical Course IV 4 8

GE CS-205 Optimization Algorithms 4 4

DSE CS-206 Artificial Intelligence 4 4

3

M. Sc.- II (Computer Science)

Examination Pattern for the all Courses (60: 40)

Nature Marks

External Marks 60

Internal Marks 40

Total Marks 100

Term/

Semester

Course

Module

Subject

code

Title of paper No. of

Credits

No. of

Hours

per

week

III

DSC CS-301 Advanced Network

Programming

4 4

DSC CS-302 Data Warehousing and Data

Mining

4 4

DSC CS-303 Practical course based on

CS-301

4 8

DSC CS-304 Practical course based on

CS-302 and CS-306

4 8

SEC CS-305 Web Programming using

DOT NET

4 4

DSE CS-306 Compiler Construction 4 4

IV

DSC CS-401 Current Computing Trends 4 4

DSC CS-402 Internet of Things 4 4

DSC CS-403 Practical course based on

CS-401

4 8

DSC CS-404 Project and Viva Voce 4 8

GE CS-405 Information System and

Security.

4 4

DSE CS-406 Natural Language Processing 4 4

Khandesh College Education Society’s

Moolji Jaitha College, Jalgaon

An “Autonomous College” Affiliated to

KBC North Maharashtra University, Jalgaon

SYLLABUS

Computer Science

M. Sc. I

(Semester I & II)

Under Choice Based Credit System (CBCS)

[w. e. f. Academic Year: 2019-20]

M. Sc.- I (Computer Science)

Examination Pattern for the all Courses (60: 40)

Nature Marks

External Marks 60

Internal Marks 40

Total Marks 100

Term/

Semester

Course

Module

Subject

code

Title of paper No. of Credits No. of Hours

per week

I

DSC CS-101 Digital Image Processing

4 4

DSC CS-102 Advanced Operating

System

4 4

DSC CS-103 Practical Course I 4 8

DSC CS-104 Practical Course II 4 8

SEC CS-105 Advanced C++

programming

4 4

DSE CS-106 Automata Theory and

Computability

4 4

II

DSC CS-201 Software Engineering 4 4

DSC CS-202 Design and Analysis of

Algorithms

4 4

DSC CS-203 Practical Course III 4 8

DSC CS-204 Practical Course IV 4 8

GE CS-205 Optimization Algorithms 4 4

DSE CS-206 Artificial Intelligence 4 4

SEM-I

DSC : CS-101: Digital Image Processing

Unit-1 Introduction [H:8]

Unit-2 Image Processing Fundamental [H:8]

Unit-3 Image Enhancement [H:8]

Unit-4 Image Restoration and Transforms [H:10]

Unit-5 Color Image Processing [H:8]

Unit-6 Morphological Image Processing & Segmentation [H:10]

Unit-7 MATLAB Image Processing [H:8]

References:

DSC : CS-102 Advanced Operating Systems

Unit-1 Overview [H:5]

Introduction to Kernel, Architecture of UNIX operating system , Introduction to system

concepts, Introduction to shell programming and UNIX commands.

Unit-2 Buffer cache [H:5]

Buffer headers, Structure of the buffer pool, Scenarios for retrieval of a buffer – Reading and

writing disk blocks, Advantages and disadvantages of the buffer cache.

Unit-3 File Subsystem [H:10]

Internal representation of files: Inodes, Structure of a regular file and Directories, Conversion

of a path name to an Inode, Super block, Inode assignment to a new file, Allocation of disk

blocks.

Unit-4 System Calls for the File System [H:10]

Open – Read – Write – File and record locking – Adjusting the position of file I/O lseek –

Close, File creation – Changing directory, root, owner, mode, stat and fstat, Pipes – Dup,

Mounting and unmounting file systems - Link – unlink.

Unit-5 Processes [H:10]

Process states and transitions, Layout of system memory, The context of a process, Saving

the context of a process, Manipulation of the process address space - Sleep.

Unit-6 Process Control [H:10]

Process creation Signals, Process termination, Awaiting process termination, Invoking other

programs – user id of a process – Changing the size of a process, Shell – System boot and the

INIT process– Process Scheduling.

Unit-7 Memory Management and I/O: [H:10]

Memory Management Policies: Swapping – Demand paging, Driver Interface – Disk Drivers

– Terminal Drivers, Streams, Inter process communication

Reference Books:

1. The Design of the Unix Operating System, Maurice J. Bach, Pearson Education.

2. The Magic Garden Explained , B. Goodheart, J. Cox, Prentice Hall of India.

3. The Design and Implementation of the 4.3 BSD Unix Operating System, S. J. Leffler, M.

K. Mckusick, M. J. .Karels and J. S. Quarterman., Addison Wesley.

4. Windows System Programming, J. Hart, Pearson Education, 2008.

5. Linux Programming by Example: The Fundamentals, A. Robbins, Pearson Education,

2008.

DSC : CS-103 -Practical Course I - Lab on Advanced OS & Digital Image

Processing

Part I: Advanced OS

1. Use of Unix/Linux – User Commands – Editors - Shell programming

2. C/C++ programming on Unix/Linux – use of make, version control

3. Use of system calls – files – processes – I/O – IPC

4. Experiments using C of mini unix systems (such as Minix) – File system – Processes –

Memory Management – Drivers

5. Unix / Linux sources – build, run kernel – small modifications

Part II: DIP

1. Display of Grayscale Images, Color images.

2. Arithmetic Operation on Images

3. Histogram Equalization

4. Conversion between color spaces.

5. Max-min Non-linear Filtering.

DSC : CS-104- Practical Course II- Lab on Advanced C++ Programming

SEC :CS-105: Advanced C++ Programming

Unit-1 Inheritance and Polymorphism: [ H: 05 ]

Unit-2 Exception Handling: [ H: 05 ]

Unit-3 Runtime Type Information: [ H: 03 ]

Unit-4 Inheritance Hierarchies: [ H: 05 ]

Unit-5 Applications of C++ Concepts: [ H: 04 ]

Unit-6 An Overview of Templates: [ H: 08 ]

Unit-7 Introduction to Standard Template Library: [ H: 07 ]

Unit-8 STL Iterators: [ H: 06 ]

Unit-9 STL Container: [ H: 11 ]

Unit-10 Generic Algorithms: [ H: 06]

References:

DSE :CS-106: Automata Theory and Computability

Unit 1 : Finite Automata and Regular Languages [ H:14]

Introduction : States and Automata, Finite Automata as Language Acceptors, Deterministic and

Non deterministic Finite Automata, Properties of Finite Automata : Equivalence of finite

Automata, transitions, Moore and Mealy machine models, Regular expressions : Definition and

examples, Regular expressions and finite automata, Regular expressions from DFA.

Unit 2 :Regular Sets and Context Free Grammar [ H:14]

Pumping lemma for regular sets, application of pumping lemma, closure properties of regular

sets. Context free grammar, Derivation tree: Leftmost, rightmost, ambiguous grammar,

Simplification of context free grammar: Construction of reduced grammar, elimination of null

production and elimination of unit production. Normal forms: Chomsky Normal Form, Griebach

Normal Form.

Unit 3: Pushdown Automata and Turing Machine [ H:16]

Acceptance by empty store and final state, equivalence between pushdown automata and context

free grammar, Closure properties of CFL, Deterministic PDA.

Techniques for TM construction : Generalized and restricted versions equivalent to the basic

model,Godel numbering, universal TM, recursive enumerable sets and recursive sets,

computable functions, time-space complexity measures, context sensitive languages and linear

bounded automata(LBA), multitapeturing machine

Unit 4: Decidability [H:4]

Post correspondence problem, decidability of membership, emptiness and equivalence problems

of languages.

Unit 5 : Computability [ H:8]

Primitive Recursive functions : Initial function, Primitive recursive functions over N, primitive

recursive functions{a,b}. Recursive functions.

Unit 6 : Complexity measures [ H:4]

Time and tape complexity measures of Turing machines, random access machines, the classes P

and NP, NP completeness.

References :

1. K. Krithivasan and R. Rama, “Introduction to Formal Automata Theory and

Computation”,,2009, ISBN: 9788131723562, Pearson Education.

2. J.E. Hopcroft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory Languages

and Computation”, 2nd Edition, 2001,ISBN: 9780201441246, Pearson Education Asia.

3. Bernard M. Moret, “The Theory of Computation”, 2nd Edition, 2008, ISBN:

9788131708705, Pearson Education.

4. K.L.P.Mishra, N. Chandrasekaran,“Theory of Computer Science: Automata, Languages and

Computation”, 3rdEdition, 2007, ISBN-10: 8120329686, Prentice-Hall of India.

SEM-II

DSC : CS-201- Software Engineering

Unit – 1 Introduction to Software Engineering [H:6]

Unit -2 Software Process Models: [H:10]

Unit -3 Requirement Specifications: [H:8 ]

Unit – 4 Design Concepts [H:12]

Unit- 5 Testing [H:8]

Unit- 6 Quality Management [H:8]

Unit – 7 Software Configuration Management (SCM) and Project Scheduling [H:8]

References:

DSC : CS -202 Designs and Analysis of Algorithm

Unit - 1 Introduction: [H:14]

Unit - 2 Divide and Conquer: [H:8]

Unit- 3 Greedy Algorithms: [H:12]

Unit- 4 Dynamic Programming: [H:14]

Unit - 5 Backtracking: [H: 6]

Unit - 6 Problem Classifications: [H:6]

References :

DSC : CS-203- Practical Course III -Lab on Design &Analysis of Algorithms

DSC : CS-204- Practical Course IV - Lab on Artificial Intelligence

Note: Following practicals should be implemented in C/C++.

Part I: Artificial Intelligence

GE : CS-205 Optimization Algorithms Unit-1 Overview of Operations Research and Linear Programming [H:16]

Introduction, Quantitative Techniques and their field of applications, Classification of

Quantitative Techniques, Limitations of Quantitative Techniques

Introduction – Graphical Solution; Graphical Sensitivity Analysis– The Standard Form

Of Linear Programming Problems – Basic Feasible Solutions -Unrestricted Variables –

Simplex Algorithm – Artificial Variables – Big M And Two Phase Method –Degeneracy

– Alternative, Optimal – Unbounded Solutions – Infeasible Solutions.

Unit-2 Dual Problems: [H:6]

Relation between Primal and Dual Problems – Dual Simplex Method

Unit-3 Transportation Model: [H:12]

Starting Solutions. North West Corner Rule - Lowest Cost Method–Vogels

approximation Method – MODI Method, Stepping Stone Method, Transportation

Algorithms –Assignment Problem –Hungarian Method.

Unit-4 Game Theory: [H:10]

Introduction, Two-Person Zero-Sum Games, Some Basic Terms, the Maxmini Minimax

Principle, Games Without Saddle Points-Mixed Strategies, Graphic Solution of 2 * N

and M*2 Games, Dominance Property.

Unit-5 Network Models: [H:8]

Definitions – CPM and PERT Network Minimization, Shortest Route Problem,

Critical Path Calculations, PERT Calculation, Float Analysis.

Unit-6 Sequencing Models [H:8]

Processing N Jobs through 2 Machines, N Jobs through 3 Machines, Two

Jobs through M Machines.

References:

1. Handy A Taha, “Operations Research – An Introduction”, 9th Edition, 2011,

ISBN:9780131391994, Pearson Education.

2. Prem Kumar Gupta, D. S. Hira, “Operations Research”, 7th Edition, 2014,

ISBN:9788121902816, S. Chand & Company LTD.

3. R. PanneerSelvam, “Operations Research”, 2nd Edition, 2016, ISBN:9788120329287,

Prentice Hall of India.

4. L.C. Jhamb, “Quantitative Techniques for Managerial Decisions: Vol. I”,3rd Edition,

ISBN:9788186314623, Everest Publishing House.

DSE : CS-206 Artificial Intelligence

Unit-1 Introduction: [H:2]

Unit-2 Problems, Problem Spaces, and Search: [H:6]

Unit-3 Heuristic Search Techniques: [H:5]

Unit-4 Knowledge Representation: [H:4]

Unit-5 Using Predicate Logic: [H:8]

Unit-6 Weak Slot-and-Filler Structures: [H:5]

Unit-7 Strong Slot-and Filler Structures: [H:5]

Unit-8 Learning [H:3]

Unit-9 Planning & Understanding [H:6]

Unit-10 Neural networks [H:6]

Unit-11 Fuzzy logic [H:6]

Unit-12 Genetic algorithms [H:4]

References: