Alagappa University Previous Year Questions

Can you please give here previous year question paper for MCA course examination of Alagappa University?

[Kiran Chandar]

As you want I am here providing you previous year question paper for MCA course examination of Alagappa University.

Sample paper :
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.
2 RW-6174
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.
***


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.
5 RW-6175
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.


Here is the attachment.