Download - Alagappa University

ws 2
DE-2009
11
DISTANCE EDUCATION
M.Phil. (Computer Science) (NS) DEGREE EXAMINATION,
MAY 2011.
RESEARCH METHODOLOGY
(2002 onwards)
Time : Three hours
Maximum : 100 marks
Answer any FIVE questions.
All questions carry equal marks.
(5  20 = 100)
1.
Write in detail the general format in thesis writing method.
2.
Write short notes on :
3.
(a)
Actual investigation.
(b)
Literature survey.
Solve the following LP problem :
Maximize Z  3 x1  5 x2  2x3
subject to x1  2x2  2x3  14
2x1  4 x2  3 x3  23
0  x1  4
2  x2  5
0  x 3  3.
4.
Solve using revised simplex method for the problem :
Max Z  x1  2x2  3x3  x4
subject to the constraints x1  2x2  3 x3  15
2x1  x2  5 x3  20
x1  2x2  x3  x4  10 and
x1 , x2 , x3 , x4  0.
1
DE–9024
ws 2
5.
Explain in detail about window management and its architecture.
6.
Discuss on the concepts of Data management and the system overview of
multitasking.
7.
(a)
Explain terminal emulator.
(b)
Elucidate the elements of system software tool.
8.
Write short notes on :
(a)
Asynchronous communication
(b)
Keyboard management.
———————
DE–2010
12 A
DISTANCE EDUCATION
M.Phil. (Computer Science) (N.S.) DEGREE EXAMINATION, MAY 2011.
IMAGE PROCESSING AND PATTERN RECOGNITION
(2002 onwards)
Time : Three hours
Maximum : 100 marks
Answer any FIVE questions.
All questions carry equal marks.
(5  20 = 100)
1. Discuss the features of any four image sensing and acquisition devices.
2.
Write a note on :
(a) Raster screen
(b) Grey level transformation
(c) Spatially dependent transformation
(d) Multi image operation.
(5)
(5)
(5)
(5)
3.
What are the basic morphological operations and their uses? Explain how
these operations are used to construct the complex operations.
4.
What is meant by compression? Explain any two compression techniques used
for lossy compression.
5.
Discuss the following decision functions in detail :
(a)
Linear decision function
(10)
2
DE–9024
ws 2
(b)
6.
Implementation of decision functions.
(10)
Explain the following pattern recognition algorithms :
(a)
Cluster seeking algorithm
(10)
(b)
ISO data algorithm.
(10)
7.
Discuss the features, designing concept, advantages and applications of
pattern recognition system.
8.
Discuss the following in detail :
(a)
Concept of formal languages theory of syntactic pattern recognition
(10)
(b)
Recognition grammar and statistical considerations.
(10)
————————
DE–2011
12 B
DISTANCE EDUCATION
M.Phil. (Computer Science) DEGREE EXAMINATION,
MAY 2011.
Non-Semester
DISTRIBUTED COMPUTING SYSTEMS
(2002 Onwards)
Time : Three hours
Maximum : 100 marks
Answer any FIVE questions.
(5  20 = 100)
All questions carry equal marks.
1. (a)
Discuss the relative advantages and disadvantages of the various
commonly used models for configuring distributed computing systems. Which model
do you think is going to become the most popular model in future? Give reasons for
your answer.
2.
(b)
Discuss the various communication protocols for RPCs.
(a)
How computer clocks are implemented in clock synchronization? How do
clock synchronization issues differ in centralised and distributed
computing systems? Explain.
3
DE–9024
ws 2
3.
4.
(b)
Explain the basic approaches
implementing mutual exclusion.
(a)
Explain any two election Algorithms.
(b)
Explain threads, its usage and implementation.
(a)
Comment on practical ability of the Load-Balancing approach as a
scheduling scheme for the following types of distributed systems
(i)
A LAN-Based
(ii)
A WAN-Based
used
by
different
algorithm
(iii) Processor-Pool model.
5.
6.
7.
8.
(b)
Explain the desirable features of a good process migration mechanism.
(a)
Explain about distributed databases.
(b)
Discuss the various issues in designing a Thread Package.
(a)
Explain the various file-sharing semantics.
(b)
Discuss the desirable features of a good distributed file system.
(a)
Explain bus based multiprocessor in detail.
(b)
Describe the client-server communications in distributed system.
(a)
Describe in detail distributed file system.
(b)
Explain any one network operating system.
————————
DE–2012
12C
DISTANCE EDUCATION
M.Phil. (Computer Science) DEGREE EXAMINATION,
MAY 2011.
Non-Semester
NATURAL LANGUAGE PROCESSING
Time : Three hours
Maximum : 100 marks
Answer any FIVE questions.
4
DE–9024
for
ws 2
All questions carry equal marks.
(5 × 20 = 100)
1. (a)
(b)
2.
Describe the different levels of language analysis in detail.
Explain in brief about the representation of natural language processing.
Discuss the following :
(a)
Top down parser.
(10)
(b)
Finite state models.
(10)
3.
Explain various Grammars and logic programming in natural language
processing.
(20)
4.
Explain a simple grammar and lexicon with semantic interpretation.
(20)
5.
Explain about
6.
(a)
Semantic networks.
(10)
(b)
Discourse structure and references.
(10)
Give a plausible logic form for each sentence.
We returned the ring to the store.
We returned to the party.
The owner received a ticket.
(20)
7.
Discuss about the semantic and pragmatic roles of noun phrases.
(20)
8.
Write short notes on the following :
(a)
KING
(b)
GUS
(c)
POET
(d)
Current trends in NLP.
(20)
———————
DE–2013
12 (D)
DISTANCE EDUCATION
5
DE–9024
ws 2
M.Phil. (Computer Science) DEGREE EXAMINATION,
MAY 2011.
Non–Semester
NEURAL NETWORKS AND FUZZY LOGIC
(2002 onwards)
Time : Three hours
Maximum : 100 marks
Answer any FIVE questions.
All questions carry equal marks.
(5  20 = 100)
1. (a)
Enumerate the principles and promises of neural networks.
(10)
(b)
Explain the applications of back propagation training algorithm.
(10)
2.
Describe in detail about the counter propagation networks.
(20)
3.
Write a detailed note on Boltzmann’s training and Cauchy training Hop fields
nets.
4.
(a)
Explain in detail about Bi-directional associative memories.
(b)
Explain the classification and implementation of Adaptive Resonance
theory (ART).
(a)
Describe the features of holographic correlators.
(b)
Describe the structure of cognition and neocognition.
(a)
Distinguish between fuzzy sets and CRIPS sets.
(b)
Enumerate fuzzy arithmetic and fuzzy relations.
(a)
Summarize the operations of fuzzy sets.
(b)
Describe about pattern recognition of fuzzy systems.
5.
6.
7.
8.
Describe about fuzzy databases and information retrieval systems.
——————
DE–2014
21 A
DISTANCE EDUCATION
6
DE–9024
ws 2
M.Phil. (CS) (Non-Semester) DEGREE EXAMINATION,
MAY 2011.
COMPILER DESIGN
(2002 onwards)
Time : Three hours
Maximum : 100 marks
Answer any FIVE questions.
All questions carry equal marks.
(5  20 = 100)
1. (a)
Explain the phase of Compiler.
(b)
Write short notes on Local optimization.
2.
(a)
(b)
What is the role of Lexical Analyzer? Explain.
3.
(a)
(b)
How to handle Shift-Reduce Errors?
4.
(a)
(b)
Explain Top-down Parsing.
5.
(a)
(b)
Write a top-down translation scheme to produce quadruples for Boolean
expressions.
6.
(a)
(b)
What is Hash table? Explain it with necessary diagrams.
7.
(a)
(b)
Construct the DAG for the following basic block :
Explain the ways of implementing a transition diagram.
Write note on constructing Parse Tree.
How to construct a Canonical LR Parsing Tables?
How to represent triple in three-address statements?
What are the contents are available in Symbol-table?
Explain Semantic Errors.
D : B  C
E : A  B
B : B  C
A : E  D
8.
(a)
What are the sources of optimization?
(b)
Discuss Flow Graph with a suitable example.
———————
7
DE–9024
ws 2
DE–2015
21 B
DISTANCE EDUCATION
M.Phil (CS) (NS) DEGREE EXAMINATION, MAY 2011.
SECURITY IN COMPUTING
(2002 onwards)
Time : Three hours
Maximum : 100 marks
Answer any FIVE questions.
All questions carry equal marks.
(5  20 = 100)
1. (a)
(10)
2.
3.
Describe threats, counter measures and security functions.
(b)
Explain passive and active attack in detail.
(10)
(a)
Explain the security functions of operating system.
(10)
(b)
Explain the strengths of conventional encryption algorithm with
example. (10)
(a)
Explain data encryption and issues in network security.
(10)
(b)
What are the features and advantages in Data Encryption Standard
(DES)?
(10)
4.
Explain the public key cryptography and necessary algorithms with examples.
(20)
5.
(a)
What are the different types of firewall? Explain in detail.
(10)
(b)
Write a short note on security safeguards.
(10)
(a)
Explain courtney risk analysis function.
(10)
(b)
Explain the following :
6.
7.
(i)
Risk identification
(5)
(ii)
Risk management.
(5)
(a)
Write a short note on contingency planning.
(10)
(b)
Explain the copyright law.
(10)
8
DE–9024
ws 2
8.
(a)
Explain the RSA algorithms.
(10)
(b)
Compare the transposition ciphers and substitution ciphers.
(10)
————————
DE–2016
21 C
DISTANCE EDUCATION
M.Phil (Computer Science (Non- Semester))
DEGREE EXAMINATION, MAY 2011.
DATA WAREHOUSING AND MINING
(2002 onwards)
Time : Three hours
Maximum : 100 marks
Answer any FIVE questions.
All questions carry equal marks.
(5  20 = 100)
1. (a)
2.
3.
4.
5.
Explain the role of data mining in marketing.
(10)
(b)
What is data warehouse? Why do we need it? Explain.
(10)
(a)
Explain in detail about OLAP tools.
(b)
Explain about genetic algorithms with its merits and demerits.
(10)
(a)
Explain the process of designing the star flake schema.
(10)
(b)
When a data mart is appropriate? Explain.
(a)
Write in detail about day-to-day operations of data warehouse.
(10)
(b)
Explain the impact of security on performance and design.
(10)
(10)
Explain the process of testing the datawarehouse.
9
(10)
(20)
DE–9024
ws 2
6.
7.
8.
(a)
What is parallel query? How does it work?
(b)
Explain the following :
(10)
(i)
User requirements.
(5)
(ii)
System requirements.
(5)
(a)
What is Metadata and explain its uses.
(b)
Explain the following :
(10)
(i)
Horizontal partitioning.
(5)
(ii)
Vertical partitioning.
(5)
Explain the various stages in knowledge in discovery process.
(20)
————————
DE–2017
21(D)
DISTANCE EDUCATION
M.Phil. (Computer Science) (Non-Semester) DEGREE EXAMINATION, MAY 2011.
PARALLEL ALGORITHMS
(2002 onwards)
Time : Three hours
Maximum : 100 marks
Answer any FIVE questions.
All questions carry equal marks.
(5  20 = 100)
1. (a)
2.
3.
4.
Discuss about MIMD class computers.
(10)
(b)
Explain in detail about CREW searching.
(10)
(a)
Explain in detail about searching on mesh connected computers.
(10)
(b)
Discuss about broadcast and all sum algorithms on SIMD model.
(10)
(a)
Describe the sorting on a linear array in detail. (10)
(b)
Explain in detail about sorting by selection approach in sorting EREW
model.
(10)
(a)
Explain the Shuffle transpose with suitable example in detail.
(10)
10
DE–9024
ws 2
5.
(b)
Write the procedure for Mesh multiplication and explain with an
example. (10)
(a)
Write the MIMD algorithm for solving partial differential equations.
(10)
(b)
Explain the finding roots of non-linear equation using MIMD algorithm
in detail. (10)
6.
Explain in detail about computing Eigen values with examples.
(20)
7.
(a)
Explain in detail about computing the connectivity matrix with procedure
for cube connectivity. (10)
(b)
Explain sequential tree traversal with example. (10)
(a)
Write short notes on parallel cutoffs.
(10)
(b)
Explain MIMD ALPHA BETA algorithm.
(10)
8.
————————
11
DE–9024