M.Sc. DEGREE EXAMINATION — JANUARY 2017.

First Year

Computer Science

MATHEMATICAL STRUCTURES FOR COMPUTER

SCIENCE

Time : 3 hours Maximum marks : 75

PART A — (5 5 = 25 marks)

Answer any FIVE questions.

1. Construct the truth table for following statement formula RPRQQP .

2. Show that QPQPPQP .

3. How many different bit strings are there of length seven?

4. Four coins are tossed simultaneously. What is the probability of getting (a) 2 heads (b) atleast 2 heads?

PG–1089 MSC–1

PG–1089 2

5. Let R be a set of real numbers, Let RRf : be defined by Rxxxf ,52 . Show that f is one-one and onto.

6. Give an example of a graph which a Hamiltonian but not Eulerian.

7. Prove that every regular set is accepted by a finite state automaton.

PART B — (5 10 = 50 marks)

Answer any FIVE questions.

8. Using rule CP, derive SQP from SRQRQP , .

9. Show that xQxxPxxQxPx by using indirect method.

10. Find the number of integers between 1 and 250 both inclusive that are not divisible by any of the integers 2, 3, 5 and 7.

11. If RRhgf :,, are defined by ,43 xxxf

1

12

x

xg and 4xxh , find xhgf and

xhgf , and check if they are equal .

12. Show that a graph G is connected if and only if it has a spanning tree.

PG–1089 3

13. Prove that a simple graph with ‘n’ vertices must

be connected if it has more than

221 nn

edges.

14. Show that the Language 1,/ mnba mn is generated by the regular grammar

,,,,,, PSbaASG bAbAAaASaSSP ,,, .

———————

M.Sc. DEGREE EXAMINATION — JANUARY, 2017.

First Year

DATA STRUCTURE

Time : 3 hours Maximum marks : 75

PART A — (5 5 = 25 marks)

Answer any FIVE questions.

1. Explain types of data structure.

2. Explain linear data structure with array.

3. What is a Binary tree traversal? Explain.

4. Write short notes on Graph Traversals.

5. Explain the skew heaps.

6. Write short notes on Red Black trees.

7. What is a k-d trees? Explain.

PG–1090 MSC–2

PG–1090 2

PART B — (5 × 10 = 50 marks)

Answer any FIVE questions.

8. Explain the doubly linked list and circular list.

9. Describe the performance analysis of an algorithm.

10. Explain lazy binomial heaps.

11. Write short notes for the following :

(a) Array

(b) Stack

(c) Queue.

12. Explain B-Trees and splay trees.

13. Explain MX-Quad trees and R-trees.

14. Explain Min/Max heaps.

——–––––––––

M.Sc. DEGREE EXAMINATION — JANUARY, 2017.

First Year

Computer Science

COMPUTER GRAPHICS

Time : 3 hours Maximum marks : 75

Answer for 5 marks questions should not exceed 2 pages.

Answer for 10 marks questions should not exceed 5 pages.

SECTION A — (5 5 = 25 marks)

Answer any FIVE questions.

1. Discuss various Hard Copy devices.

2. Explain any three input devices.

3. Explain line attributes.

4. Write short notes on composite transformation.

PG–1091 MSC–3

PG–1091 2

5. What is a clipping algorithm? Explain.

6. Explain parallel projection.

7. Write short notes on Depth buffer method.

SECTION B — (5 × 10 = 50 marks)

Answer any FIVE questions.

8. Describe line drawing algorithm.

9. Explain color and grayscale styles.

10. Discuss any five output devices.

11. Explain three dimensional display methods.

12. Explain the various 3D transformation concepts in detail.

13. Explain the graphics software.

14. Describe visible surface detection algorithm.

——–––––––––

M.Sc. DEGREE EXAMINATION – JANUARY 2017.

First Year

Computer Science

OBJECT ORIENTED ANALYSIS AND DESIGN

Time : 3 hours Maximum marks : 75

PART A — (5 5 = 25 marks)

Answer any FIVE questions.

1. What is a UML? Explain.

2. Write short notes on common mechanisms and diagrams.

3. What is a modeling techniques? Explain.

4. Write short notes for the following:

(a) class

(b) object

(c) interfaces.

5. Write short notes on state chart diagram.

PG-1092 MSC–4

PG-1092 2

6. Explain about interface with an example.

7. Explain in detail quality assurance.

PART B — (5 10 = 50 marks)

Answer any FIVE questions.

8. Describe the software development life cycle.

9. Explain advance structural modeling.

10. Describe advanced behavioral modeling – II.

11. Write notes for the following :

(a) Process

(b) Threads.

12. Describe about unified library applications.

13. Explain mapping object model to database schema.

14. What is a object oriented modeling? Explain.

–––––––––––

M.Sc. DEGREE EXAMINATION – JANUARY, 2017.

First Year

Computer Science

ADVANCED DATABASES

Time : 3 hours Maximum marks : 75

PART A — (5 5 = 25 marks)

Answer any FIVE questions.

1. Discuss about Client Server Architecture.

2. Explain system architecture.

3. Write object relational features in SQL/ORACLE.

4. Discuss about complex objects.

5. What is spatial database? Explain.

6. Explain Text mining.

7. Discuss about biological data management.

PG–1093 MSC–5

PG–1093 2

PART B — (5 10 = 50 marks)

Answer any FIVE questions.

8. Explain distributed data storage.

9. What is parallel system? Explain.

10. Explain ODL.

11. Describe spatial data structure.

12. Explain concurrency control.

13. What is data mining? Explain.

14. Describe briefly cloud based data base.

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

M.Sc. DEGREE EXAMINATION – JANUARY 2017.

First Year

Computer Science

COMPUTER ARCHITECTURE

Time : 3 hours Maximum marks : 75

SECTION A — (5 × 5 = 25 marks)

Answer any FIVE questions.

1. Write short notes on Flynn’ classification.

2. Discuss about task dependency.

3. What is the purpose of arithmetic pipeline? Explain.

4. State the uses of inter PE communication.

5. Write short notes on mesh connected illiac.

6. Explain about sorting with an example.

7. What is masking? Explain.

PG-1094 MSC-6

PG-1094 2

SECTION B — (5 × 10 = 50 marks)

Answer any FIVE questions.

8. Discuss in detail about Matrix operations with example.

9. Explain in detail about parallel processing applications.

10. Describe about pipeline processing in detail.

11. Briefly discuss about job sequencing and collision prevention.

12. Discuss in detail about multiprocessor architecture.

13. Explain in detail about searching with examples.

14. Discuss in detail about cube interconnection network.

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

M.Sc. DEGREE EXAMINATION – JANUARY, 2017.

First Year

Computer Science

MOBILE COMPUTING

Time : 3 hours Maximum marks : 75

SECTION A — (5 5 = 25 marks)

Answer any FIVE questions.

1. Discuss about components of wireless environment.

2. Write short notes on GPRS.

3. What is PDA? Explain.

4. Explain MAC protocol.

5. Write short notes on QOS.

6. Discuss about energy management.

7. Write short notes on Mobile devices.

PG–1095 MSC–7

PG–1095 2

SECTION B — (5 10 = 50 marks)

Answer any FIVE questions.

8. Discuss about wireless transmission.

9. What is clipping? Explain text clipping.

10. Explain in detail about the wireless LAN.

11. Explain in detail about satellite system.

12. How to develop mobile GUI’s? Explain.

13. Discuss in detail about multi model user interface.

14. Explain in detail about transport layer protocols.

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

M.Sc. DEGREE EXAMINATION – JANUARY 2017.

First Year

Computer Science

DATA WAREHOUSING AND DATA MINING

Time : 3 hours Maximum marks : 75

SECTION A — (5 × 5 = 25 marks)

Answer any FIVE questions.

1. Explain about multidimensional data model.

2. What is data reduction? Explain.

3. Explain frequent item sets.

4. Write short notes on outlier analysis.

5. What is indexing? Explain.

6. Explain about lazy learners.

7. Explain about hierarchical methods.

PG-1096 MSC-8

PG-1096 2

SECTION B — (5 × 10 = 50 marks)

Answer any FIVE questions.

8. Explain in detail about data warehouse architecture.

9. Briefly explain data mining functionalities.

10. Explain various kinds of association rules.

11. Discuss in detail about Bayesian classification.

12. Explain in detail about support vector machine.

13. Explain in detail about accuracy and measures.

14. Discuss in detail about density-based methods.

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

M.Sc. DEGREE EXAMINATION — JANUARY, 2017.

First Year

Computer Science

ANALYSIS OF ALGORITHMS

Time : 3 hours Maximum marks : 75

SECTION A — (5 5 = 25 marks)

Answer any FIVE questions.

1. Define big oh (O), Big omega )( and big theta )( notations.

2. Explain about modular arithmetic.

3. Write an algorithm for binary search.

4. What is Hamiltonian circuit? Explain.

5. Write an algorithm for quick sort.

6. What is minimum spanning tree problem? Explain.

7. What is single source shortest path algorithm? Explain.

PG–1097 MSC–9

PG–1097 2

SECTION B — (5 × 10 = 50 marks)

Answer any FIVE questions.

8. Explain in detail quick sorting method. Provide a complete analysis of quick sort with example.

9. Explain in detail about 0/1 knapsack problem with example.

10. Discuss in detail about multistage graph with an example.

11. Explain in detail about Hamiltonian cycle.

12. Explain in detail about travelling salesman problem.

13. Describe Knapsack problem and memory functions with example.

14. Explain optimal binary search tree algorithm with example and analyze its efficiency.

——–––––––––

M.Sc. DEGREE EXAMINATION — JANUARY, 2017.

First Year

Computer Science

ADVANCED SOFTWARE ENGINEERING

Time : 3 hours Maximum marks : 75

SECTION A — (5 5 = 25 marks)

Answer any FIVE questions.

1. Explain about RE processes.

2. Explain about user interface design.

3. Write a brief note on soft systems.

4. Briefly explain about extreme programming.

5. Write short notes on software quality.

6. Write a brief note on software requirement.

7. Write a brief note on software maintenance cost.

PG–1098 MSC–10

PG-1098 2

SECTION B — (5 10 = 50 marks)

Answer any FIVE questions.

8. Explain in detail about formal methods.

9. Discuss in detail about architecture object-oriented design.

10. Explain in detail about iterative software development.

11. Write a detailed note on Real-Time systems.

12. Discuss in detail about risk management.

13. Discuss briefly about agile software engineering.

14. Explain in detail about software metrics.

——–––––––––