Register

Recent questions tagged ugcnetcse-june2008-paper2

0 votes
1 answer
2
UGC NET CSE | June 2008 | Part 2 | Question: 2
The complexity of Kruskal's minimum spanning tree algorithm on a graph with ' $n$ ' nodes and ' $e$ ' edges is : $\mathrm{O}(n)$ $\mathrm{O}(n \log n)$ $\mathrm{O}(e \log n)$ $\mathrm{O}(e)$
The complexity of Kruskal's minimum spanning tree algorithm on a graph with ' $n$ ' nodes and ' $e$ ' edges is :$\mathrm{O}(n)$$\mathrm{O}(n \log n)$$\mathrm{O}(e \log n)...
User Avatar
0 votes
1 answer
3
UGC NET CSE | June 2008 | Part 2 | Question: 3
If a code is t-error correcting, the minimum Hamming distance is equal to : $2 t+1$ $2 t$ $2 t-1$ $t-1$
If a code is t-error correcting, the minimum Hamming distance is equal to :$2 t+1$$2 t$$2 t-1$$t-1$
User Avatar
0 votes
3 answers
4
UGC NET CSE | June 2008 | Part 2 | Question: 4
The set of positive integers under the operation of ordinary multiplication is : not a monoid not a group a group an Abelian group
The set of positive integers under the operation of ordinary multiplication is :not a monoidnot a groupa groupan Abelian group
User Avatar
0 votes
0 answers
5
UGC NET CSE | June 2008 | Part 2 | Question: 5
In a set of $8$ positive integers, there always exists a pair of numbers having the same remainder when divided by : $7$ $11$ $13$ $15$
In a set of $8$ positive integers, there always exists a pair of numbers having the same remainder when divided by :$7$$11$$13$$15$
User Avatar
0 votes
1 answer
6
UGC NET CSE | June 2008 | Part 2 | Question: 6
An example of a tautology is : $x \vee y$ $x \mathrm{v}(\sim y)$ $x \mathrm{v}(\sim x)$ $(x=>y) \wedge(x<=y)$
An example of a tautology is :$x \vee y$$x \mathrm{v}(\sim y)$$x \mathrm{v}(\sim x)$$(x=>y) \wedge(x<=y)$
User Avatar
0 votes
1 answer
7
UGC NET CSE | June 2008 | Part 2 | Question: 7
Among the logic families $\text{RTL, TTL, ECL}$ and $\text{CMOS}$, the fastest family is : $\text{ECL}$ $\mathrm{CMOS}$ $\text{TTL}$ $\text{RTL}$
Among the logic families $\text{RTL, TTL, ECL}$ and $\text{CMOS}$, the fastest family is :$\text{ECL}$$\mathrm{CMOS}$$\text{TTL}$$\text{RTL}$
User Avatar
0 votes
1 answer
8
UGC NET CSE | June 2008 | Part 2 | Question: 8
The octal equivalent of the hexadecimal number $\mathrm{FF}$ is : $100$ $150$ $377$ $737$
The octal equivalent of the hexadecimal number $\mathrm{FF}$ is :$100$$150$$377$$737$
User Avatar
0 votes
1 answer
10
UGC NET CSE | June 2008 | Part 2 | Question: 10
The idempotent law in Boolean algebra says that: $\sim(\sim x)=x$ $x+x=x$ $x+x y=x$ $x(x+y)=x$
The idempotent law in Boolean algebra says that:$\sim(\sim x)=x$$x+x=x$$x+x y=x$$x(x+y)=x$
User Avatar
0 votes
2 answers
12
UGC NET CSE | June 2008 | Part 2 | Question: 12
Consider the following declaration in $\mathrm{C}$ : char a[]; char * p; Which of the following statement is not a valid statement? $\mathrm{p}=\mathrm{a}$; $\mathrm{p}=\mathrm{a}+2$; $\mathrm{a}=\mathrm{p}$; $\mathrm{p}=\& \mathrm{a}[2]$
Consider the following declaration in $\mathrm{C}$ :char a[]; char * p;Which of the following statement is not a valid statement?$\mathrm{p}=\mathrm{a}$;$\mathrm{p}=\math...
User Avatar
0 votes
2 answers
13
UGC NET CSE | June 2008 | Part 2 | Question: 13
Consider the following $\mathrm{C}$ code : {int a = 5, b=9; float r; r= b /a ;} What is the value of $\text{r}$ ? $1.8$ $1.0$ $2.0$ $0.0$
Consider the following $\mathrm{C}$ code :{int a = 5, b=9; float r; r= b /a ;}What is the value of $\text{r}$ ?$1.8$$1.0$$2.0$$0.0$
User Avatar
0 votes
0 answers
16
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
17
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
18
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
21
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
22
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
23
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
24
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
25
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
26
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
27
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
28
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
29
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
30
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
Page: