search
Log In
Questions with solution for UGC NET 2017 November Paper 3 for Computer Applications.

Recent questions tagged ugcnetnov2017-iii

1 vote
0 answers
1
An undirected graph G (V, E) contains n (n > 2) nodes named v1 , v2 ,...,vn. Two nodes vi and vj are connected if and only if 0 < │ i − j│ ≤2. Each edge (vi , vj ) is assigned a weight i+j. The cost of the minimum spanning tree of such a graph with 10 nodes is: A) 88 B)91 C)49 D)21
asked Sep 28, 2018 in Graph Theory aditi19 348 views
0 votes
0 answers
2
0 votes
1 answer
3
A simple stand - alone software utility is to be developed in 'C' programming by a team of software experts for a computer running Linux and the overall size of this software is estimated to be 20,000 lines of code. Considering (a, b) = (2.4, 1.05) as multiplicative and ... (A) 10.52 months (B) 11.52 months (C) 12.52 months (D) 14.52 months How to solve exponential part of this question?
asked Jun 12, 2018 in IS&Software Engineering Rajandeep Gill 523 views
0 votes
1 answer
4
1 vote
1 answer
5
57. Let P, Q, R and S be Propositions. Assume that the equivalences P ⇔ (Q ∨ ¬ Q) and Q ⇔ R hold. Then the truth value of the formula (P ∧ Q) ⇒ ((P ∧ R) ∨ S) is always : (1) True (2) False (3) Same as truth table of Q (4) Same as truth table of S
asked Feb 2, 2018 in Discrete Mathematics kavikeve 1.7k views
0 votes
2 answers
6
59. Consider the following two well-formed formulas in prepositional logic. F1 : P ⇒ ¬ P F2 : (P ⇒ ¬ P) ∨ (¬ P ⇒ P) Which of the following statements is correct ? (1) F1 is Satisfiable, F2 is valid (2) F1 is unsatisfiable, F2 is Satisfiable (3) F1 is unsatisfiable, F2 is valid (4) F1 and F2 both are Satisfiable
asked Feb 1, 2018 in Discrete Mathematics kavikeve 734 views
0 votes
2 answers
7
58. “If X, then Y unless Z” is represented by which of the following formulae in propositional logic ? (1) (X ∧ Y) → ¬ Z (2) (X ∧ ¬ Z) → Y (3) X → (Y ∧ ¬ Z) (4) Y → (X ∧ ¬ Z)
asked Feb 1, 2018 in Discrete Mathematics kavikeve 540 views
1 vote
2 answers
8
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)
asked Nov 5, 2017 in Unknown Category Arjun 152 views
1 vote
1 answer
9
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)$
asked Nov 5, 2017 in Operating System Arjun 212 views
1 vote
1 answer
10
Consider the following statements: UNIX provides three types of permissions Read Write Execute UNIX provides three sets of permissions permission for owner permission for group permission for others Which of the above statement/s is/are true? Only (a) Only (b) Both (a) and (b) Neither (a) nor (b)
asked Nov 5, 2017 in Unknown Category Arjun 107 views
1 vote
1 answer
11
Consider a single perceptron with sign activation function. The perceptron is represented by weight vector $\begin{bmatrix} 0.4 & -0.3 & 0.1 \end{bmatrix}^t$ and a bias $\theta=0$. If the input vector to the perceptron is $X=\begin{bmatrix} 0.2 & 0.6 & 0.5 \end{bmatrix}$ then the output of the perceptron is $1$ $0$ $-0.05$ $-1$
asked Nov 5, 2017 in Unknown Category Arjun 110 views
1 vote
1 answer
12
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)}$
asked Nov 5, 2017 in Unknown Category Arjun 93 views
1 vote
0 answers
13
Consider the following LPP: Min $Z=2x_1+x_2+3x_3$ Subject to: $x_1 – 2x_2+x_3 \geq 4$ $2x_1+x_2+x_3 \leq 8$ $x_1-x_3 \geq 0$ $x_1, x_2, x_3 \geq 0$ The solution of this LPP using Dual Simplex Method is $x_1=0, x_2=0, x_3=3$ and $Z=9$ $x_1=0, x_2=6, x_3=0$ and $Z=6$ $x_1=4, x_2=0, x_3=0$ and $Z=8$ $x_1=2, x_2=0, x_3=2$ and $Z=10$
asked Nov 5, 2017 in Unknown Category Arjun 64 views
1 vote
0 answers
14
Consider a Takagi-Sugeno - Kang (TSK) Model consisting of rules of the form: If $x_1$ is $A_{i1}$ and $\dots$ and $x_r$ is $A_{ir}$ THEN $y=f_i(x_1, x_2, \dots , x_t)=b_{i0} + b_{i1} x_1 + \dots + b_{ir}x_r$ assume, $\alpha _i$ is the matching degree of rule $i$, then the ... $y=\underset{i}{\text{max}} [\alpha _i f_i (x_1, x_2, \dots , x_r)]$
asked Nov 5, 2017 in Unknown Category Arjun 45 views
1 vote
0 answers
15
Consider the following LPP: Max $Z=15x_1+10 x_2$ Subject to the constraints $4x_1 +6x_2 \leq 360$ $3x_1+0x_2 \leq 180$ $0x_1+5x_2 \leq 200$ $x_1, x_2 \geq 0$ The solution of the LPP using Graphical solution technique is $x_1=60, x_2=0$ and $Z=900$ $x_1=60, x_2=20$ and $Z=1100$ $x_1=60, x_2=30$ and $Z=1200$ $x_1=50, x_2=40$ and $Z=1150$
asked Nov 5, 2017 in Unknown Category Arjun 64 views
1 vote
1 answer
16
Which of the following is a valid reason for causing degeneracy in a transportation problem? Here $m$ is number of rows and $n$ is number of columns in transportation table. When the number of allocations is $m+n-1$ When two or more occupied cells become unoccupied ... allocations is less than $m+n-1$ When a loop cannot be drawn without using unoccupied cells, except the starting cell of the loop
asked Nov 5, 2017 in Unknown Category Arjun 57 views
1 vote
0 answers
17
Consider the following languages: $L_1 = \{ a^mb^n \mid m \neq n\}$ $L_2 = \{ a^mb^n \mid m = 2n+1\}$ $L3 = \{ a^mb^n \mid m \neq 2n\}$ Which one of the following statements is correct? Only $L_1$ and $L_2$ are context free languages Only $L_1$ and $L_3$ are context free languages Only $L_2$ and $L_3$ are context free languages $L_1$, $L_2$ and $L_3$ are context free languages
asked Nov 5, 2017 in Unknown Category Arjun 76 views
1 vote
1 answer
18
Context free grammar is not closed under Concatenation Complementation Kleene Star Union
asked Nov 5, 2017 in Unknown Category Arjun 45 views
1 vote
0 answers
19
A $4 \times 4$ DFT matrix is given by $\dfrac{1}{2} \begin{bmatrix} 1 & 1 & 1 & 1 \\ 1 & x & -1 & y \\ 1 & -1 & 1 & -1 \\ 1 & -j & -1 & j \end{bmatrix} \\ j^2 = -1$ Where the values of $x$ and $y$ are ______, _____ respectively. $1, -1$ $-1,1$ $-j,j$ $j, -j$
asked Nov 5, 2017 in Unknown Category Arjun 60 views
1 vote
0 answers
20
Entropy of a discrete random variable with possible values $\{x_1, x_2, \dots , x_n\}$ and probability density function $P(X)$ is $H(X) = \: – \sum\limits_{i=1}^{n}P(x_i) \log _bP(x_i)$ The value of $b$ gives the units of entropy. The unit for $b=10$ is bits bann nats deca
asked Nov 5, 2017 in Unknown Category Arjun 54 views
1 vote
0 answers
21
For any binary $(n,h)$ linear code with minimum distance $(2t+1)$ or greater $n-h \geq \log_2 \bigg[ \sum \limits_{i=0}^{\alpha} \begin{pmatrix} n \\ i \end{pmatrix} \bigg]$ where $\alpha$ is $2t+1$ $t+1$ $t-1$ $t$
asked Nov 5, 2017 in Unknown Category Arjun 44 views
1 vote
0 answers
22
Consider the following two well-formed formulas in prepositional logic. $F1 : P \Rightarrow \neg P$ $F2: (P \Rightarrow \neg P) \vee (\neg P \Rightarrow P)$ Which of the following statements is correct? $F1$ is Satisfiable, $F2$ is valid $F1$ is unsatisfiable, $F2$ is Satisfiable $F1$ is unsatisfiable, $F2$ is valid $F1$ and $F2$ both are Satisfiable
asked Nov 5, 2017 in Unknown Category Arjun 37 views
1 vote
0 answers
23
Let $P, Q, R$ and $S$ be Propositions. Assume that the equivalences $P \Leftrightarrow (Q \vee \neg Q )$ and $Q \Leftrightarrow R$ hold. Then the truth value of the formula $(P \wedge Q) \Rightarrow ((P \wedge R) \vee S)$ is always True False Same as truth table of $Q$ Same as truth table of $S$
asked Nov 5, 2017 in Unknown Category Arjun 78 views
1 vote
0 answers
24
“If $X$, then $Y$ unless $Z$” is represented by which of the following formulae in propositional logic? $(X \wedge Y) \rightarrow \neg Z$ $(X \wedge \neg Z) \rightarrow Y$ $X \rightarrow (Y \wedge \neg Z)$ $Y \rightarrow (X \wedge \neg Z)$
asked Nov 5, 2017 in Unknown Category Arjun 72 views
1 vote
1 answer
25
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
asked Nov 5, 2017 in Unknown Category Arjun 52 views
1 vote
0 answers
26
Which of the following statements is not correct? Every recursive language is recursively enumerable $L=\{ 0^n \: 1^n \: 0^n \mid n=1,2,3, \dots \}$ is recursively enumerable Recursive languages are closed under intersection Recursive languages are not closed under intersection
asked Nov 5, 2017 in Unknown Category Arjun 47 views
1 vote
0 answers
27
Consider a system with five processes $P_0$ through $P_4$ and three resource types $A, B$ and $C$. Resource type $A$ has seven instances, resource type $B$ has two instances and resource type $C$ ... the following allocation. If we implement Deadlock detection algorithm we claim that system is ________ Semaphore Deadlock state Circular wait Not in deadlock state
asked Nov 5, 2017 in Unknown Category Arjun 51 views
1 vote
0 answers
28
Consider a disk queue with requests for I/O to blocks on cylinders $98, 183, 37, 122, 14, 124, 65, 67$. Suppose SSTF disk scheduling algorithm implemented to meet the requests then the total number of head movements are ________ if the disk head is initially at $53$. $224$ $248$ $236$ $240$
asked Nov 5, 2017 in Unknown Category Arjun 51 views
1 vote
1 answer
29
The Bounded buffer problem is also known as ___________ Producer – consumer problem Reader – writer problem Dining Philosophers problem Both $(2)$ and $(3)$
asked Nov 5, 2017 in Unknown Category Arjun 54 views
1 vote
0 answers
30
...