AMU MCA Computer Previous Year Questions (PYQs) – Page 12 of 14
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations
Study Stuff for MCA Examinations
Showing 137 questions
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
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.
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
Solution
Post-increment assigns old value of $x$ to $y$, then increments $x$.
So $y = 1$, $x = 2$.
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
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
Which of the following is an implementation version of an algorithm but not a program?
1
2
3
4
Solution
Pseudo code represents algorithm logic but is not executable.
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
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
The data structure needed to convert infix notations to postfix notations is:
1
2
3
4
Solution
Stack is used to temporarily hold operators during infix to postfix conversion.
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
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
Which of the following standards promises to provide enough characters to cover the entire world’s languages?
1
2
3
4
Solution
Unicode is designed to represent characters from almost all languages of the world.
If every non-key attribute is functionally dependent on primary key, relation is in at least:
1
2
3
4
Solution
This condition satisfies 2NF (no partial dependency).
Which of the following memory allocation function changes the pre-allocated memory space in C?
1
2
3
4
Solution
realloc() is used to resize previously allocated memory.
AMU MCA
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
AMU MCA
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
