AMU MCA Computer Previous Year Questions (PYQs) – Page 11 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
The first operating system of Micro-processor is …………
1
2
3
4
Solution
The first widely used OS for microprocessors was CP/M (Control Program for Microcomputers).
The time interval from the time of submission of a process to the time of completion is:
1
2
3
4
Solution
Turnaround time = Completion time − Arrival time.
What are two types of semaphores?
1
2
3
4
Solution
Semaphores are classified into Counting and Binary semaphores.
What is the meaning of ‘Underflow’ in the context of data structure?
1
2
3
4
Solution
Underflow occurs when deletion is attempted on an empty data structure.
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
Solution
Process 0 is created at boot, not by fork, becomes swapper, and is special.
Init is process 1, not process 0.
A phone number in a database is an example of:
1
2
3
4
Solution
A phone number is a single attribute, hence it is a field.
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
(C) Processor utilization by a user as group of process (priority calculated in fair scheduler)
1
2
3
4
Solution
All listed factors are considered in fair scheduling.
In tuple relational calculus, $P_1 \rightarrow P_2$ is equivalent to:
1
2
3
4
Solution
$P_1 \rightarrow P_2 \equiv \neg P_1 \vee P_2$.
A front-end processor is usually used in
1
2
3
4
Solution
Front-end processors are mainly used for I/O handling in time-sharing systems.
The average time complexity of quick sort algorithm is:
1
2
3
4
Solution
In average case, quick sort divides the array efficiently, giving $O(n \log n)$ time.
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.
