UGC NET December 2014 Paper 3, Computer Applications

# Recent questions tagged ugcnetdec2014iii

1
Which of the following computing models is not an example of distributed computing environment ? Cloud computing Parallel computing Cluster computing Peer-to-peer computing
2
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 or impersonation. A piece of ... that spreads to other computer systems by exploiting security holes like weaknesses in facilities for creation of remote processes All of the above
3
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$
4
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 iii. Partial information ... about desired responses Codes : a b c d i ii iii iv i iii ii iv ii iv iii i ii iii iv i
5
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
6
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 false and $II$ is false. $I$ is true and $II$ is false. $​I$ is false and $II$ is true. $I$ is true and $II$ is true.
7
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$
8
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
1 vote
9
If an artificial variable is present in the ‘basic variable’ column of optimal simplex table, then the solution is Optimum Infeasible Unbounded Degenerate
10
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(u, v)}{D_{0}}\right]^{n}}$ $\frac{1}{1+\left[\frac{D_{0}}{D(u, v)}\right]^{2n}}$ $\frac{1}{1+\left[\frac{D_{0}}{D(u, v)}\right]^{n}}$
1 vote
11
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}{2}, b=\frac{1}{2}, c=0, d=0$ $a=\frac{1}{3}, b=\frac{1}{3}, c=\frac{1}{3}, d=0$ $a=\frac{1}{4}, b=\frac{1}{4}, c=\frac{1}{4}, d=\frac{1}{4}$
12
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 at all points $(x, y)$ can be implemented by convolving the image with spatial mask. Which of the following can be used as the spatial mask ? only $S_{1}$ only $S_{2}$ Both $S_{1}$ and $S_{2}$ None of these
13
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 that $uv^{i}xy^{i} z\in L$ for all ... $| vy | \geq 1$, such that $uv^{i}xy^{i} z\in L$ for all $i = 0, 1, 2, &hellip;&hellip;.$
14
Match the following : \begin{array} {|l||l|l|l|}\hline & \textbf{List-I} && \textbf{List-II} \\ \hline\text{a.}& \text{Context free grammer} & \text{i.} & \text{Linear bounded automaton} \\ \hline \text{b.}& \text{Regular grammer} & \text{ii.} & \text{Pushdown automaton} \\ \hline \text{c.}& \text{ ... a-ii, b-iv, c-iii, d-i a-ii, b-iv, c-i, d-iii a-iv, b-i, c-ii, d-iii a-i, b-iv, c-iii, d-ii
15
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})$ ... $L_{DCF} \subseteq L_{CF} \subseteq L_{CS} \subseteq L_{REC} \subseteq L_{RE}$
16
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. As timely and accurate decisions ... $and$II $III$ and $IV$ $II$ and $III$ $II$ and $IV$
1 vote
17
Match the following components of an expert system : ... -i, b-iii, c-iv, d-ii a-iv, b-iii, c-i, d-ii a-i, b-iii, c-ii, d-iv a-iv, b-i, c-iii, d-ii
18
Match the following : ... iv, b-ii, c-i, d-iii a-iv, b-iii, c-ii, d-i a-ii, b-iii, c-iv, d-i a-i, b-iii, c-iv, d-ii
19
The resolvent of the set of clauses $(A \vee B, \sim A \vee D, C \vee \sim B)$ is $A \vee&#8203; B$ $C \vee&#8203; D$ $A \vee&#8203; C$ $A \vee&#8203; D$
20
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 to a goal node through each of ... all path lengths (costs) from start node to all generated nodes and chooses shortest path for further expansion. None of the above
21
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])&#8203;$ $\forall x F\left[x\right]$
22
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
1 vote
23
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 a non-negative integer which apart ... implemented as system calls to block the process when they are not allowed to enter critical region to save $CPU$ time.
24
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 drives, $P2$ is allocated $3$ tape ... is allocated $2$ tape drives. Which of the following sequences represent a safe state? $P2 P1 P3$ $P2 P3 P1$ $P1 P2 P3$ $P1 P3 P2$
25
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$
26
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
27
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$ electronic disks $\rightarrow$ main memory $\rightarrow$ ... $\rightarrow$ electronic disks $\rightarrow$ main memory $\rightarrow$ cache $\rightarrow$ registers
1 vote
$'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
Maximum possible value of reliability is $100$ $10$ $1$ $0$