Register
Filter

Recent questions in Others

0 votes
0 answers
91
UGC NET CSE | June 2008 | Part 2 | Question: 16
A superkey for an entity consists of : one attribute only at least two attributes at most two attributes one or more attributes
A superkey for an entity consists of :one attribute onlyat least two attributesat most two attributesone or more attributes
User Avatar
0 votes
1 answer
92
UGC NET CSE | June 2008 | Part 2 | Question: 17
Which of the following set of keywords constitutes a mapping in $\text{SQL}$? $\text{SELECT, FROM, TABLE}$ $\text{SELECT, FROM, WHERE}$ $\text{CONNECT, TABLE, CREATE}$ $\text{SELECT, TABLE, INSERT}$
Which of the following set of keywords constitutes a mapping in $\text{SQL}$?$\text{SELECT, FROM, TABLE}$$\text{SELECT, FROM, WHERE}$$\text{CONNECT, TABLE, CREATE}$$\text...
User Avatar
0 votes
0 answers
93
UGC NET CSE | June 2008 | Part 2 | Question: 18
If a relation is in $2 \mathrm{NF}$ then : every candidate key is a primary key every non-prime attribute is fully functionally dependent on each relation key every attribute is functionally independent every relational key is a primary key
If a relation is in $2 \mathrm{NF}$ then :every candidate key is a primary keyevery non-prime attribute is fully functionally dependent on each relation keyevery attribut...
User Avatar
0 votes
3 answers
96
UGC NET CSE | June 2008 | Part 2 | Question: 21
Which of the following data structures is most efficient in terms of both space and time to reverse a string of characters? Linked list Stack Array Tree
Which of the following data structures is most efficient in terms of both space and time to reverse a string of characters?Linked listStackArrayTree
User Avatar
0 votes
0 answers
97
UGC NET CSE | June 2008 | Part 2 | Question: 22
Which of the following can be the sequence of nodes examined in a binary search tree while searching for key $98$? $100, 50, 75, 60, 98$ $100,120,90,95,98$ $200, 70, 100, 95, 98$ $75,150,90,80,98$
Which of the following can be the sequence of nodes examined in a binary search tree while searching for key $98$?$100, 50, 75, 60, 98$$100,120,90,95,98$$200, 70, 100, 95...
User Avatar
1 votes
1 answer
98
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
99
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
100
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
101
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
102
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
103
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
104
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
105
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
106
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
108
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
109
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
110
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
Page: