Register
Filter

Recent activity by ajit

1 answer
1
ISRO2014-30
Every time the attribute A appears, it is matched with the same value of attribute B but not the same value of attribute C. Which of the following is true? A -> (B,C) A -> B, A ->> C A -> B, C ->> A A ->> B, B -> C
Every time the attribute A appears, it is matched with the same value of attribute B but not the same value of attribute C. Which of the following is true?A - (B,C) ...
2 answers
2
ISRO2016-17
Which of the following binary number is the same as its $2's$ complement ? $1010$ $0101$ $1000$ $1001$
Which of the following binary number is the same as its $2's$ complement ?$1010$$0101$$1000$$1001$
10 answers
3
ISRO2015-38
Suppose two jobs, each of which needs $10$ minutes of CPU time, start simultaneously. Assume $50\%$ I/O wait time. How long will it take for both to complete, if they run sequentially? 10 20 30 40
Suppose two jobs, each of which needs $10$ minutes of CPU time, start simultaneously. Assume $50\%$ I/O wait time. How long will it take for both to complete, if they run...
2 answers
7
ISRO2008-4
On a LAN ,where are IP datagrams transported? In the LAN header In the application field In the information field of the LAN frame After the TCP header
On a LAN ,where are IP datagrams transported?In the LAN headerIn the application fieldIn the information field of the LAN frameAfter the TCP header
4 answers
8
GATE CSE 2016 Set 2 | Question: 32
The width of the physical address on a machine is $40$ bits. The width of the tag field in a $512$ KB $8$-way set associative cache is ________ bits.
The width of the physical address on a machine is $40$ bits. The width of the tag field in a $512$ KB $8$-way set associative cache is ________ bits.
4 answers
12
Why is the maximum number of tuples in full outer join equal to m*n ?
Why is the maximum number of tuples in full outer join equal to m*n, where m is the number of attributes in one relation and n is the attribute count in other ? Can someone give an example to illustrate this ?
Why is the maximum number of tuples in full outer join equal to m*n, where m is the number of attributes in one relation and n is the attribute count in other ?Can someon...
5 answers
13
ISRO2015-53
An ACK number of $1000$ in TCP always means that $999$ bytes have been successfully received $1000$ bytes have been successfully received $1001$ bytes have been successfully received None of the above
An ACK number of $1000$ in TCP always means that$999$ bytes have been successfully received$1000$ bytes have been successfully received$1001$ bytes have been successfully...
2 answers
14
ISRO2015-46
The correct syntax to write "Hi there" in Javascript is jscript.write ("Hi There") response.write ("Hi There") print ("Hi There") print.jscript ("Hi There")
The correct syntax to write "Hi there" in Javascript isjscript.write ("Hi There")response.write ("Hi There")print ("Hi There")print.jscript ("Hi There")
11 answers
15
ISRO2015-30
Semaphores are used to solve the problem of Race Condition Process Synchronization Mutual Exclusion None of the above I and II II and III All of the above None of the above
Semaphores are used to solve the problem ofRace ConditionProcess SynchronizationMutual ExclusionNone of the aboveI and IIII and IIIAll of the aboveNone of the above
3 answers
16
ISRO2015-4
A modulus -$12$ ring counter requires a minimum of $10$ flip-flops $12$ flip-flops $8$ flip-flops $6$ flip-flops
A modulus -$12$ ring counter requires a minimum of$10$ flip-flops$12$ flip-flops$8$ flip-flops$6$ flip-flops
5 answers
17
ISRO2015-7
If half adders and full adders are implements using gates, then for the addition of two $17$ bit numbers (using minimum gates) the number of half adders and full adders required will be $0,17$ $16,1$ $1,16$ $8,8$
If half adders and full adders are implements using gates, then for the addition of two $17$ bit numbers (using minimum gates) the number of half adders and full adders r...
5 answers
18
ISRO2015-55
A certain population of ALOHA users manages to generate $70$ request/sec. If the time is slotted in units of $50$ msec, then channel load would be $4.25$ $3.5$ $450$ $350$
A certain population of ALOHA users manages to generate $70$ request/sec. If the time is slotted in units of $50$ msec, then channel load would be$4.25$$3.5$$450$$350$
3 answers
19
ISRO2015-62
The minimum time delay between the initiation of two independent memory operations is called Access time Cycle time Rotational time Latency time
The minimum time delay between the initiation of two independent memory operations is calledAccess timeCycle timeRotational timeLatency time
5 answers
20
ISRO2015-68
Consider the following program fragment if(a > b) if(b > c) s1; else s2; s2 will be executed if a <= b b > c b >= c and a <= b a > b and b <= c
Consider the following program fragment if(a b) if(b c) s1; else s2;s2 will be executed ifa <= bb cb >= c and a <= ba b and b <= c
3 answers
21
ISRO2015-72
Consider the following declaration: int a, *b=&a, **c=&b; The following program fragment a=4; **c=5; does not change the value of a assigns address of $c$ to $a$ assigns the value of $b$ to $a$ assigns $5$ to $a$
Consider the following declaration:int a, *b=&a, c=&b;The following program fragmenta=4; c=5;does not change the value of aassigns address of $c$ to $a$assigns the valu...
3 answers
22
ISRO2015-18
Given a block can hold either $3$ records or $10$ key pointers. A database contains n records, then how many blocks do we need to hold the data file and the dense index $13n/30$ $n/3$ $n/10$ $n/30$
Given a block can hold either $3$ records or $10$ key pointers. A database contains n records, then how many blocks do we need to hold the data file and the dense index$1...
4 answers
23
ISRO2009-69
The 'command' used to change contents of one database using the contents of another database by linking them on a common key field? Replace Join Change Update
The 'command' used to change contents of one database using the contents of another database by linking them on a common key field?ReplaceJoinChangeUpdate
4 answers
24
ISRO2009-77
When a process is rolled back as a result of deadlock the difficulty which arises is Starvation System throughput Low device utilization Cycle stealing
When a process is rolled back as a result of deadlock the difficulty which arises isStarvationSystem throughputLow device utilizationCycle stealing
4 answers
26
ISRO2009-79
Compared to CISC processors,RISC processors contain More register and smaller instruction set larger instruction set less registers and smaller instruction set more transistor elements
Compared to CISC processors,RISC processors containMore register and smaller instruction setlarger instruction setless registers and smaller instruction setmore transisto...
1 answer
27
The process of organizing the memory into two banks to allow 8 and 16 bit data operation is called
The process of organizing the memory into two banks to allow 8 and 16 bit data operation is called a)Bank switching b)Indexed mapping c)Two-way memory interleaving d)Memory segmentation
The process of organizing the memory into two banks to allow 8 and 16 bit data operation is calleda)Bank switchingb)Indexed mappingc)Two-way memory interleavingd)Memory s...
1 answer
28
Which is the correct definition of a valid process transition in an operating system?
Which is the correct definition of a valid process transition in an operating system? a)Wake up:ready->running b)Dispatch:ready->running c)Block:ready->running d)Timer runout:ready->blocked
Which is the correct definition of a valid process transition in an operating system?a)Wake up:ready->runningb)Dispatch:ready->runningc)Block:ready->runningd)Timer runout...
2 answers
29
ISRO2011-69
Lightweight Directory Access protocol is used for Routing the packets Authentication obtaining IP address domain name resolving
Lightweight Directory Access protocol is used forRouting the packetsAuthenticationobtaining IP addressdomain name resolving
2 answers
30
ISRO2011-70
Number of comparisons required for an unsuccessful search of an element in a sequential search organized, fixed length, symbol table of length L is L L/2 (L+1)/2 2L
Number of comparisons required for an unsuccessful search of an element in a sequential search organized, fixed length, symbol table of length L isLL/2(L+1)/22L