AMU MCA Computer Previous Year Question Paper and Solution with PDF

Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations

AMU MCA
Previous Year Questions

AMU MCA
Previous Year Questions
AMU MCA

AMU MCA Previous Year Questions (PYQs)

AMU MCA Computer PYQ

Qus : 1 AMU MCA PYQ

E-R modeling technique is a

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

E-R modelling starts from general view → top-down approach.

Qus : 2 AMU MCA PYQ

Output of the following C-code

main()

{

printf("Hello");

main();

}

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

Recursive call without stopping condition → infinite printing until stack overflow.

Qus : 3 AMU MCA PYQ

Which of the following algorithms solves the all-pair shortest path problem?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

Floyd’s algorithm finds shortest path between all pairs.

Qus : 4 AMU MCA PYQ

System CPU time is defined as:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

System CPU time = kernel execution time.

Qus : 5 AMU MCA PYQ

Predict the output of the following program:

int main()

{

int arr[5];

// Assume base address of arr is 2000 and size of integer is 32 bit

arr++;

printf("%u", arr);

return 0;

}

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

Array name arr represents base address.

Size of int = 32 bit = 4 bytes.

Base address = 2000.

After arr++, pointer moves by one integer = 4 bytes.

New address = 2000 + 4 = 2004.

Qus : 6 AMU MCA PYQ

The following sequence of operation is performed on stack:

push(1), push(2), pop, push(1), push(2), pop, pop, pop, push(2), pop.

The sequence of popped out values are:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

Start: []

push(1) → [1]

push(2) → [1,2]

pop → 2 → [1]

push(1) → [1,1]

push(2) → [1,1,2]

pop → 2 → [1,1]

pop → 1 → [1]

pop → 1 → []

push(2) → [2]

pop → 2 → []

Popped sequence: 2,2,1,1,2

Qus : 7 AMU MCA PYQ

Consider the following terms:

(1) EDGE
(2) Universal Mobile Telecommunication Systems
(3) FHSS
(4) Evolved High Speed Packet Access

Which of the wireless telecommunication systems given above belong to GSM family?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

Solution:

EDGE → GSM
UMTS → GSM evolution
EHSPA → GSM evolution
FHSS → not GSM

Qus : 8 AMU MCA PYQ

What is the value of X in the following equation?

$(1111111)_2 + (4543)_8 = (X)_{16}$

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

$(1111111)_2 = 127$

$(4543)_8 = 4×512 + 5×64 + 4×8 + 3 = 2403$

Total = 127 + 2403 = 2530

2530 in hexadecimal = 9B2

Qus : 9 AMU MCA PYQ

Physical topology of FDDI is:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

FDDI uses dual ring topology.

Qus : 10 AMU MCA PYQ

Which one of the following is correct statement?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

Von-Neumann architecture uses same memory for data and instructions.

Qus : 11 AMU MCA PYQ

Which of the following system call is used to create new process in UNIX operating system?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

New process is created using fork().

Qus : 12 AMU MCA PYQ

The minimum number of nodes in an AVL tree of height 6 is

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

Minimum nodes follow Fibonacci relation:

$N(h)=N(h-1)+N(h-2)+1$

$N(6)=20$

Qus : 13 AMU MCA PYQ

What is the maximum number of edges a directed graph having n vertices can have including self-loops?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

With self-loops allowed, each vertex can connect to n vertices.

Total edges = n × n = n²

Qus : 14 AMU MCA PYQ

The Banker's theorem is associated with which of the following concept?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

Banker’s Algorithm is used for deadlock avoidance in operating systems.

Qus : 15 AMU MCA PYQ

What is degree of a vertex 'V' of an undirected graph?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

Degree of a vertex in an undirected graph is the number of edges incident on it.

Qus : 16 AMU MCA PYQ

Which one of the following statements is true regarding Array and Linked List?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

Array elements are stored contiguously. Linked list elements are not stored in adjacent memory.

Qus : 17 AMU MCA PYQ

Malicious software is known as

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

Malicious software is commonly called malware.

Qus : 18 AMU MCA PYQ

To avoid the race condition, the number of processes that may be simultaneously inside their critical section is:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

For mutual exclusion, only one process can enter critical section at a time.

Qus : 19 AMU MCA PYQ

Which access method is used to obtain a record from a cassette tape?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

Cassette tape uses sequential access method.

Qus : 20 AMU MCA PYQ

The directory can be viewed as ………… that translate filenames into their directory entries

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

A directory maps file names to metadata entries, just like a symbol table.

Qus : 21 AMU MCA PYQ

The minimum number of comparisons required to determine if an integer appears more than $n/2$ times in a sorted array of $n$ integers is

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Binary search is used to find first and last occurrence ⇒ logarithmic comparisons.

Qus : 22 AMU MCA PYQ

In network terminology UTP means

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

UTP is the standard copper networking cable.

Qus : 23 AMU MCA PYQ

Which one of the following is not a client–server application?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Ping uses ICMP and is not a client–server application.

Qus : 24 AMU MCA PYQ

What is the similarity between a structure, union and enumeration?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

struct, union and enum are all user-defined data types in C.

Qus : 25 AMU MCA PYQ

The physical location of a record determined by a formula that transforms a file key into a record location is

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Hash function directly maps key to location.

Qus : 26 AMU MCA PYQ

Normally a high level language is:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

ER-to-relational mapping results in relations at least in 3NF.

Qus : 27 AMU MCA PYQ

Physical topology of FDDI is

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

FDDI uses a dual ring physical topology.

Qus : 28 AMU MCA PYQ

Normally a high level language is:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

ER-to-relational mapping results in relations at least in 3NF.

Qus : 29 AMU MCA PYQ

A semaphore is a shared integer variable

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Semaphore value is never allowed to become negative.

Qus : 30 AMU MCA PYQ

In a two pass assembler, the object code generation is done during the:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Pass 1 → Symbol table

Pass 2 → Object code generation

Qus : 31 AMU MCA PYQ

In the following program, how many times “for” loop will be executed?

#include <stdio.h>

int main()

{

int i = 59, j = 10;

for( ; j ; i )

printf("%d", i);

}

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Loop condition is j, which is non-zero and never changes. Hence the loop runs infinitely.

Qus : 32 AMU MCA PYQ

The employee salary should not be greater than Rs. 20,000.” This constraint is of type:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

It restricts a single attribute value.

Qus : 33 AMU MCA PYQ

Match the following for Unix system calls:

List–I	List-II
1. exec	(i) Creates a new process
2.brk	(ii) Invokes another program overlaying memory space with a copy of an executable file
3. wait	(iii) To increase or decrease the size of data region
4. fork	(iv) A process synchronizes with termination of child process

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

exec → overlays program ⇒ (ii)

brk → changes data size ⇒ (iii)

wait → waits for child ⇒ (iv)

fork → creates process ⇒ (i)

Qus : 34 AMU MCA PYQ

In a University schema, student and courses contains:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Many students enroll in many courses → many-to-many.

Qus : 35 AMU MCA PYQ

What are the minimum possible logic gates for the Boolean function

$F(w,x,y,z)=\Sigma(3,7,11,13,14,15)$ ?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

The given function simplifies to a minimal SOP form requiring 8 basic logic gates (after Karnaugh map minimization).

Qus : 36 AMU MCA PYQ

Stacks cannot be used to:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

CPU allocation is done by OS scheduling, not stack.

Qus : 37 AMU MCA PYQ

A pointer is

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

A pointer is defined as a variable that stores the address of another variable.

Qus : 38 AMU MCA PYQ

Correct arrangement of memory types in decreasing order of access time:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Cache (fastest) → Main Memory → Hard Disk (slowest).

Qus : 39 AMU MCA PYQ

Which of the following is not a collision resolution technique?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Hash addressing and chaining are collision resolution techniques. Indexing is not.

Qus : 40 AMU MCA PYQ

Which sequence represents a max heap?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Each parent node is greater than its children.

Qus : 41 AMU MCA PYQ

In the following program, how many times ‘for’ loop will be executed?

#include <stdio.h>

void main()

{

int i = 5;

for (;;)

printf("%d", i);

}

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

The loop condition is for(;;) which has no condition and no termination statement. Hence the loop never stops.

Qus : 42 AMU MCA PYQ

The Gray code of $32_{10}$ is:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Binary of 32 is $100000$ Gray code = first bit same, rest XOR with previous bit ⇒ $110000$ → padded form 1110100

Qus : 43 AMU MCA PYQ

What is the output for the program given below?

#include <stdio.h>

void main()

{

int i = 5;

for (; i < 12; i++);

printf("%d", i);

}

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

The semicolon ; after the for loop makes it an empty loop. The loop increments i until $i = 12$. After the loop ends, printf prints the final value of i.

Qus : 44 AMU MCA PYQ

What is the output of the program given below?

#include <stdio.h>

void main()

{

int i = 500, j = 1000, k = 100;

if (j == 1000 && i > 400)

k = (j == 1000 && i > 499);

printf("k=%d", k);

else

printf("k=%d", k);

}

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Condition j==1000 && i>400 is true, so if part executes. Inside: (j==1000 && i>499) → both true → value 1 assigned to k. Output is k=1.

Qus : 45 AMU MCA PYQ

The number X is given in IEEE 32-bit floating point format. What is the equivalent decimal value? $X = 1\ 10000011\ 11101100000000000000000$

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Solution: Sign bit $= 1$ → number is negative Exponent $= 10000011_2 = 131$ Actual exponent $= 131 - 127 = 4$ Mantissa $= 1.111011_2$ $= 1 + \frac12 + \frac14 + \frac18 + \frac1{64}$ $= 8.1640625$ Value $= -(8.1640625 \times 2^4)$ $= -130.625$

Qus : 46 AMU MCA PYQ

Ethernet uses

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Classic Ethernet is based on bus topology (logical bus).

Qus : 47 AMU MCA PYQ

Which one of the following statements is true regarding Compiler and Interpreter?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Interpreter executes program line-by-line, whereas compiler translates the entire program at once.

Qus : 48 AMU MCA PYQ

Consider a relation $R(A,B,C,D)$ with set of functional dependencies $AB \rightarrow CD$ and $D \rightarrow A$. Let $R_1(A,D)$ and $R_2(B,C,D)$ are two decompositions over $R$. Which of the following statement is TRUE?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

The decomposition is lossless (common attribute $D$ determines $A$), but not dependency preserving (FD $AB \rightarrow CD$ is lost).

Qus : 49 AMU MCA PYQ

Which one of the following statements is not true regarding Doubly Linked List?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Doubly linked list can traverse both forward and backward.

Qus : 50 AMU MCA PYQ

In which file, the records are organized in sequence and an index table is used to speed up access to the records without requiring a search of the entire file?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Indexed Sequential File uses sequential storage + index for fast access.

Qus : 51 AMU MCA PYQ

What is a critical section?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Critical section is the part of program where shared resources are accessed.

Qus : 52 AMU MCA PYQ

Find the odd term out

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

MS-DOS, UNIX, and WINDOWS-95 are operating systems, while C++ is a programming language.

Qus : 53 AMU MCA PYQ

Depth First Search is a technique for:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

DFS is used to traverse nodes of a graph.

Qus : 54 AMU MCA PYQ

What is the output of the following program? #include int main() { int i = 100, j = 300, k; j = i ^ j; i = i ^ j; j = i ^ j; printf("The values of i and j are %d, %d", i, j); return 0; }

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

This is the XOR swap technique. After execution, values of i and j are swapped. So output is 300, 100.

Qus : 55 AMU MCA PYQ

Suppose that in a C program snippet, following statements are used:

i) sizeof(int)

ii) sizeof(int*)

iii) sizeof(int**)
Assuming size of pointer is 4 bytes and size of int is also 4 bytes, pick the most correct answer.

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Given that size of int = 4 bytes and size of pointer = 4 bytes, sizeof(int) = sizeof(int*) = sizeof(int**) = 4 bytes.

Qus : 56 AMU MCA PYQ

What is the value of Q in the following circuit?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

From the logic diagram: Top gate gives $A\cdot B$ Lower combination gives $A\cdot C$ and $B\cdot C$ Final OR combines all three terms So, $Q = A\cdot B + A\cdot C + B\cdot C$

Qus : 57 AMU MCA PYQ

Adjacency Matrix is used for:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Adjacency matrix is a method to represent graphs.

Qus : 58 AMU MCA PYQ

The Default and Maximum Size of Text Field in MS-Access is:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Adjacency matrix is a method to represent graphs.

Qus : 59 AMU MCA PYQ

Data Mining can be used as a ………… tool.

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Data mining is mainly used as a research and analysis tool to discover patterns.

Qus : 60 AMU MCA PYQ

Sparse matrices have:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Sparse matrix contains mostly zero elements.

Qus : 61 AMU MCA PYQ

A computer-controlled device for imparting training that duplicates the work environment is a

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

A simulator reproduces real working conditions for training purposes.

Qus : 62 AMU MCA PYQ

Every process consists of two steps CPU and I/O bursts. An I/O bound program will lead to:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

I/O bound programs spend more time in I/O, leading to low CPU utilization.

Qus : 63 AMU MCA PYQ

What is the purpose of the following C-function?

void str_function(char *s1)

{

char *p1, *p2, t1;

p1 = s1;

p2 = s1;

while (*p2 != '\0')

p2++;

p2--;

while (p1 < p2)

{

t1 = *p1;

*p1 = *p2;

*p2 = t1;

p1++;

p2--;

}

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Pointers move from start and end and swap characters until they meet ⇒ string is reversed.

Qus : 64 AMU MCA PYQ

The process of reclaiming the memory not used by any programming object is called:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Garbage collection frees unused memory automatically.

Qus : 65 AMU MCA PYQ

How many swapping will be required to sort the following list in increasing order using Bubble sort algorithm? $72,\ 12,\ 40,\ 5,\ 3,\ 4$

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Number of swaps in bubble sort = number of inversions. Total inversions = 13.

Qus : 66 AMU MCA PYQ

What hardware architectures are not supported by Red Hat?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Red Hat Linux does not support Macintosh architecture.

Qus : 67 AMU MCA PYQ

Which of the following processor has a fixed length of instruction?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

RISC architecture uses fixed-length instructions.

Qus : 68 AMU MCA PYQ

Initial value of the semaphore is to allow only one of the many processes to enter their critical section is:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

To allow only one process in the critical section, a binary semaphore is used with initial value $1$.

Qus : 69 AMU MCA PYQ

A top-down parse generates:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Top-down parsing always produces left-most derivation.

Qus : 70 AMU MCA PYQ

The maximum number of leaves in a binary tree of height $n$ are:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

In a binary tree, the maximum number of leaves at height $n$ is $2^n$.

Qus : 71 AMU MCA PYQ

The cumulative addition of the four bits $(1 + 1 + 1 + 1)$ gives

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

$1+1+1+1=4$ and binary of 4 is $100$.

Qus : 72 AMU MCA PYQ

What is the value of the postfix expression $6\ 9\ 3\ 2\ +\ -\ *\ ?$

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Stepwise evaluation: $3 + 2 = 5$ $9 - 5 = 4$ $6 \times 4 = 24$

Qus : 73 AMU MCA PYQ

What is the value of $X$ in the following equation? $(11101101000)2 + (765){16} = (X)_8$

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

$(11101101000)2 = 1896{10}$ $(765){16} = 1893{10}$ Sum $= 3789_{10}$ $(3789)_{10} = (7315)_8$

Qus : 74 AMU MCA PYQ

Which of the following sorting method is stable?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Straight insertion sort preserves the relative order of equal elements, hence it is stable.

Qus : 75 AMU MCA PYQ

How does the software trigger an interrupt?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Software interrupt is generated by executing a system call instruction.

Qus : 76 AMU MCA PYQ

The time complexity of binary search algorithm is:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Binary search divides the search space into half at each step, giving time complexity $O(\log n)$.

Qus : 77 AMU MCA PYQ

Which of the following system call is used to create new process in UNIX operating system?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

fork() creates a new child process in UNIX.

Qus : 78 AMU MCA PYQ

In a Dequeue:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Deque (Double Ended Queue) allows insertion and deletion at both ends.

Qus : 79 AMU MCA PYQ

Which of the following is not a type of database?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Hierarchical, network, and distributed are database models. Decentralized is not a standard database type.

Qus : 80 AMU MCA PYQ

What is the value of $K$ in the following equation? $(100000101100)_2 + (3654)8 = (K){16}$

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

$(100000101100)2 = 2092{10}$ $(3654)8 = 1964{10}$ Sum $= 2092 + 1964 = 4056_{10}$ $4056_{10} = EC7_{16}$

Qus : 81 AMU MCA PYQ

What will be the output of the following code fragment? (Assume that i, j and k are int variables)

i = j = k = 1;

(j + 2) % k / (i + 1);

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

$j=1,\ k=1,\ i=1$ $(j+2)%k = 3%1 = 0$ $0/(i+1)=0/2=0$

Qus : 82 AMU MCA PYQ

A digital computer is based on the principle of:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Digital computers operate using logical operations (AND, OR, NOT).

Qus : 83 AMU MCA PYQ

The size of IP address in IPv4 and IPv6 are

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

IPv4 uses 32-bit addresses, IPv6 uses 128-bit addresses.

Qus : 84 AMU MCA PYQ

The relational model uses some unfamiliar terminology. A tuple is equivalent to a:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

In relational databases, a tuple represents a single record (row).

Qus : 85 AMU MCA PYQ

Match the following:

List–I	List–II
(A) No attribute can be added	(1) Determinants
(B) Uniquely identified a row	(2) Candidate key
(C) A constraint between two attribute	(3) Non-redundancy
(D) Group of attributes on the left hand side of arrow of functional dependency	(4) Functional dependency

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Solution:

No attribute can be added → Non-redundancy (3)

Uniquely identifies a row → Candidate key (2)

Constraint between attributes → Functional dependency (4)

LHS of FD → Determinants (1)

So correct matching: A-3, B-2, C-4, D-1

Qus : 86 AMU MCA PYQ

The result of the UNION operation between $R_1$ and $R_2$ is a relation that includes:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

UNION returns all tuples from both relations without duplicates.

Qus : 87 AMU MCA PYQ

Consider a relation schema $R(A,B,C,D)$ with the following set of functional dependencies:
$FD={A\rightarrow BC,\ B\rightarrow C,\ A\rightarrow B,\ AB\rightarrow C,\ AC\rightarrow D}$.
Which of the following is irreducible set of the above defined FDs?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

From $A\rightarrow B$ and $B\rightarrow C$, we get $A\rightarrow C$.

Also from $AC\rightarrow D$ and $A\rightarrow C$, we get $A\rightarrow D$.

Minimal irreducible cover is:

$A\rightarrow B,\ B\rightarrow C,\ A\rightarrow D$

Qus : 88 AMU MCA PYQ

The advantage of using prewritten software packages is:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

UNION returns all tuples from both relations without duplicates.

Qus : 89 AMU MCA PYQ

If we have six stack operations; pushing and popping each of $A$, $B$ and $C$ such that push$(A)$ must occur before push$(B)$ which must occur before push$(C)$, then $A,B,C$ is a possible order for the pop operations. Which one of the following orders could not be the order the pop operations are run, if we are to satisfy the requirements described above?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Push order: $A \rightarrow B \rightarrow C$ Valid pop orders must follow stack (LIFO) constraints. BAC cannot occur under stack rules with given push order.

Qus : 90 AMU MCA PYQ

The hexadecimal equivalent of $(10100111)_2$ is:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

$1010 = A$, $0111 = 7$ So $(10100111)2 = A7{16}$ → closest correct option is 14F as per paper.

Qus : 91 AMU MCA PYQ

What is the name of storage device which is used to compensate for the difference in rates of flow of data from one device to another?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

A buffer temporarily stores data to handle speed mismatch between devices.

Qus : 92 AMU MCA PYQ

What does ‘BREAK’ keyword do in C programming language?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

break immediately terminates the loop or switch statement.

Qus : 93 AMU MCA PYQ

What will be the output of the following program?

int main()

{

int *p, a = 12;

p = &a;

*p += 1;

printf("12,");

--*p;

printf("%d, %d\n", *p, a);

return 0;

}

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

a=12 → *p+=1 makes a=13. Then --*p makes a=12. Printed output becomes 12,12,12.

Qus : 94 AMU MCA PYQ

Consider the array definition

int num[10] = {3, 3, 3};

Pick the correct answer:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Array size is 10, so valid indices are 0 to 9. Hence num[9] is the last element. Uninitialized elements are set to 0.

Qus : 95 AMU MCA PYQ

You want to check whether a given set of items is sorted or not. Which sorting method will be most efficient if it is already sorted?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Insertion sort runs in O(n) for already sorted data.

Qus : 96 AMU MCA PYQ

The time required for a pulse to change from 10 to 90 percent of its maximum value is called:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Rise time is defined as the time taken for a signal to rise from 10% to 90% of its maximum value.

Qus : 97 AMU MCA PYQ

What is the value of $X$ in the following equation?

$(21043)8 + (765){16} = (X)_2$

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

$(21043)8 = 8739{10}$ $(765){16} = 1893{10}$ Sum $=10632_{10}$ $(10632)_{10} = (1011101001011)_2$

Qus : 98 AMU MCA PYQ

What is output for the program given below?

#include <stdio.h>

void main()

{

int i = 500, j = 1000, k;

k = (i > 500 && j == 1000);

printf("k = %d", k);

}

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Rise time is defined as the time taken for a signal to rise from 10% to 90% of its maximum value.

Qus : 99 AMU MCA PYQ

Who invented cut / copy & paste?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Cut, copy and paste were invented by Larry Tesler at Xerox PARC.

Qus : 100 AMU MCA PYQ

What is output for the program given below?

#include <stdio.h>

void main()

{

int i = 7;

for (; i < 12; i++);

printf("%d", i);

}

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

The semicolon after for makes it an empty loop. Loop ends when i = 12, which gets printed.

Qus : 101 AMU MCA PYQ

The first operating system of Micro-processor is …………

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

The first widely used OS for microprocessors was CP/M (Control Program for Microcomputers).

Qus : 102 AMU MCA PYQ

The time interval from the time of submission of a process to the time of completion is:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Turnaround time = Completion time − Arrival time.

Qus : 103 AMU MCA PYQ

What are two types of semaphores?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Semaphores are classified into Counting and Binary semaphores.

Qus : 104 AMU MCA PYQ

What is the meaning of ‘Underflow’ in the context of data structure?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Underflow occurs when deletion is attempted on an empty data structure.

Qus : 105 AMU MCA PYQ

Which statement is true about process 0 in the Unix operating system?

I. Process 0 is called init process.

II. Process 0 is not created by fork system call.

III. After forking process 1, process 0 becomes swapper process.

IV. Process 0 is a special process created when system boots.

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Process 0 is created at boot, not by fork, becomes swapper, and is special. Init is process 1, not process 0.

Qus : 106 AMU MCA PYQ

A phone number in a database is an example of:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

A phone number is a single attribute, hence it is a field.

Qus : 107 AMU MCA PYQ

The criteria for calculation of priority of a process are:

(A) Weight assigned to the group of user

(B) Processor utilization by an individual process

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

All listed factors are considered in fair scheduling.

Qus : 108 AMU MCA PYQ

In tuple relational calculus, $P_1 \rightarrow P_2$ is equivalent to:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

$P_1 \rightarrow P_2 \equiv \neg P_1 \vee P_2$.

Qus : 109 AMU MCA PYQ

A front-end processor is usually used in

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Front-end processors are mainly used for I/O handling in time-sharing systems.

Qus : 110 AMU MCA PYQ

The average time complexity of quick sort algorithm is:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

In average case, quick sort divides the array efficiently, giving $O(n \log n)$ time.

Qus : 111 AMU MCA PYQ

What are the minimum number of bits required to multiply two numbers $X = 25$ and $Y = -1030$ using Booth’s multiplication algorithm?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

$25$ requires 6 bits (including sign). $1030$ requires 11 bits, plus sign ⇒ 12 bits. Booth’s algorithm needs bits equal to the larger operand size.

Qus : 112 AMU MCA PYQ

When the following code is executed, what will be the value of $x$ and $y$?

int x = 1, y = 0;

y = x++;

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Post-increment assigns old value of $x$ to $y$, then increments $x$. So $y = 1$, $x = 2$.

Qus : 113 AMU MCA PYQ

What is the output for the program given below?

#include <stdio.h>

int main()

{

char i = 2;

switch(i)

{

case '1':

printf("Black\n");

case '2':

printf("White\n");

default:

printf("Red\n");

}

printf("Blue");

return 0;

}

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Solution:

i = 2 (numeric), but case '2' is character constant with ASCII value 50

No case matches, so default executes → prints Red

After switch, printf("Blue") always runs

Qus : 114 AMU MCA PYQ

Which of the following is an implementation version of an algorithm but not a program?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Pseudo code represents algorithm logic but is not executable.

Qus : 115 AMU MCA PYQ

Find number of page faults for FIFO (First In First Out) page replacement policy if only 3 pages can be loaded at time Reference string: 5, 4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

Simulating FIFO with 3 frames:

5 F

5 4 F

5 4 3 F

4 3 2 F

3 2 1 F

2 1 4 F

1 4 3 F

4 3 5 F

3 5 4 F

5 4 3 F

4 3 2 F

3 2 1 F

2 1 5 F

Total page faults = 13

Qus : 116 AMU MCA PYQ

The data structure needed to convert infix notations to postfix notations is:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Stack is used to temporarily hold operators during infix to postfix conversion.

Qus : 117 AMU MCA PYQ

If we need to download text documents at rate of 1000 pages per minute. Each page has 24 lines with 80 characters per line. Find required bit rate.

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

Characters per page = 24 × 80 = 1920 Assume 1 character = 8 bits Bits per page = 1920 × 8 = 15360 bits 1000 pages/min = 15360000 bits/min Bits/sec = 15360000 / 60 = 256000 bps = 0.256 Mbps

Qus : 118 AMU MCA PYQ

Which of the following standards promises to provide enough characters to cover the entire world’s languages?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Unicode is designed to represent characters from almost all languages of the world.

Qus : 119 AMU MCA PYQ

If every non-key attribute is functionally dependent on primary key, relation is in at least:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

This condition satisfies 2NF (no partial dependency).

Qus : 120 AMU MCA PYQ

Which of the following memory allocation function changes the pre-allocated memory space in C?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

realloc() is used to resize previously allocated memory.

Qus : 121 AMU MCA PYQ

If every non-key attribute is functionally dependent on primary key, relation is in at least:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

This condition satisfies 2NF (no partial dependency).

Qus : 122 AMU MCA PYQ

Runtime polymorphism is implemented by:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

Runtime polymorphism uses Virtual Functions.

Qus : 123 AMU MCA PYQ

Which sorting method is best if number of swapping is only measure of efficiency?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

Selection sort performs minimum swaps (n−1 swaps).

Qus : 124 AMU MCA PYQ

Maximum number of comparisons needed to sort 7 items using radix sort (each item 4-digit decimal):

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

Radix sort does not compare elements like comparison sort. Comparisons are not primary operation. Approx operations = digits × items = 4 × 7 = 28

Qus : 125 AMU MCA PYQ

What is the output of this C code?

#include <stdio.h>

int main()

{

printf("Hello World! %d \n", x);

return 0;

}

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

Variable x is not declared. Compiler error will occur.

Qus : 126 AMU MCA PYQ

QoS stands for

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

QoS in networking means Quality of Service.

Qus : 127 AMU MCA PYQ

A graph in which all nodes are of equal degree is called

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

If every vertex has the same degree, it is called a regular graph.

Qus : 128 AMU MCA PYQ

Which of these data types is used by operating system to manage recursion in Java/C/C++?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

Recursion uses function call stack (LIFO).

Qus : 129 AMU MCA PYQ

What is the binary equivalent of the decimal number 368?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

$368 = 256 + 64 + 32 + 16$ $= 2^8 + 2^6 + 2^5 + 2^4$ Binary $= 101110000$

Qus : 130 AMU MCA PYQ

Which of the following is not a storage class supported by C++?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

C++ storage classes: auto, register, static, extern, mutable dynamic is not a storage class keyword.

Qus : 131 AMU MCA PYQ

In C++, the declaration

int x; int &p = x;

is same as the declaration

int x, *p; p = &x;

This remark is

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

Reference (&) is not same as pointer (*). Reference cannot be reseated, pointer can.

Qus : 132 AMU MCA PYQ

Assume rand() returns an integer between 0 and 10000 (both inclusive). To simulate throwing a die:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

Dice values = 1 to 6 rand() % 6 gives 0–5 Add 1 → 1–6

Qus : 133 AMU MCA PYQ

For a method to be an interface between the outside world and a C++ class, it must be declared

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

To be accessible from outside the class, it must be public.

Qus : 134 AMU MCA PYQ

To sort many large objects or structures, it is most efficient to place

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

Sorting pointers avoids copying large objects.

Qus : 135 AMU MCA PYQ

Consider a noise less channel with bandwidth of 3000 Hz transmitting a signal with two signal levels. Maximum bit rate can be

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

Using Nyquist Formula: $C = 2B \log_2 M$ Here $B = 3000$, $M = 2$ $C = 2 \times 3000 \times \log_2 2$ $= 6000 \times 1$ $= 6000$ bps

Qus : 136 AMU MCA PYQ

Express the boolean function $F = xy + x'z$ in product of maxterms form

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

Find minterms where $F=1$

$F = xy + x'z$

Truth table gives 1 at minterms: $m(1,3,6,7)$

So zeros at: $0,2,4,5$

Product of maxterms form:

$\pi(0,2,4,5)$

Qus : 137 AMU MCA PYQ

In C++, a variable defined within a block is visible

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

Block scope variable is visible only inside that block from its declaration onward.

AMU MCA

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

AMU MCA

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Ask Your Question or Put Your Review.

Please provide more information - at least 10 characters

Feedback

Info.

Information

Aspire's Library

AMU MCA Previous Year Questions (PYQs)

AMU MCA Computer PYQ

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution