Download DUET (Delhi University Entrance Test conducted by the NTA) 2018 DU MSc Computer Science Question Paper With Solution Key
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
24)
25)
26)
2. [Option ID = 3530]
3. [Option ID = 3529]
4. [Option ID = 3531]
Correct Answer :-
[Option ID = 3531]
[Question ID = 914]
1. [Option ID = 3656]
2. [Option ID = 3654]
3. [Option ID = 3653]
4. [Option ID = 3655]
Correct Answer :-
[Option ID = 3655]
[Question ID = 876]
1. [Option ID = 3503]
2. [Option ID = 3504]
3. [Option ID = 3502]
4. [Option ID = 3501]
Correct Answer :-
[Option ID = 3504]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
24)
25)
26)
2. [Option ID = 3530]
3. [Option ID = 3529]
4. [Option ID = 3531]
Correct Answer :-
[Option ID = 3531]
[Question ID = 914]
1. [Option ID = 3656]
2. [Option ID = 3654]
3. [Option ID = 3653]
4. [Option ID = 3655]
Correct Answer :-
[Option ID = 3655]
[Question ID = 876]
1. [Option ID = 3503]
2. [Option ID = 3504]
3. [Option ID = 3502]
4. [Option ID = 3501]
Correct Answer :-
[Option ID = 3504]
27)
28)
29)
[Question ID = 904]
1. both conjugate complex numbers. [Option ID = 3616]
2. both irrational numbers. [Option ID = 3615]
3. both rational numbers, other than integers. [Option ID = 3614]
4. integers of unlike signs [Option ID = 3613]
Correct Answer :-
both irrational numbers. [Option ID = 3615]
[Question ID = 908]
1. [Option ID = 3630]
2. [Option ID = 3632]
3. [Option ID = 3631]
4. [Option ID = 3629]
Correct Answer :-
[Question ID = 910]
1. [Option ID = 3637]
2. [Option ID = 3640]
3. [Option ID = 3638]
4. [Option ID = 3639]
Correct Answer :-
[Option ID = 3640]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
24)
25)
26)
2. [Option ID = 3530]
3. [Option ID = 3529]
4. [Option ID = 3531]
Correct Answer :-
[Option ID = 3531]
[Question ID = 914]
1. [Option ID = 3656]
2. [Option ID = 3654]
3. [Option ID = 3653]
4. [Option ID = 3655]
Correct Answer :-
[Option ID = 3655]
[Question ID = 876]
1. [Option ID = 3503]
2. [Option ID = 3504]
3. [Option ID = 3502]
4. [Option ID = 3501]
Correct Answer :-
[Option ID = 3504]
27)
28)
29)
[Question ID = 904]
1. both conjugate complex numbers. [Option ID = 3616]
2. both irrational numbers. [Option ID = 3615]
3. both rational numbers, other than integers. [Option ID = 3614]
4. integers of unlike signs [Option ID = 3613]
Correct Answer :-
both irrational numbers. [Option ID = 3615]
[Question ID = 908]
1. [Option ID = 3630]
2. [Option ID = 3632]
3. [Option ID = 3631]
4. [Option ID = 3629]
Correct Answer :-
[Question ID = 910]
1. [Option ID = 3637]
2. [Option ID = 3640]
3. [Option ID = 3638]
4. [Option ID = 3639]
Correct Answer :-
[Option ID = 3640]
30)
31)
[Question ID = 892]
1. {A, B, D} [Option ID = 3566]
2. {A} [Option ID = 3568]
3. {A, B, D, G, H} [Option ID = 3567]
4. {A, B} [Option ID = 3565]
Correct Answer :-
{A, B, D} [Option ID = 3566]
[Question ID = 891]
1. All branches that have greater assets than all branches in Patna. [Option ID = 3562]
2. The branch that has greatest asset in Patna [Option ID = 3563]
3. All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
4. Any branch that has greater assets than any branch in Patna. [Option ID = 3564]
Correct Answer :-
All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
[Question ID = 913]
1. [Option ID = 3649]
2. [Option ID = 3650]
3. [Option ID = 3651]
4. [Option ID = 3652]
Correct Answer :-
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
24)
25)
26)
2. [Option ID = 3530]
3. [Option ID = 3529]
4. [Option ID = 3531]
Correct Answer :-
[Option ID = 3531]
[Question ID = 914]
1. [Option ID = 3656]
2. [Option ID = 3654]
3. [Option ID = 3653]
4. [Option ID = 3655]
Correct Answer :-
[Option ID = 3655]
[Question ID = 876]
1. [Option ID = 3503]
2. [Option ID = 3504]
3. [Option ID = 3502]
4. [Option ID = 3501]
Correct Answer :-
[Option ID = 3504]
27)
28)
29)
[Question ID = 904]
1. both conjugate complex numbers. [Option ID = 3616]
2. both irrational numbers. [Option ID = 3615]
3. both rational numbers, other than integers. [Option ID = 3614]
4. integers of unlike signs [Option ID = 3613]
Correct Answer :-
both irrational numbers. [Option ID = 3615]
[Question ID = 908]
1. [Option ID = 3630]
2. [Option ID = 3632]
3. [Option ID = 3631]
4. [Option ID = 3629]
Correct Answer :-
[Question ID = 910]
1. [Option ID = 3637]
2. [Option ID = 3640]
3. [Option ID = 3638]
4. [Option ID = 3639]
Correct Answer :-
[Option ID = 3640]
30)
31)
[Question ID = 892]
1. {A, B, D} [Option ID = 3566]
2. {A} [Option ID = 3568]
3. {A, B, D, G, H} [Option ID = 3567]
4. {A, B} [Option ID = 3565]
Correct Answer :-
{A, B, D} [Option ID = 3566]
[Question ID = 891]
1. All branches that have greater assets than all branches in Patna. [Option ID = 3562]
2. The branch that has greatest asset in Patna [Option ID = 3563]
3. All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
4. Any branch that has greater assets than any branch in Patna. [Option ID = 3564]
Correct Answer :-
All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
[Question ID = 913]
1. [Option ID = 3649]
2. [Option ID = 3650]
3. [Option ID = 3651]
4. [Option ID = 3652]
Correct Answer :-
32)
33)
34)
[Option ID = 3651]
[Question ID = 911]
1. [Option ID = 3643]
2. [Option ID = 3644]
3. [Option ID = 3642]
4. [Option ID = 3641]
Correct Answer :-
[Option ID = 3644]
[Question ID = 902]
1. Rank of T is 3. [Option ID = 3606]
2. Rank of T is 2. [Option ID = 3605]
3. Nullity of T is 2. [Option ID = 3608]
4. Nullity of T is 3. [Option ID = 3607]
Correct Answer :-
Rank of T is 3. [Option ID = 3606]
[Question ID = 905]
1. 6 [Option ID = 3618]
2. 7 [Option ID = 3617]
3. 5 [Option ID = 3619]
4. 4 [Option ID = 3620]
Correct Answer :-
6 [Option ID = 3618]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
24)
25)
26)
2. [Option ID = 3530]
3. [Option ID = 3529]
4. [Option ID = 3531]
Correct Answer :-
[Option ID = 3531]
[Question ID = 914]
1. [Option ID = 3656]
2. [Option ID = 3654]
3. [Option ID = 3653]
4. [Option ID = 3655]
Correct Answer :-
[Option ID = 3655]
[Question ID = 876]
1. [Option ID = 3503]
2. [Option ID = 3504]
3. [Option ID = 3502]
4. [Option ID = 3501]
Correct Answer :-
[Option ID = 3504]
27)
28)
29)
[Question ID = 904]
1. both conjugate complex numbers. [Option ID = 3616]
2. both irrational numbers. [Option ID = 3615]
3. both rational numbers, other than integers. [Option ID = 3614]
4. integers of unlike signs [Option ID = 3613]
Correct Answer :-
both irrational numbers. [Option ID = 3615]
[Question ID = 908]
1. [Option ID = 3630]
2. [Option ID = 3632]
3. [Option ID = 3631]
4. [Option ID = 3629]
Correct Answer :-
[Question ID = 910]
1. [Option ID = 3637]
2. [Option ID = 3640]
3. [Option ID = 3638]
4. [Option ID = 3639]
Correct Answer :-
[Option ID = 3640]
30)
31)
[Question ID = 892]
1. {A, B, D} [Option ID = 3566]
2. {A} [Option ID = 3568]
3. {A, B, D, G, H} [Option ID = 3567]
4. {A, B} [Option ID = 3565]
Correct Answer :-
{A, B, D} [Option ID = 3566]
[Question ID = 891]
1. All branches that have greater assets than all branches in Patna. [Option ID = 3562]
2. The branch that has greatest asset in Patna [Option ID = 3563]
3. All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
4. Any branch that has greater assets than any branch in Patna. [Option ID = 3564]
Correct Answer :-
All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
[Question ID = 913]
1. [Option ID = 3649]
2. [Option ID = 3650]
3. [Option ID = 3651]
4. [Option ID = 3652]
Correct Answer :-
32)
33)
34)
[Option ID = 3651]
[Question ID = 911]
1. [Option ID = 3643]
2. [Option ID = 3644]
3. [Option ID = 3642]
4. [Option ID = 3641]
Correct Answer :-
[Option ID = 3644]
[Question ID = 902]
1. Rank of T is 3. [Option ID = 3606]
2. Rank of T is 2. [Option ID = 3605]
3. Nullity of T is 2. [Option ID = 3608]
4. Nullity of T is 3. [Option ID = 3607]
Correct Answer :-
Rank of T is 3. [Option ID = 3606]
[Question ID = 905]
1. 6 [Option ID = 3618]
2. 7 [Option ID = 3617]
3. 5 [Option ID = 3619]
4. 4 [Option ID = 3620]
Correct Answer :-
6 [Option ID = 3618]
35)
36)
37)
38)
[Question ID = 877]
1. [Option ID = 3508]
2. [Option ID = 3505]
3. [Option ID = 3507]
4. [Option ID = 3506]
Correct Answer :-
[Option ID = 3505]
[Question ID = 907]
1. 6 [Option ID = 3625]
2. 5 [Option ID = 3626]
3. 3 [Option ID = 3628]
4. 4 [Option ID = 3627]
Correct Answer :-
6 [Option ID = 3625]
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3,
9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First
In First Out (FIFO) and Least Recently Used (LRU)? [Question ID = 888]
1. FIFO incurs 2 more page faults than LRU [Option ID = 3550]
2. FIFO incurs 1 more page faults than LRU [Option ID = 3552]
3. Both incur the same number of page faults [Option ID = 3549]
4. LRU incurs 2 more page faults than FIFO [Option ID = 3551]
Correct Answer :-
Both incur the same number of page faults [Option ID = 3549]
Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by
chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum,
minimum, and average chain lengths in the hash table, respectively, are [Question ID = 879]
1. 3, 3, and 3 [Option ID = 3514]
2. 4, 0, and 1 [Option ID = 3515]
3. 3, 0, and 1 [Option ID = 3513]
4. 3, 0, and 2 [Option ID = 3516]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
24)
25)
26)
2. [Option ID = 3530]
3. [Option ID = 3529]
4. [Option ID = 3531]
Correct Answer :-
[Option ID = 3531]
[Question ID = 914]
1. [Option ID = 3656]
2. [Option ID = 3654]
3. [Option ID = 3653]
4. [Option ID = 3655]
Correct Answer :-
[Option ID = 3655]
[Question ID = 876]
1. [Option ID = 3503]
2. [Option ID = 3504]
3. [Option ID = 3502]
4. [Option ID = 3501]
Correct Answer :-
[Option ID = 3504]
27)
28)
29)
[Question ID = 904]
1. both conjugate complex numbers. [Option ID = 3616]
2. both irrational numbers. [Option ID = 3615]
3. both rational numbers, other than integers. [Option ID = 3614]
4. integers of unlike signs [Option ID = 3613]
Correct Answer :-
both irrational numbers. [Option ID = 3615]
[Question ID = 908]
1. [Option ID = 3630]
2. [Option ID = 3632]
3. [Option ID = 3631]
4. [Option ID = 3629]
Correct Answer :-
[Question ID = 910]
1. [Option ID = 3637]
2. [Option ID = 3640]
3. [Option ID = 3638]
4. [Option ID = 3639]
Correct Answer :-
[Option ID = 3640]
30)
31)
[Question ID = 892]
1. {A, B, D} [Option ID = 3566]
2. {A} [Option ID = 3568]
3. {A, B, D, G, H} [Option ID = 3567]
4. {A, B} [Option ID = 3565]
Correct Answer :-
{A, B, D} [Option ID = 3566]
[Question ID = 891]
1. All branches that have greater assets than all branches in Patna. [Option ID = 3562]
2. The branch that has greatest asset in Patna [Option ID = 3563]
3. All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
4. Any branch that has greater assets than any branch in Patna. [Option ID = 3564]
Correct Answer :-
All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
[Question ID = 913]
1. [Option ID = 3649]
2. [Option ID = 3650]
3. [Option ID = 3651]
4. [Option ID = 3652]
Correct Answer :-
32)
33)
34)
[Option ID = 3651]
[Question ID = 911]
1. [Option ID = 3643]
2. [Option ID = 3644]
3. [Option ID = 3642]
4. [Option ID = 3641]
Correct Answer :-
[Option ID = 3644]
[Question ID = 902]
1. Rank of T is 3. [Option ID = 3606]
2. Rank of T is 2. [Option ID = 3605]
3. Nullity of T is 2. [Option ID = 3608]
4. Nullity of T is 3. [Option ID = 3607]
Correct Answer :-
Rank of T is 3. [Option ID = 3606]
[Question ID = 905]
1. 6 [Option ID = 3618]
2. 7 [Option ID = 3617]
3. 5 [Option ID = 3619]
4. 4 [Option ID = 3620]
Correct Answer :-
6 [Option ID = 3618]
35)
36)
37)
38)
[Question ID = 877]
1. [Option ID = 3508]
2. [Option ID = 3505]
3. [Option ID = 3507]
4. [Option ID = 3506]
Correct Answer :-
[Option ID = 3505]
[Question ID = 907]
1. 6 [Option ID = 3625]
2. 5 [Option ID = 3626]
3. 3 [Option ID = 3628]
4. 4 [Option ID = 3627]
Correct Answer :-
6 [Option ID = 3625]
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3,
9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First
In First Out (FIFO) and Least Recently Used (LRU)? [Question ID = 888]
1. FIFO incurs 2 more page faults than LRU [Option ID = 3550]
2. FIFO incurs 1 more page faults than LRU [Option ID = 3552]
3. Both incur the same number of page faults [Option ID = 3549]
4. LRU incurs 2 more page faults than FIFO [Option ID = 3551]
Correct Answer :-
Both incur the same number of page faults [Option ID = 3549]
Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by
chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum,
minimum, and average chain lengths in the hash table, respectively, are [Question ID = 879]
1. 3, 3, and 3 [Option ID = 3514]
2. 4, 0, and 1 [Option ID = 3515]
3. 3, 0, and 1 [Option ID = 3513]
4. 3, 0, and 2 [Option ID = 3516]
39)
40)
1)
Correct Answer :-
3, 0, and 1 [Option ID = 3513]
How many 8-bit characters can be transmitted per second over a 7200 baud serial communication link
using asynchronous mode of transmission with one start bit, eight data bits, one parity bit, and two stop bits:
[Question ID = 886]
1. 800 [Option ID = 3543]
2. 600 [Option ID = 3541]
3. 900 [Option ID = 3544]
4. 700 [Option ID = 3542]
Correct Answer :-
600 [Option ID = 3541]
Let G be a graph with n vertices and m edges. What is the upper bound on the running time of depth first
search on G, when G is represented as an adjacency matrix?
[Question ID = 880]
1. ? (m) [Option ID = 3519]
2. ? (n+m) [Option ID = 3518]
3. ? (n) [Option ID = 3517]
4. ? (n
2
) [Option ID = 3520]
Correct Answer :-
? (n
2
) [Option ID = 3520]
Topic:- DU_J18_MSC_CS_Topic02
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
24)
25)
26)
2. [Option ID = 3530]
3. [Option ID = 3529]
4. [Option ID = 3531]
Correct Answer :-
[Option ID = 3531]
[Question ID = 914]
1. [Option ID = 3656]
2. [Option ID = 3654]
3. [Option ID = 3653]
4. [Option ID = 3655]
Correct Answer :-
[Option ID = 3655]
[Question ID = 876]
1. [Option ID = 3503]
2. [Option ID = 3504]
3. [Option ID = 3502]
4. [Option ID = 3501]
Correct Answer :-
[Option ID = 3504]
27)
28)
29)
[Question ID = 904]
1. both conjugate complex numbers. [Option ID = 3616]
2. both irrational numbers. [Option ID = 3615]
3. both rational numbers, other than integers. [Option ID = 3614]
4. integers of unlike signs [Option ID = 3613]
Correct Answer :-
both irrational numbers. [Option ID = 3615]
[Question ID = 908]
1. [Option ID = 3630]
2. [Option ID = 3632]
3. [Option ID = 3631]
4. [Option ID = 3629]
Correct Answer :-
[Question ID = 910]
1. [Option ID = 3637]
2. [Option ID = 3640]
3. [Option ID = 3638]
4. [Option ID = 3639]
Correct Answer :-
[Option ID = 3640]
30)
31)
[Question ID = 892]
1. {A, B, D} [Option ID = 3566]
2. {A} [Option ID = 3568]
3. {A, B, D, G, H} [Option ID = 3567]
4. {A, B} [Option ID = 3565]
Correct Answer :-
{A, B, D} [Option ID = 3566]
[Question ID = 891]
1. All branches that have greater assets than all branches in Patna. [Option ID = 3562]
2. The branch that has greatest asset in Patna [Option ID = 3563]
3. All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
4. Any branch that has greater assets than any branch in Patna. [Option ID = 3564]
Correct Answer :-
All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
[Question ID = 913]
1. [Option ID = 3649]
2. [Option ID = 3650]
3. [Option ID = 3651]
4. [Option ID = 3652]
Correct Answer :-
32)
33)
34)
[Option ID = 3651]
[Question ID = 911]
1. [Option ID = 3643]
2. [Option ID = 3644]
3. [Option ID = 3642]
4. [Option ID = 3641]
Correct Answer :-
[Option ID = 3644]
[Question ID = 902]
1. Rank of T is 3. [Option ID = 3606]
2. Rank of T is 2. [Option ID = 3605]
3. Nullity of T is 2. [Option ID = 3608]
4. Nullity of T is 3. [Option ID = 3607]
Correct Answer :-
Rank of T is 3. [Option ID = 3606]
[Question ID = 905]
1. 6 [Option ID = 3618]
2. 7 [Option ID = 3617]
3. 5 [Option ID = 3619]
4. 4 [Option ID = 3620]
Correct Answer :-
6 [Option ID = 3618]
35)
36)
37)
38)
[Question ID = 877]
1. [Option ID = 3508]
2. [Option ID = 3505]
3. [Option ID = 3507]
4. [Option ID = 3506]
Correct Answer :-
[Option ID = 3505]
[Question ID = 907]
1. 6 [Option ID = 3625]
2. 5 [Option ID = 3626]
3. 3 [Option ID = 3628]
4. 4 [Option ID = 3627]
Correct Answer :-
6 [Option ID = 3625]
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3,
9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First
In First Out (FIFO) and Least Recently Used (LRU)? [Question ID = 888]
1. FIFO incurs 2 more page faults than LRU [Option ID = 3550]
2. FIFO incurs 1 more page faults than LRU [Option ID = 3552]
3. Both incur the same number of page faults [Option ID = 3549]
4. LRU incurs 2 more page faults than FIFO [Option ID = 3551]
Correct Answer :-
Both incur the same number of page faults [Option ID = 3549]
Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by
chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum,
minimum, and average chain lengths in the hash table, respectively, are [Question ID = 879]
1. 3, 3, and 3 [Option ID = 3514]
2. 4, 0, and 1 [Option ID = 3515]
3. 3, 0, and 1 [Option ID = 3513]
4. 3, 0, and 2 [Option ID = 3516]
39)
40)
1)
Correct Answer :-
3, 0, and 1 [Option ID = 3513]
How many 8-bit characters can be transmitted per second over a 7200 baud serial communication link
using asynchronous mode of transmission with one start bit, eight data bits, one parity bit, and two stop bits:
[Question ID = 886]
1. 800 [Option ID = 3543]
2. 600 [Option ID = 3541]
3. 900 [Option ID = 3544]
4. 700 [Option ID = 3542]
Correct Answer :-
600 [Option ID = 3541]
Let G be a graph with n vertices and m edges. What is the upper bound on the running time of depth first
search on G, when G is represented as an adjacency matrix?
[Question ID = 880]
1. ? (m) [Option ID = 3519]
2. ? (n+m) [Option ID = 3518]
3. ? (n) [Option ID = 3517]
4. ? (n
2
) [Option ID = 3520]
Correct Answer :-
? (n
2
) [Option ID = 3520]
Topic:- DU_J18_MSC_CS_Topic02
2)
How does Maharashtra plan to expand the service further? [Question ID = 1024]
1. All of the these. [Option ID = 4096]
2. The state is looking to extend this service to more areas. [Option ID = 4093]
3. It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
4. It may provide this service in other states as well. [Option ID = 4095]
Correct Answer :-
It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
24)
25)
26)
2. [Option ID = 3530]
3. [Option ID = 3529]
4. [Option ID = 3531]
Correct Answer :-
[Option ID = 3531]
[Question ID = 914]
1. [Option ID = 3656]
2. [Option ID = 3654]
3. [Option ID = 3653]
4. [Option ID = 3655]
Correct Answer :-
[Option ID = 3655]
[Question ID = 876]
1. [Option ID = 3503]
2. [Option ID = 3504]
3. [Option ID = 3502]
4. [Option ID = 3501]
Correct Answer :-
[Option ID = 3504]
27)
28)
29)
[Question ID = 904]
1. both conjugate complex numbers. [Option ID = 3616]
2. both irrational numbers. [Option ID = 3615]
3. both rational numbers, other than integers. [Option ID = 3614]
4. integers of unlike signs [Option ID = 3613]
Correct Answer :-
both irrational numbers. [Option ID = 3615]
[Question ID = 908]
1. [Option ID = 3630]
2. [Option ID = 3632]
3. [Option ID = 3631]
4. [Option ID = 3629]
Correct Answer :-
[Question ID = 910]
1. [Option ID = 3637]
2. [Option ID = 3640]
3. [Option ID = 3638]
4. [Option ID = 3639]
Correct Answer :-
[Option ID = 3640]
30)
31)
[Question ID = 892]
1. {A, B, D} [Option ID = 3566]
2. {A} [Option ID = 3568]
3. {A, B, D, G, H} [Option ID = 3567]
4. {A, B} [Option ID = 3565]
Correct Answer :-
{A, B, D} [Option ID = 3566]
[Question ID = 891]
1. All branches that have greater assets than all branches in Patna. [Option ID = 3562]
2. The branch that has greatest asset in Patna [Option ID = 3563]
3. All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
4. Any branch that has greater assets than any branch in Patna. [Option ID = 3564]
Correct Answer :-
All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
[Question ID = 913]
1. [Option ID = 3649]
2. [Option ID = 3650]
3. [Option ID = 3651]
4. [Option ID = 3652]
Correct Answer :-
32)
33)
34)
[Option ID = 3651]
[Question ID = 911]
1. [Option ID = 3643]
2. [Option ID = 3644]
3. [Option ID = 3642]
4. [Option ID = 3641]
Correct Answer :-
[Option ID = 3644]
[Question ID = 902]
1. Rank of T is 3. [Option ID = 3606]
2. Rank of T is 2. [Option ID = 3605]
3. Nullity of T is 2. [Option ID = 3608]
4. Nullity of T is 3. [Option ID = 3607]
Correct Answer :-
Rank of T is 3. [Option ID = 3606]
[Question ID = 905]
1. 6 [Option ID = 3618]
2. 7 [Option ID = 3617]
3. 5 [Option ID = 3619]
4. 4 [Option ID = 3620]
Correct Answer :-
6 [Option ID = 3618]
35)
36)
37)
38)
[Question ID = 877]
1. [Option ID = 3508]
2. [Option ID = 3505]
3. [Option ID = 3507]
4. [Option ID = 3506]
Correct Answer :-
[Option ID = 3505]
[Question ID = 907]
1. 6 [Option ID = 3625]
2. 5 [Option ID = 3626]
3. 3 [Option ID = 3628]
4. 4 [Option ID = 3627]
Correct Answer :-
6 [Option ID = 3625]
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3,
9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First
In First Out (FIFO) and Least Recently Used (LRU)? [Question ID = 888]
1. FIFO incurs 2 more page faults than LRU [Option ID = 3550]
2. FIFO incurs 1 more page faults than LRU [Option ID = 3552]
3. Both incur the same number of page faults [Option ID = 3549]
4. LRU incurs 2 more page faults than FIFO [Option ID = 3551]
Correct Answer :-
Both incur the same number of page faults [Option ID = 3549]
Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by
chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum,
minimum, and average chain lengths in the hash table, respectively, are [Question ID = 879]
1. 3, 3, and 3 [Option ID = 3514]
2. 4, 0, and 1 [Option ID = 3515]
3. 3, 0, and 1 [Option ID = 3513]
4. 3, 0, and 2 [Option ID = 3516]
39)
40)
1)
Correct Answer :-
3, 0, and 1 [Option ID = 3513]
How many 8-bit characters can be transmitted per second over a 7200 baud serial communication link
using asynchronous mode of transmission with one start bit, eight data bits, one parity bit, and two stop bits:
[Question ID = 886]
1. 800 [Option ID = 3543]
2. 600 [Option ID = 3541]
3. 900 [Option ID = 3544]
4. 700 [Option ID = 3542]
Correct Answer :-
600 [Option ID = 3541]
Let G be a graph with n vertices and m edges. What is the upper bound on the running time of depth first
search on G, when G is represented as an adjacency matrix?
[Question ID = 880]
1. ? (m) [Option ID = 3519]
2. ? (n+m) [Option ID = 3518]
3. ? (n) [Option ID = 3517]
4. ? (n
2
) [Option ID = 3520]
Correct Answer :-
? (n
2
) [Option ID = 3520]
Topic:- DU_J18_MSC_CS_Topic02
2)
How does Maharashtra plan to expand the service further? [Question ID = 1024]
1. All of the these. [Option ID = 4096]
2. The state is looking to extend this service to more areas. [Option ID = 4093]
3. It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
4. It may provide this service in other states as well. [Option ID = 4095]
Correct Answer :-
It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
3)
Mark the statement that is NOT true: [Question ID = 1025]
1. Not many people know that the service is quite free. [Option ID = 4100]
2. Locating the place from where the call has come is often a challenge in Mumbai [Option ID = 4099]
3. The service is meant for and availed of by people living in slums. [Option ID = 4098]
4. The free service has still remained relatively low-key. [Option ID = 4097]
Correct Answer :-
The service is meant for and availed of by people living in slums. [Option ID = 4098]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
24)
25)
26)
2. [Option ID = 3530]
3. [Option ID = 3529]
4. [Option ID = 3531]
Correct Answer :-
[Option ID = 3531]
[Question ID = 914]
1. [Option ID = 3656]
2. [Option ID = 3654]
3. [Option ID = 3653]
4. [Option ID = 3655]
Correct Answer :-
[Option ID = 3655]
[Question ID = 876]
1. [Option ID = 3503]
2. [Option ID = 3504]
3. [Option ID = 3502]
4. [Option ID = 3501]
Correct Answer :-
[Option ID = 3504]
27)
28)
29)
[Question ID = 904]
1. both conjugate complex numbers. [Option ID = 3616]
2. both irrational numbers. [Option ID = 3615]
3. both rational numbers, other than integers. [Option ID = 3614]
4. integers of unlike signs [Option ID = 3613]
Correct Answer :-
both irrational numbers. [Option ID = 3615]
[Question ID = 908]
1. [Option ID = 3630]
2. [Option ID = 3632]
3. [Option ID = 3631]
4. [Option ID = 3629]
Correct Answer :-
[Question ID = 910]
1. [Option ID = 3637]
2. [Option ID = 3640]
3. [Option ID = 3638]
4. [Option ID = 3639]
Correct Answer :-
[Option ID = 3640]
30)
31)
[Question ID = 892]
1. {A, B, D} [Option ID = 3566]
2. {A} [Option ID = 3568]
3. {A, B, D, G, H} [Option ID = 3567]
4. {A, B} [Option ID = 3565]
Correct Answer :-
{A, B, D} [Option ID = 3566]
[Question ID = 891]
1. All branches that have greater assets than all branches in Patna. [Option ID = 3562]
2. The branch that has greatest asset in Patna [Option ID = 3563]
3. All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
4. Any branch that has greater assets than any branch in Patna. [Option ID = 3564]
Correct Answer :-
All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
[Question ID = 913]
1. [Option ID = 3649]
2. [Option ID = 3650]
3. [Option ID = 3651]
4. [Option ID = 3652]
Correct Answer :-
32)
33)
34)
[Option ID = 3651]
[Question ID = 911]
1. [Option ID = 3643]
2. [Option ID = 3644]
3. [Option ID = 3642]
4. [Option ID = 3641]
Correct Answer :-
[Option ID = 3644]
[Question ID = 902]
1. Rank of T is 3. [Option ID = 3606]
2. Rank of T is 2. [Option ID = 3605]
3. Nullity of T is 2. [Option ID = 3608]
4. Nullity of T is 3. [Option ID = 3607]
Correct Answer :-
Rank of T is 3. [Option ID = 3606]
[Question ID = 905]
1. 6 [Option ID = 3618]
2. 7 [Option ID = 3617]
3. 5 [Option ID = 3619]
4. 4 [Option ID = 3620]
Correct Answer :-
6 [Option ID = 3618]
35)
36)
37)
38)
[Question ID = 877]
1. [Option ID = 3508]
2. [Option ID = 3505]
3. [Option ID = 3507]
4. [Option ID = 3506]
Correct Answer :-
[Option ID = 3505]
[Question ID = 907]
1. 6 [Option ID = 3625]
2. 5 [Option ID = 3626]
3. 3 [Option ID = 3628]
4. 4 [Option ID = 3627]
Correct Answer :-
6 [Option ID = 3625]
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3,
9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First
In First Out (FIFO) and Least Recently Used (LRU)? [Question ID = 888]
1. FIFO incurs 2 more page faults than LRU [Option ID = 3550]
2. FIFO incurs 1 more page faults than LRU [Option ID = 3552]
3. Both incur the same number of page faults [Option ID = 3549]
4. LRU incurs 2 more page faults than FIFO [Option ID = 3551]
Correct Answer :-
Both incur the same number of page faults [Option ID = 3549]
Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by
chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum,
minimum, and average chain lengths in the hash table, respectively, are [Question ID = 879]
1. 3, 3, and 3 [Option ID = 3514]
2. 4, 0, and 1 [Option ID = 3515]
3. 3, 0, and 1 [Option ID = 3513]
4. 3, 0, and 2 [Option ID = 3516]
39)
40)
1)
Correct Answer :-
3, 0, and 1 [Option ID = 3513]
How many 8-bit characters can be transmitted per second over a 7200 baud serial communication link
using asynchronous mode of transmission with one start bit, eight data bits, one parity bit, and two stop bits:
[Question ID = 886]
1. 800 [Option ID = 3543]
2. 600 [Option ID = 3541]
3. 900 [Option ID = 3544]
4. 700 [Option ID = 3542]
Correct Answer :-
600 [Option ID = 3541]
Let G be a graph with n vertices and m edges. What is the upper bound on the running time of depth first
search on G, when G is represented as an adjacency matrix?
[Question ID = 880]
1. ? (m) [Option ID = 3519]
2. ? (n+m) [Option ID = 3518]
3. ? (n) [Option ID = 3517]
4. ? (n
2
) [Option ID = 3520]
Correct Answer :-
? (n
2
) [Option ID = 3520]
Topic:- DU_J18_MSC_CS_Topic02
2)
How does Maharashtra plan to expand the service further? [Question ID = 1024]
1. All of the these. [Option ID = 4096]
2. The state is looking to extend this service to more areas. [Option ID = 4093]
3. It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
4. It may provide this service in other states as well. [Option ID = 4095]
Correct Answer :-
It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
3)
Mark the statement that is NOT true: [Question ID = 1025]
1. Not many people know that the service is quite free. [Option ID = 4100]
2. Locating the place from where the call has come is often a challenge in Mumbai [Option ID = 4099]
3. The service is meant for and availed of by people living in slums. [Option ID = 4098]
4. The free service has still remained relatively low-key. [Option ID = 4097]
Correct Answer :-
The service is meant for and availed of by people living in slums. [Option ID = 4098]
4)
What advantage does Ambulance 108 enjoy over regular ambulance?
[Question ID = 53418]
1. It is far more user-friendly. [Option ID = 93658]
2. It provides medical aid that regular ambulance cannot. [Option ID = 93657]
3. It consists of dedicated medical practitioners. [Option ID = 93660]
4. It can reach the patient in need of ambulance earlier. [Option ID = 93659]
Correct Answer :-
It can reach the patient in need of ambulance earlier. [Option ID = 93659]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
24)
25)
26)
2. [Option ID = 3530]
3. [Option ID = 3529]
4. [Option ID = 3531]
Correct Answer :-
[Option ID = 3531]
[Question ID = 914]
1. [Option ID = 3656]
2. [Option ID = 3654]
3. [Option ID = 3653]
4. [Option ID = 3655]
Correct Answer :-
[Option ID = 3655]
[Question ID = 876]
1. [Option ID = 3503]
2. [Option ID = 3504]
3. [Option ID = 3502]
4. [Option ID = 3501]
Correct Answer :-
[Option ID = 3504]
27)
28)
29)
[Question ID = 904]
1. both conjugate complex numbers. [Option ID = 3616]
2. both irrational numbers. [Option ID = 3615]
3. both rational numbers, other than integers. [Option ID = 3614]
4. integers of unlike signs [Option ID = 3613]
Correct Answer :-
both irrational numbers. [Option ID = 3615]
[Question ID = 908]
1. [Option ID = 3630]
2. [Option ID = 3632]
3. [Option ID = 3631]
4. [Option ID = 3629]
Correct Answer :-
[Question ID = 910]
1. [Option ID = 3637]
2. [Option ID = 3640]
3. [Option ID = 3638]
4. [Option ID = 3639]
Correct Answer :-
[Option ID = 3640]
30)
31)
[Question ID = 892]
1. {A, B, D} [Option ID = 3566]
2. {A} [Option ID = 3568]
3. {A, B, D, G, H} [Option ID = 3567]
4. {A, B} [Option ID = 3565]
Correct Answer :-
{A, B, D} [Option ID = 3566]
[Question ID = 891]
1. All branches that have greater assets than all branches in Patna. [Option ID = 3562]
2. The branch that has greatest asset in Patna [Option ID = 3563]
3. All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
4. Any branch that has greater assets than any branch in Patna. [Option ID = 3564]
Correct Answer :-
All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
[Question ID = 913]
1. [Option ID = 3649]
2. [Option ID = 3650]
3. [Option ID = 3651]
4. [Option ID = 3652]
Correct Answer :-
32)
33)
34)
[Option ID = 3651]
[Question ID = 911]
1. [Option ID = 3643]
2. [Option ID = 3644]
3. [Option ID = 3642]
4. [Option ID = 3641]
Correct Answer :-
[Option ID = 3644]
[Question ID = 902]
1. Rank of T is 3. [Option ID = 3606]
2. Rank of T is 2. [Option ID = 3605]
3. Nullity of T is 2. [Option ID = 3608]
4. Nullity of T is 3. [Option ID = 3607]
Correct Answer :-
Rank of T is 3. [Option ID = 3606]
[Question ID = 905]
1. 6 [Option ID = 3618]
2. 7 [Option ID = 3617]
3. 5 [Option ID = 3619]
4. 4 [Option ID = 3620]
Correct Answer :-
6 [Option ID = 3618]
35)
36)
37)
38)
[Question ID = 877]
1. [Option ID = 3508]
2. [Option ID = 3505]
3. [Option ID = 3507]
4. [Option ID = 3506]
Correct Answer :-
[Option ID = 3505]
[Question ID = 907]
1. 6 [Option ID = 3625]
2. 5 [Option ID = 3626]
3. 3 [Option ID = 3628]
4. 4 [Option ID = 3627]
Correct Answer :-
6 [Option ID = 3625]
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3,
9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First
In First Out (FIFO) and Least Recently Used (LRU)? [Question ID = 888]
1. FIFO incurs 2 more page faults than LRU [Option ID = 3550]
2. FIFO incurs 1 more page faults than LRU [Option ID = 3552]
3. Both incur the same number of page faults [Option ID = 3549]
4. LRU incurs 2 more page faults than FIFO [Option ID = 3551]
Correct Answer :-
Both incur the same number of page faults [Option ID = 3549]
Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by
chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum,
minimum, and average chain lengths in the hash table, respectively, are [Question ID = 879]
1. 3, 3, and 3 [Option ID = 3514]
2. 4, 0, and 1 [Option ID = 3515]
3. 3, 0, and 1 [Option ID = 3513]
4. 3, 0, and 2 [Option ID = 3516]
39)
40)
1)
Correct Answer :-
3, 0, and 1 [Option ID = 3513]
How many 8-bit characters can be transmitted per second over a 7200 baud serial communication link
using asynchronous mode of transmission with one start bit, eight data bits, one parity bit, and two stop bits:
[Question ID = 886]
1. 800 [Option ID = 3543]
2. 600 [Option ID = 3541]
3. 900 [Option ID = 3544]
4. 700 [Option ID = 3542]
Correct Answer :-
600 [Option ID = 3541]
Let G be a graph with n vertices and m edges. What is the upper bound on the running time of depth first
search on G, when G is represented as an adjacency matrix?
[Question ID = 880]
1. ? (m) [Option ID = 3519]
2. ? (n+m) [Option ID = 3518]
3. ? (n) [Option ID = 3517]
4. ? (n
2
) [Option ID = 3520]
Correct Answer :-
? (n
2
) [Option ID = 3520]
Topic:- DU_J18_MSC_CS_Topic02
2)
How does Maharashtra plan to expand the service further? [Question ID = 1024]
1. All of the these. [Option ID = 4096]
2. The state is looking to extend this service to more areas. [Option ID = 4093]
3. It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
4. It may provide this service in other states as well. [Option ID = 4095]
Correct Answer :-
It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
3)
Mark the statement that is NOT true: [Question ID = 1025]
1. Not many people know that the service is quite free. [Option ID = 4100]
2. Locating the place from where the call has come is often a challenge in Mumbai [Option ID = 4099]
3. The service is meant for and availed of by people living in slums. [Option ID = 4098]
4. The free service has still remained relatively low-key. [Option ID = 4097]
Correct Answer :-
The service is meant for and availed of by people living in slums. [Option ID = 4098]
4)
What advantage does Ambulance 108 enjoy over regular ambulance?
[Question ID = 53418]
1. It is far more user-friendly. [Option ID = 93658]
2. It provides medical aid that regular ambulance cannot. [Option ID = 93657]
3. It consists of dedicated medical practitioners. [Option ID = 93660]
4. It can reach the patient in need of ambulance earlier. [Option ID = 93659]
Correct Answer :-
It can reach the patient in need of ambulance earlier. [Option ID = 93659]
5)
What makes this ambulance service quite different from conventional ambulance service? [Question ID =
1023]
1. It has a more human touch as it renders both medical and psychological firstaid. [Option ID = 4091]
2. It is faster. [Option ID = 4089]
3. It is availed of mostly by people living in slums in Mumbai. [Option ID = 4090]
4. All of the these. [Option ID = 4092]
Correct Answer :-
All of the these. [Option ID = 4092]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
24)
25)
26)
2. [Option ID = 3530]
3. [Option ID = 3529]
4. [Option ID = 3531]
Correct Answer :-
[Option ID = 3531]
[Question ID = 914]
1. [Option ID = 3656]
2. [Option ID = 3654]
3. [Option ID = 3653]
4. [Option ID = 3655]
Correct Answer :-
[Option ID = 3655]
[Question ID = 876]
1. [Option ID = 3503]
2. [Option ID = 3504]
3. [Option ID = 3502]
4. [Option ID = 3501]
Correct Answer :-
[Option ID = 3504]
27)
28)
29)
[Question ID = 904]
1. both conjugate complex numbers. [Option ID = 3616]
2. both irrational numbers. [Option ID = 3615]
3. both rational numbers, other than integers. [Option ID = 3614]
4. integers of unlike signs [Option ID = 3613]
Correct Answer :-
both irrational numbers. [Option ID = 3615]
[Question ID = 908]
1. [Option ID = 3630]
2. [Option ID = 3632]
3. [Option ID = 3631]
4. [Option ID = 3629]
Correct Answer :-
[Question ID = 910]
1. [Option ID = 3637]
2. [Option ID = 3640]
3. [Option ID = 3638]
4. [Option ID = 3639]
Correct Answer :-
[Option ID = 3640]
30)
31)
[Question ID = 892]
1. {A, B, D} [Option ID = 3566]
2. {A} [Option ID = 3568]
3. {A, B, D, G, H} [Option ID = 3567]
4. {A, B} [Option ID = 3565]
Correct Answer :-
{A, B, D} [Option ID = 3566]
[Question ID = 891]
1. All branches that have greater assets than all branches in Patna. [Option ID = 3562]
2. The branch that has greatest asset in Patna [Option ID = 3563]
3. All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
4. Any branch that has greater assets than any branch in Patna. [Option ID = 3564]
Correct Answer :-
All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
[Question ID = 913]
1. [Option ID = 3649]
2. [Option ID = 3650]
3. [Option ID = 3651]
4. [Option ID = 3652]
Correct Answer :-
32)
33)
34)
[Option ID = 3651]
[Question ID = 911]
1. [Option ID = 3643]
2. [Option ID = 3644]
3. [Option ID = 3642]
4. [Option ID = 3641]
Correct Answer :-
[Option ID = 3644]
[Question ID = 902]
1. Rank of T is 3. [Option ID = 3606]
2. Rank of T is 2. [Option ID = 3605]
3. Nullity of T is 2. [Option ID = 3608]
4. Nullity of T is 3. [Option ID = 3607]
Correct Answer :-
Rank of T is 3. [Option ID = 3606]
[Question ID = 905]
1. 6 [Option ID = 3618]
2. 7 [Option ID = 3617]
3. 5 [Option ID = 3619]
4. 4 [Option ID = 3620]
Correct Answer :-
6 [Option ID = 3618]
35)
36)
37)
38)
[Question ID = 877]
1. [Option ID = 3508]
2. [Option ID = 3505]
3. [Option ID = 3507]
4. [Option ID = 3506]
Correct Answer :-
[Option ID = 3505]
[Question ID = 907]
1. 6 [Option ID = 3625]
2. 5 [Option ID = 3626]
3. 3 [Option ID = 3628]
4. 4 [Option ID = 3627]
Correct Answer :-
6 [Option ID = 3625]
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3,
9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First
In First Out (FIFO) and Least Recently Used (LRU)? [Question ID = 888]
1. FIFO incurs 2 more page faults than LRU [Option ID = 3550]
2. FIFO incurs 1 more page faults than LRU [Option ID = 3552]
3. Both incur the same number of page faults [Option ID = 3549]
4. LRU incurs 2 more page faults than FIFO [Option ID = 3551]
Correct Answer :-
Both incur the same number of page faults [Option ID = 3549]
Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by
chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum,
minimum, and average chain lengths in the hash table, respectively, are [Question ID = 879]
1. 3, 3, and 3 [Option ID = 3514]
2. 4, 0, and 1 [Option ID = 3515]
3. 3, 0, and 1 [Option ID = 3513]
4. 3, 0, and 2 [Option ID = 3516]
39)
40)
1)
Correct Answer :-
3, 0, and 1 [Option ID = 3513]
How many 8-bit characters can be transmitted per second over a 7200 baud serial communication link
using asynchronous mode of transmission with one start bit, eight data bits, one parity bit, and two stop bits:
[Question ID = 886]
1. 800 [Option ID = 3543]
2. 600 [Option ID = 3541]
3. 900 [Option ID = 3544]
4. 700 [Option ID = 3542]
Correct Answer :-
600 [Option ID = 3541]
Let G be a graph with n vertices and m edges. What is the upper bound on the running time of depth first
search on G, when G is represented as an adjacency matrix?
[Question ID = 880]
1. ? (m) [Option ID = 3519]
2. ? (n+m) [Option ID = 3518]
3. ? (n) [Option ID = 3517]
4. ? (n
2
) [Option ID = 3520]
Correct Answer :-
? (n
2
) [Option ID = 3520]
Topic:- DU_J18_MSC_CS_Topic02
2)
How does Maharashtra plan to expand the service further? [Question ID = 1024]
1. All of the these. [Option ID = 4096]
2. The state is looking to extend this service to more areas. [Option ID = 4093]
3. It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
4. It may provide this service in other states as well. [Option ID = 4095]
Correct Answer :-
It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
3)
Mark the statement that is NOT true: [Question ID = 1025]
1. Not many people know that the service is quite free. [Option ID = 4100]
2. Locating the place from where the call has come is often a challenge in Mumbai [Option ID = 4099]
3. The service is meant for and availed of by people living in slums. [Option ID = 4098]
4. The free service has still remained relatively low-key. [Option ID = 4097]
Correct Answer :-
The service is meant for and availed of by people living in slums. [Option ID = 4098]
4)
What advantage does Ambulance 108 enjoy over regular ambulance?
[Question ID = 53418]
1. It is far more user-friendly. [Option ID = 93658]
2. It provides medical aid that regular ambulance cannot. [Option ID = 93657]
3. It consists of dedicated medical practitioners. [Option ID = 93660]
4. It can reach the patient in need of ambulance earlier. [Option ID = 93659]
Correct Answer :-
It can reach the patient in need of ambulance earlier. [Option ID = 93659]
5)
What makes this ambulance service quite different from conventional ambulance service? [Question ID =
1023]
1. It has a more human touch as it renders both medical and psychological firstaid. [Option ID = 4091]
2. It is faster. [Option ID = 4089]
3. It is availed of mostly by people living in slums in Mumbai. [Option ID = 4090]
4. All of the these. [Option ID = 4092]
Correct Answer :-
All of the these. [Option ID = 4092]
1)
What has been the impact of this scheme elsewhere? [Question ID = 1022]
1. Several other States have started similar service. [Option ID = 4085]
2. All of the these. [Option ID = 4088]
3. This service has been extended to some other States as well. [Option ID = 4086]
4. This service is now available in Karnataka, Punjab and West Bengal. [Option ID = 4087]
Correct Answer :-
Several other States have started similar service. [Option ID = 4085]
Topic:- DU_J18_MSC_CS_Topic03
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
24)
25)
26)
2. [Option ID = 3530]
3. [Option ID = 3529]
4. [Option ID = 3531]
Correct Answer :-
[Option ID = 3531]
[Question ID = 914]
1. [Option ID = 3656]
2. [Option ID = 3654]
3. [Option ID = 3653]
4. [Option ID = 3655]
Correct Answer :-
[Option ID = 3655]
[Question ID = 876]
1. [Option ID = 3503]
2. [Option ID = 3504]
3. [Option ID = 3502]
4. [Option ID = 3501]
Correct Answer :-
[Option ID = 3504]
27)
28)
29)
[Question ID = 904]
1. both conjugate complex numbers. [Option ID = 3616]
2. both irrational numbers. [Option ID = 3615]
3. both rational numbers, other than integers. [Option ID = 3614]
4. integers of unlike signs [Option ID = 3613]
Correct Answer :-
both irrational numbers. [Option ID = 3615]
[Question ID = 908]
1. [Option ID = 3630]
2. [Option ID = 3632]
3. [Option ID = 3631]
4. [Option ID = 3629]
Correct Answer :-
[Question ID = 910]
1. [Option ID = 3637]
2. [Option ID = 3640]
3. [Option ID = 3638]
4. [Option ID = 3639]
Correct Answer :-
[Option ID = 3640]
30)
31)
[Question ID = 892]
1. {A, B, D} [Option ID = 3566]
2. {A} [Option ID = 3568]
3. {A, B, D, G, H} [Option ID = 3567]
4. {A, B} [Option ID = 3565]
Correct Answer :-
{A, B, D} [Option ID = 3566]
[Question ID = 891]
1. All branches that have greater assets than all branches in Patna. [Option ID = 3562]
2. The branch that has greatest asset in Patna [Option ID = 3563]
3. All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
4. Any branch that has greater assets than any branch in Patna. [Option ID = 3564]
Correct Answer :-
All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
[Question ID = 913]
1. [Option ID = 3649]
2. [Option ID = 3650]
3. [Option ID = 3651]
4. [Option ID = 3652]
Correct Answer :-
32)
33)
34)
[Option ID = 3651]
[Question ID = 911]
1. [Option ID = 3643]
2. [Option ID = 3644]
3. [Option ID = 3642]
4. [Option ID = 3641]
Correct Answer :-
[Option ID = 3644]
[Question ID = 902]
1. Rank of T is 3. [Option ID = 3606]
2. Rank of T is 2. [Option ID = 3605]
3. Nullity of T is 2. [Option ID = 3608]
4. Nullity of T is 3. [Option ID = 3607]
Correct Answer :-
Rank of T is 3. [Option ID = 3606]
[Question ID = 905]
1. 6 [Option ID = 3618]
2. 7 [Option ID = 3617]
3. 5 [Option ID = 3619]
4. 4 [Option ID = 3620]
Correct Answer :-
6 [Option ID = 3618]
35)
36)
37)
38)
[Question ID = 877]
1. [Option ID = 3508]
2. [Option ID = 3505]
3. [Option ID = 3507]
4. [Option ID = 3506]
Correct Answer :-
[Option ID = 3505]
[Question ID = 907]
1. 6 [Option ID = 3625]
2. 5 [Option ID = 3626]
3. 3 [Option ID = 3628]
4. 4 [Option ID = 3627]
Correct Answer :-
6 [Option ID = 3625]
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3,
9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First
In First Out (FIFO) and Least Recently Used (LRU)? [Question ID = 888]
1. FIFO incurs 2 more page faults than LRU [Option ID = 3550]
2. FIFO incurs 1 more page faults than LRU [Option ID = 3552]
3. Both incur the same number of page faults [Option ID = 3549]
4. LRU incurs 2 more page faults than FIFO [Option ID = 3551]
Correct Answer :-
Both incur the same number of page faults [Option ID = 3549]
Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by
chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum,
minimum, and average chain lengths in the hash table, respectively, are [Question ID = 879]
1. 3, 3, and 3 [Option ID = 3514]
2. 4, 0, and 1 [Option ID = 3515]
3. 3, 0, and 1 [Option ID = 3513]
4. 3, 0, and 2 [Option ID = 3516]
39)
40)
1)
Correct Answer :-
3, 0, and 1 [Option ID = 3513]
How many 8-bit characters can be transmitted per second over a 7200 baud serial communication link
using asynchronous mode of transmission with one start bit, eight data bits, one parity bit, and two stop bits:
[Question ID = 886]
1. 800 [Option ID = 3543]
2. 600 [Option ID = 3541]
3. 900 [Option ID = 3544]
4. 700 [Option ID = 3542]
Correct Answer :-
600 [Option ID = 3541]
Let G be a graph with n vertices and m edges. What is the upper bound on the running time of depth first
search on G, when G is represented as an adjacency matrix?
[Question ID = 880]
1. ? (m) [Option ID = 3519]
2. ? (n+m) [Option ID = 3518]
3. ? (n) [Option ID = 3517]
4. ? (n
2
) [Option ID = 3520]
Correct Answer :-
? (n
2
) [Option ID = 3520]
Topic:- DU_J18_MSC_CS_Topic02
2)
How does Maharashtra plan to expand the service further? [Question ID = 1024]
1. All of the these. [Option ID = 4096]
2. The state is looking to extend this service to more areas. [Option ID = 4093]
3. It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
4. It may provide this service in other states as well. [Option ID = 4095]
Correct Answer :-
It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
3)
Mark the statement that is NOT true: [Question ID = 1025]
1. Not many people know that the service is quite free. [Option ID = 4100]
2. Locating the place from where the call has come is often a challenge in Mumbai [Option ID = 4099]
3. The service is meant for and availed of by people living in slums. [Option ID = 4098]
4. The free service has still remained relatively low-key. [Option ID = 4097]
Correct Answer :-
The service is meant for and availed of by people living in slums. [Option ID = 4098]
4)
What advantage does Ambulance 108 enjoy over regular ambulance?
[Question ID = 53418]
1. It is far more user-friendly. [Option ID = 93658]
2. It provides medical aid that regular ambulance cannot. [Option ID = 93657]
3. It consists of dedicated medical practitioners. [Option ID = 93660]
4. It can reach the patient in need of ambulance earlier. [Option ID = 93659]
Correct Answer :-
It can reach the patient in need of ambulance earlier. [Option ID = 93659]
5)
What makes this ambulance service quite different from conventional ambulance service? [Question ID =
1023]
1. It has a more human touch as it renders both medical and psychological firstaid. [Option ID = 4091]
2. It is faster. [Option ID = 4089]
3. It is availed of mostly by people living in slums in Mumbai. [Option ID = 4090]
4. All of the these. [Option ID = 4092]
Correct Answer :-
All of the these. [Option ID = 4092]
1)
What has been the impact of this scheme elsewhere? [Question ID = 1022]
1. Several other States have started similar service. [Option ID = 4085]
2. All of the these. [Option ID = 4088]
3. This service has been extended to some other States as well. [Option ID = 4086]
4. This service is now available in Karnataka, Punjab and West Bengal. [Option ID = 4087]
Correct Answer :-
Several other States have started similar service. [Option ID = 4085]
Topic:- DU_J18_MSC_CS_Topic03
2)
Mark the statement that is NOT true: [Question ID = 1031]
1. Once we find an easier way to do something, we don?t want to do it the earlier way. [Option ID = 4121]
2. We don?t want to vote in election because waiting in a line irritates us. [Option ID = 4123]
3. The little guy cannot compete with the monopoly businesses. [Option ID = 4124]
4. Monopolies are bad for ordinary consumers and workers alike. [Option ID = 4122]
Correct Answer :-
We don?t want to vote in election because waiting in a line irritates us. [Option ID = 4123]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
24)
25)
26)
2. [Option ID = 3530]
3. [Option ID = 3529]
4. [Option ID = 3531]
Correct Answer :-
[Option ID = 3531]
[Question ID = 914]
1. [Option ID = 3656]
2. [Option ID = 3654]
3. [Option ID = 3653]
4. [Option ID = 3655]
Correct Answer :-
[Option ID = 3655]
[Question ID = 876]
1. [Option ID = 3503]
2. [Option ID = 3504]
3. [Option ID = 3502]
4. [Option ID = 3501]
Correct Answer :-
[Option ID = 3504]
27)
28)
29)
[Question ID = 904]
1. both conjugate complex numbers. [Option ID = 3616]
2. both irrational numbers. [Option ID = 3615]
3. both rational numbers, other than integers. [Option ID = 3614]
4. integers of unlike signs [Option ID = 3613]
Correct Answer :-
both irrational numbers. [Option ID = 3615]
[Question ID = 908]
1. [Option ID = 3630]
2. [Option ID = 3632]
3. [Option ID = 3631]
4. [Option ID = 3629]
Correct Answer :-
[Question ID = 910]
1. [Option ID = 3637]
2. [Option ID = 3640]
3. [Option ID = 3638]
4. [Option ID = 3639]
Correct Answer :-
[Option ID = 3640]
30)
31)
[Question ID = 892]
1. {A, B, D} [Option ID = 3566]
2. {A} [Option ID = 3568]
3. {A, B, D, G, H} [Option ID = 3567]
4. {A, B} [Option ID = 3565]
Correct Answer :-
{A, B, D} [Option ID = 3566]
[Question ID = 891]
1. All branches that have greater assets than all branches in Patna. [Option ID = 3562]
2. The branch that has greatest asset in Patna [Option ID = 3563]
3. All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
4. Any branch that has greater assets than any branch in Patna. [Option ID = 3564]
Correct Answer :-
All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
[Question ID = 913]
1. [Option ID = 3649]
2. [Option ID = 3650]
3. [Option ID = 3651]
4. [Option ID = 3652]
Correct Answer :-
32)
33)
34)
[Option ID = 3651]
[Question ID = 911]
1. [Option ID = 3643]
2. [Option ID = 3644]
3. [Option ID = 3642]
4. [Option ID = 3641]
Correct Answer :-
[Option ID = 3644]
[Question ID = 902]
1. Rank of T is 3. [Option ID = 3606]
2. Rank of T is 2. [Option ID = 3605]
3. Nullity of T is 2. [Option ID = 3608]
4. Nullity of T is 3. [Option ID = 3607]
Correct Answer :-
Rank of T is 3. [Option ID = 3606]
[Question ID = 905]
1. 6 [Option ID = 3618]
2. 7 [Option ID = 3617]
3. 5 [Option ID = 3619]
4. 4 [Option ID = 3620]
Correct Answer :-
6 [Option ID = 3618]
35)
36)
37)
38)
[Question ID = 877]
1. [Option ID = 3508]
2. [Option ID = 3505]
3. [Option ID = 3507]
4. [Option ID = 3506]
Correct Answer :-
[Option ID = 3505]
[Question ID = 907]
1. 6 [Option ID = 3625]
2. 5 [Option ID = 3626]
3. 3 [Option ID = 3628]
4. 4 [Option ID = 3627]
Correct Answer :-
6 [Option ID = 3625]
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3,
9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First
In First Out (FIFO) and Least Recently Used (LRU)? [Question ID = 888]
1. FIFO incurs 2 more page faults than LRU [Option ID = 3550]
2. FIFO incurs 1 more page faults than LRU [Option ID = 3552]
3. Both incur the same number of page faults [Option ID = 3549]
4. LRU incurs 2 more page faults than FIFO [Option ID = 3551]
Correct Answer :-
Both incur the same number of page faults [Option ID = 3549]
Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by
chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum,
minimum, and average chain lengths in the hash table, respectively, are [Question ID = 879]
1. 3, 3, and 3 [Option ID = 3514]
2. 4, 0, and 1 [Option ID = 3515]
3. 3, 0, and 1 [Option ID = 3513]
4. 3, 0, and 2 [Option ID = 3516]
39)
40)
1)
Correct Answer :-
3, 0, and 1 [Option ID = 3513]
How many 8-bit characters can be transmitted per second over a 7200 baud serial communication link
using asynchronous mode of transmission with one start bit, eight data bits, one parity bit, and two stop bits:
[Question ID = 886]
1. 800 [Option ID = 3543]
2. 600 [Option ID = 3541]
3. 900 [Option ID = 3544]
4. 700 [Option ID = 3542]
Correct Answer :-
600 [Option ID = 3541]
Let G be a graph with n vertices and m edges. What is the upper bound on the running time of depth first
search on G, when G is represented as an adjacency matrix?
[Question ID = 880]
1. ? (m) [Option ID = 3519]
2. ? (n+m) [Option ID = 3518]
3. ? (n) [Option ID = 3517]
4. ? (n
2
) [Option ID = 3520]
Correct Answer :-
? (n
2
) [Option ID = 3520]
Topic:- DU_J18_MSC_CS_Topic02
2)
How does Maharashtra plan to expand the service further? [Question ID = 1024]
1. All of the these. [Option ID = 4096]
2. The state is looking to extend this service to more areas. [Option ID = 4093]
3. It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
4. It may provide this service in other states as well. [Option ID = 4095]
Correct Answer :-
It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
3)
Mark the statement that is NOT true: [Question ID = 1025]
1. Not many people know that the service is quite free. [Option ID = 4100]
2. Locating the place from where the call has come is often a challenge in Mumbai [Option ID = 4099]
3. The service is meant for and availed of by people living in slums. [Option ID = 4098]
4. The free service has still remained relatively low-key. [Option ID = 4097]
Correct Answer :-
The service is meant for and availed of by people living in slums. [Option ID = 4098]
4)
What advantage does Ambulance 108 enjoy over regular ambulance?
[Question ID = 53418]
1. It is far more user-friendly. [Option ID = 93658]
2. It provides medical aid that regular ambulance cannot. [Option ID = 93657]
3. It consists of dedicated medical practitioners. [Option ID = 93660]
4. It can reach the patient in need of ambulance earlier. [Option ID = 93659]
Correct Answer :-
It can reach the patient in need of ambulance earlier. [Option ID = 93659]
5)
What makes this ambulance service quite different from conventional ambulance service? [Question ID =
1023]
1. It has a more human touch as it renders both medical and psychological firstaid. [Option ID = 4091]
2. It is faster. [Option ID = 4089]
3. It is availed of mostly by people living in slums in Mumbai. [Option ID = 4090]
4. All of the these. [Option ID = 4092]
Correct Answer :-
All of the these. [Option ID = 4092]
1)
What has been the impact of this scheme elsewhere? [Question ID = 1022]
1. Several other States have started similar service. [Option ID = 4085]
2. All of the these. [Option ID = 4088]
3. This service has been extended to some other States as well. [Option ID = 4086]
4. This service is now available in Karnataka, Punjab and West Bengal. [Option ID = 4087]
Correct Answer :-
Several other States have started similar service. [Option ID = 4085]
Topic:- DU_J18_MSC_CS_Topic03
2)
Mark the statement that is NOT true: [Question ID = 1031]
1. Once we find an easier way to do something, we don?t want to do it the earlier way. [Option ID = 4121]
2. We don?t want to vote in election because waiting in a line irritates us. [Option ID = 4123]
3. The little guy cannot compete with the monopoly businesses. [Option ID = 4124]
4. Monopolies are bad for ordinary consumers and workers alike. [Option ID = 4122]
Correct Answer :-
We don?t want to vote in election because waiting in a line irritates us. [Option ID = 4123]
3)
How does convenience make us intolerant of things that are not convenient? [Question ID = 1030]
1. The creed of convenience teaches you to do nothing that demands effort. [Option ID = 4118]
2. We have got used to easy life and shun all inconvenience in life. [Option ID = 4119]
3. We don?t want to do things we don?t like. [Option ID = 4117]
4. We only like what others tell us. [Option ID = 4120]
Correct Answer :-
The creed of convenience teaches you to do nothing that demands effort. [Option ID = 4118]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
24)
25)
26)
2. [Option ID = 3530]
3. [Option ID = 3529]
4. [Option ID = 3531]
Correct Answer :-
[Option ID = 3531]
[Question ID = 914]
1. [Option ID = 3656]
2. [Option ID = 3654]
3. [Option ID = 3653]
4. [Option ID = 3655]
Correct Answer :-
[Option ID = 3655]
[Question ID = 876]
1. [Option ID = 3503]
2. [Option ID = 3504]
3. [Option ID = 3502]
4. [Option ID = 3501]
Correct Answer :-
[Option ID = 3504]
27)
28)
29)
[Question ID = 904]
1. both conjugate complex numbers. [Option ID = 3616]
2. both irrational numbers. [Option ID = 3615]
3. both rational numbers, other than integers. [Option ID = 3614]
4. integers of unlike signs [Option ID = 3613]
Correct Answer :-
both irrational numbers. [Option ID = 3615]
[Question ID = 908]
1. [Option ID = 3630]
2. [Option ID = 3632]
3. [Option ID = 3631]
4. [Option ID = 3629]
Correct Answer :-
[Question ID = 910]
1. [Option ID = 3637]
2. [Option ID = 3640]
3. [Option ID = 3638]
4. [Option ID = 3639]
Correct Answer :-
[Option ID = 3640]
30)
31)
[Question ID = 892]
1. {A, B, D} [Option ID = 3566]
2. {A} [Option ID = 3568]
3. {A, B, D, G, H} [Option ID = 3567]
4. {A, B} [Option ID = 3565]
Correct Answer :-
{A, B, D} [Option ID = 3566]
[Question ID = 891]
1. All branches that have greater assets than all branches in Patna. [Option ID = 3562]
2. The branch that has greatest asset in Patna [Option ID = 3563]
3. All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
4. Any branch that has greater assets than any branch in Patna. [Option ID = 3564]
Correct Answer :-
All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
[Question ID = 913]
1. [Option ID = 3649]
2. [Option ID = 3650]
3. [Option ID = 3651]
4. [Option ID = 3652]
Correct Answer :-
32)
33)
34)
[Option ID = 3651]
[Question ID = 911]
1. [Option ID = 3643]
2. [Option ID = 3644]
3. [Option ID = 3642]
4. [Option ID = 3641]
Correct Answer :-
[Option ID = 3644]
[Question ID = 902]
1. Rank of T is 3. [Option ID = 3606]
2. Rank of T is 2. [Option ID = 3605]
3. Nullity of T is 2. [Option ID = 3608]
4. Nullity of T is 3. [Option ID = 3607]
Correct Answer :-
Rank of T is 3. [Option ID = 3606]
[Question ID = 905]
1. 6 [Option ID = 3618]
2. 7 [Option ID = 3617]
3. 5 [Option ID = 3619]
4. 4 [Option ID = 3620]
Correct Answer :-
6 [Option ID = 3618]
35)
36)
37)
38)
[Question ID = 877]
1. [Option ID = 3508]
2. [Option ID = 3505]
3. [Option ID = 3507]
4. [Option ID = 3506]
Correct Answer :-
[Option ID = 3505]
[Question ID = 907]
1. 6 [Option ID = 3625]
2. 5 [Option ID = 3626]
3. 3 [Option ID = 3628]
4. 4 [Option ID = 3627]
Correct Answer :-
6 [Option ID = 3625]
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3,
9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First
In First Out (FIFO) and Least Recently Used (LRU)? [Question ID = 888]
1. FIFO incurs 2 more page faults than LRU [Option ID = 3550]
2. FIFO incurs 1 more page faults than LRU [Option ID = 3552]
3. Both incur the same number of page faults [Option ID = 3549]
4. LRU incurs 2 more page faults than FIFO [Option ID = 3551]
Correct Answer :-
Both incur the same number of page faults [Option ID = 3549]
Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by
chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum,
minimum, and average chain lengths in the hash table, respectively, are [Question ID = 879]
1. 3, 3, and 3 [Option ID = 3514]
2. 4, 0, and 1 [Option ID = 3515]
3. 3, 0, and 1 [Option ID = 3513]
4. 3, 0, and 2 [Option ID = 3516]
39)
40)
1)
Correct Answer :-
3, 0, and 1 [Option ID = 3513]
How many 8-bit characters can be transmitted per second over a 7200 baud serial communication link
using asynchronous mode of transmission with one start bit, eight data bits, one parity bit, and two stop bits:
[Question ID = 886]
1. 800 [Option ID = 3543]
2. 600 [Option ID = 3541]
3. 900 [Option ID = 3544]
4. 700 [Option ID = 3542]
Correct Answer :-
600 [Option ID = 3541]
Let G be a graph with n vertices and m edges. What is the upper bound on the running time of depth first
search on G, when G is represented as an adjacency matrix?
[Question ID = 880]
1. ? (m) [Option ID = 3519]
2. ? (n+m) [Option ID = 3518]
3. ? (n) [Option ID = 3517]
4. ? (n
2
) [Option ID = 3520]
Correct Answer :-
? (n
2
) [Option ID = 3520]
Topic:- DU_J18_MSC_CS_Topic02
2)
How does Maharashtra plan to expand the service further? [Question ID = 1024]
1. All of the these. [Option ID = 4096]
2. The state is looking to extend this service to more areas. [Option ID = 4093]
3. It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
4. It may provide this service in other states as well. [Option ID = 4095]
Correct Answer :-
It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
3)
Mark the statement that is NOT true: [Question ID = 1025]
1. Not many people know that the service is quite free. [Option ID = 4100]
2. Locating the place from where the call has come is often a challenge in Mumbai [Option ID = 4099]
3. The service is meant for and availed of by people living in slums. [Option ID = 4098]
4. The free service has still remained relatively low-key. [Option ID = 4097]
Correct Answer :-
The service is meant for and availed of by people living in slums. [Option ID = 4098]
4)
What advantage does Ambulance 108 enjoy over regular ambulance?
[Question ID = 53418]
1. It is far more user-friendly. [Option ID = 93658]
2. It provides medical aid that regular ambulance cannot. [Option ID = 93657]
3. It consists of dedicated medical practitioners. [Option ID = 93660]
4. It can reach the patient in need of ambulance earlier. [Option ID = 93659]
Correct Answer :-
It can reach the patient in need of ambulance earlier. [Option ID = 93659]
5)
What makes this ambulance service quite different from conventional ambulance service? [Question ID =
1023]
1. It has a more human touch as it renders both medical and psychological firstaid. [Option ID = 4091]
2. It is faster. [Option ID = 4089]
3. It is availed of mostly by people living in slums in Mumbai. [Option ID = 4090]
4. All of the these. [Option ID = 4092]
Correct Answer :-
All of the these. [Option ID = 4092]
1)
What has been the impact of this scheme elsewhere? [Question ID = 1022]
1. Several other States have started similar service. [Option ID = 4085]
2. All of the these. [Option ID = 4088]
3. This service has been extended to some other States as well. [Option ID = 4086]
4. This service is now available in Karnataka, Punjab and West Bengal. [Option ID = 4087]
Correct Answer :-
Several other States have started similar service. [Option ID = 4085]
Topic:- DU_J18_MSC_CS_Topic03
2)
Mark the statement that is NOT true: [Question ID = 1031]
1. Once we find an easier way to do something, we don?t want to do it the earlier way. [Option ID = 4121]
2. We don?t want to vote in election because waiting in a line irritates us. [Option ID = 4123]
3. The little guy cannot compete with the monopoly businesses. [Option ID = 4124]
4. Monopolies are bad for ordinary consumers and workers alike. [Option ID = 4122]
Correct Answer :-
We don?t want to vote in election because waiting in a line irritates us. [Option ID = 4123]
3)
How does convenience make us intolerant of things that are not convenient? [Question ID = 1030]
1. The creed of convenience teaches you to do nothing that demands effort. [Option ID = 4118]
2. We have got used to easy life and shun all inconvenience in life. [Option ID = 4119]
3. We don?t want to do things we don?t like. [Option ID = 4117]
4. We only like what others tell us. [Option ID = 4120]
Correct Answer :-
The creed of convenience teaches you to do nothing that demands effort. [Option ID = 4118]
4)
This massive force is changing the economy and politics in ways that hurt the ?little guy?? Who is this ?little
guy?? [Question ID = 1027]
1. The ordinary consumer. [Option ID = 4105]
2. The small businessman or manufacturer. [Option ID = 4106]
3. The ordinary citizen. [Option ID = 4107]
4. All of the these. [Option ID = 4108]
Correct Answer :-
The small businessman or manufacturer. [Option ID = 4106]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
24)
25)
26)
2. [Option ID = 3530]
3. [Option ID = 3529]
4. [Option ID = 3531]
Correct Answer :-
[Option ID = 3531]
[Question ID = 914]
1. [Option ID = 3656]
2. [Option ID = 3654]
3. [Option ID = 3653]
4. [Option ID = 3655]
Correct Answer :-
[Option ID = 3655]
[Question ID = 876]
1. [Option ID = 3503]
2. [Option ID = 3504]
3. [Option ID = 3502]
4. [Option ID = 3501]
Correct Answer :-
[Option ID = 3504]
27)
28)
29)
[Question ID = 904]
1. both conjugate complex numbers. [Option ID = 3616]
2. both irrational numbers. [Option ID = 3615]
3. both rational numbers, other than integers. [Option ID = 3614]
4. integers of unlike signs [Option ID = 3613]
Correct Answer :-
both irrational numbers. [Option ID = 3615]
[Question ID = 908]
1. [Option ID = 3630]
2. [Option ID = 3632]
3. [Option ID = 3631]
4. [Option ID = 3629]
Correct Answer :-
[Question ID = 910]
1. [Option ID = 3637]
2. [Option ID = 3640]
3. [Option ID = 3638]
4. [Option ID = 3639]
Correct Answer :-
[Option ID = 3640]
30)
31)
[Question ID = 892]
1. {A, B, D} [Option ID = 3566]
2. {A} [Option ID = 3568]
3. {A, B, D, G, H} [Option ID = 3567]
4. {A, B} [Option ID = 3565]
Correct Answer :-
{A, B, D} [Option ID = 3566]
[Question ID = 891]
1. All branches that have greater assets than all branches in Patna. [Option ID = 3562]
2. The branch that has greatest asset in Patna [Option ID = 3563]
3. All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
4. Any branch that has greater assets than any branch in Patna. [Option ID = 3564]
Correct Answer :-
All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
[Question ID = 913]
1. [Option ID = 3649]
2. [Option ID = 3650]
3. [Option ID = 3651]
4. [Option ID = 3652]
Correct Answer :-
32)
33)
34)
[Option ID = 3651]
[Question ID = 911]
1. [Option ID = 3643]
2. [Option ID = 3644]
3. [Option ID = 3642]
4. [Option ID = 3641]
Correct Answer :-
[Option ID = 3644]
[Question ID = 902]
1. Rank of T is 3. [Option ID = 3606]
2. Rank of T is 2. [Option ID = 3605]
3. Nullity of T is 2. [Option ID = 3608]
4. Nullity of T is 3. [Option ID = 3607]
Correct Answer :-
Rank of T is 3. [Option ID = 3606]
[Question ID = 905]
1. 6 [Option ID = 3618]
2. 7 [Option ID = 3617]
3. 5 [Option ID = 3619]
4. 4 [Option ID = 3620]
Correct Answer :-
6 [Option ID = 3618]
35)
36)
37)
38)
[Question ID = 877]
1. [Option ID = 3508]
2. [Option ID = 3505]
3. [Option ID = 3507]
4. [Option ID = 3506]
Correct Answer :-
[Option ID = 3505]
[Question ID = 907]
1. 6 [Option ID = 3625]
2. 5 [Option ID = 3626]
3. 3 [Option ID = 3628]
4. 4 [Option ID = 3627]
Correct Answer :-
6 [Option ID = 3625]
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3,
9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First
In First Out (FIFO) and Least Recently Used (LRU)? [Question ID = 888]
1. FIFO incurs 2 more page faults than LRU [Option ID = 3550]
2. FIFO incurs 1 more page faults than LRU [Option ID = 3552]
3. Both incur the same number of page faults [Option ID = 3549]
4. LRU incurs 2 more page faults than FIFO [Option ID = 3551]
Correct Answer :-
Both incur the same number of page faults [Option ID = 3549]
Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by
chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum,
minimum, and average chain lengths in the hash table, respectively, are [Question ID = 879]
1. 3, 3, and 3 [Option ID = 3514]
2. 4, 0, and 1 [Option ID = 3515]
3. 3, 0, and 1 [Option ID = 3513]
4. 3, 0, and 2 [Option ID = 3516]
39)
40)
1)
Correct Answer :-
3, 0, and 1 [Option ID = 3513]
How many 8-bit characters can be transmitted per second over a 7200 baud serial communication link
using asynchronous mode of transmission with one start bit, eight data bits, one parity bit, and two stop bits:
[Question ID = 886]
1. 800 [Option ID = 3543]
2. 600 [Option ID = 3541]
3. 900 [Option ID = 3544]
4. 700 [Option ID = 3542]
Correct Answer :-
600 [Option ID = 3541]
Let G be a graph with n vertices and m edges. What is the upper bound on the running time of depth first
search on G, when G is represented as an adjacency matrix?
[Question ID = 880]
1. ? (m) [Option ID = 3519]
2. ? (n+m) [Option ID = 3518]
3. ? (n) [Option ID = 3517]
4. ? (n
2
) [Option ID = 3520]
Correct Answer :-
? (n
2
) [Option ID = 3520]
Topic:- DU_J18_MSC_CS_Topic02
2)
How does Maharashtra plan to expand the service further? [Question ID = 1024]
1. All of the these. [Option ID = 4096]
2. The state is looking to extend this service to more areas. [Option ID = 4093]
3. It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
4. It may provide this service in other states as well. [Option ID = 4095]
Correct Answer :-
It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
3)
Mark the statement that is NOT true: [Question ID = 1025]
1. Not many people know that the service is quite free. [Option ID = 4100]
2. Locating the place from where the call has come is often a challenge in Mumbai [Option ID = 4099]
3. The service is meant for and availed of by people living in slums. [Option ID = 4098]
4. The free service has still remained relatively low-key. [Option ID = 4097]
Correct Answer :-
The service is meant for and availed of by people living in slums. [Option ID = 4098]
4)
What advantage does Ambulance 108 enjoy over regular ambulance?
[Question ID = 53418]
1. It is far more user-friendly. [Option ID = 93658]
2. It provides medical aid that regular ambulance cannot. [Option ID = 93657]
3. It consists of dedicated medical practitioners. [Option ID = 93660]
4. It can reach the patient in need of ambulance earlier. [Option ID = 93659]
Correct Answer :-
It can reach the patient in need of ambulance earlier. [Option ID = 93659]
5)
What makes this ambulance service quite different from conventional ambulance service? [Question ID =
1023]
1. It has a more human touch as it renders both medical and psychological firstaid. [Option ID = 4091]
2. It is faster. [Option ID = 4089]
3. It is availed of mostly by people living in slums in Mumbai. [Option ID = 4090]
4. All of the these. [Option ID = 4092]
Correct Answer :-
All of the these. [Option ID = 4092]
1)
What has been the impact of this scheme elsewhere? [Question ID = 1022]
1. Several other States have started similar service. [Option ID = 4085]
2. All of the these. [Option ID = 4088]
3. This service has been extended to some other States as well. [Option ID = 4086]
4. This service is now available in Karnataka, Punjab and West Bengal. [Option ID = 4087]
Correct Answer :-
Several other States have started similar service. [Option ID = 4085]
Topic:- DU_J18_MSC_CS_Topic03
2)
Mark the statement that is NOT true: [Question ID = 1031]
1. Once we find an easier way to do something, we don?t want to do it the earlier way. [Option ID = 4121]
2. We don?t want to vote in election because waiting in a line irritates us. [Option ID = 4123]
3. The little guy cannot compete with the monopoly businesses. [Option ID = 4124]
4. Monopolies are bad for ordinary consumers and workers alike. [Option ID = 4122]
Correct Answer :-
We don?t want to vote in election because waiting in a line irritates us. [Option ID = 4123]
3)
How does convenience make us intolerant of things that are not convenient? [Question ID = 1030]
1. The creed of convenience teaches you to do nothing that demands effort. [Option ID = 4118]
2. We have got used to easy life and shun all inconvenience in life. [Option ID = 4119]
3. We don?t want to do things we don?t like. [Option ID = 4117]
4. We only like what others tell us. [Option ID = 4120]
Correct Answer :-
The creed of convenience teaches you to do nothing that demands effort. [Option ID = 4118]
4)
This massive force is changing the economy and politics in ways that hurt the ?little guy?? Who is this ?little
guy?? [Question ID = 1027]
1. The ordinary consumer. [Option ID = 4105]
2. The small businessman or manufacturer. [Option ID = 4106]
3. The ordinary citizen. [Option ID = 4107]
4. All of the these. [Option ID = 4108]
Correct Answer :-
The small businessman or manufacturer. [Option ID = 4106]
5)
?Convenience and monopoly seem to be natural bedfellows.? How? [Question ID = 1028]
1. Only big business monopolies can provide convenience in products and services. [Option ID = 4110]
2. They are always found together in business world. [Option ID = 4109]
3. They help each other. [Option ID = 4111]
4. All of the these. [Option ID = 4112]
Correct Answer :-
Only big business monopolies can provide convenience in products and services. [Option ID = 4110]
FirstRanker.com - FirstRanker's Choice
1)
2)
3)
4)
DU MSc Computer Science
Topic:- DU_J18_MSC_CS_Topic01
With reference to cache memory, the hit ratio is defined as:
[Question ID = 896]
1. No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
2. No. of hits / No. of miss [Option ID = 3581]
3. No. of miss / (No. of hits + No. of miss) [Option ID = 3584]
4. No. of miss / No. of hits [Option ID = 3582]
Correct Answer :-
No. of hits / (No. of hits + No. of miss) [Option ID = 3583]
How many address/data lines are required to access 64k x 8 memory? [Question ID = 897]
1. 16/8 [Option ID = 3585]
2. 8/16 [Option ID = 3587]
3. 16/16 [Option ID = 3586]
4. 8/8 [Option ID = 3588]
Correct Answer :-
16/8 [Option ID = 3585]
In a sliding window ARQ scheme, the transmitter?s window size is N and the receiver?s window size is M.
The minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme
is: [Question ID = 887]
1. max (M, N) [Option ID = 3546]
2. M + N [Option ID = 3547]
3. min (M, N) [Option ID = 3545]
4. M * N [Option ID = 3548]
Correct Answer :-
M + N [Option ID = 3547]
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute
(RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the
disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average
rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in
milliseconds) needed to read the entire file is ________. [Question ID = 890]
1. 14020 [Option ID = 3559]
2. 14200 [Option ID = 3558]
3. 14400 [Option ID = 3557]
4. 14040 [Option ID = 3560]
Correct Answer :-
14020 [Option ID = 3559]
5)
6)
7)
8)
9)
Consider a complete binary tree where the left and the right subtrees of the root are min-heaps. The lower
bound for the operations to convert the tree to a heap is: [Question ID = 882]
1. [Option ID = 3527]
2. [Option ID = 3526]
3. [Option ID = 3528]
4. [Option ID = 3525]
Correct Answer :-
[Option ID = 3526]
Let the content of address part of instruction be 1234H and the content of base register be 0236H. Give the
address of memory location addressed if base register addressing mode is used. [Question ID = 895]
1. 146BH [Option ID = 3580]
2. 1234H [Option ID = 3577]
3. 146AH [Option ID = 3579]
4. 1470H [Option ID = 3578]
Correct Answer :-
146AH [Option ID = 3579]
In which routing method do all the routers have a common database? [Question ID = 885]
1. Link State [Option ID = 3538]
2. Link Vector [Option ID = 3539]
3. Distance Vector [Option ID = 3537]
4. Shortest Path Routing [Option ID = 3540]
Correct Answer :-
Link State [Option ID = 3538]
If a network designer wants to connect 5 routers as point-to-point simplex line, then total number of lines
required would be: [Question ID = 884]
1. 32 [Option ID = 3536]
2. 5 [Option ID = 3533]
3. 20 [Option ID = 3535]
4. 10 [Option ID = 3534]
Correct Answer :-
10 [Option ID = 3534]
PM-CMM stands for: [Question ID = 894]
1. Project Management Capability Maturity Model [Option ID = 3576]
2. Process Management Capability Maturity Model [Option ID = 3574]
3. People Management Capability Maturity Model [Option ID = 3573]
4. Product Management Capability Maturity Model [Option ID = 3575]
Correct Answer :-
People Management Capability Maturity Model [Option ID = 3573]
10)
11)
12)
13)
14)
15)
What scheduling policy will you use when the system?s efficiency is measured by the percentage of jobs
completed? [Question ID = 889]
1. All of the these [Option ID = 3556]
2. Round Robin [Option ID = 3554]
3. FCFS [Option ID = 3553]
4. Shortest Job First [Option ID = 3555]
Correct Answer :-
Shortest Job First [Option ID = 3555]
A binary ripple counter is required to count 0 to 16383. How many flip-flops are required? [Question ID =
899]
1. 8191 [Option ID = 3594]
2. 512 [Option ID = 3595]
3. 14 [Option ID = 3596]
4. 16382 [Option ID = 3593]
Correct Answer :-
14 [Option ID = 3596]
Which model in system modelling depicts the dynamic behaviour of the system? [Question ID = 893]
1. Object Model [Option ID = 3572]
2. Context Model [Option ID = 3569]
3. Data Model [Option ID = 3571]
4. Behavioural Model [Option ID = 3570]
Correct Answer :-
Behavioural Model [Option ID = 3570]
Let S
3
be the group of permutations on S = {1, 2, 3}. Let H = {I, (12)} and {I, (1,2,3), (1, 3, 2)}.
Then which of the following is true?
[Question ID = 53420]
1. HK is a subgroup of S
3
and HK is not commutative. [Option ID = 93667]
2. HK ? S
3
[Option ID = 93665]
3. HK is a commutative subgroup of S
3.
[Option ID = 93668]
4. HK is not a subgroup of S
3
[Option ID = 93666]
Correct Answer :-
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 7 are: [Question ID = 881]
1. 255 and 8, respectively [Option ID = 3521]
2. 127 and 8, respectively [Option ID = 3523]
3. 256 and 7, respectively [Option ID = 3522]
4. 128 and 7, respectively [Option ID = 3524]
Correct Answer :-
255 and 8, respectively [Option ID = 3521]
16)
17)
[Question ID = 898]
1. [Option ID = 3591]
2. [Option ID = 3589]
3. [Option ID = 3590]
4. [Option ID = 3592]
Correct Answer :-
[Option ID = 3589]
[Question ID = 903]
1. [Option ID = 3611]
2. [Option ID = 3609]
3. [Option ID = 3612]
4. [Option ID = 3610]
Correct Answer :-
[Option ID = 3610]
[Question ID = 906]
1. [Option ID = 3624]
2. [Option ID = 3621]
3. [Option ID = 3623]
4. [Option ID = 3622]
Correct Answer :-
[Option ID = 3621]
18)
19)
20)
21)
[Question ID = 912]
1. [Option ID = 3648]
2. [Option ID = 3645]
3. [Option ID = 3646]
4. [Option ID = 3647]
Correct Answer :-
[Option ID = 3645]
[Question ID = 909]
1. [Option ID = 3636]
2. [Option ID = 3634]
3. [Option ID = 3635]
4. [Option ID = 3633]
Correct Answer :-
[Option ID = 3633]
[Question ID = 901]
1. [Option ID = 3603]
2. [Option ID = 3604]
3. [Option ID = 3601]
4. [Option ID = 3602]
Correct Answer :-
[Option ID = 3604]
22)
23)
[Question ID = 875]
1. [Option ID = 3497]
2. [Option ID = 3500]
3. [Option ID = 3499]
4. [Option ID = 3498]
Correct Answer :-
[Option ID = 3497]
[Question ID = 878]
1. iv, ii, i, iii [Option ID = 3511]
2. iv, i, ii, iii [Option ID = 3512]
3. iii, i, iv, ii [Option ID = 3510]
4. iii, ii, i, iv [Option ID = 3509]
Correct Answer :-
iv, ii, i, iii [Option ID = 3511]
[Question ID = 883]
1. [Option ID = 3532]
24)
25)
26)
2. [Option ID = 3530]
3. [Option ID = 3529]
4. [Option ID = 3531]
Correct Answer :-
[Option ID = 3531]
[Question ID = 914]
1. [Option ID = 3656]
2. [Option ID = 3654]
3. [Option ID = 3653]
4. [Option ID = 3655]
Correct Answer :-
[Option ID = 3655]
[Question ID = 876]
1. [Option ID = 3503]
2. [Option ID = 3504]
3. [Option ID = 3502]
4. [Option ID = 3501]
Correct Answer :-
[Option ID = 3504]
27)
28)
29)
[Question ID = 904]
1. both conjugate complex numbers. [Option ID = 3616]
2. both irrational numbers. [Option ID = 3615]
3. both rational numbers, other than integers. [Option ID = 3614]
4. integers of unlike signs [Option ID = 3613]
Correct Answer :-
both irrational numbers. [Option ID = 3615]
[Question ID = 908]
1. [Option ID = 3630]
2. [Option ID = 3632]
3. [Option ID = 3631]
4. [Option ID = 3629]
Correct Answer :-
[Question ID = 910]
1. [Option ID = 3637]
2. [Option ID = 3640]
3. [Option ID = 3638]
4. [Option ID = 3639]
Correct Answer :-
[Option ID = 3640]
30)
31)
[Question ID = 892]
1. {A, B, D} [Option ID = 3566]
2. {A} [Option ID = 3568]
3. {A, B, D, G, H} [Option ID = 3567]
4. {A, B} [Option ID = 3565]
Correct Answer :-
{A, B, D} [Option ID = 3566]
[Question ID = 891]
1. All branches that have greater assets than all branches in Patna. [Option ID = 3562]
2. The branch that has greatest asset in Patna [Option ID = 3563]
3. All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
4. Any branch that has greater assets than any branch in Patna. [Option ID = 3564]
Correct Answer :-
All branches that have greater assets than some branch located in Patna. [Option ID = 3561]
[Question ID = 913]
1. [Option ID = 3649]
2. [Option ID = 3650]
3. [Option ID = 3651]
4. [Option ID = 3652]
Correct Answer :-
32)
33)
34)
[Option ID = 3651]
[Question ID = 911]
1. [Option ID = 3643]
2. [Option ID = 3644]
3. [Option ID = 3642]
4. [Option ID = 3641]
Correct Answer :-
[Option ID = 3644]
[Question ID = 902]
1. Rank of T is 3. [Option ID = 3606]
2. Rank of T is 2. [Option ID = 3605]
3. Nullity of T is 2. [Option ID = 3608]
4. Nullity of T is 3. [Option ID = 3607]
Correct Answer :-
Rank of T is 3. [Option ID = 3606]
[Question ID = 905]
1. 6 [Option ID = 3618]
2. 7 [Option ID = 3617]
3. 5 [Option ID = 3619]
4. 4 [Option ID = 3620]
Correct Answer :-
6 [Option ID = 3618]
35)
36)
37)
38)
[Question ID = 877]
1. [Option ID = 3508]
2. [Option ID = 3505]
3. [Option ID = 3507]
4. [Option ID = 3506]
Correct Answer :-
[Option ID = 3505]
[Question ID = 907]
1. 6 [Option ID = 3625]
2. 5 [Option ID = 3626]
3. 3 [Option ID = 3628]
4. 4 [Option ID = 3627]
Correct Answer :-
6 [Option ID = 3625]
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3,
9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First
In First Out (FIFO) and Least Recently Used (LRU)? [Question ID = 888]
1. FIFO incurs 2 more page faults than LRU [Option ID = 3550]
2. FIFO incurs 1 more page faults than LRU [Option ID = 3552]
3. Both incur the same number of page faults [Option ID = 3549]
4. LRU incurs 2 more page faults than FIFO [Option ID = 3551]
Correct Answer :-
Both incur the same number of page faults [Option ID = 3549]
Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by
chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum,
minimum, and average chain lengths in the hash table, respectively, are [Question ID = 879]
1. 3, 3, and 3 [Option ID = 3514]
2. 4, 0, and 1 [Option ID = 3515]
3. 3, 0, and 1 [Option ID = 3513]
4. 3, 0, and 2 [Option ID = 3516]
39)
40)
1)
Correct Answer :-
3, 0, and 1 [Option ID = 3513]
How many 8-bit characters can be transmitted per second over a 7200 baud serial communication link
using asynchronous mode of transmission with one start bit, eight data bits, one parity bit, and two stop bits:
[Question ID = 886]
1. 800 [Option ID = 3543]
2. 600 [Option ID = 3541]
3. 900 [Option ID = 3544]
4. 700 [Option ID = 3542]
Correct Answer :-
600 [Option ID = 3541]
Let G be a graph with n vertices and m edges. What is the upper bound on the running time of depth first
search on G, when G is represented as an adjacency matrix?
[Question ID = 880]
1. ? (m) [Option ID = 3519]
2. ? (n+m) [Option ID = 3518]
3. ? (n) [Option ID = 3517]
4. ? (n
2
) [Option ID = 3520]
Correct Answer :-
? (n
2
) [Option ID = 3520]
Topic:- DU_J18_MSC_CS_Topic02
2)
How does Maharashtra plan to expand the service further? [Question ID = 1024]
1. All of the these. [Option ID = 4096]
2. The state is looking to extend this service to more areas. [Option ID = 4093]
3. It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
4. It may provide this service in other states as well. [Option ID = 4095]
Correct Answer :-
It is now planning to introduce this service in remote rural and tribal areas in the state. [Option ID = 4094]
3)
Mark the statement that is NOT true: [Question ID = 1025]
1. Not many people know that the service is quite free. [Option ID = 4100]
2. Locating the place from where the call has come is often a challenge in Mumbai [Option ID = 4099]
3. The service is meant for and availed of by people living in slums. [Option ID = 4098]
4. The free service has still remained relatively low-key. [Option ID = 4097]
Correct Answer :-
The service is meant for and availed of by people living in slums. [Option ID = 4098]
4)
What advantage does Ambulance 108 enjoy over regular ambulance?
[Question ID = 53418]
1. It is far more user-friendly. [Option ID = 93658]
2. It provides medical aid that regular ambulance cannot. [Option ID = 93657]
3. It consists of dedicated medical practitioners. [Option ID = 93660]
4. It can reach the patient in need of ambulance earlier. [Option ID = 93659]
Correct Answer :-
It can reach the patient in need of ambulance earlier. [Option ID = 93659]
5)
What makes this ambulance service quite different from conventional ambulance service? [Question ID =
1023]
1. It has a more human touch as it renders both medical and psychological firstaid. [Option ID = 4091]
2. It is faster. [Option ID = 4089]
3. It is availed of mostly by people living in slums in Mumbai. [Option ID = 4090]
4. All of the these. [Option ID = 4092]
Correct Answer :-
All of the these. [Option ID = 4092]
1)
What has been the impact of this scheme elsewhere? [Question ID = 1022]
1. Several other States have started similar service. [Option ID = 4085]
2. All of the these. [Option ID = 4088]
3. This service has been extended to some other States as well. [Option ID = 4086]
4. This service is now available in Karnataka, Punjab and West Bengal. [Option ID = 4087]
Correct Answer :-
Several other States have started similar service. [Option ID = 4085]
Topic:- DU_J18_MSC_CS_Topic03
2)
Mark the statement that is NOT true: [Question ID = 1031]
1. Once we find an easier way to do something, we don?t want to do it the earlier way. [Option ID = 4121]
2. We don?t want to vote in election because waiting in a line irritates us. [Option ID = 4123]
3. The little guy cannot compete with the monopoly businesses. [Option ID = 4124]
4. Monopolies are bad for ordinary consumers and workers alike. [Option ID = 4122]
Correct Answer :-
We don?t want to vote in election because waiting in a line irritates us. [Option ID = 4123]
3)
How does convenience make us intolerant of things that are not convenient? [Question ID = 1030]
1. The creed of convenience teaches you to do nothing that demands effort. [Option ID = 4118]
2. We have got used to easy life and shun all inconvenience in life. [Option ID = 4119]
3. We don?t want to do things we don?t like. [Option ID = 4117]
4. We only like what others tell us. [Option ID = 4120]
Correct Answer :-
The creed of convenience teaches you to do nothing that demands effort. [Option ID = 4118]
4)
This massive force is changing the economy and politics in ways that hurt the ?little guy?? Who is this ?little
guy?? [Question ID = 1027]
1. The ordinary consumer. [Option ID = 4105]
2. The small businessman or manufacturer. [Option ID = 4106]
3. The ordinary citizen. [Option ID = 4107]
4. All of the these. [Option ID = 4108]
Correct Answer :-
The small businessman or manufacturer. [Option ID = 4106]
5)
?Convenience and monopoly seem to be natural bedfellows.? How? [Question ID = 1028]
1. Only big business monopolies can provide convenience in products and services. [Option ID = 4110]
2. They are always found together in business world. [Option ID = 4109]
3. They help each other. [Option ID = 4111]
4. All of the these. [Option ID = 4112]
Correct Answer :-
Only big business monopolies can provide convenience in products and services. [Option ID = 4110]
?Social media represent the second wave of convenience.? ?What is this second wave of convenience??
[Question ID = 1029]
1. It has made our lives easier still. [Option ID = 4113]
2. It has freed us from mental exertion. [Option ID = 4114]
3. The convenience provided by internet services to do jobs like paying bills from home. [Option ID = 4115]
4. All of the these. [Option ID = 4116]
Correct Answer :-
All of the these. [Option ID = 4116]
FirstRanker.com - FirstRanker's Choice
This post was last modified on 29 January 2020