Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Recent questions in Others
1
votes
2
answers
1581
CMI2020-A: 10
We have a procedure $P(n)$ that makes multiple calls to a procedure $Q(m)$, and runs in polynomial time in $n$. Unfortunately, a significant flaw was discovered in $Q(m)$, and it had to be replaced by $R(m)$, which runs in exponential time in $m$. Thankfully, $P$ is ... is proportional to $log\;n.$ $P(n)$ runs in polynomial time in $n$ if, for each call $Q(m),m \underline<log \;n.$
We have a procedure $P(n)$ that makes multiple calls to a procedure $Q(m)$, and runs in polynomial time in $n$. Unfortunately, a significant flaw was discovered in $Q(m)$...
soujanyareddy13
299
views
soujanyareddy13
asked
Jan 28, 2021
Others
cmi2020
+
–
0
votes
1
answer
1582
CMI2020-B: 1
There are two cities, City $X$ and City $Y$. Each city has a metro system consisting of three different lines - red line, blue line, and green line. Each station (in both cities) is classified as either $interesting\; or\; uninteresting,$ depending on ... colours following which one can reach an interesting destination from the City Centre in $X$, but not from the City Centre in $Y$.
There are two cities, City $X$ and City $Y$. Each city has a metro system consisting of three different lines – red line, blue line, and green line. Each station (in bo...
soujanyareddy13
174
views
soujanyareddy13
asked
Jan 28, 2021
Others
cmi2020
+
–
0
votes
1
answer
1583
CMI2020-B: 2
A graph is finite if it has a finite number of vertices, and simple if it has no self-loops or multiple edges. Assume we are dealing with finite, undirected, simple graphs with at least two vertices. A graph is connected if there is a path between any two ... there exist a graph $G$ with at least two vertices such that both $G$ and $\overline G$ are connected? Justify your answer.
A graph is finite if it has a finite number of vertices, and simple if it has no self-loops or multiple edges. Assume we are dealing with finite, undirected, simple graph...
soujanyareddy13
179
views
soujanyareddy13
asked
Jan 28, 2021
Others
cmi2020
+
–
0
votes
1
answer
1584
CMI2020-B: 3
A graph is finite if it has a finite number of vertices, and simple if it has no self-loops or multiple edges. Prove or disprove: There exists a finite, undirected, simple graph with at least two vertices in which each vertex has a different degree. To give ... draw an example of such a graph. To disprove the result, you should provide an argument as to why such a graph cannot exist.
A graph is finite if it has a finite number of vertices, and simple if it has no self-loops or multiple edges.Prove or disprove: There exists a finite, undirected, simple...
soujanyareddy13
148
views
soujanyareddy13
asked
Jan 28, 2021
Others
cmi2020
+
–
0
votes
1
answer
1585
CMI2020-B: 4
Consider the procedure $\text{MYSTERY}$ described in pseudocode below. The procedure takes two non-negative integers as arguments. For a real number $x$ the notation $[x]$ denotes the largest integer which is not larger than $x$. $\text{MYSTERY (p,q)}$ ... $MYSTERY(m,n)$ return for $m,n\underline> 0?$ Justify your answer with a proof.
Consider the procedure $\text{MYSTERY}$ described in pseudocode below. The procedure takes two non-negative integers as arguments. For a real number $x$ the notation $[x]...
soujanyareddy13
188
views
soujanyareddy13
asked
Jan 28, 2021
Others
cmi2020
+
–
1
votes
1
answer
1586
CMI2020-B: 5
Let $\Sigma=\{a,b\}.$ For two non-empty languages $L_1$ and $L_2$ over $\Sigma$, we define $Mix(L_1,L_2)$ to be $\{w_1\;u\;w_2\;v\;w_3|\;u\in L_1,v\in L_2,w_1,w_2,w_3\in \Sigma^*\}$. Give two languages $L_1$ and $L_2$ ... are regular, the language $Mix(L_1,L_2)$ is also regular. Provide languages $L_1$ and $L_2$ that are not regular, for which $Mix(L_1,L_2)$ is regular.
Let $\Sigma=\{a,b\}.$ For two non-empty languages $L_1$ and $L_2$ over $\Sigma$, we define $Mix(L_1,L_2)$ to be $\{w_1\;u\;w_2\;v\;w_3|\;u\in L_1,v\in L_2,w_1,w_2,w_3\in ...
soujanyareddy13
156
views
soujanyareddy13
asked
Jan 28, 2021
Others
cmi2020
+
–
0
votes
2
answers
1587
CMI2020-B: 6
A password contains exactly $6$ characters. Each character is either a lowercase letter $\{a,b,\dots,z\}$ or a digit $\{ 0,1,\dots,9\}$. A valid password should contain at least one digit. What is the total number of valid passwords? Here is an incorrect ... a justification for your answer. You do not need to simplify your expressions (for example, you can write $26^5, 5!, etc.$).
A password contains exactly $6$ characters. Each character is either a lowercase letter $\{a,b,\dots,z\}$ or a digit $\{ 0,1,\dots,9\}$. A valid password should contain a...
soujanyareddy13
371
views
soujanyareddy13
asked
Jan 28, 2021
Others
cmi2020
+
–
0
votes
1
answer
1588
CMI2020-B: 7
We are given an array of $N$ words $W[1\dots N],$ and a length array $L[1\dots N]$, where each $L[i]$ denotes the length (number of characters) of $W[i]$. We are also given a line width $M$ ... $N$?
We are given an array of $N$ words $W[1\dots N],$ and a length array $L[1\dots N]$, where each $L[i]$ denotes the length (number of characters) of $W[i]$. We are also giv...
soujanyareddy13
214
views
soujanyareddy13
asked
Jan 28, 2021
Others
cmi2020
+
–
0
votes
1
answer
1589
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 11
If the channel is band limited to $6\;kHz$ and signal to noise ratio is $16,$ what would be the capacity of channel? $16.15$ kbps $23.24$ kbps $40.12$ kbps $24.74$ kbps
If the channel is band limited to $6\;kHz$ and signal to noise ratio is $16,$ what would be the capacity of channel?$16.15$ kbps$23.24$ kbps$40.12$ kbps$24.74$ kbps
admin
1.0k
views
admin
asked
Apr 1, 2020
Others
nielit2017oct-assistanta-it
+
–
0
votes
0
answers
1590
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 12
At $100\%$ modulation, the power in each sideband is _______ of that of carrier. $50\%$ $40\%$ $60\%$ $25\%$
At $100\%$ modulation, the power in each sideband is _______ of that of carrier.$50\%$$40\%$$60\%$$25\%$
admin
267
views
admin
asked
Apr 1, 2020
Others
nielit2017oct-assistanta-it
+
–
0
votes
1
answer
1591
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$
A $WFF$ that is equivalent to the $WFF$ $x= y$ is :$y=>x$~$y=>x$~$y=>$ ~$x$$y=>$ ~$x$
go_editor
272
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
1592
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))}$
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
661
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
1593
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$
Amongst the logic families $DTL, TTL, ECL$ and $CMOS$, the family with the least power dissipation is :$CMOS$$DTL$$TTL$$ECL$
go_editor
282
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-dec2007-paper2
+
–
0
votes
0
answers
1594
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
If a relation is in 2NF and 3NF forms then :no non-prime attribute is functionally dependent on other non-prime attributesno non-prime attribute is functionally dependent...
go_editor
304
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-dec2007-paper2
+
–
0
votes
0
answers
1595
UGC NET CSE | December 2007 | Part 2 | Question: 24
An example of a file extension is : text pict mp$3$ web
An example of a file extension is :textpictmp$3$web
go_editor
390
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-dec2007-paper2
+
–
0
votes
1
answer
1596
UGC NET CSE | December 2007 | Part 2 | Question: 39
An example of a directory found in most $\text{UNIX}$ system is : $\text{usr}$ $\text{waitpid}$ $\text{brk}$ $\text{unmap}$
An example of a directory found in most $\text{UNIX}$ system is :$\text{usr}$$\text{waitpid}$$\text{brk}$$\text{unmap}$
go_editor
300
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-dec2007-paper2
+
–
0
votes
0
answers
1597
UGC NET CSE | December 2007 | Part 2 | Question: 43
An error message produced by an interactive system should have : always the error code the list of mistakes done by the user displayed a non-judgmental approach the past records of the occurrence of the same mistake
An error message produced by an interactive system should have :always the error codethe list of mistakes done by the user displayeda non-judgmental approachthe past reco...
go_editor
265
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-dec2007-paper2
+
–
0
votes
0
answers
1598
UGC NET CSE | December 2007 | Part 2 | Question: 46
Given a parallel algorithm $A$ with computation time $t$, if parallel algorithm $A$ performs $m$ computational operation, then $p$ processors can execute algorithm $A$ in time given by : $t/p$ $mt/p$ $t+(m-t)/p$ $(m-t)/p$
Given a parallel algorithm $A$ with computation time $t$, if parallel algorithm $A$ performs $m$ computational operation, then $p$ processors can execute algorithm $A$ in...
go_editor
218
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-dec2007-paper2
+
–
0
votes
0
answers
1599
UGC NET CSE | December 2007 | Part 2 | Question: 47
With reference to implementation of different association mining algorithms, identify the correct statement : The FP growth method was usually better than the best implementation of the apriori algorithm Apriori algorithm is usually better than ... good when the support required is low At very low support the number of frequent items becomes less
With reference to implementation of different association mining algorithms, identify the correct statement :The FP growth method was usually better than the best impleme...
go_editor
201
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-dec2007-paper2
+
–
0
votes
0
answers
1600
UGC NET CSE | December 2007 | Part 2 | Question: 48
Consider a typical mobile communication system. If $840$ frequencies are available, how many can be used in a given cell ? $140$ $120$ $84$ $60$
Consider a typical mobile communication system. If $840$ frequencies are available, how many can be used in a given cell ?$140$$120$$84$$60$
go_editor
184
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-dec2007-paper2
+
–
Page:
« prev
1
...
75
76
77
78
79
80
81
82
83
84
85
...
137
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register