Register

Recent questions tagged nielit2017dec-assistanta

1 votes
1 answer
33
NIELIT 2017 DEC Scientific Assistant A - Section B: 33
Which layer connects the network support layers and user support layers ? transport layer network layer data link layer session layer
Which layer connects the network support layers and user support layers ?transport layernetwork layerdata link layersession layer
User Avatar
4 votes
3 answers
34
NIELIT 2017 DEC Scientific Assistant A - Section B: 34
Process is in a ready state _______ . when process is scheduled to run after some execution when process is unable to run until some task has been completed when process is using the $CPU$ none of the options
Process is in a ready state _______ .when process is scheduled to run after some executionwhen process is unable to run until some task has been completedwhen process is ...
User Avatar
1 votes
2 answers
36
NIELIT 2017 DEC Scientific Assistant A - Section B: 36
The average search time of hashing, with linear probing will be less if the load factor : is far less than $1$ equals $1$ is far greater than $1$ none of the options
The average search time of hashing, with linear probing will be less if the load factor :is far less than $1$equals $1$is far greater than $1$none of the options
User Avatar
0 votes
2 answers
37
NIELIT 2017 DEC Scientific Assistant A - Section B: 37
How many times the word "PROCESS" will be printed when executing the following program ? main(){ printf("PROCESS"); fflush(); fork(); fork(); } $8$ $4$ $6$ $7$
How many times the word "PROCESS" will be printed when executing the following program ?main(){ printf("PROCESS"); fflush(); fork(); fork(); }$8$$4$$6$$7$
User Avatar
1 votes
1 answer
38
NIELIT 2017 DEC Scientific Assistant A - Section B: 38
If a planner graph, having $25$ vertices divides the plane into $17$ different regions. Then how many edges are used to connect the vertices in this graph. $20$ $30$ $40$ $50$
If a planner graph, having $25$ vertices divides the plane into $17$ different regions. Then how many edges are used to connect the vertices in this graph.$20$$30$$40$$50...
User Avatar
1 votes
2 answers
40
NIELIT 2017 DEC Scientific Assistant A - Section B: 40
What is the relation between $DFA$ and $NFA$ on the basis of computational power ? $DFA$ > $NFA$ $NFA$ > $DFA$ Equal Can't be said
What is the relation between $DFA$ and $NFA$ on the basis of computational power ?$DFA$ $NFA$$NFA$ $DFA$EqualCan't be said
User Avatar
1 votes
2 answers
41
NIELIT 2017 DEC Scientific Assistant A - Section B: 41
If a random coin is tossed $11$ times, then what is the probability that for $7$th toss head appears exactly $4$ times? $5/32$ $15/128$ $35/128$ None of the options
If a random coin is tossed $11$ times, then what is the probability that for $7$th toss head appears exactly $4$ times?$5/32$$15/128$$35/128$None of the options
User Avatar
3 votes
2 answers
43
NIELIT 2017 DEC Scientific Assistant A - Section B: 43
When we use slow-start algorithm, the size of the congestion window increases _______ until it reaches a threshold. Additively Multiplicatively Exponentially None of the options
When we use slow-start algorithm, the size of the congestion window increases _______ until it reaches a threshold.AdditivelyMultiplicativelyExponentiallyNone of the opti...
User Avatar
0 votes
1 answer
45
NIELIT 2017 DEC Scientific Assistant A - Section B: 45
In $IPv4$ Addresses, classfull addressing is replaced with : Classless Addressing Classfull Addressing Subnet Advertising None of the options
In $IPv4$ Addresses, classfull addressing is replaced with :Classless AddressingClassfull AddressingSubnet AdvertisingNone of the options
User Avatar
2 votes
1 answer
46
NIELIT 2017 DEC Scientific Assistant A - Section B: 46
An Ethernet destination address $07-01-12-03-04-05$ is : Unicast address Multicast address Broadcast address All of the options
An Ethernet destination address $07-01-12-03-04-05$ is : Unicast addressMulticast addressBroadcast addressAll of the options
User Avatar
1 votes
1 answer
47
NIELIT 2017 DEC Scientific Assistant A - Section B: 47
The open file table has a/an __________ associated with each file. file content file permission open count close count
The open file table has a/an __________ associated with each file.file contentfile permissionopen countclose count
User Avatar
1 votes
1 answer
48
NIELIT 2017 DEC Scientific Assistant A - Section B: 48
The process of loading the operating system into memory is called : Booting Spooling Thrashing Formatting
The process of loading the operating system into memory is called : BootingSpoolingThrashingFormatting
User Avatar
1 votes
2 answers
49
NIELIT 2017 DEC Scientific Assistant A - Section B: 49
Why is one - time password safe ? It is easy to generate It cannot b shared It is different for every access It can be easily decrypted
Why is one - time password safe ?It is easy to generateIt cannot b sharedIt is different for every accessIt can be easily decrypted
User Avatar
2 votes
1 answer
51
NIELIT 2017 DEC Scientific Assistant A - Section B: 51
The demerits of the fragmentation are : Complex routers Open to DOS attack No overlapping of fragments $\left (A \right)$ and $\left ( B \right)$ both
The demerits of the fragmentation are : Complex routersOpen to DOS attackNo overlapping of fragments$\left (A \right)$ and $\left ( B \right)$ both
User Avatar
2 votes
1 answer
52
NIELIT 2017 DEC Scientific Assistant A - Section B: 52
The address field of linked list : Contain address of next node May contain null character Contain address of next pointer Both $\left (A \right)$ and $\left ( B \right)$
The address field of linked list : Contain address of next node May contain null characterContain address of next pointerBoth $\left (A \right)$ and $\left ( B \right)$
User Avatar
5 votes
5 answers
53
NIELIT 2017 DEC Scientific Assistant A - Section B: 53
Given two sorted list of size '$m$' and '$n$' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be : $m^{*}n$ minimum of $m, n$ maximum of $m, n$ $m+n-1$
Given two sorted list of size '$m$' and '$n$' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be :$m^{*}n$minimum of $m,...
User Avatar
4 votes
4 answers
55
NIELIT 2017 DEC Scientific Assistant A - Section B: 55
In Boolean algebra $1+1+1+1\dots\dots 800$ times ones $=$ ______ . $1$ $0$ $11$ $800$
In Boolean algebra $1+1+1+1\dots\dots 800$ times ones $=$ ______ .$1$$0$$11$$800$
User Avatar
1 votes
1 answer
58
NIELIT 2017 DEC Scientific Assistant A - Section B: 58
Page fault frequency in an operating system is reduced when the : Process tend to be I/O bound Locality of reference is applicable to the process Size of pages is reduced Processes tend to be CPU bound
Page fault frequency in an operating system is reduced when the :Process tend to be I/O boundLocality of reference is applicable to the processSize of pages is reducedPro...
User Avatar
Page: