Alagappa University MCA Question Papers

Hello, I am looking for the details regarding the question paper of the MCA of the Algappa University. So can you please provide me the details regarding this including the contact details of the Algappa University??

[Arun Vats]

Alagappa University is a Public University which is located in the city of Karaikudi, Tamil Nadu, India.

It was established in 1985

The list of the colleges affiliated to the University is:

Chennai
Alagappa Institute of Technology (AIT)
Empee Institute of Hotel Management and Catering Technology
Madras Institute of Hotel Management and Catering Technology (MIHMCT)
Coimbatore
Nehru College of Aeronautics and Applied Science
Karaikudi
Alagappa Institute of Technology (AIT)
Mumbai
ICE College of Hotel Management
Ramanathapuram
Alagappa University Evening College
Caussanel College of Arts and Science
Ganapathy College of Education
Government Arts College
Government Arts College for Women
Pasumpon Thiru Muthuramalinga Thevar Memorial College
Ramasamy Tamil College
Sethupathy Government Arts College
Sonai Meenal Arts and Science College
Syed Hameedha Arabic College
Syed Hameedha Arts and Science College
Thassim Beevi Abdul Kader College for Women
Sivaganga
Alagappa Government Arts College
Ananda College
Arumugam Pillai Seethai Ammal College
Dr. Umayal Ramanathan College for Women - URCW
Ganapathi Seethai Ammal College (GSAC)
Government Arts College for Women
Government College for Women
Matha College of Arts & Science
Raja Doraisingam Government Arts College
Raja Duraisingam Government Arts College
Seethalakshmi Achi College for Women
Sree Sevugan Annamalai College
Sri Sarada Niketan College for Women
V.S.S. Government Arts College
The Nilgiris
Merit International Institute of Business Management
Merit International Institute of Technology
Merit Swiss Asian School of Hotel Management
Tirunelveli
Madurai Sivakasi Nadars Pioneer Meenakshi Women's College
Tirupati
Ramee Academy of Catering, Tourism and Hotel Management
Trichy
Jenneys Academy of Tourism and Hotel Management

You are looking for the question paper of the MCA of the Algappa University. So I am providing it to you:

Computer Applications
COMPUTER ORGANIZATION

Part - A (10 × 2 = 20)
Answer all questions.
1. Mention the difference between Combinational and
Sequential circuits.
2. Specify the Demorgan’s theorem.
3. Mention the use of multiplexer.
4. Specify the types of main memories.

5. What is instruction format ?
6. Mention and four pseudo instructions.
7. What is memory - mapped I/O.
8. Mention the function of IOP.
9. What is locality of reference ?
10. Specify the difference between Virtual address and
Physical address.

Part - B (5 × 5 = 25)
Answer all questions.
11. (a) Explain any two methods of representing
negative numbers.
(Or)
(b) Explain the operation of D-flip flop.
12. (a) Explain any five arithmetic micro operations.
(Or)
(b) Explain the characteristics of MOS and CMOS.

13. (a) Explain the basic registers in a Computer
system.
(Or)
(b) Explain the function of an assembler.
14. (a) Explain the block diagram of an I/O interface
unit.
(Or)
(b) Explain any four peripheral devices.
15. (a) Explain the memory hierarchy.
(Or)
(b) Explain the flags in the status register.

Part - C (3 × 10 = 30)
Answer any three questions.
16. Construct the half and full adder circuits from the
truth tables.
17. Design a 3 to 8 line decoder using logic gates.
18. Explain the control unit of a basic computer with a
block diagram.
19. Briefly explain any two methods of asynchronous
data transfer.
20. Explain any five addressing modes.

Computer Applications
C AND DATA STRUCTURES
(Common for M.C.A. (R) / M.C.A. (W/END)
(CBCS—2008 onwards)
Time : 3 Hours Maximum : 75 Marks

Part - A (10 × 2 = 20)
Answer all questions.
1. What is need for declaration ?
2. What is cast operator ? Give an example.
3. int a [3] [4] [2]. How many elements can be stored
and size of the array in bytes ?
4. Define Pointers.

5. Define Linear List.
6. Define Stack.
7. Define Tree.
8. Define Collision.
9. Why is Binary search better than linear search ?
10. What is the principle used in Quick sort ?

Part - B (5 × 5 = 25)
Answer all questions.
11. (a) Explain aggregate data type supported by C.
(Or)

(b) Compare if ... elseif ... with switch statement.
12. (a) Explain pointer Arithemetic with suitable
example.
(Or)
(b) When do you need pointer to printer ? Give an
example.
13. (a) How do you merge two linear lists ?
(Or)
(b) Explain add and delete operations on queue.

14. (a) What are the ways to represent Binary Tree ?
Explain.
(Or)
(b) Describe any four Hashing functions.
15. (a) Write a ‘C’ Program for binary search.
(Or)
(b) Explain Insertion sort with an example.

Part - C (3 × 10 = 30)
Answer any three questions.
16. Describe hierarchy of operators in C.

17. Write a C program to find determinant of a given
matrix.
18. Explain insertion and deletion operation in single
linked list with ‘C’ code.
19. Explain tree Traversal algorithms with examples.
20. Describe Tree sort with example.

Computer Applications
DATABASE MANAGEMENT SYSTEMS
(Common for MCA (R) MCA (W/END))
(CBCS—2008 onwards)
Time : 3 Hours Maximum : 75 Marks

Part - A (10 × 2 = 20)
Answer all questions.
1. What are the different views on data ?
2. What is a Query processor ?
3. Define View.
4. What is the formal definition of Domain Relational
Calculus ?

5. Write the basic form of basic SQL query.
6. What are the problems caused by redundancy ?
7. What is Log ? What is its use ?
8. Define Atomicity. Give one example.
9. What is a Cluster ?
10. What is meant by Indexed Sequential Access
Method ?

Part - B (5 × 5 = 25)
Answer all questions.
11. (a) Explain E - R model with an example.
(Or)

(b) Discuss the design issues of Database design.
12. (a) Explain how will you delete and alter a table ?
Give example.
(Or)
(b) Explain the operations in Tuple relational
Calculus.
13. (a) Explain various Aggregate operators with
example.
(Or)
(b) Explain outer join with example.

14. (a) Write short notes on concurrent execution.
(Or)
(b) Explain the Remote Backup systems.
15. (a) Explain Secondary index with example.
(Or)
(b) Describe the Dynamic index structure.

Part - C (3 × 10 = 30)
Answer any three questions.
16. Describe the structure and purpose of DBMS.

17. Describe the fundamental and additional operations
of Relational Algebra with example.
18. Explain :
(a) BCNF.
(b) THIRD Normal Form with example.
19. Explain Lock-Based protocols and its types with
example.
20. Describe tree Based Indexing with example.

DISCRETE MATHEMATICS
Common for MCA (R)/ MCA W/E)
(CBCS—2008 onwards)
Time : 3 Hours Maximum : 75 Marks

Part - A (10 × 2 = 20)
Answer all questions.
1. Construct the truth table for P (P Q)   .
2. Show that the equivalence :
P (Q P) P (P Q)     
3. Show that A B A B B     .

4. If A is a given finite set, (A)  its power set and 
is the inclusion relation on the elements of (A)  ,
draw Hasse diagram of (P(A),  ) for A = {a, b, c}. .
5. Prove that for any commutative monoid M, * , the
set of idempotent elements of M forms a
submonoid.
6. Show that the set N of natural numbers is a
semigroup under the operation * max { , } x y x y  . Is
it a monoid ?
7. Define unilaterally connected digraph and
strongly connected digraph.
8. Write down the adjacency matrix for the graph.

9. A pair of dice is tossed. Find the probability that
one of the die is 2 if the sum is 6.
10. The probabil ity that a boy wil l pass an
examination is
3
5 and that for a girl is
2
5 , what is
the probability that at least one of them passes the
examination.

Part - B (5 × 5 = 25)

Answer all questions.
11 (a) Obtain the principal disjunctive normal form
of P ((P Q) ( Q P))     .
(Or)
(b) Show that S  R is tautologically implied by
(P Q) (P R) (Q S)      .

12. (a) Let X = {1, 2, . . . , 10} and R be a relation on X
wh er e R = {(x, y) : x + y = 10}. What are the
properties of the relation R ?
(Or)
(b) If the compatibil ity relation on a set
1 2 6 { , ,..., } x x x is given the matrix.
x2 1
x3 1 1
x4 1 1 1
x5 0 1 0 0
x6 0 0 1 0 1
x1 x2 x3 x4 x5
Draw the graph and find the maximal
compatibility blocks of the relation.

13 (a) If G,* and H,  are groups and :G H g 
is a homomorphism, prove that the kernel of
g is a normal subgroup.
(Or)
(b) Show that the set of all elements a of a group
of G,* such that a * x = x * a for every
G x  is a subgroup of G.
14 (a) Prove that in a simple digraph, G = (V, E),
every node of the digraph lies in exactly one
strong component.
(Or)
6 RW-6177
(b) Define Binary tree. Obtain the binary tree
corresponding to the tree
15 (a) An event A is known to be independent of the
events B, B  C and B  C. Show that it is
also independent of C.
(Or)
(b) Let X be a random variable with the following
probability distribution.
2 1 0 1 2 3
P(X ) 0.1 k 0.2 2k 0.3 3k
x
x
 

Find the value of k, P (X < 2), P (X  2) and
P (–2 < X < 2).

Part - C (3 × 10 = 30)
Answer any three questions.
16. (a) Show the following using indirect method.
S Q,S R, R, R Q P    
(b) Show that the fol lowing premises are
inconsistent
P Q, P R, Q R, P   
17. (a) Show that A – (A  B) = A – B.
(b) If f : X  Y and g : Y  Z are functions such
that both f and g are one-to-one and onto,
show that g o f is also one-to-one and onto.

18. Prove that every finite group of order n is
isomorphic to a permutation group of degree n.
19. Let A be the adjacency matrix of the graph G.
Show that the (i, j)th element of An is equal to the
number of paths of length n from the ith node to
the jth node.
20. State and prove Baye’s theorem.
***
To get the paper download this attachment:

Contact:
Algappa University
Alagappa Puram
Karaikudi, Tamil Nadu 630003

Map:
[MAP]Algappa University[/MAP]