Register

Recent questions tagged isro2008

5 votes
7 answers
61
ISRO2008-52
Dynamic address translation is part of the operating system paging algorithm is useless when swapping is used is the hardware necessary to implement paging storage pages at a specific location on disk
Dynamic address translationis part of the operating system paging algorithmis useless when swapping is usedis the hardware necessary to implement pagingstorage pages at a...
User Avatar
3 votes
2 answers
62
ISRO2008-53
Thrashing always occurs on large computers is a natural consequence of virtual memory systems can always be avoided by swapping can be caused by poor paging algorithms
Thrashingalways occurs on large computersis a natural consequence of virtual memory systemscan always be avoided by swappingcan be caused by poor paging algorithms
User Avatar
10 votes
3 answers
63
ISRO2008-62
In which of the following four necessary conditions for deadlock processes claim exclusive control of the resources they require? no preemption mutual exclusion circular wait hold and wait
In which of the following four necessary conditions for deadlock processes claim exclusive control of the resources they require?no preemptionmutual exclusioncircular wai...
User Avatar
10 votes
4 answers
64
ISRO2008-68
Which of the following class of statement usually produces no executable code when compiled? declaration assignment statements input and output statements structural statements
Which of the following class of statement usually produces no executable code when compiled?declarationassignment statementsinput and output statementsstructural statemen...
User Avatar
2 votes
5 answers
65
ISRO2008-76
The minimum number of fields with each node of doubly linked list is 1 2 3 4
The minimum number of fields with each node of doubly linked list is1234
User Avatar
23 votes
1 answer
68
GATE CSE 1996 | Question: 1.19, ISRO2008-61
A critical section is a program segment which should run in a certain amount of time which avoids deadlocks where shared resources are accessed which must be enclosed by a pair of semaphore operations, $P$ and $V$
A critical section is a program segmentwhich should run in a certain amount of timewhich avoids deadlockswhere shared resources are accessedwhich must be enclosed by a pa...
User Avatar
34 votes
3 answers
71
GATE CSE 1997 | Question: 3.10, ISRO2008-57, ISRO2015-64
Dirty bit for a page in a page table helps avoid unnecessary writes on a paging device helps maintain LRU information allows only read on a page None of the above
Dirty bit for a page in a page tablehelps avoid unnecessary writes on a paging devicehelps maintain LRU informationallows only read on a pageNone of the above
User Avatar
26 votes
3 answers
73
GATE CSE 1998 | Question: 1.25, ISRO2008-41
In a resident – OS computer, which of the following systems must reside in the main memory under all situations? Assembler Linker Loader Compiler
In a resident – OS computer, which of the following systems must reside in the main memory under all situations?AssemblerLinkerLoaderCompiler
User Avatar
25 votes
2 answers
74
GATE CSE 1998 | Question: 1.21, ISRO2008-16
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph? Dynamic programming Backtracking Greedy Divide and Conquer
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?Dynamic programmingBacktrackingGreedyDivide and Conqu...
User Avatar
23 votes
6 answers
75
GATE CSE 1999 | Question: 2-18, ISRO2008-46
Raid configurations of the disks are used to provide Fault-tolerance High speed High data density (A) & (B)
Raid configurations of the disks are used to provideFault-tolerance High speedHigh data density(A) & (B)
User Avatar
28 votes
3 answers
76
GATE CSE 2004 | Question: 31, ISRO2008-40
Consider the following C function: int f(int n) { static int i = 1; if(n >= 5) return n; n = n+i; i++; return f(n); } The value returned by $f(1)$ is: $5$ $6$ $7$ $8$
Consider the following C function:int f(int n) { static int i = 1; if(n >= 5) return n; n = n+i; i++; return f(n); }The value returned by $f(1)$ is:$5$$6$$7$$8$
User Avatar
29 votes
3 answers
77
GATE CSE 2002 | Question: 2.6, ISRO2008-19
The performance of a pipelined processor suffers if: the pipeline stages have different delays consecutive instructions are dependent on each other the pipeline stages share hardware resources All of the above
The performance of a pipelined processor suffers if:the pipeline stages have different delaysconsecutive instructions are dependent on each otherthe pipeline stages share...
User Avatar
39 votes
8 answers
78
GATE CSE 2002 | Question: 1.25, ISRO2008-30, ISRO2016-6
The maximum number of edges in a $n$-node undirected graph without self loops is $n^2$ $\frac{n(n-1)}{2}$ $n-1$ $\frac{(n+1)(n)}{2}$
The maximum number of edges in a $n$-node undirected graph without self loops is$n^2$$\frac{n(n-1)}{2}$$n-1$$\frac{(n+1)(n)}{2}$
User Avatar
44 votes
5 answers
79
GATE CSE 2001 | Question: 1.7, ISRO2008-18
More than one word are put in one cache block to: exploit the temporal locality of reference in a program exploit the spatial locality of reference in a program reduce the miss penalty none of the above
More than one word are put in one cache block to:exploit the temporal locality of reference in a programexploit the spatial locality of reference in a programreduce the m...
User Avatar
41 votes
6 answers
80
GATE CSE 2000 | Question: 1.20, ISRO2008-47
Which of the following need not necessarily be saved on a context switch between processes? General purpose registers Translation look-aside buffer Program counter All of the above
Which of the following need not necessarily be saved on a context switch between processes?General purpose registersTranslation look-aside bufferProgram counterAll of the...
User Avatar
Page: