me syllabus solapur university

Solapur University, Solapur

STRUCTURE AND SYLLABII OF M.E. PART I & II

OF COMPUTER SCIENCE AND ENGINEERING

M. E. PART – I

Semester - I

Sr.

No.

Subject Teaching Scheme Examination

Scheme

Total

Marks

Lectures Tutorial Practical Theory TW

1 Theory of Computer

Science

3 1 --- 100 25 125

2 Advanced Operating

System

3 --- 2 100 50 150

3 Design and analysis of

Algorithm

3 1 --- 100 25 125

4 Elective-I 3 1 --- 100 25 125

5 Elective-II 3 1 --- 100 25 125

6 Seminar I --- --- 2 --- 50 50

Total 15 4 4 500 200 700

Elective-I :: 1) Computer Vision And Image Processing, 2) Artificial Neural

Networks, 3) Real time O.S., 4) Mobile Computing

Elective-II :: 1) Multimedia Communications, 2) Embedded Systems, 3) Data

Mining, 4) Geographical Information System

Semester II

Sr.

No.


Scheme

Total

Marks


1 Computer Network

Administration

3 1 --- 100 25 125

2 Advanced Database

Design

3 --- 2 100 50 150

3 Advanced Computer

Architecture

3 1 --- 100 25 125

4 Elective-III 3 1 --- 100 25 125

5 Elective-IV 3 1 --- 100 25 125

6 Seminar II --- --- 2 --- 50 50

Total 15 4 4 500 200 700

Elective III : 1) Web Technology, 2) Component Technology, 3) Quantum

Computing, 4) Bio Informatics

Elective IV : 1) Advance Software Engineering, 2) Computer Modeling and

Simulation, 3) Natural language Processing 4) Grid Computing

M. E. PART – II

Semester III

Sr.

No.


Scheme

Total

Marks


1 Seminar III --- 2 --- --- 50 50

2 Dissertation Phase I --- --- 6 --- 150 150

Total 2 6 --- 200 200

Semester IV

Sr.

No.


Scheme

Total

Marks

Lectures Tutorial Practical TW OE

1 Dissertation Phase II --- --- 8 100 200 300

Total --- --- 8 100 200 300

Solapur University , Solapur

M.E. (Computer Science and Engineering) Part – I ( Sem – I )

1. Theory of Computer Science

Lectures : 3 Hrs/week Theory :

100 marks

Tutorials : 1 Hr/week Term

work : 25 marks

Section I

1. Introduction: (5)

Mathematical notions and terminology of sets, sequences and tuples, functions and

relations, graphs, strings and languages. Boolean logic properties and

representation. Definition. Theorems and types of proofs formal proofs, deductive,

reduction to definition, proof by construction, contradiction, induction,

counterexamples.

2. Regular languages:

(5)

Finite automata, DFA, NFA. Equivalence of DFA and NFA. An application,

Regular expressions and languages, applications.

3. Context-free languages:

(4)

CFGs, Applications, Ambiguity removal, Pushdown automata and Equivalence

with CFGs.

4. Turing machine:

(4)

Turing machines, variants of TMs, programming techniques for TMs, TMs and

computers.

Section II

5. Decidability: (4)

Decidable languages, decidable problems concerning Context-free languages. The

halting problem – Diagonalization method, halting problem is undecidable.

6. Reducibility:

(5)

Undecidable problems from language theory. Regular expressions, Turing

machines, Reduction, A simple undecidable problem (PCP), mapping reducibility

and other undecidable problems.

7. Computability: (4)

Primitive recursive functions, More examples, The recursion theorem.

8. Computational complexity:

(5)

Tractable and Interactable problems, Growth rates of functions, Time complexity

of TM of TM, Tractable decision problems, Theory of Optimization.

Text Books:

1) Introduction to Theory of Computation

- Michael Sipser (Thomson Brools Cole )

2) Introduction to Automata Theory, Languages and Computation

- J. E. Hoperoft, Rajeev Motawani and J.D. Ullman( Pearson Education Asia) 2nd

Edition.

References:

1) Discrete Mathematical structures with applications to computer science

- J. P. Thembloy and R. Manohar.

2) Theory of Computer Science – E. V. Krishnamoorthy



2. Advanced Operating System


100 marks

Practicals : 2Hr/week Term

work : 50 marks

Section I

1. Distributed computing systems fundamentals:

(4)

Introduction to Distributed computing systems, Models, Popularity. Distributed

computing system. Design issues of Distributed operating system. Distributed

computing environment.

2. Message Passing: (4)

Features of a good Message Passing System. Issues in IPC by Message Passing

Synchronization, Bullering, Multidatagram Messages, Encoding and Decoding of

Message Data, Process Addressing, Failure handling, Group Communication.

3. Remote Procedure Calls:

(5)

RPC Model, Implementing RPC Mechanism. Stub Generation. RPC Messages,

Marshaling Arguments and Results. Server Management, Parameter-Passing

semantics, call semantics, Communication protocols for RPCs, Client-Server

Building, Exception handling, Security RPC in Heterogeneous Environments,

Lightweight RPC.

4. Distributed Shared Memory: (5)

General Architecture of DSM systems. Design and implementation Issues of DSM,

Granularity, Structure of Shared Memory Space. Consistency models,

Replacement strategy, Thrashing. Synchronization: Clock Synchronization. Event

Ordering, Mutual Exclusion, Deadlock, Election Algorithms.

Section II

5. Resource Management:

(4)

Features of global scheduling algorithm. Task assignment approach, Load-

Balancing and Load approach.

6. Process Management: (4)

Introduction, Process Migration, Treads.

7. Distributed File Systems:

(5)

Features of good DFS, File models, File Accessing models. File-Sharing

Semantics, File-Caching schemes, File Replication, Fault Tolerance, Automatic

Transactions, Design Principles, Case study: DCE Distributed File Service.

8. Security: (5)

Potential Attacks to Computer systems, Cryptography, Authentication, Access

Control, Design Principles, Case study : DCE Security service.

Text book:

1. Distributed Operating Systems concepts and design-P.K.Sinha(PHI).

2. Modern Operating System-Singhal

Reference Books:

1. Distributed Systems concepts and design-G.Coulouris,J.Dollimore & T.

Kindberg

2. Modern Operating System-A.S. Tanenbaum(PHI).



3. Design and Analysis of Algorithms


100 marks


work : 25 marks

Section-I


Algorithm definition and specification ,Performance analysis randomized

algorithms, Divide and Conquer method ,Binary search, Merge sort Quick sort and

Convex hull.

2. Greedy method and Dynamic Programming :

(6)

General methods, Job sequencing with deadlines, Minimum cost spanning trees,

Optimal merge patterns, All pairs shortest paths, Optimal binary search trees,

Reliability design ,Travelling salesman problem and flow shop scheduling.

3. Lower bound Theory: (6)

Comparison trees, Oracles and adversary arguments, lower bounds through

reductions.

Section-II

4. NP-Hard and NP complete problems:

(4)

Basic concepts, cook’s theorem. NP –hard graph problems, NP-hard scheduling

problems.NP-Hard code generations problems.

5. PARAM Algorithms: (5)

Introduction, computational model, Fundamental techniques and algorithms,

Merging, lower bounds.

6. Mesh Algorithms:

(4)

Computational model packet routing fundamental algorithms, merging, computing

the convex hull.

7. Hypercube Algorithms:

(5)

Computational model, PPR routing fundamental algorithms, merging, computing

the convex hull.

Text Books:

1. Fundamentals of computer algorithms –Ellis horowitz, Sartaj Sahani and

Sanguthewar

Rajasekaran

2. Design and analysis of algorithms- Aho Hoperraft &Ullman

3. Introduction to algorithms- Thomas H. cormen,charles S.Leiserson

4. Randomized algorithms-Rajeev Motwan and Prabhakar Raghwan



4. Elective I -1. Computer Vision and Image Processing


100 marks


work : 25 marks

Section I

1. Digital Image Fundamentals: -

(6)

Digital image Representation – Functional Units of an Image processing

system. Visual perception – Image Model _ Image sampling and Quantization –

grayscale resolution – pixel relationship – imagegeometry. Image Transforms –

Unitary Transform, Discrete Fourier Transform, Cosine Transform, Sine

Transform, Hadamard Transform, Slant and KL Transform.

2. Image Enhancement – (6)

Histogram processing – Spatial operations – Image smoothing –Image

Sharpening – Color Image Processing methods- Color Image Models

3. Image restoration and compression Degradation Model –

(6)

Discrete Formulation –Circulant matrices – Constrained and Unconstrained

restoration geometric transformations fundamentals – Compression Models –

Error Free Compression – Lossy Compression – International Image

Compression Standards.

Section II

4. Image Analysis and Computer Vision: Spatial feature Extraction –

(6)

Transform feature –Edge detection-Boundary Representation-Region

Representation-Moment Representation-Structure-Shape Features-Texture-

Scene Matching and Detection-Image Segmentation-Classification techniques-

Morphology-Interpolation.

5. Sensing 3D shape:

(6)

how the 3rd dimension changes the problem. Stereo 3D description, 3Dmodel,

matching, TINA. Direct 3D sensing-structured light, range finders, range image

segmentation.

6. Emerging IT applications:

(6)

Recognition of characters, Fingerprints and faces- Image databases.

Text Books

1. Fundamentals of Digital Image Processing-A.K.Jain

2. Image Processing and machine vision-Milan Sonka,Vaclav Hlavae

3. Pattern Recognition Principles-J.T. Tou and R.C.Gonzalez

4. Syntactic Pattern Recognition and applications.-King Sun Fun

5. Computer vision-Fairhurst (PHI).



4. Elective I – 2.Artificial Neural Networks


100 marks


work : 25 marks

Section I


Inspiration from Neuroscience, History, Issues.

2. Hopfield model: (5)

Associative memory problem, model, stochastic networks .capacity of

stochastic n/w.

3. Optimization problems:

(4)

Weighed matching problem, Travelling salesman problem, Graph

bipartioning, optimization problems in image processing.

4. Simple perceptions:

(5)

feed forward n/w, Threshold units, linear units, nonlinear units

stochastic units, capacity of simple perception.

Section II

5. Multi-layer n/w: (4)

Back propagation ,examples and applications performance of

multilayer feed forward n/w Kohoanen self organizing n/w cognition

& neocognutron.

6. Recurrent n/w: (5)

Boltzmann n/w, Recurrent Back propagation, Learning time sequence,

Reinforcement learning.

7. Learning: (5)

Supervised, Unsupervised (Hebbian competitive), adaptive resonance

theory, Travelling salesman problem.

8. Applications of artificial Neural Network.

(4)

Reference Books

1. Introduction to the theory of neural Computation-Hertz Krogh, Palmer

2. Artificial Neural Networks-B. Yegnanarayana (PHI)

3. Genetic Algorithms-David E. Goldberg (Adddison Wesely)



4. Elective I – 3. Real Time Operating Systems


100 marks


work : 25 marks

Section I

1. Basic Real Time Concepts:

(4)

Terminology, Real time design issues, Example Real-time systems,

Brief history, Language issues : Language features, Commonly used

programming languages, Software life cycle : Phases of the software

life cycle, non temporal transition in the software life cycle, spiral

model .

2. Real time specification and design techniques:

(4)

Natural languages, Mathematical specification , flow chart, structure

chart ,pseudo code, programming designing languages, finite state

automata , data flow diagrams, petrinets, warnier-orr notations, state

charts, Sunity in using graphical techniques

3. Real time kernels :

(4)

Polled loop system, phase state driven code , co routine interrupt

driven systems, foreground/background systems, full feature real time

operating system

4. Inter-Task Communication and Synchronization:

(3)

Buffering Data, Mailboxes, Critical Regions, Semaphores, Event flags

and signals, Deadlock.

5. Real time Memory Management:

(3)

Process Stack Management, Dynamic Allocation, Static Schemes.

Section II

6. System performance Analysis and optimization:

(3)

Response Time calculation, Interrupt Latency, Time- Loading and its

Measurement, Scheduling is NP-Complete, Reducing Response Times

and Time-loading, Analysis of memory Requirements, Reducing

Memory loading I/O performance.

7. Queuing Models: (3)

Probability functions, discrete, Basic Buffer size calculation, Classical

Queuing theory, Little’s law, Erlang’s Formula.

8. Reliability, Testing and Fault tolerance:

(3)

Faults, Failures, Bugs and effects, Reliability, testing fault tolerance.

9. Multiprocessing System:

(3)

Classification of architecture, Distributed systems Non-Von Neuman

Architectures.

10. Hardware, Software Integration :

(3)

Goals of real time system integration tools, Methodology, The

software Heisenberg Uncertainty Principle.

11. Real time Applications:

(3)

Real time systems as complex system, first Real time application,

Real time databases Real time Image processing , Real time Unix

Building Real time Applications with real time programming

languages.

Text Books:

1) Real Time Systems Design and Analysis : An Engineer’s Handbook

Phillp A. Laplante(2nd Edition PHI)

Reference Books:

1) Real Time system Design – Levi Shem Tov and Ashok K. Agrawala

(New York McGraw Hill)

2) Proceedings of IEEE Special Issue on Real Time Systems (Jan 1994)

3) Real Time Systems and their Programming Language Burns, Alan and

Andy Wellings (New York , Addison Wesley)

4) The design of Real time Applications: M. Blackman (New York John

Wiley & Sons).

5) Real time systems: C. M. Krishna, K.G. Shin (TMGh)



4. Elective I - 4. Mobile Computing


100 marks


work : 25 marks

Section I

1. Introduction to wireless communication:

(4)

Wireless data technologies, Frequencies for radio signals, antennas and

signal propagation, need and types of multiplexing techniques, modulation

types, use of spread spectrum, cellular systems.

2. Medium Access Control:

(4)

Need for MAC algorithm, medium access methods and comparison of these

methods

3. Digital mobile Phone Systems –

(10)

GSM :, mobile services, system architecture, radio interference, protocols,

localization and calling , hand over, security, new data services, other

digital cellular networks, comparison with GSM.

Section II

4. Wireless LAN: (8)

Introduction, advantages and design goals for wireless LAN, Infrastructure,

ad-hoc networks, IEEE 802.11: system and protocol architecture, physical

layer, HIPERLAN protocol architecture and physical layer and MAC, Blue

tooth physical and MAC layer. Wireless ad-hoc networks.

5. Protocols for mobile computing:

(4)

Mobile network layer, mobile IP, Snooping TCP, Mobile TCP, Fast and

selective retransmission and recovery, Transaction oriented TCP.

6. Wireless Application Protocol.

(3)

WAP architecture wireless datagram protocol, transport layer security,

WML, script.

7. Palm OS: - (3)

Architecture, features of kernel, memory, system managers, Symbian OS:

Architecture, hardware interface, memory, management, Window CE :

features and architecture,

Text Books

1. Mobile Communications – Jachen Schiller (Addison- Wesley)

2. Mobile Computing – Asoke K Talukder, Roopa R Yavgal, (TMH Publishing)

Reference

Mobile Computing - Raj Pandya



4. Elective II – 3 Data Mining


100 marks


work : 25 marks

Section I

1. Introduction : (3)

Data Warehousing and Introduction to data mining basic elements of datawarehousing, Data warehousing and OLAP.

2. Data model development for Data Warehousing: (3)

Business model, selection of the data of interest, creation and maintaining keys, modeling transaction, datawarehousing optimization.

3. Data warehousing methodologies: (3)

Type and comparisons.

4. Data Mining techniques ( 6) Data mining algorithms, classification, Decision- Tree based Classifiers clustering, association Association-Rule Mining Information Extraction using Neural Networks.

5. Knowledge discovery : ( 3) KDD environment

Section –II

6. Visualization: ( 4) Data generalization and summarization-based characterization, Analytical characterization: analysis of attribute relevance, mining class Comparison, Discriminating between classes, mining descriptive statistical measures in large database.

7. Data mining primitives, languages & system architectures: (4)

Data mining primitives, Query language, designing GUI based on a data mining query language, architectures of data mining systems.

8. Advanced topics: (3)

Spatial mining, temporal mining.

9. Web mining: (3) Web content mining, web structure mining, web usage mining

10. Application and trends in data mining : (4)

Applications, systems products and research prototypes, multimedia data mining, indexing of multimedia material, compression, space modeling. Text books: 1. Paulraj ponniah, “Web warehousing fundamentals” – John Wiley. 2. M. H. Dunham, “Data mining introductory and advanced topics” – Pearson education 3. Han, Kamber, “Data mining concepts and techniques”, Morgan Kaufmann 4. Imhoff, Galemmo, Geiger, “Mastering data warehouse design”, Wiley dreamtech


M.E. (Computer Science and Engineering) Part – I ( Sem – II )

1.Computer Network Administration


100 marks


work : 25 marks

Section I

1. Data Communication and network management overview:

(6)

Analogy of telephone network management, Data and telecommunication

network, distributed computing environment, TCP/IP based networks –

Internet and intranet, communication protocols and standards, challenges of

information technology manager Network management – goals, organization

and functions, network and system management, network management

system platform, current status and future of network management.

2. Basic foundation:

(6)

Standards, models and languages: Network management standards, network

management model, organization model, information model, communication

model, ASN.1, Encoding structure, macros, and functional model.

3. SNMP 1 network management:

(6)

Organization and information models: Managed network, International

organization and standard SNMP model, organization model, system

overview, information models

Section II

4. SNMP v1 network management:

(6)

Communication and functional models, SNMP model, functional model,

Major changes in SNMP v2 and v3

5. SNMP Management: (6)

RMON – Remote monitoring, RMON, SMI & MIB, RMON1, RMOPN2,

ATM Remote monitoring, case study of internet traffic using RMON.

6. Network management tools and systems:

(6)

network management tools, network statistics measurement systems,

network management systems, commercial network management systems,

System management, Enterprise management solutions.

Text Books:

1. Network Management principles and practice – Mani Subramanian (Pearson

Edition)

2. SNMP – SNMPv2 , SNMPv3 & RMON 1 – William Stalling (Pearson

Edition)

3. Network Administration – Steve Wisniewski.



2. Advanced Database Design


100 marks

Practicals : 2 Hr/week Term

work : 50 marks

Section I

1. Distributed database management system:

(8)

Features of DDS, Distribution transparency, DDB design, Query translation,

Optimization

2. Distributed Transaction:

(9)

Management of distributed transaction, concurrency control, reliability,

agents, homogeneous DDS, DDS administration.

Section II

3. Object database management system:

(6)

Fundamentals of ODS, Design issues, Object management, Encapsulation

inheritance, ORDBMS, Implementation challenges, object query

processing, Transaction management, Query optimization. O-O Query

languages and interfaces.

4. Multimedia database system: (6)

multimedia database management system, image and text database

techniques, Audio and Video Database Techniques Physical Storage and

Retrieval. Data structure, Operation, indexing, segmentation.

5. Advanced Topics:

(6)

Mobile databases, xml, data web interfaces.

Text Books

1. Database management system - Ramakrishna Gherkin (McGraw Hill)

2. Principals of distributed Database system (2nd edition) - M. Tamer Ozsu.

Patrick valduriez (Pearson)

3. Distributed Database Principals and systems - Stephan ceri, Giuseppe

Pelagatti. (McGraw Hill)

4. Object Oriented Interface and Databases - Rajesh Narang, Prentic Hall of

India.

5. Database system concepts - Silberschatz, Korth, Sudershan, McGraw Hill

International



3. Advanced Computer Architecture


100 marks


work : 25 marks

Section I

1. Computation Models: - (5)

Concept Relationships between concepts of CM, Programming language and

architecture. Basic computation models von- Newman computation model

key concepts relating to CM.

2. Concepts of Computer Architectur

(4)

Evolution and concept, Abstraction, Multi level hierarchical framework and

extensions

3. Parallel Processing:

(5)

Basic concepts, Types and level of parallelism, Classification, Basic parallel

techniques, Relationship between languages and parallel architecture.

4. Instruction level parallel processors:

(4)

Evolution and overview of ILP processors, Dependencies between

instructions, Instruction scheduling, Preserving sequential consistency,

Speed up potential of ILP processing

Section II

5. Pipelined processors: (4)

Concepts, Design space of pipelines, Pipelined instruction processing,

Pipelined execution of integers and Boolean instructions, Pipelined

processing of load and stores

6. VLIW architectures: (4)

Basic principles, VLIW architectures, Case study- Trace 200 family,

7. Superscalar processor: (5)

Introduction, Parallel decoding, Superscalar instruction issue, Shelving,

Register naming, Parallel execution, Preserving the sequential consistency of

instruction execution and exception processing, Implementation of super

scalar CISC processor using a superscalar RISC care

8. Case studies: - (5)

R10000, power PC 620 and Pentium Pro

Text Books:

1. Advanced Computer Architecture a design space approach. - Sima,

Fauntain, Kscucle, Pearson Edition

2. 2. Parallel Computer Architecture – David Culler and J. Palsingh, Morgan

Kauf mann Pub.

3. Introduction to parallel Algorithms - Joseph J.A. , Addison Wesley

4. Parallel programming - Barry Wilkinson, C.Michael Allen



4. Elect. –III 1. Web Technology


100 marks


work : 25 marks

Section I

1. Introduction 4

History of the Internet and World Wide Web – HTML 4 protocols – HTTP, SMTP,

POP3, MIME, IMAP. Introduction to JAVA Scripts – Object Based Scripting for

the web. Structures – Functions,Arrays–Objects.

2. Dynamic html 5

Introduction – Object refers, Collectors all and Children. Dynamic style, Dynamic

position, frames, navigator, Event Model – On check – On load – Onenor – Mouse

rel – Form process – Event Bubblers – Filters – Transport with the Filter –

Creating Images – Adding shadows – Creating Gradients – Creating Motion with

Blur – Data Binding – Simple Data Binding – Moving with a record set – Sorting

table data – Binding of an Image and table.

3. Multimedia 5

Audio and video speech synthesis and recognition - Electronic Commerce – E-

Business Model – E- Marketing – Online Payments and Security – Web Servers –

HTTP request types – System Architecture – Client Side Scripting and Server side

Scripting – Accessing Web servers – IIS – Apache web server.

4. DATABASE- ASP – XML 5

Database, Relational Database model – Overview, SQL – ASP – Working of ASP

– Objects – File System Objects – Session tracking and cookies – ADO – Access a

Database from ASP – Server side Active-X Components – Web Resources – XML

– Structure in Data – Name spaces –DTD–Vocabularies–DOMmethods.

Section – II

5. Servlets and JSP 5

Introduction – Servlet Overview Architecture – Handling HTTP Request – Get

and post request – redirecting request – multi-tier applications – JSP – Overview –

Objects – scripting – Standard Actions–Directives.

6. Web Architectures

5

Web architectures, web analysis, web restructuring methodologies,

Web 2.0, Web 3.0 concepts and implementation strategies.

7. Web security 4 Web insecurity Security strategies, General security Listing of server-side risks, Language specific security

8. Web Applications

4

Accessible Blogs, RSS, Widgets, Mashups , wiki, Podcasting, ,

TextBook :

1. Deitel & Deitel, Goldberg, “Internet and world wide web – How to Program”,

Pearson Education Asia, 2001.

References

1. Eric Ladd, Jim O’ Donnel, “Using HTML 4, XML and JAVA”, Prentice Hall of

India – QUE, 1999.

2.Aferganatel,“ WebProgramming: Desktop Management”, PHI, 2004.

3. Rajkamal, “Web Technology”, Tata McGraw-Hill, 2001.

Url resources

1. http://ocw.uc3m.es/ingenieria-telematica/web-technologies-1 2. http://ad4dcss.wikispaces.com/



4. Elect. –III 2. Component Technology


100 marks


work : 25 marks

Section I

1. COM : (3) Introduction, COM as better C++, S/W distribution, Dynamic linking, separating interface from implementation, Run time polymorphism .

2. Interfaces (5) Introduction , Interface definition language(IDL), interfaces and IDL, Using COM interface pointers, Optimizing query interface, Code sharing and reuse. 3. Classes and Objects :

(6) Introduction, Classes and servers, Optimization, Classes and IDL, Class emulation, Query interface types and properties, object services and dynamic composition, Apartments : Cross apartments access, Life cycle management. 4. Distributed COM: (8) Fundamental programming architecture of DCOM: Parallel processing, Advantages of distributed computing. Threading models and apartments: Apartments, Apartments interaction, Implementing multithreaded local components, facilities : Connection points and type information, Connectable objects. Remoting: DLL surgates and executable components.

Section – II

5. CORBA ( 5) Introduction and concepts, Distributed objects in CORBA, CORBA components, Architectural features, Method Invocations: static and Dynamic. IDL (Interface Definition Language) models and Interfaces: Structure of CORBA IDL, CORBA’s self describing data, CORBA interface repository. 6. CORBA services: (5) Services of object naming, object life cycle, event, Transaction service features, concurrency control services, persistent object service and CORBA security service. 7. JAVA Beans : (8) JAVA Beans, Bean Events, Bean Properties, Implementing JAVA Beans, Creating Bean Object, Serializing a Bean. 8. Object Web: (4) Web Technologies, Integration of Web & Distributed objects. Text Books: 1. Essential COM - Booch Jackobson, Rumbaugh, ( Addison Wesley ) 2. DCOM, Microsoft Press - Guy Eden and Henry Eden

3. CORBA fundamentals & programming - John Siegle (Jhon Wiley and Sum's 96) 4. Essential CORBA - Mowbray and Zahavi ( Addison Wesley ) 5. The essential distributed object survival guide – Orfali (SPD) 6. Learn ActiveX Template Library Development with VC++ - Nathan Wallace (BPB) 7. Client / Server programming with Java & CORBA – Robert Orfali, Dan Harkey (SPD)



4. Elect. –IV 2. Computer Modeling and Simulation


100 marks


work : 25 marks

Section I

1. System Models : (4)

The concept of a system , System environments, stochastic activities , continuous

and discrete systems, system modeling, types of models, static physical models,

dynamic physical models, static mathematical models, dynamic mathematical

models, principles used in modeling.

2. System studies: (4)

Sub systems, A corporate model, environment segment, Production Segments,

management segment , full corporate model .

3. Planning computer simulation (6)

Formulation of the problem, collection and processing of real world data,

formulation of mathematical models, Estimation of parameters , evaluation of the

model , formulation of computer program, Design of simulation experiments,

Analysis of simulated data.

4. System simulation : (4)

Techniques of simulations, Monte-carlo method, Numerical computation

techniques for continuous models, numerical computer techniques for discrete

models , distributed lag models, Gobweb models

Section - II

5. Probability concepts in Simulations :

(6)

Stochastics variables, discrete probability functions, continuous probability

functions, Measures of probability functions, computer generation of random

numbers, uniform random number generator, non-uniform continuous distributed

random numbers.

6. Arrival Patterns and service Times :

(4)

Congestion in system, arrival patterns, Poisson arrival patterns, exponential

distribution coefficient of variation , enlarge distribution, service times, normal

distribution , Queuing disciplines , measures of queues, mathematical solution of

queuing problems.

7. Discrete system simulation :

( 4)

Discrete events , Representation of time, generation of arrival patterns , simulation

of telephone system, delayed calls, simulation programming tasks, gathering

statistics , measuring utilization and occupancy , recording distribution and transit

times.

8. Introduction to GPSS :

(4)

General description , action time, succession of events, choice of paths,

simulation of a manufacturing shop, facilities and storages, gathering statistics,

Conditional transfers, program control statements, priorities and parameters,

standard numeric attributes, transfer modes, logic switches, Testing conditions ,

GPSS , General features of SIMSCRIPT.

Text Books :

1] System simulation : Geoffrey Gordon ( PHI)

References :

1] Computer Simulation Techniques : Naylor , Balintty, Bordict and Chu ( John

Wiley )



4. Elect. –IV 3. Natural Language Processing


100 marks


work : 25 marks

Section I

1. Introduction to NLP : (3)

Introduction, Some Example Application, Achievements and Brief History, Open

Problems, Major Goal.

2. Languages Structure and Language Analyzer :

(3)

Introduction to Language Structure, Overview of Language Analyzer,

Morphological Analyzer, Local Word Grouper (LWG), Core Parser, Requirements

of Computational Grammars, Computational Aspects, System Aspects, Large

System Aspects.

3. Words and Their Analyzer : (3)

Introduction, Why Morphological Analysis, Morphological Generation Using

Paradigms, Morphological Analysis Using Paradigms, Speeding Up Morphological

Analysis by Compilation*, Morphological Analyzer - Some Additional Issues*.

4. Local Word Grouping :

(3)

Introduction, Verb Groups, Kriya Rupa Charts, Noun Group, Strategy for

Grammar Development, Semantics in Stages, Some Open Problems, Conclusions.

5. Paninian Grammar

(3)

Introduction, The Semantic Model, Free Word Order and Vibhakti, Paninian

Theory, Karaka Relations, Active Passive, Control, Karaka to Vibhakti Mapping,

Karaka Sharing.

6. Paninian Parser :

( 3)

Introduction, Core Parser, Constraints, Constraint Parser Using Integer

Programming, Constraint Parser Matching and Assignment, Reduction to Bipartite

Graph Matching, Reduction to Assignment Problem, Preferences over Parses,

Lakshan Charts for Sense Disambiguation, Summary.

Section - II

7. Machine Translation : ( 3)

Survey, Introduction, Problems of Machine Translation, Is MT Possible?, Brief

History, Possible Approaches, Current Status, Anusaraka or Language Accessor,

Background, Cutting the Gordian Knot, The Problem, Structure of Anusaraka

System, User Interface, Linguistic Area, Giving up Agreement in Anusaraka

Output, Language Bridge, Summary.

8. Lexical Functional Grammar :

(3)

Introduction, Active-Passive and Dative Constructions, Wh-movement in

Questions, Overview of LFG, LFG Formalism, Well-formedness Conditions,

Handling Wh-movement in Questions, Computational Aspects, Features and

Feature Structures, Unification, Other Constraints, Conclusions.

9. LFG and Indian Languages : (3)

CFG and Indian Languages, Functional Specification.

10. Tree Adjoining Grammar

(3)

Lexicalized Grammars and Locality, Lexicalized Tree Substitution Grammar,

Lexicalized Tree Adjoining Grammar, Feature Structures, Some Mathematical

Aspects.

11. Comparing TAG with PG Introduction:

(3)

Similarities Between TAG and PG Difference between TAG and PG, Optional

Arguments, Sentential or Verbal Arguments, Some Important Phenomena,

Discussion.

12. Government and Binding :

( 2)

Introduction, The GB Modules, X-bar theory, Theta theory, Government, Case

theory, Bounding theory, Empty Category Principle (ECP), Binding theory,

Constraints on mevement, How can GB help in Parsing?, Conclusion.

13. Comparing GB with PG :

(1)

Introduction, Summary.

Text Books :

1] Natural Language Processing : A Paninian Perspective - Akshar Bharti, Vineet

Chaitanya, Rajeev Sangal (PHI)

References :

1] Natural Language Understanding - James Allen

( The Benjamin / Cummings Publishing Company )

2] Natural Language Processing in Prolog - Gerald Gazdar, Chris Mellish

( Addison Wesley)

me syllabus solapur university

Documents

language theory

computer modeling

computer vision

regular languages

marks section

hrsweek theory

decidable languages

advanced computer architecture