Register
Filter

Answers by Hradesh patel

0 votes
1
UGC NET CSE | November 2017 | Part 2 | Question: 48
Which of the following is not a Clustering method? K-Means method Self Organizing feature map method K- nearest neighbor method Agglomerative method
Which of the following is not a Clustering method?K-Means methodSelf Organizing feature map methodK- nearest neighbor methodAgglomerative method
0 votes
4
UGC NET CSE | November 2017 | Part 2 | Question: 39
Which module gives control of the CPU to the process selected by the short-term schedular? Dispatcher Interrupt Schedular Threading
Which module gives control of the CPU to the process selected by the short-term schedular?DispatcherInterruptSchedularThreading
0 votes
7
UGC NET CSE | November 2017 | Part 2 | Question: 18
Match the following with respect to RDBMS : ... $\text{(a)-(ii); (b)-(iii); (c)-(iv); (d)-(i)}$
Match the following with respect to RDBMS :$\begin{array}{clcl} \text{(a)} & \text{Entity integrity} & \text{(i)} & \text{enforces some specific business rule that do not...
0 votes
11
UGC NET CSE | November 2017 | Part 3 | Question: 60
Standard planning algorithms assume environment to be ______ Both deterministic and fully observable Neither deterministic nor fully observable Deterministic but not fully observable Not deterministic but fully observable
Standard planning algorithms assume environment to be ______Both deterministic and fully observableNeither deterministic nor fully observableDeterministic but not fully o...
0 votes
12
UGC NET CSE | November 2017 | Part 3 | Question: 56
If $b$ is the branching factor and $m$ is the maximum depth of the search tree, what is the space complexity of greedy search? $O (b+m)$ $O(bm)$ $O(b^m)$ $O(m^b)$
If $b$ is the branching factor and $m$ is the maximum depth of the search tree, what is the space complexity of greedy search?$O (b+m)$$O(bm)$$O(b^m)$$O(m^b)$
0 votes
13
UGC NET CSE | November 2017 | Part 3 | Question: 54
The Bounded buffer problem is also known as ___________ Producer – consumer problem Reader – writer problem Dining Philosophers problem Both $(2)$ and $(3)$
The Bounded buffer problem is also known as ___________Producer – consumer problemReader – writer problemDining Philosophers problemBoth $(2)$ and $(3)$
0 votes
14
UGC NET CSE | November 2017 | Part 3 | Question: 62
Context free grammar is not closed under Concatenation Complementation Kleene Star Union
Context free grammar is not closed underConcatenationComplementationKleene StarUnion
0 votes
16
UGC NET CSE | November 2017 | Part 3 | Question: 72
The Sigmoid activation function $f(t)$ is defined as $\dfrac{1}{\text{exp} (t) + \text{exp} (-t)}$ $t \text{ exp}(-t)$ $\dfrac{1}{1+ \text{exp} (t)}$ $\dfrac{1}{1+ \text{exp} (-t)}$
The Sigmoid activation function $f(t)$ is defined as$\dfrac{1}{\text{exp} (t) + \text{exp} (-t)}$$t \text{ exp}(-t)$$\dfrac{1}{1+ \text{exp} (t)}$$\dfrac{1}{1+ \text{exp...
0 votes
17
UGC NET CSE | November 2017 | Part 3 | Question: 75
Match the following WINDOWS system calls and UNIX system calls with reference to process control and File manipulation. ... $(a)-(iii) \: (b)-(iv) \: (c)-(ii) \: d-(i)$
Match the following WINDOWS system calls and UNIX system calls with reference to process control and File manipulation. $$\begin{array}{llll} & \textbf{Windows} & & \text...
0 votes
19
UGC NET CSE | November 2017 | Part 3 | Question: 74
Which of the following routing technique / techniques is/are used in distributed systems? Fixed Routing Virtual Routing Dynamic Routing (a) only (a) and (b) only (c) only All (a), (b), (c)
Which of the following routing technique / techniques is/are used in distributed systems?Fixed RoutingVirtual RoutingDynamic Routing(a) only(a) and (b) only(c) onlyAll (a...
2 votes
20
NIELIT 2017 DEC Scientist B - Section B: 40
Which of the following is/are not features of RISC processor? Large number of addressing modes. Uniform instruction set. (i) Only (ii) Only Both (i) and (ii) None of the options
Which of the following is/are not features of RISC processor?Large number of addressing modes.Uniform instruction set.(i) Only(ii) OnlyBoth (i) and (ii)None of the option...
3 votes
27
NIELIT 2016 DEC Scientist B (IT) - Section B: 16
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with $n$ discs is: $T(n)=2T(n-2)+2$ $T(n)=2T(n/2)+1$ $T(n)=2T(n-1)+n$ $T(n)=2T(n-1)+1$
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with $n$ discs is:$T(n)=2T(n-2)+2$$T(n)=2T(n/2)+1$$T(n)=2T(n-1)+n$$T(n)=2T(n-1...
Page: