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
Most viewed questions in Others
0
votes
2
answers
101
GATE COMPUTER SCIENCE PAPER 2 WAS TOUGH COMPARE TO PAPER1 AND 3?
arun001
2.9k
views
arun001
asked
Mar 14, 2015
1
votes
3
answers
102
UGC NET CSE | June 2011 | Part 2 | Question: 42
What is the first stage in program development ? Specification and design System Analysis Testing None of the above
What is the first stage in program development ?Specification and designSystem AnalysisTestingNone of the above
makhdoom ghaya
2.9k
views
makhdoom ghaya
asked
Aug 30, 2016
Others
ugcnetcse-june2011-paper2
is&software-engineering
software-development-life-cycle-models
+
–
1
votes
1
answer
103
How to prepare for core mathematics for BITS HD test? Since only one month left, notes would be helpful.
Meghna Jain
2.9k
views
Meghna Jain
asked
Apr 27, 2016
2
votes
2
answers
104
UGC NET CSE | June 2011 | Part 2 | Question: 16
Which of the following is the recovery management technique in DDBMS ? 2PC (Two Phase Commit) Backup Immediate update All of the above
Which of the following is the recovery management technique in DDBMS ?2PC (Two Phase Commit)BackupImmediate updateAll of the above
makhdoom ghaya
2.9k
views
makhdoom ghaya
asked
Aug 23, 2016
Others
ugcnetcse-june2011-paper2
databases
transaction-and-concurrency
+
–
1
votes
1
answer
105
How much time I should alot to each subject for GATE CSE?
How much time I should give each subject approx for gate cse?
How much time I should give each subject approx for gate cse?
shivangimaurya11
2.9k
views
shivangimaurya11
asked
Mar 28, 2023
Study Resources
study-resources
query
+
–
2
votes
1
answer
106
UGC NET CSE | August 2016 | Part 2 | Question: 50
In Data mining, ______ is a method of incremental conceptual clustering. STRING COBWEB CORBA OLAD
In Data mining, ______ is a method of incremental conceptual clustering.STRINGCOBWEBCORBAOLAD
makhdoom ghaya
2.9k
views
makhdoom ghaya
asked
Sep 28, 2016
Others
ugcnetcse-aug2016-paper2
data-mining
+
–
2
votes
1
answer
107
UGC NET CSE | August 2016 | Part 3 | Question: 64
What are the following sequence of steps taken in designing a fuzzy logic machine ? Fuzzification $\rightarrow$ Rule evaluation $\rightarrow$ Defuzzification Fuzzification $\rightarrow$ Defuzzification $\rightarrow$ ... $\rightarrow$ Fuzzification $\rightarrow$ Defuzzification Rule evaluation $\rightarrow$ Defuzzification $\rightarrow$ Fuzzification
What are the following sequence of steps taken in designing a fuzzy logic machine ?Fuzzification $\rightarrow$ Rule evaluation $\rightarrow$ DefuzzificationFuzzification ...
makhdoom ghaya
2.9k
views
makhdoom ghaya
asked
Oct 4, 2016
Others
ugcnetcse-aug2016-paper3
neural-network
fuzzy-logic
+
–
3
votes
1
answer
108
Best question bank for GATE
Please tell me books or online sites etc which are best to practice GATE question and which contain least errors. I am spending my time trying question of a test series but I find that for most of them a wrong explanation is given and ... scope of GATE. Please tell me a bonafide resource where I can get quality questions. I have already tried previous year questions.
Please tell me books or online sites etc which are best to practice GATE question and which contain least errors. I am spending my time trying question of a test series b...
shikharV
2.8k
views
shikharV
asked
Dec 8, 2015
Study Resources
study-resources
+
–
1
votes
2
answers
109
UGC NET CSE | June 2013 | Part 2 | Question: 22
Given a grammar $S1 \rightarrow Sc, S \rightarrow SA \mid A, A \rightarrow aSb \mid ab$, there is a rightmost derivation $S1 \Rightarrow Sc \Rightarrow SAC \Rightarrow SaSbc$ Thus, $SaSbc$ is a right sentential form, and its handle is $SaS$ $bc$ $Sbc$ $aSb$
Given a grammar $S1 \rightarrow Sc, S \rightarrow SA \mid A, A \rightarrow aSb \mid ab$, there is a rightmost derivation $S1 \Rightarrow Sc \Rightarrow SAC \Rightarrow S...
go_editor
2.8k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
1
votes
2
answers
110
UGC NET CSE | December 2019 | Part 2 | Question: 1
A basic feasible solution of an $m \times n$ transportation problem is said to be non-degenerate, if basic feasible solution contains exactly _______ number of individual allocation in ______ positions. $m+n+1$, independent $m+n-1$, independent $m+n-1$, appropriate $m-n+1$, independent
A basic feasible solution of an $m \times n$ transportation problem is said to be non-degenerate, if basic feasible solution contains exactly _______ number of individual...
soujanyareddy13
2.8k
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
+
–
2
votes
2
answers
111
GATE CS set1 2016 answer key based on chat discussions
189 views GATE CS Set-1 Answer key based on chat discussions for CS section: 1. best cpu scheduling algo - srtf 2. no.of jk flipflops for a counter - 1 3. min no.of temporary registers - 6 4. worst case time complexities of mergesort, insertion, ... of Min Weight Spanning Tree of 6 distinct edges 1,2,3,4,5,6 - 7 52. missing while loop .. b!=a
189 viewsGATE CS Set-1 Answer key based on chat discussions for CS section:1. best cpu scheduling algo - srtf2. no.of jk flipflops for a counter - 13. min no.of temporary...
icecool
2.8k
views
icecool
asked
Feb 10, 2016
1
votes
2
answers
112
UGC NET CSE | June 2013 | Part 2 | Question: 6
When the following code is executed what will be the value of x and y? int x=1, y=0; y=x++; 2, 1 2, 2 1, 1 1, 2
When the following code is executed what will be the value of x and y?int x=1, y=0;y=x++;2, 12, 21, 11, 2
go_editor
2.8k
views
go_editor
asked
Jul 13, 2016
Others
ugcnetcse-june2013-paper2
+
–
0
votes
0
answers
113
Rank predictor
My expected rank changes every 3-4 days . Which rank should i expect . Initially expected rank was around 180. But now it says 22-54
My expected rank changes every 3-4 days . Which rank should i expect . Initially expected rank was around 180. But now it says 22-54
Rajat Nagpal
2.8k
views
Rajat Nagpal
asked
Mar 1, 2018
Others
predictor
gate2018-analysis
+
–
1
votes
0
answers
114
GATE 18 RESPONSE SHEET
i am checking for my response sheet from 8pm.but is showing that their server has interal problem and not showing my response sheet...when this issue will be resolved?
i am checking for my response sheet from 8pm.but is showing that their server has interal problem and not showing my response sheet...when this issue will be resolved?
dheeraj sawant
2.8k
views
dheeraj sawant
asked
Feb 14, 2018
0
votes
2
answers
115
UGC NET CSE | June 2007 | Part 2 | Question: 16
Which of the following statements is wrong? $2-$ phase Locking Protocols suffer from dead locks. Time-Stamp Protocols suffer from more aborts. Time-Stamp Protocols suffer from cascading roll back where as $2-$phase locking Protocol donot. None of these
Which of the following statements is wrong?$2-$ phase Locking Protocols suffer from dead locks.Time-Stamp Protocols suffer from more aborts.Time-Stamp Protocols suffer fr...
go_editor
2.7k
views
go_editor
asked
Mar 28, 2020
Others
ugcnetcse-june2007-paper2
+
–
2
votes
1
answer
116
UGC NET CSE | June 2013 | Part 3 | Question: 73
A fuzzy set A on R is ______ iff $A(\lambda x_1 + (1- \lambda)x_2) \geq min [A(x_1), A(x_2)]$ for all $x_1, x_2 \in R$ and all $\lambda \in [0,1]$ where minimum denotes the minimum operator. Support $\alpha$ - cut Convex Concave
A fuzzy set A on R is ______ iff $A(\lambda x_1 + (1- \lambda)x_2) \geq min [A(x_1), A(x_2)]$ for all $x_1, x_2 \in R$ and all $\lambda \in [0,1]$ where minimum denotes t...
go_editor
2.7k
views
go_editor
asked
Jul 19, 2016
Others
ugcnetcse-june2013-paper3
neural-network
fuzzy-set
+
–
1
votes
1
answer
117
UGC NET CSE | August 2016 | Part 3 | Question: 62
Consider the following statements : (a) If primal (dual) problem has a finite optimal solution, then its dual (primal) problem has a finite optimal solution. (b) If primal (dual) problem has an unbounded optimum solution, then its dual (primal) has no feasible solution at all. ... ? (a) and (b) only (a) and (c) only (b) and (c) only (a), (b) and (c)
Consider the following statements :(a) If primal (dual) problem has a finite optimal solution, then its dual (primal) problem has a finite optimal solution.(b) If primal ...
makhdoom ghaya
2.7k
views
makhdoom ghaya
asked
Oct 4, 2016
Others
ugcnetcse-aug2016-paper3
linear-programming
duality
+
–
0
votes
1
answer
118
UGC NET CSE | December 2005 | Part 2 | Question: 36
Producer consumer problem can be solved using : semaphores event counters monitors all the above
Producer consumer problem can be solved using :semaphoresevent countersmonitorsall the above
go_editor
2.7k
views
go_editor
asked
Mar 27, 2020
Others
ugcnetcse-dec2005-paper2
+
–
0
votes
3
answers
119
UGC NET CSE | June 2011 | Part 2 | Question: 30
Which of the following switching techniques is most suitable for interactive traffic ? Circuit switching Message switching Packet switching All of the above
Which of the following switching techniques is most suitable for interactive traffic ?Circuit switchingMessage switchingPacket switchingAll of the above
makhdoom ghaya
2.7k
views
makhdoom ghaya
asked
Aug 30, 2016
Others
ugcnetcse-june2011-paper2
computer-networks
network-switching
+
–
4
votes
2
answers
120
UGC NET CSE | June 2013 | Part 2 | Question: 26
Given an open address hash table with load factor $\alpha <1$, the expected number of probes in a successful search is Atmost $\frac{1}{\alpha}$ In $( \frac{1-\alpha}{\alpha})$ Atmost $\frac{1}{\alpha}$ In $( \frac{1 }{1-\alpha})$ Atleast $\frac{1}{\alpha}$ In $( \frac{1 }{1-\alpha})$ Atleast $\frac{1}{\alpha}$ In $( \frac{\alpha }{1-\alpha})$
Given an open address hash table with load factor $\alpha <1$, the expected number of probes in a successful search isAtmost $\frac{1}{\alpha}$ In $( \frac{1-\alpha}{\alp...
go_editor
2.7k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
137
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register