Download DUET Master 2018 DU MSc Computer Science Question Paper With Answer Key

Download DUET (Delhi University Entrance Test conducted by the NTA) 2018 DU MSc Computer Science Question Paper With Solution Key

This post was last modified on 29 January 2020

Download Document

UGC-NET Last 10 Years 2011-2021 Previous Question Papers

FirstRanker.com

DU MSc Computer Science

Topic:- DU_J18_MSC_CS_Topic01

--- Content provided by‌ FirstRanker.com ---

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 :-
--- Content provided by‌ FirstRanker.com ---
- 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]
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. O (n) [Option ID = 3527]
2. O (lgn) [Option ID = 3526]
3. O (nlgn) [Option ID = 3528]
4. O (1) [Option ID = 3525]
Correct Answer :-
- O (lgn) [Option ID = 3526]

--- Content provided by⁠ FirstRanker.com ---

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 :-
--- Content provided by⁠ FirstRanker.com ---
- 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]
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]

--- Content provided by‍ FirstRanker.com ---

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 :-
--- Content provided by‌ FirstRanker.com ---
- 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₃ 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₃ and HK is not commutative. [Option ID = 93667]
2. HK ? S₃ [Option ID = 93665]
3. HK is a commutative subgroup of S₃. [Option ID = 93668]
4. HK is not a subgroup of S₃ [Option ID = 93666]
Correct Answer :-

--- Content provided by⁠ FirstRanker.com ---

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 :-
--- Content provided by FirstRanker.com ---
- 255 and 8, respectively [Option ID = 3521]
The simplified function in product of sums of Boolean function F (W, X, Y, Z) = S (0, 1, 2, 5, 8, 9, 10) is: [Question ID = 898]
1. (W' + X') (Y' + Z) (X' + Z) [Option ID = 3591]
2. (W' + X') (Y' + Z') (X' + Z) [Option ID = 3589]
3. (W' + X') (Y' + Z') (X' + Z') [Option ID = 3590]
4. (W' + X') (Y + Z') (X' + Z) [Option ID = 3592]
Correct Answer :-
- (W' + X') (Y' + Z') (X' + Z) [Option ID = 3589]
If a = cos(^2p/₇) + i sin(^2p/₇), b = a + a² + a⁴ and c = a³ + a⁵ + a⁶, then b² and c² are the roots of the equation: [Question ID = 903]
1. x³ + 3x - 4 = 0. [Option ID = 3611]
2. x³-3x - 4 = 0. [Option ID = 3609]
3. x³-3x + 4 = 0. [Option ID = 3612]
4. x³ + 3x + 4 = 0. [Option ID = 3610]
Correct Answer :-
- x³ + 3x + 4 = 0. [Option ID = 3610]
If z = cot^-1(^x-y/_vx²+y²) satisfies x ^?z/_?x + y ^?z/_?y = k sin 2z, then k is equal to: [Question ID = 906]
1. ¹/₄ [Option ID = 3624]
2. ^-1/₄ [Option ID = 3621]
3. ¹/₂ [Option ID = 3623]
4. ^-1/₂ [Option ID = 3622]
Correct Answer :-
- ^-1/₄ [Option ID = 3621]
If u = ^r/_r, where r = |r| = |xi + yj + zk|, then curl u is equal to: [Question ID = 912]
1. -k [Option ID = 3648]
2. 0 [Option ID = 3645]
3. i [Option ID = 3646]
4. j [Option ID = 3647]
Correct Answer :-
- 0 [Option ID = 3645]

--- Content provided by⁠ FirstRanker.com ---

Two circles are drawn passing through the points (0, 1) and (0, -1). Both these circles touch the line, y = mx + n. If they intersect orthogonally, then n² is equal to: [Question ID = 909]
1. m² - 2 [Option ID = 3636]
2. m² + 1 [Option ID = 3634]
3. m²-1 [Option ID = 3635]
4. m² + 2 [Option ID = 3633]
Correct Answer :-
--- Content provided by‍ FirstRanker.com ---
- m² + 2 [Option ID = 3633]
Let I be an ideal of a ring R. If A = {x ? R: rx ? I ? r ? R}, then A is [Question ID = 901]
1. An ideal of R but I ? A. [Option ID = 3603]
2. An ideal of R and I ? A. [Option ID = 3604]
3. Not a subring of R. [Option ID = 3601]
4. A subring of R but not an ideal of R. [Option ID = 3602]
Correct Answer :-
- An ideal of R and I ? A. [Option ID = 3604]
The following postfix expression with single digit operands is evaluated using a Stack: 8 2 3 ^ / 2 4 * + 6 2 * - Not that ^ is the exponentiation operator. The top two elements of the stack, after the first * is evaluated, are [Question ID = 875]
1. 8, 1 [Option ID = 3497]
2. 3, 2 [Option ID = 3500]
3. 9, 5 [Option ID = 3499]
4. 5, 9 [Option ID = 3498]
Correct Answer :-
- 8, 1 [Option ID = 3497]
Consider a list of recursive algorithms and a list of recurrence relations as given below, and indicate which list correctly maps the recurrence relations to the list of algorithms: a, b, c, d:
List-I
a. Binary Search
b. Merge Sort
--- Content provided by⁠ FirstRanker.com ---
c. Quicksort
d. Tower of Hanoi
List-II
i. T(n) = T(n-k) + T(k) + cn
ii. T(n) = 2 T(n/2) + kn
--- Content provided by‍ FirstRanker.com ---
iii. T(n) = 2T(n/2) + 1
iv T(n) = T(n/2) + 1
[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]
Let A and B be sets and A' and B' denote compliments of the sets A and B. The set (A - B) U (B-A) U (A n B) [Question ID = 883]
1. A'UB' [Option ID = 3532]
2. A'n B' [Option ID = 3530]
3. A n B [Option ID = 3529]
4. A U B [Option ID = 3531]
Correct Answer :-
- A U B [Option ID = 3531]
If on an average, one vessel in every ten is wrecked, and the probability that out of 5 vessels expected to arrive, at least 4 vessels reach safely is K (⁴/₁₀), then K is equal to: [Question ID = 914]
1. 1.6 [Option ID = 3656]
2. 1.3 [Option ID = 3654]
3. 1.2 [Option ID = 3653]
4. 1.4 [Option ID = 3655]
Correct Answer :-
- 1.4 [Option ID = 3655]
An array A of size 50 x 50 is defined as follows: A[i, j] = i -j, 1 <= i <= 50, 1 <= j <= 50 The sum of the elements of the array A is [Question ID = 876]
1. 49 [Option ID = 3503]
2. 0 [Option ID = 3504]
3. 2352 [Option ID = 3502]
4. 63750 [Option ID = 3501]
Correct Answer :-
- 0 [Option ID = 3504]

--- Content provided by FirstRanker.com ---

If the products of two roots of the equation, x⁴ - 10x² + 9x - 2 = 0 is unity, then the remaining two roots of this equation are:
[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]
The line ? = ^p/₃ divides the length of the curve, r = 2(1 + cos?) in the first quadrant, in the ratio: [Question ID = 908]
1. 1:3 [Option ID = 3630]
2. 1:1 [Option ID = 3632]
3. 1:2 [Option ID = 3631]
4. 2:3 [Option ID = 3629]
Correct Answer :-
If a variable plane passing through a fixed point (a, b, c) cuts the coordinate axes at the points P, Q and R, then the locus of the centres of the spheres through O (origin), P, Q, and R, is: [Question ID = 910]
1. ^a/_x + ^b/_y + ^c/_z = 1 [Option ID = 3637]
2. ^a/_x + ^b/_y + ^c/_z = 2 [Option ID = 3640]
3. ^x-a/_x + ^b/_y + ^c/_z = 2 [Option ID = 3638]
4. ^a/_x + ^b/_y + ^c/_z = 1 [Option ID = 3639]
Correct Answer :-
- ^a/_x + ^b/_y + ^c/_z = 2 [Option ID = 3640]
Consider the relation scheme R=(A, B, C, D, E, F, G, H, I, J) and the set of functional dependencies {{A, B} ? {C}, {B} ? {E, F}, {A, D} ? {G, H}, {G} ? {I}, {H} ? {J}} on R. What is the key for R? [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]
The SQL expression: Select distinct T.branch_name from branch T, branch S where T. assests > S.assets and S.branch_city = "Patna" finds the names of [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]

--- Content provided by⁠ FirstRanker.com ---

Which of the following sequences <a_n> is not a Cauchy sequence where a_n is equal to: [Question ID = 913]
1. ¹/_n [Option ID = 3649]
2. ⁿ/_n+1 [Option ID = 3650]
3. 1 + ¹/₂ + ¹/₃ + ... + ¹/_n [Option ID = 3651]
4. ¹/_1! + ¹/_2! + ¹/_3! + ... + ¹/_n! [Option ID = 3652]
Correct Answer :-
--- Content provided by‌ FirstRanker.com ---
The Wronskian of the set {sin 2t, 2, cos 2t} is: [Question ID = 911]
1. 2³ [Option ID = 3643]
2. 2⁴ [Option ID = 3644]
3. -2⁴ [Option ID = 3642]
4. -2³ [Option ID = 3641]
Correct Answer :-
- 2⁴ [Option ID = 3644]
If T : R⁴ ? R³ be a linear transformation defined by T(X₁, X₂, X₃, X₄) = (X₁ - X₄, X₂ + X₃, X₃ - X₄), then [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]

--- Content provided by‌ FirstRanker.com ---

If x, y and z be three numbers satisfying
x + y + z = 1,
x² + y² + z² = 2,
and x³ + y³ + z³ = 3,
then the value of x⁵ + y⁵+ z⁵ is: [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]
If we use Radix sort to sort n integers in the range (n^1/2, n^k) for some k>0 which is independent of n, the time taken would be [Question ID = 877]
1. T (klgn) [Option ID = 3508]
2. T (kn) [Option ID = 3505]
3. T (nlgk) [Option ID = 3507]
4. T (k+n) [Option ID = 3506]
Correct Answer :-
- T (kn) [Option ID = 3505]
If f(x) = 2x - [x], where [x] stands for the greatest integer less than or equal to x, then ?₀³ f(x)dx is equal to: [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]

--- Content provided by FirstRanker.com ---

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 :-
--- Content provided by FirstRanker.com ---
- 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]
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. 0 (m) [Option ID = 3519]
2. O (n+m) [Option ID = 3518]
3. O (n) [Option ID = 3517]
4. O (n²) [Option ID = 3520]
Correct Answer :-
- O (n²) [Option ID = 3520]

Topic:- DU_J18_MSC_CS_Topic02

A pilot project of Maharashtra Emergency Medical Services (MEMS) runs the 108 ambulance service, to provide first-aid faster in the traffic-worn Mumbai. On getting
This download link is referred from the post: UGC-NET Last 10 Years 2011-2021 Previous Question Papers

--- Content provided by FirstRanker.com ---

This post was last modified on 29 January 2020

Get the MBBS Question Bank Android App

Download DUET Master 2018 DU MSc Computer Science Question Paper With Answer Key

Share This Post:

Share This Post: