# MSC Comp Science by 7l0k0u

VIEWS: 12 PAGES: 22

• pg 1
```									                                                                                       ws 2

DE–7502                                                             11

DISTANCE EDUCATION

M.Sc. (Computer Science) DEGREE EXAMINATION, DECEMBER 2009.

MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE

(2007 onwards)

Time : Three hours                             Maximum : 100 marks

SECTION A — (10 × 3 = 30 marks)

1. Construct the truth table for            P       
Q .

2. Write the duals of
(a)    ( P  Q)  R

(b)    ( P  Q)  T .

3. Let X  {1, 2, 3, 4} and R   x , y | x  y. Then draw the graph of R.

4. Let R   1, 2 , 3, 4 , 2, 2  and S   4, 2 , 2, 5 , 3,1 , 1, 3 . Find R  S .

5. Show that the functions f ( x )  x 3 and g( x )  x1 3 for x  R are inverses of one
another.

6. Give an example of a function from X to Y where X  a, b, c and Y  {0,1} .

7. Give an example of a monoid.

8. Show that every cyclic group is abelian.

9. Define connectedness of a graph and give an example.

10. Give an example of a multigraph.

SECTION B — (4 × 10 = 40 marks)

1           DE–7502
ws 2

11. Obtain a conjunctive normal form of

(a)     P  (P  Q) .                                                  (2)

(b)        P  Q   ( P  Q) .
                                                  (8)

12. Show that ((x ) ( p( x )  q( x )))  ( x ) p( x )  ( x ) q( x ) is logically valid statement.

13. Write all the functions from X  {1, 2, 3} to Y  {1, 2, 3} .

14. (a)      Define submonoid and give an example.                           (4)

(b)    For any commutative monoid M ,  , prove that the set of idempotent

elements of M forms a submonoid.
(6)

15. Show that a group (G, ) is abelian if ( a  b)2  a 2  b2 .

16. Show that A  ( B  C )  ( A  B )  ( A  C ) .

SECTION C — (2 × 15 = 30 marks)

17. For the relations R   1, 2 , 3, 4 , 2, 2  and S   4, 2 , 2, 5 , 3,1 , 1, 3  over the
set {1, 2, 3, 4, 5} obtain the relation matrices for R  S and S  R .

18. Determine all the proper subgroups of the symmetric group S3 .

19. Obtain      the       principal     disjunctive       and   conjunctive        normal   forms      of
(Q  P )         P Q .

–––––––––––––––
DE–7503                                                                12

DISTANCE EDUCATION

2          DE–7502
ws 2

M.Sc. (CS) DEGREE EXAMINATION, DECEMBER 2009.

COMPUTER ARCHITECTURE

(2007 onwards)

Time : Three hours                          Maximum : 100 marks

SECTION A — (10 × 3 = 30 marks)

1. What are the operators in instruction set? Explain in brief.

2. What are the different types of control flow change? Explain briefly.

3. Write short notes on dynamic scheduling.

4. Discuss briefly about multiple issues.

5. Write short notes on looping unrolling.

6. Discuss briefly about VLIW approach.

7. What is reducing hit time? Explain in brief.

8. Discuss about throughput versus response time in brief.

9. Write short notes about barrier synchronization.

10. What is multiprocessor? Explain in brief.

SECTION B — (4  10 = 40 marks)

11. Explain in detail about control flow instructions.

12. Explain about IP6 micro architecture in detail.

13. Discuss static branch prediction techniques in detail.

14. Explain the design process of I/O systems in detail.

16. Explain RAID levels briefly.

3            DE–7502
ws 2

SECTION C — (2  15 = 30 marks)

17. Explain MIPS Architecture with all its functionalities in detail.

18. Explain the five levels of optimization for reducing cache miss penalty in detail.

19. Explain symmetric and distributed shard memory architecture in detail.

———————
DE–7504                                                    13

DISTANCE EDUCATION

M.Sc. (Computer Science) DEGREE EXAMINATION, DECEMBER 2009.

DATA STRUCTURES USING C++

(2007 onwards)

Time : Three hours                        Maximum : 100 marks
PART A — (10 × 3 = 30 marks)

1. What is an array? Write the syntax for one dimensional array.

3. What is the difference between stack and array?

4. Define Postfix.

6. Define circular list.

7. What is the difference between preorder and postorder?

8. What is a binary tree?

9. Define bubble sort.

10. Compare sequential search with binary search.

4          DE–7502
ws 2

PART B — (4 × 10 = 40 marks)

11. Discuss about two dimensional arrays.

12. Explain queue as an ADT.

13. Describe the applications of linked list.

14. Explain the operations on binary trees.

15. Discuss about the bubble sort.

16. How can you create a binary search tree?

PART C — (2 × 15 = 30 marks)

17. Write a program to evaluate a postfix expression with an example.

18. Explain preorder and postorder tree traversal techniques with suitable
examples.

19. Explain the Quick sort procedure with an example.

——————–
DE–7505                                                   14

DISTANCE EDUCATION

M.Sc. (Computer Science) DEGREE EXAMINATION, DECEMBER 2009.

VISUAL PROGRAMMING

(2007 onwards)

Time : Three hours                         Maximum : 100 marks

SECTION A — (10 × 3 = 30 marks)

1. What are resources?

5         DE–7502
ws 2

2. Explain API.

3. Explain forms in Visual Basic.

4. How to declare constant in VB? Give example.

5. What is the use of RmDir function and GetArr function?

6. What is the purpose of unload statement in VB?

7. How to initialize objects in visual C++?

8. Explain how to connect menu items to code.

9. What is the use of breakpoints in visual C++?

10. Write any three errors using exception classes in VC++.

SECTION B — (4  10 = 40 marks)

11. Discuss about the structure of a windows program.

12. Explain about properties in VB.

13. Explain the components of VB.

14. Discuss about MS filex Grid control in VB.

15. Explain MFC in visual C++.

16. Discuss about OLE in visual C++.

SECTION C — (2  15 = 30 marks)

17. Explain with example about looping in VB.

18. Explain the following in VB :

(a)   Dialog boxes.                                      (7)

(b)   Functions.                                         (8)

6         DE–7502
ws 2

19. Discuss ODBC in VC++.

———————
DE–7506                                                   15

DISTANCE EDUCATION

M.Sc. (CS) DEGREE EXAMINATION, DECEMBER 2009.

DATABASE MANAGEMENT SYSTEMS

(2007 onwards)

Time : Three hours                         Maximum : 100 marks

SECTION A — (10 × 3 = 30 marks)

1. Define Schema and Subschema.

2. Give any three advantage of database management systems.

3. What is Relational Model? Give an example.

4. Define Superkey and Candidate key.

5. What is a Client/Server system?

6. What is Physical Files? Give an example.

7. What is query? Give an example.

8. How to join any two tables? Give an example.

9. How to load a table? Give an example.

10. How to renaming a table? Give an example.

SECTION B — (4  10 = 40 marks)

11. List the different user interface. Explain.

7        DE–7502
ws 2

12. Explain the various mapping operations in detail.

13. (a)     What are the benefits of Oracle?
(b)   Explain the Network System Tables.

14. Explain the types of databases.

15. Explain how can you work with NULL values.

16. Explain the various data types in SQL.

SECTION C — (2  15 = 30 marks)

17. Write short notes on :
(a)   Data Manipulation facilities
(b)   Data Definition facilities
(c)   Data Control facilities.

18. Explain the oracle architecture in detail.

19. (a)     Explain the Embedded SQL statements.
(b)   Explain the subqueries with an example.

————————
DE-7507                                                     21

DISTANCE EDUCATION

M.Sc. (Computer Science) DEGREE EXAMINATION,
DECEMBER 2009.

COMPUTER NETWORKS

(2007 onwards)

Time : Three hours                          Maximum : 100 marks

SECTION A — (10  3 = 30 marks)

1. List the uses of computer networks.

2. What is network standardization?

8          DE–7502
ws 2

3. What is sliding window protocol?

4. What is ALOHA?

5. Draw the ATM cell format.

6. What is RARP?

7. Define flow control.

8. What is multiplexing?

9. What is SNMP?

10. What is JPEG?

SECTION B — (4  10 = 40 marks)

11. Discuss the types of transmission media.

12. Explain the Narrow band ISDN.

13. Discuss the HDLC functions in detail.

14. Explain Routing and switching in ATM networks.

15. Discuss crash recovery in transport layer.

16. Discuss SNMP in detail.

SECTION C — (2  15 = 30 marks)

17. Explain the error detection and correction codes with example.

18. Explain the congestion control algorithms in network layer.

19. Discuss about data compression in detail.

———————
DE–7508                                                  22

9       DE–7502
ws 2

DISTANCE EDUCATION

M.Sc.(Computer Science) DEGREE EXAMINATION, DECEMBER 2009.

SOFTWARE ENGINEERING

(2007 onwards)

Time : Three hours                         Maximum : 100 marks

SECTION A — (10  3 = 30 marks)

1. Define Software Engineering.

2. Define project metrics.

3. Write the objectives of project planning.

4. Define the structure of estimation models.

6. Define quality assurance.

7. What is transform mapping?

8. Define cardinality.

9. What is unit testing?

10. What is known as debugging?

SECTION B — (4  10 = 40 marks)

11. Describe Software project in detail.

12. Write in detail about risk mitigation, monitoring and management.

13. Discuss software configuration management in detail.

10        DE–7502
ws 2

14. Write in detail about data design.

15. Explain loop testing with suitable example.

16. Describe system testing in detail.

SECTION C — (2  15 = 30 marks)

17. Explain the Linear Sequential Model.

18. Explain empirical estimation model in detail.

19. Describe the principles of requirement analysis.

—————————
DE–7509                                                   23

DISTANCE EDUCATION

M.Sc.(Computer Science) DEGREE EXAMINATION, DECEMBER 2009.

INTERNET PROGRAMMING AND WEB DESIGN

(2007 onwards)

Time : Three hours                         Maximum : 100 marks

SECTION A — (10  3 = 30 marks)

1. What is WWW?

2. What is the use of programming language CGI?

3. Define coding conventions VB script.

4. Specify the need of java script.

5. What is HTML?

6. Specify any six HTML tags.

11          DE–7502
ws 2

7. What is the use of Activex controls?

8. What is protocol?

9. What is framing?

SECTION B — (4  10 = 40 marks)

11. Discuss features of java language.

12. Discuss on the objects of javascript.

13. What is IE? Explain.

14. Describe the creation of Netscape Navigator plug-Ins.

15. Describe the design of a site and page.

16. What is dynamic graphics? Explain.

SECTION C — (2  15 = 30 marks)

17. (a)     Discuss the Design Issues of WWW.
(b)   What is Internet Programming? Explain.

18. (a)     Describe the loop structures available in VB script.
(b)   Discuss on shokwave and lingo.

19. (a)     Describe the creation of custom Integrated application with multiple
protocol.
(b)   Explain how can you add graphics to web pages.

————————
DE–7510                                                    24

DISTANCE EDUCATION

M.Sc. (Computer Science) DEGREE EXAMINATION, DECEMBER 2009.

12       DE–7502
ws 2

IMAGE PROCESSING AND ANALYSIS

(2007 onwards)

Time : Three hours                         Maximum : 100 marks
SECTION A — (10  3 = 30 marks)

1. What is image?

2. Define filtering.

3. Give an example for high-pass filtering.

4. What is error restoration?

5. What are the functions used frequently for image enhancement?

6. Define segmentation.

7. Define line detection.

8. Define multi-level thresholding with an example.

9. Define description in image processing.

10. What are the various methods for recognition of individual object?

SECTION B — (4  10 = 40 marks)

All questions carry equal marks.

(a)   Quantization

(b)   Digitization

12. Discuss Smoothing

13. Explain the low-pass filtering techniques.

14. Explain Huffman coding with an example.

13         DE–7502
ws 2

15. How to process the colour images? Explain.

16. Describe the topological attributes.

SECTION C — (2 × 15 = 30 marks)

17. Explain basic transformations.

18. Explain Thresholding.

19. Discuss about fuzzy mathematical recognition.

———————
DE–7511                                                  25

DISTANCE EDUCATION

M.Sc.(Computer Science) DEGREE EXAMINATION, DECEMBER 2009.

OPERATING SYSTEMS

(2007 onwards)

Time : Three hours                         Maximum : 100 marks

SECTION A — (10  3 = 30 marks)

1. What is mean by Resource Sharing?

2. What is error detection?

3. What is Resource-Request Algorithm?

5. What do you mean by roll out and roll in?

6. What is page table?

7. What is meant by disk location?

14         DE–7502
ws 2

8. What is FAT?

9. What is server initiated approach?

10. What is stateless file service?

SECTION B — (4  10 = 40 marks)

13. What is segmentation? Explain.

14. Explain page replacement algorithm with your own example.

15. What is free space management?

16. Discuss different types of Disk Scheduling.

SECTION C — (2  15 = 30 marks)

17. Explain in detail about scheduling algorithms.

19. Discuss the directory structure in file system.

————————
DE–7795                                                   16

DISTANCE EDUCATION

M.Sc. (Computer Science) DEGREE EXAMINATION, DECEMBER 2009.

C++ AND DATA STRUCTURE — LAB

(2007 onwards)

Time : Three hours                         Maximum : 100 marks
Break-up of marks :
Record : 10
Algorithm : 10

15          DE–7502
ws 2

Program : 50
Debugging : 10
Execution : 10
Result : 10
Total : 100
Answer TWO questions (ONE simple C++ program and ONE Data structure
program)
Questions are to be selected by the examiner for each candidate.
Cut here
1. Create a class called worker that contains a name, identify, salary, designation,
address. Use the member function getdata(), to read the information from user and
putdata() to display the information. Write a C++ program to declare and define the
class.
Cut here

2. Write a C++ program to createp a list with header and ends with null list.
Perform insertion and deletion operation using linked list.

3. Write a C++ program to create a stack and perform overflow and underflow
(display the status of stack) and include push and pop operation of a stack.

Cut here

4. Write a C++ program to perform the matrix operations addition, subtraction and
multiplication using function.
Cut here

5. Write a C++ program to create a queue using array. Perform insertion and
deletion operation on queue. Verify queue is empty and full conditions.
Cut here

6. Write a C++ program to convert a given number into words for numbers 1 to 10.
Cut here

7. Write a C++ program to solve the roots of a quadratic equation using function
calling.
Cut here

8. Write a C++ program to read values to an array. Use pointers to locate and
display each value.

16         DE–7502
ws 2

Cut here

9. Write a C++ program, use ‘+’ and ‘–‘ operator to find the different and total
length of given two sticks specified in meters and centimeters using operator

10. Write a C++ program to find the factorial of a given number using recursion.
Cut here

11. Write a C++ program for matrix operation addition, subtraction and
multiplication using function.
Cut here

12. Write a C++ program to concatenate two given strings using dynamic
constructors.
Cut here

13. Write a C++ program to create a list and perform insert and delete operations on
Cut here

14. Write a C++ program to arrange an elements in ascending order using selection
sort, insertion sort and quick sort.
Cut here

15. Create a class that contains two different matrices of order m  n and perform
Cut here

16. Create a class that contains a name, employee number, designation and salary
use the member function called getdata() to read an item from the user and
putdata() to display an item into the user. Write a main program to use this
class. Create an array of object and use the member function.

17. Write a program to calculate the square of type integer, float, double and long
use the same function name using polymorphism concept.
Cut here

18. Write a C++ program to evaluate any post fix expression using stack.

17         DE–7502
ws 2

————————
DE–7796                                                      17

DISTANCE EDUCATION
M.Sc. (Computer Science) DEGREE EXAMINATION, DECEMBER 2009.
VISUAL PROGRAMMING – LAB
(2007 onwards)
Time : Three hours                     Maximum : 100 marks
Breakup marks
Record : 10
Algorithm : 10
Program : 50
Debugging : 10
Execution : 10
Result : 10
Total : 100
Instruction :
Candidate        has     to       select     and        give   one          set
(2 questions) of questions by lot system.
Cut here

1. (a)     Create a VB application using a control array, create a simple calculator
which will do the following operation :
(ii) Subtraction.
(iii) Multiplication.
(iv) Division.
(v) Square.
(vi) Square root.
(vii) Modulus.
(viii) Power.
(ix) Percentage.
(using Textbox, Command Button, Frames)
(b) Write a VC++ program to find out whether a mouse is attached or not;
and if attached how many buttons are present or not.

2. (a)     Using Active X control create a Textbox that accepts only numeric value
with the following properties :
(i)    Background of the textbox.
(ii)   Foreground of the textbox.
(iii) Text property of the textbox.

18          DE–7502
ws 2

(iv)   Resize the textbox at the standard application without using
properties.
(b)   Write a Visual C++ program to create a List box in a window.

Cut here

3. (a)     Write a VB program to perform the following operation in a record of
Random Access File.
(i)    Insert.
(ii)   Delete.
(iii) Search.
(b)   Write a Visual C++ program to generate a status bar and show the status
of Caps Lock, Num Lock and Scroll Lock in it.

Cut here

4. (a)     Write a VB program for event procedure to perform the following :
(i)    Reverse a string.
(ii)   Determine whether the given string is palindrome or not.
(iii) Change the ease of string to upper of lower. (Use Label, Textbox,
Command Button)
(b)   Write a VC++ program to create a window of desired size using MFC.

5. (a)     Write a VB program to create a form with Textbox, Combo Box and
Command Button and do the following operation :

(i)    Add the university name in the Combo Box at the run time.

(ii)   Search and delete the particular university in the Combo Box.

(iii) Display the message box with number of University available in the
Combo Box.

(iv)   Sort the university names in the alphabetical order.

(b)   Write a Visual C++ program to handle windows messages in MFC
program.

Cut here

6. (a)     Write a VB program using AX DLL or EXE add a class module that
would perform the following function :

(i)    Test whether the given number is perfect or not

19         DE–7502
ws 2

(ii)   Whether the given number is Armstrong number or not?

(iii) Find the factorial of the given number.

(iv)   Sum of digits.

(b)   Write VC++ program to fill back ground of the client area with a bit map.

7. (a)     Write a VB program to develop a data report using employee table with
the following :
(i)    Display all the employee details.
(ii)   Display all the employee details in each department and display
total salary in each department.
(iii) Display all the employee details which starts with employee name
specified in Textbox.
(b)   Write a VC++ program to get the status of the shift and toggle keys using
MFC.

————————
DE–7797                                                    26

DISTANCE EDUCATION

M.Sc. (Computer Science) DEGREE EXAMINATION, DECEMBER 2009.

INTERNET PROGRAMMING – LAB-III

(2007 onwards)

Time : Three hours                        Maximum : 100 marks

Break-up of Marks
Record : 10
Algorithm : 10
Program : 50
Debugging : 10
Execution : 10
Result : 10
Total : 100

Examiner has to select and give One question to each candidate by lot system.
Cut here
1. (a)     Write a VB script to do the following

20          DE–7502
ws 2

(b)   Design an applet which display Greetings.
Cut here
2. (a)     Write a java program to implement multiple inheritance using interface.

(b)   Write a swing program to create the Tabbed panels.

3. (a)     Write a java script to create a order form to select the house articles.
(b)   Write a java program to display a frame, which shows your address in
four lines. Each line appear in a different font in a different color. The
title of the frame must be address. Choose a suitable background color for
the frame.
Cut here
4. (a)     Write a VB script to create a calander for given month and year.
(b)   Write a swing to create buttons with
(i)    Tool tip text
(ii)   Image
(iii) Border
(iv)   Short cut keys.
Cut here
5. (a)     Write a java program to create a color palet and display the text in the
color chosen from the palet with proper background color.
(b)   Write a java program to create a color as the background.
Cut here

6. (a)     Write a menu drive java program to do database functions using
database connectivity facility. The functions include display, edit, insert,
and delete a records from a table.
(b)   Design an applet which displays the salient features of a project.

7. (a)     Write a java program using applet to draw a human face using graphic
controls.
(b)   Write a swing program to create a color as the background.

Cut here
8. (a)     Write a menu driven java program using frames.

21          DE–7502
ws 2

(b)   Write a java program to display your name continuously on increasing
size of fonts.

———————

22        DE–7502

```
To top