Dark Mode

Recent questions tagged ugcnetcse-dec2007-paper2

2 votes

1 answer

1

UGC NET CSE | December 2007 | Part 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 ? $\large\frac{3}{7}$ $\large\frac{4}{7}$ $\large\frac{5}{7}$ $\large\frac{6}{7}$

go_editor asked in Probability Mar 28, 2020

1.1k views

1 vote

2 answers

2

UGC NET CSE | December 2007 | Part 2 | Question: 2
The number of edges in a complete graph with $‘n’$ vertices is equal to : $n(n-1)$ $\large\frac{n(n-1)}{2}$ $n^2$ $2n-1$

go_editor asked in Graph Theory Mar 28, 2020

1.2k views

0 votes

1 answer

3

UGC NET CSE | December 2007 | Part 2 | Question: 3
A context free grammar is : type $0$ type $1$ type $2$ type $3$

go_editor asked in Theory of Computation Mar 28, 2020

535 views

0 votes

1 answer

4

UGC NET CSE | December 2007 | Part 2 | 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

go_editor asked in Computer Networks Mar 28, 2020

556 views

1 vote

1 answer

5

UGC NET CSE | December 2007 | Part 2 | 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 : two or more b’s three or more b’s two or more a’s three or more a’s

go_editor asked in Theory of Computation Mar 28, 2020

1.4k views

0 votes

1 answer

6

UGC NET CSE | December 2007 | Part 2 | Question: 6
A $WFF$ that is equivalent to the $WFF$ $x=> y$ is : $y=>x$ ~$y=>x$ ~$y=>$ ~$x$ $y=>$ ~$x$

go_editor asked in Others Mar 28, 2020

261 views

0 votes

1 answer

7

UGC NET CSE | December 2007 | Part 2 | Question: 7
Simplified form of Boolean expression $\text{xy+(~x)z+yz}$ is : $\text{xy+(~x)z}$ $\text{(~x)y+(~x)z}$ $\text{(~x)y+xz}$ $\text{xy+xz}$

go_editor asked in Digital Logic Mar 28, 2020

648 views

0 votes

1 answer

8

UGC NET CSE | December 2007 | Part 2 | Question: 8
In order to build a $\text{MOD - 18}$ counter, the minimum number of flip flops needed is equal to : $18$ $9$ $5$ $4$

go_editor asked in Digital Logic Mar 28, 2020

2.0k views

0 votes

1 answer

9

UGC NET CSE | December 2007 | Part 2 | Question: 9
The dual of the switching function $F=x+yz$ is given by : $\text{x+yz}$ $\text{x(y+z)}$ $\text{(~x)+(~y)(~z)}$ $\text{(~x)((~y)+(~z))}$

go_editor asked in Others Mar 28, 2020

602 views

0 votes

1 answer

10

UGC NET CSE | December 2007 | Part 2 | Question: 10
Amongst the logic families $DTL, TTL, ECL$ and $CMOS$, the family with the least power dissipation is : $CMOS$ $DTL$ $TTL$ $ECL$

go_editor asked in Others Mar 28, 2020

274 views

1 vote

1 answer

11

UGC NET CSE | December 2007 | Part 2 | 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); $i\leq100$ $i\leq101$ $i<100$ $i<101$

go_editor asked in Programming in C Mar 28, 2020

610 views

1 vote

2 answers

12

UGC NET CSE | December 2007 | Part 2 | 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 ? $\text{for (p=list; p !=NULL; p=p → next);}\\ p=q;$ ... $\text{for (p=list; p→next !=NULL; p=p → next);}\\ p→next=q;$

go_editor asked in DS Mar 28, 2020

815 views

1 vote

1 answer

13

UGC NET CSE | December 2007 | Part 2 | Question: 13
Which of the following is a valid C code to print character A' to C' ? x='A' ; switch(x) {case 'A'= printf ( "%d\n" , x); .... case 'C'= printf ( "%d\n" , x); } x='A'; ... , x); case 'B' =printf ( "%d\n" , x); case 'C' =printf ( "%d\n" , x); }

go_editor asked in Programming in C Mar 28, 2020

640 views

0 votes

1 answer

14

UGC NET CSE | December 2007 | Part 2 | Question: 14
Which of the following is not true in C++ ? Private elements of a base class are not accessible by members of its derived class. Protected elements of base class are not accessible by members of its derived class. ... When base class access specified is Public , protected elements of a base class become protected members of its derived class.

go_editor asked in Object Oriented Programming Mar 28, 2020

900 views

0 votes

1 answer

15

UGC NET CSE | December 2007 | Part 2 | Question: 15
Which of the following is true of constructor function in C++ ? A class must have at least one constructor. A constructor is a unique function which cannot be overloaded. A constructor function must be invoked with the object name. A constructor function is automatically invoked when an object is created.

go_editor asked in Object Oriented Programming Mar 28, 2020

2.7k views

1 vote

1 answer

16

UGC NET CSE | December 2007 | Part 2 | Question: 16
A primary key for an entity is : a candidate key any attribute a unique attribute a superkey

go_editor asked in Databases Mar 28, 2020

782 views

0 votes

1 answer

17

UGC NET CSE | December 2007 | Part 2 | Question: 17
Aggregate functions in SQL are : GREATEST, LEAST and ABS SUM, COUNT and AVG UPPER, LOWER and LENGTH SQRT, POWER and MOD

go_editor asked in Databases Mar 28, 2020

457 views

0 votes

0 answers

18

UGC NET CSE | December 2007 | Part 2 | Question: 18
If a relation is in 2NF and 3NF forms then : no non-prime attribute is functionally dependent on other non-prime attributes no non-prime attribute is functionally dependent on prime attributes all attributes are functionally independent prime attribute is functionally independent of all non-prime attributes

go_editor asked in Others Mar 28, 2020

282 views

0 votes

1 answer

19

UGC NET CSE | December 2007 | Part 2 | Question: 19
The end of an SQL command is denoted by : an end-of-line character an ‘enter-key’ marker entering F4 key a semicolon (;)

go_editor asked in Databases Mar 28, 2020

619 views

0 votes

2 answers

20

UGC NET CSE | December 2007 | Part 2 | Question: 20
Consider the query : SELECT student_name FROM students WHERE class_name=(SELECT class_name FROM students WHERE math_marks=100); what will be the output ? the list of names of students with $100$ marks in mathematics the names of all ... having $100$ marks in mathematics the names and class of all students whose marks in mathematics is $100$

go_editor asked in Databases Mar 28, 2020

1.0k views

1 vote

1 answer

21

UGC NET CSE | December 2007 | Part 2 | Question: 21
Consider a rooted tree in which every node has at least three children. What is the minimum number of nodes at level i (i > $0$) of the tree ? Assume that the root is at level $0$: $3^i$ $3i$ $3$ $3i+1$

go_editor asked in DS Mar 28, 2020

863 views

0 votes

1 answer

22

UGC NET CSE | December 2007 | Part 2 | Question: 22
Which of the following data structure is used to implement recursion ? Arrays Stacks Queues Linked lists

go_editor asked in DS Mar 28, 2020

1.7k views

1 vote

1 answer

23

UGC NET CSE | December 2007 | Part 2 | Question: 23
The height of a binary tree with $n$ nodes, in the worst case is : $O(log n)$ $O(n)$ $\Omega(n\log n)$ $\Omega(n^2)$

go_editor asked in DS Mar 28, 2020

1.1k views

0 votes

0 answers

24

UGC NET CSE | December 2007 | Part 2 | Question: 24
An example of a file extension is : text pict mp$3$ web

go_editor asked in Others Mar 28, 2020

373 views

0 votes

1 answer

25

UGC NET CSE | December 2007 | Part 2 | Question: 25
The performance of a file system depends upon the cache hit rate. If it takes $1$ msec to satisfy a request from the cache but $10$ msec to satisfy a request if a disk read is needed, then the mean time (ms) required for a hit rate $’h’$ is given by : $1$ $h+10(1-h)$ $(1-h)+10h$ $10$

go_editor asked in Operating System Mar 28, 2020

821 views

0 votes

3 answers

26

UGC NET CSE | December 2007 | Part 2 | Question: 26
The best known example of a MAN is : Ethernet Cable Television FDDI IEEE $802.3$

go_editor asked in Computer Networks Mar 28, 2020

1.2k views

0 votes

1 answer

27

UGC NET CSE | December 2007 | Part 2 | Question: 27
In a broadcast network, a layer that is often thin or non-existent is : network layer transport layer presentation layer application layer

go_editor asked in Computer Networks Mar 28, 2020

604 views

0 votes

1 answer

28

UGC NET CSE | December 2007 | Part 2 | Question: 28
The maximum data rate of binary signals on a noiseless $3\:KHz$ channel is : $3000$ bps. $6000$ bps. $9000$ bps. $12,000$ bps.

go_editor asked in Computer Networks Mar 28, 2020

2.0k views

0 votes

1 answer

29

UGC NET CSE | December 2007 | Part 2 | Question: 29
For pure ALOHA, the maximum channel utilization is : $100\%$ $50\%$ $36\%$ $18\%$

go_editor asked in Computer Networks Mar 28, 2020

730 views

0 votes

1 answer

30

UGC NET CSE | December 2007 | Part 2 | Question: 30
An example of an adaptive routing algorithm is : distance vector routing flooding selective flooding shortest path routing

go_editor asked in Computer Networks Mar 28, 2020

1.2k views

Page:

Recent questions tagged ugcnetcse-dec2007-paper2