Name of the University : Alagappa University
Degree : M.Sc
Department : Computer Science
Subject Code/Name : Applied Mathematics For Computer Science
Semester : I
Document Type : Model Question Papers
Website : alagappauniversity.ac.in
Download Model/Sample Question Paper : APRIL 2011 :https://www.pdfquestion.in/uploads/alagappauniversity.ac.in/4051.-MSc.%20COMPUTER%20SCIENCE.pdf
Applied Mathematics For Computer Science :
1. Show that – P – – P- Q- Q.
2. Construct truth table for P- Q.
3. Prove that – P – Q- P – – Q- .
Related : Alagappa University Microprocessor And Interfacing B.Sc Model Question Papers : www.pdfquestion.in/3962.html
4. Find the dual of
5. Define a complete graph and give an example.
6. What is an Eulerian graph –
7. Explain artificial variable and its use in linear programming.
8. What is the difference between assignment problem –
9. What is an unbalanced assignment problem – How to solve it –
10. What do you mean by degenerate solution to a transportation problem –
11. (a) Verify the following is a tautology or not –
12. (a) Show that the following equivalence without constructing truth table :—
13. (a) Draw the binary tree to represent the expression
14. (a) Use graphical method to solve : Maximize Z – 2×1 – 3×2
15. (a) Find initial solution of the transportation problem
16. Show that – is a functionally complete set.
17. Show that R – – P – Q- is a valid conclusion from the
18. Find the number of paths of length 4 from the vertex
19. Find the optimal solution to the following Transportation problem.
20. Solve using Big-M method :Manimize Z – 20×1 – 10×2
C AND DATA STRUCTURE :
1. Mention the logical operators in C.
2. List any four commonly used library functions in C.
3. Specify the use of continue statement.
4. Mention the main difference between while and
5. What is the use of sprintf ( ) –
6. Specify the difference between float a and float ka.
7. Mention the use of header in the linked list.
8. Specify any two applications of stack.
9. What is hashing –
10. Mention the difference between Binary tree and General tree.
11. (a) Explain the formatted input and output functions in C with an example.
12. (a) Write a C program to check whether a given number is prime or not –
13. (a) Explain the method of representing two dimensional array in memory.
14. (a) What is doubly linked list – Explain.
15. (a) Explain the binary tree traversal methods with an example.
16. Explain the data types available in C with examples.
17. Explain any three decision control statements in C with example.
18. Write a C program to multiply two matrices of order m × n and n × p.
19. Explain the operations on stack with its algorithm.
20. Explain quicksort algorithm with an example.
OBJECT ORIENTED PROGRAMMING IN JAVA
1. What is JVM –
2. What is encapsulation –
3. Define Constructor.
4. What is the use of finalize ( ) method –
5. Define Multiple threads.
6. What is the use of synchronized statement –
7. What is the use of replace ( ) method in Java –
8. Mention any two mouse events in Java.
9. What is the use of Datagram Packet () in Java –
10. Mention any two advantages of Java Beans.
Part B : (5 × 5 = 25)
Answer all the questions.
11. (a) Write the features of Java.
(Or)
(b) Explain about character set in Java.
12. (a) Discuss about interfaces.
(Or)
(b) Write a Java program to create a student class which contains name and roll no. Write a program to read and display the student information.
13. (a) Discuss about thread priorities.
(Or)
(b) Explain about suspending and resuming threads.
14. (a) Write a Java program to concatenate two strings.
(Or)
(b) Discuss about the steps involved in creation of push button.
15. (a) What is JDBC ? Explain.
(Or)
(b) Write a Java program to display Internet addressing Information.
Part C : (3 × 10 = 30)
Answer any three questions.
16. Explain the various Operators available in Java.
17. Discuss about user defined exceptions with an example.
18. Explain about interthread communication with an example.
19. Explain about four methods in an applet skeleton.
20. Discuss the steps involved in developing a simple servlet.
Elective— Object Oriented Analysis And Design :
Time : 3 Hours Maximum : 75 Marks
Part A : (10 × 2 = 20)
Answer all questions.
1. What is an Object ?
2. What is a link and an association ?
3. Define Process and Data flow.
4. Define Meta data.
5. Why do we need analysis ?
6. Why do we need to model a problem ?
7. Define ATM network.
8. What is a sub system ?
9. Write hints on designing algorithms.
10. What is robustness ?
Part B : (5 × 5 = 25)
Answer all questions
11. (a) Explain generalization in detail. (Or)
(b) Explain grouping constructs with example.
12. (a) What is an event ? Discuss. (Or)
(b) Write short notes on Data flow diagrams.
13. (a) Write short note on Object modeling. (Or)
(b) Write short notes on functional modeling.
14. (a) What is meant by boundary condition ? Explain. (Or)
(b) Explain about management of Data stores.
15. (a) Explain about design of associations. (Or)
(b) Write notes on adjustment of inheritance.