Register
Filter

Recent questions in Others

1 votes
1 answer
91
UGC NET CSE | June 2008 | Part 2 | Question: 23
Which of the following is true for a sorted list with ' $n$ ... $\mathrm{O}(\log n)$ time.
Which of the following is true for a sorted list with ' $n$ ' elements?Insertion in a sorted array takes constant time.Insertion in a sorted linear linked list takes cons...
User Avatar
0 votes
1 answer
92
UGC NET CSE | June 2008 | Part 2 | Question: 24
Files that are related to input/output and are used to model serial $\text{I/O}$ devices such as terminals, printers and networks are called: regular files character special files directories block special files
Files that are related to input/output and are used to model serial $\text{I/O}$ devices such as terminals, printers and networks are called:regular filescharacter specia...
User Avatar
0 votes
0 answers
93
UGC NET CSE | June 2008 | Part 2 | Question: 25
An example of a possible file attribute is: minimum size permanent flag archive flag EBCDIC flag
An example of a possible file attribute is:minimum sizepermanent flagarchive flagEBCDIC flag
User Avatar
0 votes
0 answers
94
UGC NET CSE | June 2008 | Part 2 | Question: 26
The $\text{ATM}$ cells are __________ bytes long. $48$ $53$ $64$ $69$
The $\text{ATM}$ cells are __________ bytes long.$48$$53$$64$$69$
User Avatar
0 votes
0 answers
95
UGC NET CSE | June 2008 | Part 2 | Question: 27
For slotted ALOHA, the maximum channel utilization is : $100 \%$ $50 \%$ $36 \%$ $18 \%$
For slotted ALOHA, the maximum channel utilization is :$100 \%$$50 \%$$36 \%$$18 \%$
User Avatar
0 votes
2 answers
96
UGC NET CSE | June 2008 | Part 2 | Question: 28
For a channel of $3 \mathrm{KHz}$ bandwidth and signal to noise ratio of $30 \mathrm{~dB}$, the maximum data rate is: $3000 \mathrm{bps}$ $6000 \mathrm{bps}$ $15000 \mathrm{bps}$ $30000 \mathrm{bps}$
For a channel of $3 \mathrm{KHz}$ bandwidth and signal to noise ratio of $30 \mathrm{~dB}$, the maximum data rate is:$3000 \mathrm{bps}$$6000 \mathrm{bps}$$15000 \mathrm{...
User Avatar
0 votes
1 answer
97
UGC NET CSE | June 2008 | Part 2 | Question: 29
An example of a public key encryption algorithm is : Caesar cipher algorithm DES algorithm AES algorithm Knapsack algorithm
An example of a public key encryption algorithm is :Caesar cipher algorithmDES algorithmAES algorithmKnapsack algorithm
User Avatar
0 votes
0 answers
98
UGC NET CSE | June 2008 | Part 2 | Question: 30
With reference to hierarchical routing, the optimum number of levels for an $m$ router subnet is: $m^{2}$ $m$ $\ln m$ $\sqrt{m}$
With reference to hierarchical routing, the optimum number of levels for an $m$ router subnet is:$m^{2}$$m$$\ln m$$\sqrt{m}$
User Avatar
0 votes
1 answer
99
UGC NET CSE | June 2008 | Part 2 | Question: 31
Assembler program is : dependent on the operating system dependent on the compiler dependent on the hardware independent of the hardware
Assembler program is :dependent on the operating systemdependent on the compilerdependent on the hardwareindependent of the hardware
User Avatar
0 votes
1 answer
101
UGC NET CSE | June 2008 | Part 2 | Question: 33
At the end of parsing, tokens are identified. set of instructions are identified. the syntactic groups are identified. machine instructions are identified.
At the end of parsing,tokens are identified.set of instructions are identified.the syntactic groups are identified.machine instructions are identified.
User Avatar
0 votes
0 answers
102
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
103
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
104
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
105
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
106
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
107
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
108
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
109
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
Page: