The process of reclaiming the memory not used by any programming object is called:
Previous 10 Questions — AMU MCA 2025
Nearest first
1
2
3
4
5
6
7
8
9
10
Every process consists of two steps CPU and I/O bursts. An I/O bound program will lead to:
Topic: AMU MCA 2025
Sparse matrices have:
Topic: AMU MCA 2025
The Default and Maximum Size of Text Field in MS-Access is:
Topic: AMU MCA 2025
Adjacency Matrix is used for:
Topic: AMU MCA 2025
Suppose that in a C program snippet, following statements are used:i) sizeof(int)ii) sizeof(int*)iii) sizeof(int**)Assu…
Topic: AMU MCA 2025
Depth First Search is a technique for:
Topic: AMU MCA 2025
What is a critical section?
Topic: AMU MCA 2025
Which one of the following statements is not true regarding Doubly Linked List?
Topic: AMU MCA 2025
Which one of the following statements is true regarding Compiler and Interpreter?
Topic: AMU MCA 2025
The number X is given in IEEE 32-bit floating point format. What is the equivalent decimal value?
$X = 1\ 10000011\ 11…
Topic: AMU MCA 2025
Next 10 Questions — AMU MCA 2025
Ascending by ID
1
2
3
4
5
6
7
8
9
10
What hardware architectures are not supported by Red Hat?
Topic: AMU MCA 2025
Initial value of the semaphore is to allow only one of the many processes to enter their critical section is:
Topic: AMU MCA 2025
The maximum number of leaves in a binary tree of height $n$ are:
Topic: AMU MCA 2025
What is the value of the postfix expression
$6\ 9\ 3\ 2\ +\ -\ *\ ?$
Topic: AMU MCA 2025
Which of the following sorting method is stable?
Topic: AMU MCA 2025
The time complexity of binary search algorithm is:
Topic: AMU MCA 2025
In a Dequeue:
Topic: AMU MCA 2025
What is the value of $K$ in the following equation?
$(100000101100)_2 + (3654)8 = (K){16}$
Topic: AMU MCA 2025
A digital computer is based on the principle of:
Topic: AMU MCA 2025
The relational model uses some unfamiliar terminology. A tuple is equivalent to a:
Topic: AMU MCA 2025
