UGC NET CS 2007-Dec-Paper-2
Question 1 |
A box contains six red balls and four green balls. Four balls are selected at random from the box. What is the probability that two of the selected balls are red and two are green ?
3/7 | |
4/7 | |
5/7 | |
6/7 |
Question 1 Explanation:
Question 2 |
The number of edges in a complete graph with ‘n’ vertices is equal to :
n(n-1) | |
n(n-1)/2 | |
n2 | |
2n-1 |
Question 2 Explanation:
Complete graph is an undirected graph in which each vertex is connected to every vertex, other than itself. If there are ‘n’ vertices then total edges in a complete graph is n(n-1)/2.
Question 3 |
A context free grammar is :
type 0 | |
type 1 | |
type 2 | |
type 3 |
Question 3 Explanation:
Question 4 |
Let e : B^m →B^n is a group code. The minimum distance of ‘e’ is equal to :
the maximum weight of a non zero code word | |
the minimum weight of a non zero code word | |
m
| |
n |
Question 5 |
Consider a Moore machine M whose digraph is :
Then L(M), the language accepted by the machine M, is the set of all strings having :
Then L(M), the language accepted by the machine M, is the set of all strings having :
two or more b’s. | |
three or more b’s. | |
two or more a’s. | |
three or more a’s. |
Question 5 Explanation:
In the given state diagram it can be clearly noticed that the minimum string that is accepted by the moore machine M is "bb". So the language can contain 0 or more number of a's and 2 or more number of b's.
Question 6 |
A WFF that is equivalent to the WFF x=>y is :
y=> x | |
~ y=> x | |
~ y=> ~ x | |
y=> ~ x |
Question 6 Explanation:
Question 7 |
Simplified form of Boolean expression xy+(~x)z+yz is :
xy+(~x)z. | |
(~x)y+(~x)z. | |
(~x)y+xz. | |
xy+xz. |
Question 7 Explanation:
Question 8 |
In order to build a MOD-18 counter, the minimum number of flip flops needed is equal to :
18 | |
9 | |
5 | |
4 |
Question 8 Explanation:
Mod value of a counter is the number of unique states.
Let K = Number of states =18.
Number of flip-flops is the smallest number which is greater than or equal to Log K ( base 2).
Log 18 = 4.1.
L=5>=4.1.
So number of flip-flops needed is 5.
Let K = Number of states =18.
Number of flip-flops is the smallest number which is greater than or equal to Log K ( base 2).
Log 18 = 4.1.
L=5>=4.1.
So number of flip-flops needed is 5.
Question 9 |
The dual of the switching function F=x+yz is given by :
x+yz
| |
x(y+z) | |
(~x)+(~y)(~z) | |
(~x)((~y)+(~z)) |
Question 9 Explanation:
The dual of switching function means it changes AND to OR and OR to AND.
given x+yz.
x.(y+z)
given x+yz.
x.(y+z)
Question 10 |
Amongst the logic families DTL, TTL, ECL and CMOS, the family with the least power dissipation is :
CMOS | |
DTL | |
TTL | |
ECL |
Question 10 Explanation:
Emitter Coupled Logic (ECL):
The storage time is eliminated as the transistors are used in difference amplifier mode and are never driven into saturation.
1. Fastest among all logic families
2. Lowest propagation delay.
Complementary metal oxide semiconductor(CMOS):
The power dissipation is usually 10nW per gate depending upon the power supply voltage, output load etc.
1. Lowest power dissipation 2. Excellent noise immunity 3. High packing density 4. Wide range of supply voltage 5. Highest fan out among all logic families Transistor Transistor Logic:
→ TTL devices consume substantially more power than equivalent CMOS devices at rest, but power consumption does not increase with clock speed as rapidly as for CMOS devices.
The storage time is eliminated as the transistors are used in difference amplifier mode and are never driven into saturation.
1. Fastest among all logic families
2. Lowest propagation delay.
Complementary metal oxide semiconductor(CMOS):
The power dissipation is usually 10nW per gate depending upon the power supply voltage, output load etc.
1. Lowest power dissipation 2. Excellent noise immunity 3. High packing density 4. Wide range of supply voltage 5. Highest fan out among all logic families Transistor Transistor Logic:
→ TTL devices consume substantially more power than equivalent CMOS devices at rest, but power consumption does not increase with clock speed as rapidly as for CMOS devices.
Question 11 |
What cannot replace ‘?’ in the following C-code to print all odd numbers less than 100 ?
for (i=1; ? ; i=i+2)
printf(“%d\n”,i);
for (i=1; ? ; i=i+2)
printf(“%d\n”,i);
i≤100 | |
i≤101 | |
i<100 | |
i<101 |
Question 11 Explanation:
The given constraint in question, we have to print odd numbers in less than 100.
So, the condition should not be greater than 100 but it is equal to 100 acceptable.
for (i=1; i<=100 ; i=i+2)
printf(“%d\n”,i);
So, the condition should not be greater than 100 but it is equal to 100 acceptable.
for (i=1; i<=100 ; i=i+2)
printf(“%d\n”,i);
Question 12 |
Consider the following linked list:
Which of the following piece of code will insert the node pointed to by q at the end of the list ?
Which of the following piece of code will insert the node pointed to by q at the end of the list ?
for (p=list; p !=NULL; p=p →next);
p=q;
| |
for (p=list; p !=NULL; p=p →next);
p →next=q;
| |
for (p=list; p →next!=NULL; p=p→next);
p=q;
| |
for (p=list; p →next !=NULL; p=p →next);
p →next=q;
|
Question 12 Explanation:
→ n order to add a new node to the end of the list, first we need to traverse the entire list.
→ To the traverse the list, we will take one pointer.
→ We will traverse the list till the end by moving the pointer to next node.
→ The pointer will point to the last node and from there the pointer next address will point to the new node.
Option D will provide the above steps.
Q
→ To the traverse the list, we will take one pointer.
→ We will traverse the list till the end by moving the pointer to next node.
→ The pointer will point to the last node and from there the pointer next address will point to the new node.
Option D will provide the above steps.
Q
There are 12 questions to complete.