Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ugcnetcse-dec2014-paper3
4
votes
2
answers
1
UGC NET CSE | December 2014 | Part 3 | Question: 75
Which of the following computing models is not an example of distributed computing environment ? Cloud computing Parallel computing Cluster computing Peer-to-peer computing
Which of the following computing models is not an example of distributed computing environment ?Cloud computingParallel computing Cluster computing Peer-to-peer computing...
makhdoom ghaya
5.6k
views
makhdoom ghaya
asked
Aug 2, 2016
Distributed Computing
ugcnetcse-dec2014-paper3
distributed-computing
computing-models
+
–
4
votes
2
answers
2
UGC NET CSE | December 2014 | Part 3 | Question: 74
A Trojan horse is A program that performs a legitimate function that is known to an operating system or its user and also has a hidden component that can be used for nefarious purposes like attacks on message security ... computer systems by exploiting security holes like weaknesses in facilities for creation of remote processes All of the above
A Trojan horse isA program that performs a legitimate function that is known to an operating system or its user and also has a hidden component that can be used for nefar...
makhdoom ghaya
2.1k
views
makhdoom ghaya
asked
Aug 2, 2016
Web Technologies
ugcnetcse-dec2014-paper3
trojan-horse
+
–
2
votes
1
answer
3
UGC NET CSE | December 2014 | Part 3 | Question: 73
Which of the following versions of Windows O.S. contain built-in partition manager which allows us to shrink and expand pre-defined drives ? Windows Vista Windows $2000$ Windows NT Windows $98$
Which of the following versions of Windows O.S. contain built-in partition manager which allows us to shrink and expand pre-defined drives ?Windows Vista Windows $2000$Wi...
makhdoom ghaya
1.6k
views
makhdoom ghaya
asked
Aug 2, 2016
Operating System
ugcnetcse-dec2014-paper3
operating-system
windows
non-gate
+
–
3
votes
1
answer
4
UGC NET CSE | December 2014 | Part 3 | Question: 72
Match the following learning modes $w.r.t$. characteristics of available information for learning : a. Supervised i. Instructive information on desired responses, explicitly specified by a teacher. b. Recording ii. A priori design information for memory storing c. Reinforcement ... Codes : a b c d i ii iii iv i iii ii iv ii iv iii i ii iii iv i
Match the following learning modes $w.r.t$. characteristics of available information for learning : a. Supervisedi. Instructive information on desired responses, explicit...
makhdoom ghaya
4.7k
views
makhdoom ghaya
asked
Aug 2, 2016
Artificial Intelligence
ugcnetcse-dec2014-paper3
artificial-intelligence
machine-learning
+
–
4
votes
1
answer
5
UGC NET CSE | December 2014 | Part 3 | Question: 71
A ________ point of a fuzzy set $A$ is a point $x \in X$ at which $\mu_{A} (x) = 0.5$ Core Support Crossover $\alpha$-cut
A ________ point of a fuzzy set $A$ is a point $x \in X$ at which $\mu_{A} (x) = 0.5$CoreSupportCrossover$\alpha$-cut
makhdoom ghaya
5.6k
views
makhdoom ghaya
asked
Aug 2, 2016
Others
ugcnetcse-dec2014-paper3
fuzzy-set
+
–
3
votes
1
answer
6
UGC NET CSE | December 2014 | Part 3 | Question: 70
Consider the following statements about a perception : $I$. Feature detector can be any function of the input parameters. $II$. Learning procedure only adjusts the connection weights to the output layer. Identify the correct statement out of the following : $I$ is ... $II$ is false. $ I$ is false and $II$ is true. $I$ is true and $II$ is true.
Consider the following statements about a perception :$I$. Feature detector can be any function of the input parameters.$II$. Learning procedure only adjusts the connecti...
makhdoom ghaya
3.4k
views
makhdoom ghaya
asked
Aug 2, 2016
Data Mining and Warehousing
ugcnetcse-dec2014-paper3
neural-network
perceptron
+
–
3
votes
1
answer
7
UGC NET CSE | December 2014 | Part 3 | Question: 69
Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do each job is known and is given in the following table : Find out the minimum time required to complete all the jobs. $5$ $11$ $13$ $15$
Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do each job is known and is given in the following table :...
makhdoom ghaya
7.3k
views
makhdoom ghaya
asked
Aug 2, 2016
Numerical Methods
ugcnetcse-dec2014-paper3
assignment-problem
hungarian-method
+
–
4
votes
1
answer
8
UGC NET CSE | December 2014 | Part 3 | Question: 68
The occurrence of degeneracy while solving a transportation problem means that Total supply equals total demand Total supply does not equal total demand The solution so obtained is not feasible None of these
The occurrence of degeneracy while solving a transportation problem means thatTotal supply equals total demandTotal supply does not equal total demandThe solution so obta...
makhdoom ghaya
3.0k
views
makhdoom ghaya
asked
Aug 2, 2016
Others
ugcnetcse-dec2014-paper3
operational-research
transportation-problem
+
–
1
votes
1
answer
9
UGC NET CSE | December 2014 | Part 3 | Question: 67
If an artificial variable is present in the ‘basic variable’ column of optimal simplex table, then the solution is Optimum Infeasible Unbounded Degenerate
If an artificial variable is present in the ‘basic variable’ column of optimal simplex table, then the solution isOptimumInfeasible Unbounded Degenerate
makhdoom ghaya
7.6k
views
makhdoom ghaya
asked
Aug 2, 2016
Others
ugcnetcse-dec2014-paper3
linear-programming
simplex-method
+
–
2
votes
1
answer
10
UGC NET CSE | December 2014 | Part 3 | Question: 66
A Butterworth lowpass filter of order $n$, with a cutoff frequency at distance $D_{0}$ from the origin, has the transfer function $H(u, v)$ given by $\frac{1}{1+\left[\frac{D(u, v)}{D_{0}}\right]^{2n}}$ ... $\frac{1}{1+\left[\frac{D_{0}}{D(u, v)}\right]^{n}}$
A Butterworth lowpass filter of order $n$, with a cutoff frequency at distance $D_{0}$ from the origin, has the transfer function $H(u, v)$ given by$\frac{1}{1+\left[\fra...
makhdoom ghaya
1.3k
views
makhdoom ghaya
asked
Aug 2, 2016
Digital Signal Processing
ugcnetcse-dec2014-paper3
digital-image-processing
butterworth-lowpass-filter
+
–
1
votes
1
answer
11
UGC NET CSE | December 2014 | Part 3 | Question: 65
Given a simple image of size $10 \times 10$ whose histogram models the symbol probabilities and is given by $P_{1}$ $P_{2}$ $P_{3}$ $P_{4}$ a b c d The first order estimate of image entropy is maximum when $a = 0, b = 0, c = 0, d = 1$ ... $a=\frac{1}{4}, b=\frac{1}{4}, c=\frac{1}{4}, d=\frac{1}{4}$
Given a simple image of size $10 \times 10$ whose histogram models the symbol probabilities and is given by$P_{1}$$P_{2}$$P_{3}$$P_{4}$abcd The first order estimate of im...
makhdoom ghaya
2.0k
views
makhdoom ghaya
asked
Aug 2, 2016
Digital Image Processing
ugcnetcse-dec2014-paper3
digital-image-processing
entropy
+
–
3
votes
1
answer
12
UGC NET CSE | December 2014 | Part 3 | Question: 64
Given two spatial masks $S_{1}= \begin{bmatrix} 0&1&0 \\ 1&-4&0 \\ 0&1&0 \end{bmatrix}$ $S_{2} = \begin{bmatrix} 1&1&1 \\ 1&-8&1 \\ 1&1&1 \end{bmatrix}$ ... can be used as the spatial mask ? only $S_{1}$ only $S_{2}$ Both $S_{1}$ and $S_{2}$ None of these
Given two spatial masks$S_{1}= \begin{bmatrix}0&1&0 \\1&-4&0 \\0&1&0\end{bmatrix}$ $S_{2} = \begin{bmatrix}1&1&1 \\1&-8&1 \\1&1&1\end{bmatrix}$The Laplacian of an image a...
makhdoom ghaya
1.8k
views
makhdoom ghaya
asked
Aug 2, 2016
Digital Signal Processing
ugcnetcse-dec2014-paper3
digital-image-processing
spatial-mask
+
–
0
votes
1
answer
13
UGC NET CSE | December 2014 | Part 3 | Question: 63
According to pumping lemma for context free languages : Let $L$ be an infinite context free language, then there exists some positive integer m such that any $w \in L$ with $| w | \geq m$ can be decomposed as $w = u v x y z$ With $| vxy | \leq m$ such ... $uv^{i}xy^{i} z\in L$ for all $i = 0, 1, 2, …….$
According to pumping lemma for context free languages :Let $L$ be an infinite context free language, then there exists some positive integer m such that any $w \in L$ wit...
makhdoom ghaya
2.1k
views
makhdoom ghaya
asked
Aug 2, 2016
Theory of Computation
ugcnetcse-dec2014-paper3
theory-of-computation
+
–
3
votes
1
answer
14
UGC NET CSE | December 2014 | Part 3 | Question: 62
Match the following $:$ ... $\text{a-iv, b-i, c-ii, d-iii}$ $\text{a-i, b-iv, c-iii, d-ii}$
Match the following $:$ $\begin{array} {clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.}& \text{Context free grammar} & \text{i.} & \text{Linear bounded a...
makhdoom ghaya
857
views
makhdoom ghaya
asked
Aug 1, 2016
Theory of Computation
ugcnetcse-dec2014-paper3
theory-of-computation
grammar
+
–
3
votes
1
answer
15
UGC NET CSE | December 2014 | Part 3 | Question: 61
Given the recursively enumerable language $(L_{RE})$, the context sensitive language $(L_{CS})$, the recursive language $(L_{REC})$, the context free language $(L_{CF})$ and deterministic context free language $(L_{DCF})$. The relationship between ... $L_{DCF} \subseteq L_{CF} \subseteq L_{CS} \subseteq L_{REC} \subseteq L_{RE}$
Given the recursively enumerable language $(L_{RE})$, the context sensitive language $(L_{CS})$, the recursive language $(L_{REC})$, the context free language $(L_{CF})$ ...
makhdoom ghaya
2.2k
views
makhdoom ghaya
asked
Aug 1, 2016
Theory of Computation
ugcnetcse-dec2014-paper3
languages-relationships
+
–
3
votes
2
answers
16
UGC NET CSE | December 2014 | Part 3 | Question: 60
A computer based information system is needed : I. As it is difficult for administrative staff to process data. II. Due to rapid growth of information and communication technology. III. Due to growing size of organizations which need to process large volume of data. IV. ... ) is/are true ? $I$ and $II$ $III$ and $IV$ $II$ and $III$ $II$ and $IV$
A computer based information system is needed :I. As it is difficult for administrative staff to process data.II. Due to rapid growth of information and communication tec...
makhdoom ghaya
3.3k
views
makhdoom ghaya
asked
Jul 30, 2016
IS&Software Engineering
ugcnetcse-dec2014-paper3
information-system
+
–
1
votes
1
answer
17
UGC NET CSE | December 2014 | Part 3 | Question: 59
Match the following components of an expert system $:$ ... $\text{a-i, b-iii, c-ii, d-iv}$ $\text{a-iv, b-i, c-iii, d-ii}$
Match the following components of an expert system $:$$\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} &\text{I/O Interface} & \text{i.}...
makhdoom ghaya
3.2k
views
makhdoom ghaya
asked
Jul 30, 2016
Data Mining and Warehousing
ugcnetcse-dec2014-paper3
artificial-intelligence
expert-system
+
–
0
votes
0
answers
18
UGC NET CSE | December 2014 | Part 3 | Question: 58
Match the following $:$ ... $\text{a-ii, b-iii, c-iv, d-i}$ $\text{a-i, b-iii, c-iv, d-ii}$
Match the following $:$$\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} &\text{Script} & \text{i.} & \text{Directed graph with labelled ...
makhdoom ghaya
2.4k
views
makhdoom ghaya
asked
Jul 30, 2016
Data Mining and Warehousing
ugcnetcse-dec2014-paper3
artificial-intelligence
knowledge-representation
+
–
2
votes
3
answers
19
UGC NET CSE | December 2014 | Part 3 | Question: 57
The resolvent of the set of clauses $(A \vee B, \sim A \vee D, C \vee \sim B)$ is $A \vee​ B$ $C \vee​ D$ $A \vee​ C$ $A \vee​ D$
The resolvent of the set of clauses $(A \vee B, \sim A \vee D, C \vee \sim B)$ is $A \vee​ B$$C \vee​ D$$A \vee​ C$$A \vee​ D$
makhdoom ghaya
4.5k
views
makhdoom ghaya
asked
Jul 30, 2016
Mathematical Logic
ugcnetcse-dec2014-paper3
mathematical-logic
+
–
3
votes
3
answers
20
UGC NET CSE | December 2014 | Part 3 | Question: 56
An $A^{*}$ algorithm is a heuristic search technique which Is like a depth-first search where most promising child is selected for expansion Generates all successor nodes and computes an estimate of distance (cost) from start node ... (costs) from start node to all generated nodes and chooses shortest path for further expansion. None of the above
An $A^{*}$ algorithm is a heuristic search technique whichIs like a depth-first search where most promising child is selected for expansion Generates all successor nodes ...
makhdoom ghaya
2.7k
views
makhdoom ghaya
asked
Jul 30, 2016
Others
ugcnetcse-dec2014-paper3
artificial-intelligence
searching
+
–
2
votes
3
answers
21
UGC NET CSE | December 2014 | Part 3 | Question: 55
Equivalent logical expression for the Well Formed Formula $(WFF)$, $\sim(\forall x) F\left[x\right]$ is $\forall x (\sim F\left[x\right])$ $\sim (\exists x) F\left[x\right]$ $\exists x (\sim F\left[x\right])​$ $\forall x F\left[x\right]$
Equivalent logical expression for the Well Formed Formula $(WFF)$,$\sim(\forall x) F\left[x\right]$is$\forall x (\sim F\left[x\right])$$\sim (\exists x) F\left[x\right]$$...
makhdoom ghaya
1.9k
views
makhdoom ghaya
asked
Jul 30, 2016
Mathematical Logic
ugcnetcse-dec2014-paper3
mathematical-logic
+
–
2
votes
1
answer
22
UGC NET CSE | December 2014 | Part 3 | Question: 54
In a distributed computing environment, distributed shared memory is used which is Logical combination of virtual memories on the nodes. Logical combination of physical memories on the nodes. Logical combination of the secondary memories on all the nodes. All of the above
In a distributed computing environment, distributed shared memory is used which is Logical combination of virtual memories on the nodes.Logical combination of physical me...
makhdoom ghaya
4.2k
views
makhdoom ghaya
asked
Jul 30, 2016
Distributed Computing
ugcnetcse-dec2014-paper3
distributed-computing
+
–
1
votes
1
answer
23
UGC NET CSE | December 2014 | Part 3 | Question: 53
Monitor is an Interprocess Communication $(IPC)$ technique which can be described as It is higher level synchronization primitive and is a collection of procedures, variables, and data structures grouped together in a special package. It is ... calls to block the process when they are not allowed to enter critical region to save $CPU$ time.
Monitor is an Interprocess Communication $(IPC)$ technique which can be described as It is higher level synchronization primitive and is a collection of procedures, varia...
makhdoom ghaya
1.5k
views
makhdoom ghaya
asked
Jul 30, 2016
Operating System
ugcnetcse-dec2014-paper3
operating-system
monitors
+
–
3
votes
1
answer
24
UGC NET CSE | December 2014 | Part 3 | Question: 52
An operating system has $13$ tape drives. There are three processes $P1, P2$ & $P3$. Maximum requirement of $P1$ is $11$ tape drives, $P2$ is $5$ tape drives and $P3$ is $8$ tape drives. Currently, $P1$ is allocated $6$ tape ... tape drives. Which of the following sequences represent a safe state? $P2 P1 P3$ $P2 P3 P1$ $P1 P2 P3$ $P1 P3 P2$
An operating system has $13$ tape drives. There are three processes $P1, P2$ & $P3$. Maximum requirement of $P1$ is $11$ tape drives, $P2$ is $5$ tape drives and $P3$ is ...
makhdoom ghaya
2.8k
views
makhdoom ghaya
asked
Jul 30, 2016
Operating System
ugcnetcse-dec2014-paper3
operating-system
deadlock-prevention-avoidance-detection
+
–
2
votes
1
answer
25
UGC NET CSE | December 2014 | Part 3 | Question: 51
Consider an imaginary disk with $40$ cylinders. A request come to read a block on cylinder $11$. While the seek to cylinder $11$ is in progress, new requests come in for cylinders $1, 36, 16, 34, 9$ and $12$ in that order. The number of arm motions using shortest seek first algorithm is $111$ $112$ $60$ $61$
Consider an imaginary disk with $40$ cylinders. A request come to read a block on cylinder $11$. While the seek to cylinder $11$ is in progress, new requests come in for ...
makhdoom ghaya
3.2k
views
makhdoom ghaya
asked
Jul 30, 2016
Operating System
ugcnetcse-dec2014-paper3
operating-system
disk-scheduling
+
–
4
votes
3
answers
26
UGC NET CSE | December 2014 | Part 3 | Question: 50
How many disk blocks are required to keep list of free disk blocks in a $16$ GB hard disk with $1$ kB block size using linked list of free disk blocks ? Assume that the disk block number is stored in $32$ bits. $1024$ blocks $16794$ blocks $20000$ blocks $1048576$ blocks
How many disk blocks are required to keep list of free disk blocks in a $16$ GB hard disk with $1$ kB block size using linked list of free disk blocks ? Assume that the d...
makhdoom ghaya
5.8k
views
makhdoom ghaya
asked
Jul 29, 2016
Operating System
ugcnetcse-dec2014-paper3
operating-system
file-system
+
–
3
votes
3
answers
27
UGC NET CSE | December 2014 | Part 3 | Question: 49
Various storage devices used by an operating system can be arranged as follows in increasing order of accessing speed : Magnetic tapes $\rightarrow$ magnetic disks $\rightarrow$ optical disks $\rightarrow$ ... disks $\rightarrow $ electronic disks $\rightarrow $ main memory $\rightarrow $ cache $\rightarrow $ registers
Various storage devices used by an operating system can be arranged as follows in increasing order of accessing speed : Magnetic tapes $\rightarrow$ magnetic disks $\righ...
makhdoom ghaya
9.1k
views
makhdoom ghaya
asked
Jul 29, 2016
Operating System
ugcnetcse-dec2014-paper3
storage-devices
accessing-speed
+
–
1
votes
1
answer
28
UGC NET CSE | December 2014 | Part 3 | Question: 48
Temporal cohesion means Coincidental cohesion Cohesion between temporary variables Cohesion between local variables Cohesion with respect to time
Temporal cohesion meansCoincidental cohesionCohesion between temporary variablesCohesion between local variables Cohesion with respect to time
makhdoom ghaya
4.1k
views
makhdoom ghaya
asked
Jul 29, 2016
IS&Software Engineering
ugcnetcse-dec2014-paper3
is&software-engineering
cohesion
+
–
2
votes
1
answer
29
UGC NET CSE | December 2014 | Part 3 | Question: 47
$'FAN IN'$ of a component $A$ is defined as Count of the number of components that can call, or pass control, to a component $A$ Number of components related to component $A$ Number of components dependent on component $A$ None of the above
$'FAN IN'$ of a component $A$ is defined as Count of the number of components that can call, or pass control, to a component $A$Number of components related to component ...
makhdoom ghaya
1.1k
views
makhdoom ghaya
asked
Jul 29, 2016
IS&Software Engineering
ugcnetcse-dec2014-paper3
is&software-engineering
fan-in
+
–
2
votes
1
answer
30
UGC NET CSE | December 2014 | Part 3 | Question: 46
Maximum possible value of reliability is $100$ $10$ $1$ $0$
Maximum possible value of reliability is$100$$10$$1$ $0$
makhdoom ghaya
2.7k
views
makhdoom ghaya
asked
Jul 29, 2016
IS&Software Engineering
ugcnetcse-dec2014-paper3
is&software-engineering
software-reliability
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register