Register
Filter

Hot questions in Others

0 votes
2 answers
1641
UGC NET CSE | December 2005 | Part 2 | Question: 12
The bitwise $\text{OR}$ of $35$ with $7$ in $C$ will be : $35$ $7$ $42$ $39$
The bitwise $\text{OR}$ of $35$ with $7$ in $C$ will be :$35$$7$$42$$39$
User Avatar
0 votes
1 answer
1643
UGC NET CSE | June 2006 | Part 2 | Question: 2
For a complete graph with $N$ vertices, the total number of spanning trees is given by: $2N-1$ $N^{N-1}$ $N^{N-2}$ $2N+1$
For a complete graph with $N$ vertices, the total number of spanning trees is given by:$2N-1$$N^{N-1}$$N^{N-2}$$2N+1$
User Avatar
0 votes
2 answers
1644
UGC NET CSE | June 2011 | Part 2 | Question: 50
Which is the most valuable electronic commerce to the individual customer in long run ? Business to Customer Business to Business Customer to Customer None of the above
Which is the most valuable electronic commerce to the individual customer in long run ?Business to CustomerBusiness to BusinessCustomer to CustomerNone of the above
User Avatar
0 votes
1 answer
1647
UGC NET CSE | June 2005 | Part 2 | Question: 40
Which of the following is not an Unix Command? Whoami wc Is put
Which of the following is not an Unix Command?WhoamiwcIsput
User Avatar
0 votes
0 answers
1653
CMI-2019-DataScience-A: 11
$\text{Description for the following question:}$ The following table gives the budget allocation (in Rupees Crores) to $5$ ... quarter is concerned? $Q4<Q1<Q3<Q2$ $Q1<Q4<Q2<Q3$ $Q4<Q1<Q2<Q3$ $Q1<Q4<Q3<Q2$
$\text{Description for the following question:}$The following table gives the budget allocation (in Rupees Crores) to $5$ different departments and their quarterly expend...
User Avatar
0 votes
2 answers
1656
UGC NET CSE | June 2005 | Part 2 | Question: 25
The algorithm that will efficiently sort an array that is nearly sorted except for the interchange of some adjacent pairs of numbers like $\left \{ 1, 3, 2, 5, 4, 6\right \}$ is : Quick sort Bubble sort Merge sort Selection sort
The algorithm that will efficiently sort an array that is nearly sorted except for the interchange of some adjacent pairs of numbers like $\left \{ 1, 3, 2, 5, 4, 6\right...
User Avatar
0 votes
2 answers
1657
UGC NET CSE | June 2005 | Part 2 | Question: 22
Which of the following statement is false ? Every tree is a bipertite graph A tree contains a cycle A tree with n nodes contains $n-1$ edges A tree is a connected graph
Which of the following statement is false ?Every tree is a bipertite graphA tree contains a cycleA tree with n nodes contains $n-1$ edgesA tree is a connected graph
User Avatar
0 votes
1 answer
1659
UGC NET CSE | June 2007 | Part 2 | Question: 31
The parsing technique that avoids back tracking is: Top-down parsing Recursive-descent parsing Predicative Syntax tree
The parsing technique that avoids back tracking is:Top-down parsingRecursive-descent parsingPredicativeSyntax tree
User Avatar
0 votes
1 answer
1660
UGC NET CSE | June 2005 | Part 2 | Question: 10
Identify the logic function performed by the circuit shown Exclusive-$OR$ $AND$ Exclusive-$NOR$ $NOR$
Identify the logic function performed by the circuit shownExclusive-$OR$$AND$Exclusive-$NOR$$NOR$
User Avatar
Page: