M.Phil. DEGREE EXAMINATION, NOVEMBER 2017
First Semester
Computer Science
RESEARCH METHODOLOGY
(CBCS 2017 onwards)
Time 3 Hours Maximum 75 Marks
Part A x 5 25)
Answer any five questions.
1. Distinguish between fundamental research and applied
research. Give examples.
2. Discuss measure of skewness.
3. Give brief account of algorithmic research problems in
different areas of management.
4. What is linked list data structure? Illustrate its working
principle with suitable diagrams.
5. Give the steps of the PRIM's algorithm.
6. Discuss about Dijkstra's algorithm with suitable example.
7. Discuss the three basic types of Learning methods in
Neural Networks.
8. Use of computer tools for writing and publishing in
thesis.
Sub. Code
7PCS1C1
AFS-0204
2
Sp 1
Part B x 10 50)
Answer all the questions, choosing either or
9. Describe various types of research.
Or
What are secondary data? Explain the internal and
external sources of secondary data.
10. What are the types of solution procedure? Explain
them in brief.
Or
What is a binary tree? Give the steps of the
algorithm for the construction of the binary tree as
well as to locate the desired key in it.
11. Explain the assignment problems with suitable
examples.
Or
Explain traveling salesman problem in detail.
12. Write short notes on:
Single Layer Feedforward Network
Multilayer Feedforward Network
Recurrent Networks.
Or
Discuss Fitness Function of Genetic Algorithm.
13. Discuss the guidelines for reviewing the draft of a
report.
Or
Elaborate on how to plan the thesis?
————————