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

1

Adjacency Matrix is used for:

Topic: AMU MCA 2025

2

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

3

Depth First Search is a technique for:

Topic: AMU MCA 2025

4

What is a critical section?

Topic: AMU MCA 2025

5

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

Topic: AMU MCA 2025

6

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

Topic: AMU MCA 2025

7

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

8

What is the output for the program given below?#include <stdio.h>void main(){    int i = 5;  &nbsp…

Topic: AMU MCA 2025

9

In the following program, how many times ‘for’ loop will be executed?#include <stdio.h>void main(){    …

Topic: AMU MCA 2025

10

Which sequence represents a max heap?

Topic: AMU MCA 2025

1

Sparse matrices have:

Topic: AMU MCA 2025

2

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

Topic: AMU MCA 2025

3

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

Topic: AMU MCA 2025

4

What hardware architectures are not supported by Red Hat?

Topic: AMU MCA 2025

5

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

Topic: AMU MCA 2025

6

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

Topic: AMU MCA 2025

7

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

Topic: AMU MCA 2025

8

Which of the following sorting method is stable?

Topic: AMU MCA 2025

9

The time complexity of binary search algorithm is:

Topic: AMU MCA 2025

10

In a Dequeue:

Topic: AMU MCA 2025