Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged ugcnetcse-nov2017-paper3
1
vote
2
answers
1
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)$
Arjun
asked
in
Operating System
Nov 5, 2017
by
Arjun
550
views
ugcnetcse-nov2017-paper3
operating-system
system-call
1
vote
3
answers
2
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)
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
469
views
ugcnetcse-nov2017-paper3
1
vote
2
answers
3
UGC NET CSE | November 2017 | Part 3 | Question: 73
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)
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
299
views
ugcnetcse-nov2017-paper3
1
vote
2
answers
4
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)}$
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
486
views
ugcnetcse-nov2017-paper3
1
vote
2
answers
5
UGC NET CSE | November 2017 | Part 3 | Question: 71
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$
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
780
views
ugcnetcse-nov2017-paper3
1
vote
1
answer
6
UGC NET CSE | November 2017 | Part 3 | Question: 70
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 ... $y=\underset{i}{\text{max}} [\alpha _i f_i (x_1, x_2, \dots , x_r)]$
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
262
views
ugcnetcse-nov2017-paper3
1
vote
1
answer
7
UGC NET CSE | November 2017 | Part 3 | Question: 69
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$
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
732
views
ugcnetcse-nov2017-paper3
1
vote
1
answer
8
UGC NET CSE | November 2017 | Part 3 | Question: 68
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$
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
349
views
ugcnetcse-nov2017-paper3
1
vote
1
answer
9
UGC NET CSE | November 2017 | Part 3 | Question: 67
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 ... less than $m+n-1$ When a loop cannot be drawn without using unoccupied cells, except the starting cell of the loop
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
267
views
ugcnetcse-nov2017-paper3
1
vote
0
answers
10
UGC NET CSE | November 2017 | Part 3 | Question: 66
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$
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
148
views
ugcnetcse-nov2017-paper3
1
vote
0
answers
11
UGC NET CSE | November 2017 | Part 3 | Question: 65
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
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
398
views
ugcnetcse-nov2017-paper3
1
vote
1
answer
12
UGC NET CSE | November 2017 | Part 3 | Question: 64
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$
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
220
views
ugcnetcse-nov2017-paper3
1
vote
0
answers
13
UGC NET CSE | November 2017 | Part 3 | Question: 63
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$ ... $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
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
191
views
ugcnetcse-nov2017-paper3
1
vote
1
answer
14
UGC NET CSE | November 2017 | Part 3 | Question: 62
Context free grammar is not closed under Concatenation Complementation Kleene Star Union
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
164
views
ugcnetcse-nov2017-paper3
1
vote
0
answers
15
UGC NET CSE | November 2017 | Part 3 | Question: 61
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
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
177
views
ugcnetcse-nov2017-paper3
1
vote
1
answer
16
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
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
200
views
ugcnetcse-nov2017-paper3
1
vote
2
answers
17
UGC NET CSE | November 2017 | Part 3 | Question: 59
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$ ... $F1$ is unsatisfiable, $F2$ is Satisfiable $F1$ is unsatisfiable, $F2$ is valid $F1$ and $F2$ both are Satisfiable
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
342
views
ugcnetcse-nov2017-paper3
1
vote
2
answers
18
UGC NET CSE | November 2017 | Part 3 | Question: 58
“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)$
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
365
views
ugcnetcse-nov2017-paper3
1
vote
1
answer
19
UGC NET CSE | November 2017 | Part 3 | Question: 57
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$
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
1.1k
views
ugcnetcse-nov2017-paper3
1
vote
1
answer
20
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)$
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
246
views
ugcnetcse-nov2017-paper3
1
vote
0
answers
21
UGC NET CSE | November 2017 | Part 3 | Question: 55
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
110
views
ugcnetcse-nov2017-paper3
1
vote
1
answer
22
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)$
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
242
views
ugcnetcse-nov2017-paper3
1
vote
0
answers
23
UGC NET CSE | November 2017 | Part 3 | Question: 53
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$
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
165
views
ugcnetcse-nov2017-paper3
1
vote
2
answers
24
UGC NET CSE | November 2017 | Part 3 | Question: 52
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$ has six ... . If we implement Deadlock detection algorithm we claim that system is ________ Semaphore Deadlock state Circular wait Not in deadlock state
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
435
views
ugcnetcse-nov2017-paper3
1
vote
2
answers
25
UGC NET CSE | November 2017 | Part 3 | Question: 51
User level threads are threads that are visible to the programmer and are unknown to the kernel. The operating system kernel supports and manages kernel level threads. Three different types of models relate user and kernel level threads. Which of the following ... is false; (b) is true Both (a) and (b) are true Both (a) and (b) are false
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
318
views
ugcnetcse-nov2017-paper3
1
vote
0
answers
26
UGC NET CSE | November 2017 | Part 3 | Question: 50
Consider a virtual page reference string $7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1$. Suppose a demand paged virtual memory system running on a computer system such that the main memory has $3$ page frames. Then ______ page replacement algorithm has minimum number of page faults. FIFO LIFO LRU Optimal
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
208
views
ugcnetcse-nov2017-paper3
1
vote
0
answers
27
UGC NET CSE | November 2017 | Part 3 | Question: 49
Consider the following four processes with the arrival time and length of CPU burst given in milliseconds: ... waiting time for preemptive SJF scheduling algorithm is ____________ $6.5$ ms $7.5$ ms $6.75$ ms $7.75$ ms
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
172
views
ugcnetcse-nov2017-paper3
1
vote
4
answers
28
UGC NET CSE | November 2017 | Part 3 | Question: 48
In Software Configuration Management (SCM), which of the following is a use-case supported by standard version control systems? Managing several versions or release of a software Filing bug reports and tracking their progress Allowing team members to work in parallel Identifying when ... b), and (c) Only (a), (b), and (d) Only (b), (c), and (d)
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
315
views
ugcnetcse-nov2017-paper3
1
vote
2
answers
29
UGC NET CSE | November 2017 | Part 3 | Question: 47
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$ ... long does the software project take to complete? $10.52$ months $11.52$ months $12.52$ months $14.52$ months
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
715
views
ugcnetcse-nov2017-paper3
1
vote
1
answer
30
UGC NET CSE | November 2017 | Part 3 | Question: 46
Consider the method mcq (); int mcq (boolean a, boolean b, boolean c, boolean d) { int ans=1; if (a) {ans=2;} else if (b) {ans=3;} else if (c) { if (d) {ans=4;} } return ans; } If $M1=$ Number of tests to exhaustively test mcq(); $M2=$ ... branch coverage for mcq ( ); then $(M1,M2,M3)=$ ______________ $(16,3,5)$ $(8,5,3)$ $(8,3,5)$ $(16,4,4)$
Arjun
asked
in
Unknown Category
Nov 5, 2017
by
Arjun
252
views
ugcnetcse-nov2017-paper3
Page:
1
2
3
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged ugcnetcse-nov2017-paper3
Recent Blog Comments
Please upload 4th Mock Test, due date was 4th Dec.
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....