Register
Filter

Most answered questions in Others

0 votes
7 answers
2
UGC NET CSE | June 2007 | Part 2 | Question: 37
Windows is a _______ operating system: Non-preemptive Preemptive Multi-user Real time
Windows is a _______ operating system:Non-preemptivePreemptiveMulti-userReal time
User Avatar
4 votes
6 answers
3
UGC NET CSE | December 2019 | Part 2 | Question: 3
The Boolean expression $AB+A \overline{B}+\overline{A}C+AC$ is unaffected by the value of the Boolean variable _________. $A$ $B$ $C$ $A, B$ and $C$
The Boolean expression $AB+A \overline{B}+\overline{A}C+AC$ is unaffected by the value of the Boolean variable _________.$A$$B$$C$$A, B$ and $C$
User Avatar
5 votes
5 answers
6
Meta: Suggestions to improve GATE Overflow
Mention your dislikes about the site and suggest improvements if any
Mention your dislikes about the site and suggest improvements if any
User Avatar
0 votes
4 answers
7
UGC NET CSE | December 2019 | Part 2 | Question: 88
Match $\text{List-I}$ with $\text{List-II}$ ... $\text{(a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)}$
Match $\text{List-I}$ with $\text{List-II}$:$$\begin{array}{llll} & \textbf{List I} && \textbf{List II} \\ \text{(a)} & \text{Micro operation} & \text{(i)} & \text{Speci...
User Avatar
0 votes
4 answers
8
UGC NET CSE | January 2017 | Part 2 | Question: 48
Which of the following is/are true w.r.t. applications of mobile computing? Travelling of salesman Location awareness services a true; b false. Both a and b are true. Both a and b are false. a false; b true.
Which of the following is/are true w.r.t. applications of mobile computing?Travelling of salesmanLocation awareness servicesa true; b false.Both a and b are true.Both a a...
User Avatar
0 votes
4 answers
9
UGC NET CSE | December 2010 | Part 2 | Question: 24
Linear probing suffers from a problem known as Secondary clustering Primary clustering Both (A) and (B) None of these
Linear probing suffers from a problem known asSecondary clusteringPrimary clusteringBoth (A) and (B)None of these
User Avatar
0 votes
3 answers
11
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
3 answers
12
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
3 answers
14
UGC NET CSE | December 2019 | Part 2 | Question: 14
What is the output of the following $C$ program? # include <stdio.h> main () { int i, j, x=0; for (i=0; i<5; ++i) for (j=0; j<i; ++j) { x+=(i+j-1); break; } printf(“%d”, x); } $6$ $5$ $4$ $3$
What is the output of the following $C$ program?# include <stdio.h main () { int i, j, x=0; for (i=0; i<5; ++i) for (j=0; j<i; ++j) { x+=(i+j-1); break; } printf(“%d”...
User Avatar
1 votes
3 answers
15
UGC NET CSE | December 2019 | Part 2 | Question: 21
Given two tables $R1(x,y)$ and $R2(y,z)$ with $50$ and $30$ number of tuples respectively. Find maximum number of tuples in the output of natural join between tables $R1$ and $R2$ i.e. $R1 * R2$? ($*$- Natural Join) $30$ $20$ $50$ $1500$
Given two tables $R1(x,y)$ and $R2(y,z)$ with $50$ and $30$ number of tuples respectively. Find maximum number of tuples in the output of natural join between tables $R1$...
User Avatar
0 votes
3 answers
17
CMI-2018-DataScience-A: 2
Let ... $|A|=|B|$ $|C|=|D|$ $|B|=-|C|$ $|A|=-|D|$
Let $A=\begin{bmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9 \end{bmatrix}, B=\begin{bmatrix} 1 & 4 & 7 \\ 2 & 5 & 8 \\ 3 & 6 & 9 \end{bmatrix}, C=\begin{bmatrix} 4 & 5 & 6...
User Avatar
0 votes
3 answers
19
UGC NET CSE | June 2007 | Part 2 | Question: 21
The time required to find the shortest path in a graph with $n$ vertices and $e$ edges is: $O(e)$ $O(n)$ $O(e^{2})$ $O(n^{2})$
The time required to find the shortest path in a graph with $n$ vertices and $e$ edges is:$O(e)$$O(n)$$O(e^{2})$$O(n^{2})$
User Avatar
0 votes
3 answers
20
UGC NET CSE | June 2006 | Part 2 | Question: 25
Application of data structure queue is : Levelwise printing of tree Implementation of priority queues Function call implementation Depth first search in a graph
Application of data structure queue is :Levelwise printing of treeImplementation of priority queuesFunction call implementationDepth first search in a graph
User Avatar
Page: