Register
Filter

Recent questions without answers

0 votes
0 answers
301
UGC NET CSE | June 2008 | Part 2 | Question: 34
Dead-code elimination in machine code optimization refers to : removal of all labels. removal of values that never get used. removal of function which are not involved. removal of a module after its use.
Dead-code elimination in machine code optimization refers to :removal of all labels.removal of values that never get used.removal of function which are not involved.remov...
User Avatar
0 votes
0 answers
302
UGC NET CSE | June 2008 | Part 2 | Question: 35
A parse tree is an annotated parse tree if : it shows attribute values at each node. there are no inherited attributes. it has synthesized nodes as terminal nodes. every non-terminal nodes is an inherited attribute.
A parse tree is an annotated parse tree if :it shows attribute values at each node.there are no inherited attributes.it has synthesized nodes as terminal nodes.every non-...
User Avatar
0 votes
0 answers
303
UGC NET CSE | June 2008 | Part 2 | Question: 36
An example of a non-preemptive $\text{CPU}$ scheduling algorithm is : Shortest job first scheduling. Round robin scheduling. Priority scheduling. Fair share scheduling.
An example of a non-preemptive $\text{CPU}$ scheduling algorithm is :Shortest job first scheduling.Round robin scheduling.Priority scheduling.Fair share scheduling.
User Avatar
0 votes
0 answers
304
UGC NET CSE | June 2008 | Part 2 | Question: 37
There are ' $n$ ' processes in memory. A process spends a fraction ' $p$ ' of its time waiting for $\mathrm{I} / \mathrm{O}$ to complete. The CPU utilization is given by : $p^{n}$ $1-p^{n}$ $(1-p)^{n}$ $1-n p$
There are ' $n$ ' processes in memory. A process spends a fraction ' $p$ ' of its time waiting for $\mathrm{I} / \mathrm{O}$ to complete. The CPU utilization is given by ...
User Avatar
0 votes
0 answers
305
UGC NET CSE | June 2008 | Part 2 | Question: 38
An example of a memory management system call in $\text{UNIX}$ is : fork. mmap. sigaction. execve.
An example of a memory management system call in $\text{UNIX}$ is :fork.mmap.sigaction.execve.
User Avatar
0 votes
0 answers
306
UGC NET CSE | June 2008 | Part 2 | Question: 39
With $64$ bit virtual addresses, a $4 \mathrm{~KB}$ page and $256 \mathrm{MB}$ of RAM, an inverted page table requires : $8192$ entries. $16384$ entries. $32768$ entries. $65536$ entries.
With $64$ bit virtual addresses, a $4 \mathrm{~KB}$ page and $256 \mathrm{MB}$ of RAM, an inverted page table requires :$8192$ entries.$16384$ entries.$32768$ entries.$65...
User Avatar
0 votes
0 answers
307
UGC NET CSE | June 2008 | Part 2 | Question: 40
A computer has $6$ tape drives with ' $n$ ' processes competing for them. Each process may need two drives. For which values of ' $n$ ' is the system deadlock free? $1$ $2$ $3$ $6$
A computer has $6$ tape drives with ' $n$ ' processes competing for them. Each process may need two drives. For which values of ' $n$ ' is the system deadlock free?$1$$2$...
User Avatar
0 votes
0 answers
308
UGC NET CSE | June 2008 | Part 2 | Question: 41
Water fall model for software development is : a top down approach. a bottom up approach. a sequential approach. a consequential approach.
Water fall model for software development is :a top down approach.a bottom up approach.a sequential approach.a consequential approach.
User Avatar
0 votes
0 answers
309
UGC NET CSE | June 2008 | Part 2 | Question: 43
While designing the user interface, one should : use as many short cuts as possible. use as many defaults as possible. use as many visual layouts as possible. reduce the demand on short-term memory.
While designing the user interface, one should :use as many short cuts as possible.use as many defaults as possible.use as many visual layouts as possible.reduce the dema...
User Avatar
0 votes
0 answers
310
UGC NET CSE | June 2008 | Part 2 | Question: 44
In software cost estimation, base estimation is related to : cost of similar projects already completed. cost of the base model of the present project. cost of the project with the base minimum profit. cost of the project under ideal situations.
In software cost estimation, base estimation is related to :cost of similar projects already completed.cost of the base model of the present project.cost of the project w...
User Avatar
0 votes
0 answers
311
UGC NET CSE | June 2008 | Part 2 | Question: 45
In clean room software engineering : only eco-friendly hardware is used. only hired facilities are used for development. correctness of the code is verified before testing. implementation is done only after ensuring correctness.
In clean room software engineering :only eco-friendly hardware is used.only hired facilities are used for development.correctness of the code is verified before testing.i...
User Avatar
0 votes
0 answers
313
UGC NET CSE | June 2008 | Part 2 | Question: 47
With reference to cluster analysis in data mining, a distance measure that is NOT used is : Euclidean distance. Manhattan distance. Chebychev's distance. Lee distance.
With reference to cluster analysis in data mining, a distance measure that is NOT used is :Euclidean distance.Manhattan distance.Chebychev's distance.Lee distance.
User Avatar
0 votes
0 answers
314
UGC NET CSE | June 2008 | Part 2 | Question: 48
In a mobile communication system, a geographic region is divided into cells. For each frequency set, there is a buffer _________ wide where that frequency is not used. one-cell two-cells three-cells four-cells
In a mobile communication system, a geographic region is divided into cells. For each frequency set, there is a buffer _________ wide where that frequency is not used.one...
User Avatar
0 votes
0 answers
318
#self doubt
Are these topics in the Gate 2024 syllabus? clocks, simple interest, time work, profit loss, and some other quantitative aptitude topics I found it in some mock tests.
Are these topics in the Gate 2024 syllabus?clocks, simple interest, time work, profit loss, and some other quantitative aptitude topics I found it in some mock tests.
User Avatar
0 votes
0 answers
319
Made easy test series
Consider a strongly connected directed graph G(V, F), where |V| = 101. The minimum possible value of IEl is
Consider a strongly connected directed graph G(V, F), where |V| = 101. The minimum possible value of IEl is
User Avatar
0 votes
0 answers
323
GATE PYQ
S := 0 i := 1 L1: if i > n goto L2 t := i * i S := S + t i := i + 1 goto L1 L2: return S what is Control FLow Graph for this and GEN KILL for all BB ?
S := 0i := 1L1: if i n goto L2t := i * iS := S + ti := i + 1goto L1L2: return S what is Control FLow Graph for this and GEN KILL for all BB ?
User Avatar
0 votes
0 answers
324
#Applied Course
what should be correct according to gate PYQs?
what should be correct according to gate PYQs?
User Avatar
0 votes
0 answers
325
testbook
Can you help me understand the last 2 options
Can you help me understand the last 2 options
User Avatar
0 votes
0 answers
330
Worksheet on Recurrence Relation
Find recurrence relations that are satisfied by the sequence formed from the following functions. (a) an = n!/15! (b) an = n2 − 6n + 8
Find recurrence relations that are satisfied by the sequence formed from the followingfunctions.(a) an = n!/15! (b) an = n2 − 6n + 8
User Avatar
Page: