DISTANCE EDUCATION M.Phil. (NS) (Computer Science) DEGREE ...

mumpsimuspreviousΤεχνίτη Νοημοσύνη και Ρομποτική

25 Οκτ 2013 (πριν από 3 χρόνια και 8 μήνες)

52 εμφανίσεις

DE

9024






1

ws 2

DE

936





DISTANCE EDUCATION

M.Phil. (NS) (Computer Science) DEGREE EXAMINATION, DECEMBER 2010.

RESEARCH METHODOLOGY

(2002 onwards)

Time : Three hours

Maximum : 100 marks

Answer any FIVE questions.



(5 × 20 = 100)

1.

Discuss about :


(a)

Abstraction of a research paper.

(10)


(b)

Assessing the status of the problem.

(10)


2.

Explain about :


(a)

Determining the mode of attack in scientific research.




(10)


(b)

Thesis writing.



(10)

3.

Solve

the following problem by Revised Simplex method :


Maximize :


Subject to :












.

4.

Explain with examples :


(a)

Revised simplex method ver
sus simplex method.

(10)


(b)

Bounded variables simplex algorithm.

(10)

5.

Discuss in detail about :


(a)

Elements of system software Tools.

(10)


(b)

Interrupt Hardware.


(10)

6.

Discuss about :


(a)

Terminal emulator.


(10)


(b)

A Multitasking window system.

(10)

11

DE

9024






2

ws 2

DE

937

7.

W
rite short notes on :


(a)

Window management.


(10)


(b)

Command interface.


(10)

8.

Discuss elaborately on Concurrency structures and their Management.




(20)

————————





















DISTANCE EDUCATION

M.Phil. DEGREE EXAMINATION, DECEMBER 2010.

Non
-
Sem
ester

Computer Science

IMAGE PROCESSING AND PATTERN RECOGNITION

(2002 onwards)

Time : Three hours

Maximum : 100 marks

Answer any FIVE questions.


(5


20 = 100)

1.

Describe the use of arithmetic and logic operations to enhance the digital images.

2.

Discuss the
features of any four image sensing and acquisition devices.

12 A

DE

9024






3

ws 2

DE 938

3.

Explain the different types of edge
-
detection.

4.

Write a detailed note on :

(a)

Contour coding and image standards.

(10)

(b)

Quantizing compression.


(10)

5.

Describe the different types and implemen
tation of decision functions.

6.

Explain the following in details :

(a)

Cluster seeking algorithm.


(10)

(b)

K
-
means algorithm.



(10)

7.

Discuss the features, designing concept, advantages and applications of
pattern recognition system.

8.

Explain with examples

the syntactic pattern description and recognition.

–––––––––––––––



DISTANCE EDUCATION

M.Phil. (NS) (Computer Science) DEGREE EXAMINATION, DECEMBER 2010.

DISTRIBUTED COMPUTING SYSTEM

(2002 onwards)

Time : Three hours

Maximum : 100 marks

Answer any FIVE

questions.


(5


20 = 100)

All questions carry equal marks.

1.

(a)

Discuss about blocking and non
-
blocking primitives.

(b)

Explain concurrency issues on database.

2.

(a)

Explain dead Lock handling in Distributed Computing System.

(b)

Explain about processor all
ocation.

3.

(a)

Explain the software issues related to distributed systems.

(b)

Write notes on trends in distributed file system.

4.

(a)

Explain Communications in Distributed Systems.

12 B

DE

9024






4

ws 2

DE

939

(b)

Explain distributed Programming Languages.

5.

(a)

What is a Thread? Explain t
he usage and implementation of Thread
Package.

(b)

Explain the design issues involved in distributed computing system.

6.

(a)

Explain Distributed File Service Interface.

(b)

Discuss about the implementation of Client
-
Server model.

7.

(a)

Explain the Hardware con
cepts in distributed Processing.

(b)

Explain the Software concepts in distributed Processing.

8.

(a)

Explain Group Communication.

(b)

Explain the four types of buffering strategies.

______________





DISTANCE EDUCATION

M.Phil. (Computer Science


Non
-
Semest
er) DEGREE EXAMINATION,
DECEMBER 2010.

NATURAL LANGUAGE PROCESSING

(2002 onwards)

Time : Three hours

Maximum : 100 marks

Answer any FIVE questions.

All questions carry equal marks.








(5


20 = 100)

1.

Discuss about the issues and problems in Natural Langu
age Processing.



(20)

2.

Explain Top Down Parser and Bottom Up Parser with suitable example.



(20)

3.

Describe Augumented Transition Network (ATN) with example.





(20)

4.

Write about Shift Reduce Parsers Algorithm.

(20)

5.

Discuss about

12 C

DE

9024






5

ws 2

DE

940


(a)

Semantic Structure Mode
l Theory.

(10)


(b)

Semantic Networks.


(10)

6.

Give the plausible logic form of each sentences :


I returned the book to the library.


I returned to the class.


I received a library token.


(20)

7.

(a)

Discuss the various levels of ambiguity in Natural Language Pro
cessing.


(10)


(b)

Explain about the semantic and pragmatic roles of noun phrases.



(10)

8.

Write notes on the following :


(a)

ELIZA


(b)

PARRY


(c)

Current trends in Natural Language Processing


(d)

KING


a natural language generation system.

(20)

————————




DISTANCE EDUCATION

M.Phil. (Computer Science) DEGREE EXAMINATION, DECEMBER 2010.

Non
-
Semester

NEURAL NETWORKS AND FUZZY LOGIC

(2002 onwards)

Time : Three hours

Maximum : 100 marks

Answer any FIVE questions.







(5


20 = 100)

1.

(a
)

Explain the principles of Neural Network.

(10)

(b)

Describe the applications of Neural Network.

(10)

2.

Explain Boltzmann’s training in detail.

(20)

12D

DE

9024






6

ws 2

DE

941

3.

Describe the architecture and operation of Bidirectional Associative Memories.

4.

Explain the continuous and ad
aptive BAMs.

5.

(a)

Write about ART classification operation and ART implementation.



(10)

(b)

Describe holographic correlators in ART.

(10)

6.

(a)

Write about the operations of Fuzzy sets.

(10)

(b)

Give a note on Fuzzy relations.

(10)

7.

Summarize the application
s of Fuzzy logic.

8.

Explain the Fuzzy databases and information retrieval system.





——————




DISTANCE EDUCATION

M.Phil. (CS) (Non

Semester) DEGREE EXAMINATION,

DECEMBER 2010.

COMPILER DESIGN

(2002 onwards)

Time : Three hours

Maximum : 100 marks

Answer
any FIVE questions.

All questions carry equal marks.

(5


20 =100)

1.

(a)

What is Bootstrapping? Explain.

(b)

Write short notes on Parse tree.

2.

(a)

Describe about Non
-
deterministic automata with a suitable example.

(b)

Explain the term : Regular expressions.

3.

(
a)

Explain Shift
-
reduce parsing.

21
-
A

DE

9024






7

ws 2

(b)

What are the characteristics of Transition diagram?

4.

(a)

Explain the concept of Top
-
down parsing.

(b)

How to represent Quadruple in three address statement?

5.

(a)

Explain the methods of translating Boolean expressions.

(b)

Translate

into postfix form.

6.

(a)

Describe the structure of an ALGOL program.

(b)

What is Hash table? Explain it with necessary diagrams.

7.

(a)

How to handle Shift
-
Reduce Errors?

(b)

What are the steps involved in construction of DAG?

8.

(a)

Discuss briefly Flow Graphs with some examples.

(b)

Write the algorithm for Loop optimization.



———————







DISTANCE EDUCATION

M.Phil (Computer Science


Non Semester) DEGREE EXAMINATION,
DECEMBER 2010.

SECURITY IN COMPUTING

(2002 onwards)

Time :
Three hours

Maximum : 100 marks

Answer any FIVE questions.

All questions carry equal marks.

1.

(a)

What is meant by threat? List down the various security objectives.


(b)

Discuss about the various counter measures taken against natural
disasters.

2.

(a)

Define D
ata Security. How cryptography is used to achieve Data
Security? Explain.

21 (B)

DE

942

DE

9024






8

ws 2

DE

943


(b)

Discuss the various issues of network security.

3.

(a)

Explain DES algorithm.


(b)

Explain Diffie Hellman Key Exchange process in PKI.

4.

Explain the following :


(a)

MAC algorithm.


(b)

E
-
mail security.

5.

Write your own ideas to acheive security in the following :


(a)

Face Book


(b)

Video conferencing.


(c)

Voice chat.

6.

(a)

Discuss the security features adopted in UNIX system.


(b)

How can we safeguard application software interface?

7.

(a)

Explai
n security policy and how packet filter firewalls uses the policy.


(b)

Explain cyber law, impact of crime in business.

8.

Write short notes on the following :


(a)

Risk analysis.



(7)


(b)

Risk management.



(7)


(c)

Patent law.



(6)

————————





DISTANCE E
DUCATION

M.Phil. (NS) (Computer Science) DEGREE EXAMINATION, DECEMBER 2010.

DATA WAREHOUSING AND MINING

(2002 onwards)

Time : Three hours

Maximum : 100 marks

Answer any FIVE questions.








(5


20 = 100)

21C

DE

9024






9

ws 2

DE

944

1.

(a)

What is Data Mining? Explain the steps in KDD
.









(10)


(b)

Describe the essential characteristics of a data mining technique.

(10)

2.

(a)

Explain how a data warehouse can help data mining.




(10)


(b)

What is concept learning? Explain with an example.






(10)

3.

(a)

Explain visualization techniqu
es.

(10)


(b)

What is genetic algorithm? How it can be used for prediction? Explain.

(10)

4.

Describe the process managers in data warehouse environment.




(20)

5.

(a)

Explain how summary tables can speed up query processing.



(10)


(b)

Explain meta data for
mats for various process managers.



(10)

6.

(a)

With an example fact and dimension table, explain various schemas of a
data warehouse.

(10)


(b)

Write short notes on Backup and recovery procedures.


(10)

7.

Explain various hardware options for a data warehous
e.









(20)

8.

Write short notes on the following :


(a)

Planning the data warehouse

(7)


(b)

Testing the data warehouse

(7)


(c)

Tuning the data warehouse.

(6)

——————————





DISTANCE EDUCATION

M.Phil. (Computer Science) (Non Semester) DEGREE EXAMINAT
ION,
DECEMBER 2010.

PARALLEL ALGORITHMS

(2002 onwards)

21 D

DE

9024






10

ws 2

Time : Three hours

Maximum : 100 marks

Answer any FIVE questions.

All questions carry equal marks.

1.

(a)

Explain the need for parallel computation.

(10)


(b)

Compare the measures used for analyzing seque
ntial and parallel
algorithms.

(10)

2.

(a)

Explain the terms EREW and CREW with an example.




(10)


(b)

Explain the interconnection networks in SIMD model.




(10)

3.

(a)

What is shuffle transpose? Explain.

(10)


(b)

Briefly explain the cube multiplication al
gorithm.
(10)

4.

Explain any one parallel sorting algorithm and obtain its time complexity.




(20)

5.

Explain the method of finding roots of non
-
linear equations on SIMD
computers with an example.

(20)

6.

(a)

Explain the method of solving partial differential eq
uations.




(10)


(b)

What is connected component? Explain.

(10)

7.

Explain any one algorithm for finding all pairs shortest path with an example.



(20)

8.

Write notes on :


(a)

Representation of graphs.


(b)

Alpha beta tree


(c)

Tree multiplication.


(7 + 7 +
6)

———————