Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ugcnetcse-june2015-paper3
4
votes
1
answer
1
UGC NET CSE | Junet 2015 | Part 3 | Question: 75
The unix command: $ vi file1 file2 Edits file1 and stores the contents of file1 in file2 Both files i.e., file1 and file2 can be edited using 'ex' command to travel between the files Both files can be edited using 'mv' command to move between the files Edits file1 first, saves it and then edits file2
The unix command: $ vi file1 file2Edits file1 and stores the contents of file1 in file2Both files i.e., file1 and file2 can be edited using 'ex' command to travel between...
go_editor
1.8k
views
go_editor
asked
Aug 2, 2016
Operating System
ugcnetcse-june2015-paper3
shell-script
+
–
2
votes
1
answer
2
UGC NET CSE | Junet 2015 | Part 3 | Question: 74
WOW32 is a Win 32 API library for creating processes and threads Special kind of file system to the NT name space Kernel-mode objects accessible through Win 32 API Special execution environment used to run 16 bit Windows applications on 32-bit machines
WOW32 is aWin 32 API library for creating processes and threadsSpecial kind of file system to the NT name spaceKernel-mode objects accessible through Win 32 APISpecial ex...
go_editor
1.5k
views
go_editor
asked
Aug 2, 2016
Others
ugcnetcse-june2015-paper3
windows-programming
+
–
3
votes
1
answer
3
UGC NET CSE | Junet 2015 | Part 3 | Question: 73
Match the following for UNIX system calls : ... $\text{(a)-(iv), (b)-(iii), (c)-(i), (d)-(ii)}$
Match the following for UNIX system calls :$\begin{array}{clcl} &\textbf{List-I} && \textbf{List-II} \\ \text{(a)} & \text{exec} & \text{(i)} & \text{Creates new process...
go_editor
2.6k
views
go_editor
asked
Aug 2, 2016
Operating System
ugcnetcse-june2015-paper3
operating-system
unix
+
–
4
votes
3
answers
4
UGC NET CSE | Junet 2015 | Part 3 | Question: 72
Suppose the function y and a fuzzy integer number around - 4 for x are given as $y=(x-3)^2 + 2$. Around - 4 ={(2, 0.3), (3, 0.6), (4, 1), (5, 0.6), (6, 0.3)} respectively. Then f(Around-4) is given by {(2, 0.6), (3, 0.3), (6, 1), (11, 0.3)} {(2, 0.6), (3, ... (11, 0.3)} {(2, 0.6), (3, 1), (6, 0.6), (11, 0.3)} {(2, 0.6), (3, 0.3), (6, 0.6), (11, 0.3)}
Suppose the function y and a fuzzy integer number around - 4 for x are given as $y=(x-3)^2 + 2$. Around - 4 ={(2, 0.3), (3, 0.6), (4, 1), (5, 0.6), (6, 0.3)} respectively...
go_editor
7.1k
views
go_editor
asked
Aug 2, 2016
Others
ugcnetcse-june2015-paper3
fuzzy-set
neural-network
+
–
4
votes
1
answer
5
UGC NET CSE | Junet 2015 | Part 3 | Question: 71
Let A and B be two fuzzy integers defined as: A={(1.0.3), (2, 0.6), (3, 1), (4, 0.7), (5, 0.2)} B={(10, 0.5), (11, 1), (12, 0.5)} Using fuzzy arithmetic operation given by $\mu_{A+B^{(Z)}} = \underset{x+y=z}{\oplus} (\mu_A (x) \otimes \mu_B(y))$ ... , 0.5), (17, 0.2)} {(11, 0.3), (12, 0.5), (13, 0.6), (14, 1), (15, 0.7), (16, 0.5), (17, 0.2)}
Let A and B be two fuzzy integers defined as:A={(1.0.3), (2, 0.6), (3, 1), (4, 0.7), (5, 0.2)}B={(10, 0.5), (11, 1), (12, 0.5)}Using fuzzy arithmetic operation given by$\...
go_editor
5.6k
views
go_editor
asked
Aug 2, 2016
Others
ugcnetcse-june2015-paper3
fuzzy-set
neural-network
+
–
3
votes
2
answers
6
UGC NET CSE | Junet 2015 | Part 3 | Question: 70
Consider the two class classification task that consists of the following points: Class $C_1$ : [1 1.5] [1 -1.5] Class $C_2$ : [-2 2.5] [-2 -2.5] The decision boundary between the two classes using single perceptron is given by: $x_1+x_2+1.5=0$ $x_1+x_2-1.5=0$ $x_1+1.5=0$ $x_1-1.5=0$
Consider the two class classification task that consists of the following points:Class $C_1$: [1 1.5][1 -1.5]Class $C_2$: [-2 2.5][-2 -2.5]The decision boundary b...
go_editor
4.1k
views
go_editor
asked
Aug 2, 2016
Others
ugcnetcse-june2015-paper3
fuzzy-set
neural-network
+
–
2
votes
1
answer
7
UGC NET CSE | Junet 2015 | Part 3 | Question: 69
Given the following statements with respect to linear programming problem: S1: The dual of the dual linear programming problem is again the primal problem S2: If either the primal or the dual problem has an unbounded objective function value, the other problem ... are equal. Which of the following is true? S1 and S2 S1 and S3 S2 and S3 S1, S2 and S3
Given the following statements with respect to linear programming problem:S1: The dual of the dual linear programming problem is again the primal problemS2: If either the...
go_editor
2.4k
views
go_editor
asked
Aug 2, 2016
Optimization
ugcnetcse-june2015-paper3
optimization
linear-programming
+
–
3
votes
3
answers
8
UGC NET CSE | Junet 2015 | Part 3 | Question: 68
Consider the following transportation problem: The initial basic feasible solution of the above transportation problem using Vogel's Approximation method (VAM) is given below: The solution of the above problem: is degenerate solution is optimum solution needs to improve is infeasible solution
Consider the following transportation problem:The initial basic feasible solution of the above transportation problem using Vogel's Approximation method (VAM) is given be...
go_editor
10.9k
views
go_editor
asked
Aug 2, 2016
Optimization
ugcnetcse-june2015-paper3
transportation-problem
optimization
+
–
3
votes
1
answer
9
UGC NET CSE | Junet 2015 | Part 3 | Question: 67
In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of rows or columns rows + columns rows + columns -1 rows + columns +1
In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero oppor...
go_editor
3.6k
views
go_editor
asked
Aug 2, 2016
Optimization
ugcnetcse-june2015-paper3
assignment-problem
optimization
+
–
3
votes
1
answer
10
UGC NET CSE | Junet 2015 | Part 3 | Question: 66
In a binary Hamming Code the number of check digits is r then number of message digits is equal to $2^r-1$ $2^r-r-1$ $2^r-r+1$ $2^r+r-1$
In a binary Hamming Code the number of check digits is r then number of message digits is equal to$2^r-1$$2^r-r-1$$2^r-r+1$$2^r+r-1$
go_editor
3.3k
views
go_editor
asked
Aug 2, 2016
Computer Networks
ugcnetcse-june2015-paper3
computer-networks
hamming-code
+
–
3
votes
2
answers
11
UGC NET CSE | Junet 2015 | Part 3 | Question: 65
The redundancy in images stems from pixel decolleration pixel colleration pixel quantization image size
The redundancy in images stems frompixel decollerationpixel collerationpixel quantizationimage size
go_editor
1.9k
views
go_editor
asked
Aug 2, 2016
Others
ugcnetcse-june2015-paper3
data-compression
digital-image-processing
+
–
2
votes
2
answers
12
UGC NET CSE | Junet 2015 | Part 3 | Question: 64
Given the symbols A, B, C, D, E, F, G and H with the probabilities$\frac{1}{30}, \frac{1}{30}, \frac{1}{30}, \frac{2}{30}, \frac{3}{30}, \frac{5}{30}, \frac{5}{30}$ and $\frac{12}{30}$respectively. The average Huffman code size in bits per symbol is $\frac{67}{30}$ $\frac{70}{34}$ $\frac{76}{30}$ $\frac{78}{30}$
Given the symbols A, B, C, D, E, F, G and H with the probabilities$\frac{1}{30}, \frac{1}{30}, \frac{1}{30}, \frac{2}{30}, \frac{3}{30}, \frac{5}{30}, \frac{5}{30}$ and $...
go_editor
6.1k
views
go_editor
asked
Aug 2, 2016
Algorithms
ugcnetcse-june2015-paper3
algorithms
greedy-algorithms
huffman-code
+
–
5
votes
4
answers
13
UGC NET CSE | Junet 2015 | Part 3 | Question: 63
Given the following grammars: $G_1$ $S \rightarrow AB \mid aaB$ $A \rightarrow aA \mid \epsilon$ $B \rightarrow bB \mid \epsilon$ $G_2$: $S \rightarrow A \mid B$ $A \rightarrow a A b \mid ab$ ... is unambiguous and $G_2$ is ambiguous grammars both $G_1$ and $G_2$ are ambiguous grammars both $G_1$ and $G_2$ are unambiguous grammars
Given the following grammars:$G_1$$S \rightarrow AB \mid aaB$ $A \rightarrow aA \mid \epsilon$ $B \rightarrow bB \mid \epsilon$$G_2$:$S \rightarrow A \mid B$ $A \rightarr...
go_editor
4.7k
views
go_editor
asked
Aug 2, 2016
Theory of Computation
ugcnetcse-june2015-paper3
theory-of-computation
compiler-design
+
–
3
votes
2
answers
14
UGC NET CSE | Junet 2015 | Part 3 | Question: 62
Given the following two statements: $S_1$: If $L_1$ and $L_2$ are recursively enumerable languages over $\Sigma^*$, then $L_1 \cup L_2$ and $L_1 \cap L_2$ are also recursively enumerable. $S_2$: The set of recursively enumerable languages is ... not correct and $S_2$ is correct Both $S_1$ and $S_2$ are not correct Both $S_1$ and $S_2$ are correct
Given the following two statements:$S_1$: If $L_1$ and $L_2$ are recursively enumerable languages over $\Sigma^*$, then $L_1 \cup L_2$ and $L_1 \cap L_2$ are also recursi...
go_editor
2.0k
views
go_editor
asked
Aug 2, 2016
Theory of Computation
ugcnetcse-june2015-paper3
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
3
votes
2
answers
15
UGC NET CSE | Junet 2015 | Part 3 | Question: 61
A context free grammar for $L=\{w \mid n_0 (w) > n_1 (w)\}$ is given by: $S \rightarrow 0 \mid 0S \mid 1 S S$ $S \rightarrow 0 S \mid 1 S \mid 0 S S \mid 1 S S \mid 0 \mid 1$ $S \rightarrow 0 \mid 0 S \mid 1 S S \mid S 1 S \mid S S 1$ $S \rightarrow 0 S \mid 1 S \mid 0 \mid 1$
A context free grammar for $L=\{w \mid n_0 (w) n_1 (w)\}$ is given by:$S \rightarrow 0 \mid 0S \mid 1 S S$$S \rightarrow 0 S \mid 1 S \mid 0 S S \mid 1 S S \mid 0 \mid 1...
go_editor
2.9k
views
go_editor
asked
Aug 1, 2016
Theory of Computation
ugcnetcse-june2015-paper3
theory-of-computation
context-free-grammar
+
–
2
votes
2
answers
16
UGC NET CSE | Junet 2015 | Part 3 | Question: 60
Match the following : ... $\text{(a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)}$
Match the following :$\begin{array}{clcl} & \textbf{List-I} & & \textbf{List-II} \\ \text{(a)} & \text{Joint Application} & \text{(i)} & \text{Delivers functionality in...
go_editor
1.6k
views
go_editor
asked
Aug 1, 2016
IS&Software Engineering
ugcnetcse-june2015-paper3
is&software-engineering
+
–
3
votes
1
answer
17
UGC NET CSE | Junet 2015 | Part 3 | Question: 59
Match the following with respect to heuristic search techniques $:$ ... $\text{(a)-(iv), (b)-(ii), (c)-(i), (d)-(iii)}$
Match the following with respect to heuristic search techniques $:$$\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{(a)} & \text{Steepest-accce...
go_editor
2.9k
views
go_editor
asked
Aug 1, 2016
Artificial Intelligence
ugcnetcse-june2015-paper3
artificial-intelligence
+
–
3
votes
1
answer
18
UGC NET CSE | Junet 2015 | Part 3 | Question: 58
Which of the following statements is true for Branch-and-Bound search? Underestimates of remaining distance may cause deviation from optimal path Overestimates can't cause right path to be overlooked Dynamic programming principle can be used to discard redundant partial paths All of the above
Which of the following statements is true for Branch-and-Bound search?Underestimates of remaining distance may cause deviation from optimal pathOverestimates can't cause ...
go_editor
4.0k
views
go_editor
asked
Aug 1, 2016
Algorithms
ugcnetcse-june2015-paper3
algorithms
branch-and-bound
tree-search-algorithm
graph-search
+
–
5
votes
2
answers
19
UGC NET CSE | Junet 2015 | Part 3 | Question: 57
In propositional language $P \leftrightarrow Q$ is equivalent to (where $\sim$ denotes NOT) $\sim (P \vee Q) \wedge \sim (Q \vee P)$ $(\sim P \vee Q) \wedge (\sim Q \vee P)$ $(P \vee Q) \wedge (Q \vee P)$ $\sim (P \vee Q) \rightarrow \sim (Q \vee P)$
In propositional language $P \leftrightarrow Q$ is equivalent to (where $\sim$ denotes NOT)$\sim (P \vee Q) \wedge \sim (Q \vee P)$$(\sim P \vee Q) \wedge (\sim Q \vee P)...
go_editor
1.2k
views
go_editor
asked
Aug 1, 2016
Discrete Mathematics
ugcnetcse-june2015-paper3
discrete-mathematics
propositional-logic
+
–
2
votes
1
answer
20
UGC NET CSE | Junet 2015 | Part 3 | Question: 56
Match the following knowledge representation techniques with their applications $:$ ... $\text{(a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)}$
Match the following knowledge representation techniques with their applications $:$$\begin{array}{clcl} & \textbf{List – I} & &\textbf{List – II} \\ \text{(a)} & \t...
go_editor
1.7k
views
go_editor
asked
Aug 1, 2016
Artificial Intelligence
ugcnetcse-june2015-paper3
artificial-intelligence
+
–
3
votes
1
answer
21
UGC NET CSE | Junet 2015 | Part 3 | Question: 55
Match the following : ... $\text{(a)-(i), (b)-(iii), (c)-(iv), (d)-(ii)}$
Match the following :$\begin{array}{clcl} & \textbf{List-I} && \textbf{List-II} \\ \text{(a)} & \text{Intelligence} & \text{(i)} & \text{Contextual, tacit, transfer need...
go_editor
2.0k
views
go_editor
asked
Aug 1, 2016
Others
ugcnetcse-june2015-paper3
management-information-system
+
–
2
votes
1
answer
22
UGC NET CSE | Junet 2015 | Part 3 | Question: 54
A unix file may be of the type Regular file Directory file Device file Any one of the above
A unix file may be of the typeRegular fileDirectory fileDevice fileAny one of the above
go_editor
2.8k
views
go_editor
asked
Aug 1, 2016
Operating System
ugcnetcse-june2015-paper3
operating-system
unix
+
–
4
votes
2
answers
23
UGC NET CSE | Junet 2015 | Part 3 | Question: 53
In _____ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy Index Linked Contiguous Bit Map
In _____ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easyIndexLinkedContiguousBit Map
go_editor
3.9k
views
go_editor
asked
Aug 1, 2016
Operating System
ugcnetcse-june2015-paper3
operating-system
file-system
+
–
2
votes
2
answers
24
UGC NET CSE | Junet 2015 | Part 3 | Question: 52
Dining Philosopher's problem is a Producer - consumer problem Classical IPC problem Starvation problem Synchronization primitive
Dining Philosopher's problem is aProducer - consumer problemClassical IPC problemStarvation problemSynchronization primitive
go_editor
3.6k
views
go_editor
asked
Aug 1, 2016
Operating System
ugcnetcse-june2015-paper3
operating-system
+
–
4
votes
1
answer
25
UGC NET CSE | Junet 2015 | Part 3 | Question: 51
What is the most appropriate function of Memory Management Unit (MMU)? It is an associative memory to store TLB It is a technique of supporting multiprogramming by creating dynamic partitions It is a chip to map virtual address to physical address It is an algorithm to allocate and deallocate main memory to a process
What is the most appropriate function of Memory Management Unit (MMU)?It is an associative memory to store TLBIt is a technique of supporting multiprogramming by creating...
go_editor
2.0k
views
go_editor
asked
Aug 1, 2016
Operating System
ugcnetcse-june2015-paper3
operating-system
memory-management
+
–
4
votes
1
answer
26
UGC NET CSE | Junet 2015 | Part 3 | Question: 50
Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm? Queues have different priorities Each queue may have different scheduling algorithm Processes are permanently assigned to a queue This algorithm can be configured to match a specific system under design
Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm?Queues have different prioritiesEach queue may have different ...
go_editor
3.5k
views
go_editor
asked
Aug 1, 2016
Operating System
ugcnetcse-june2015-paper3
operating-system
process-scheduling
+
–
2
votes
1
answer
27
UGC NET CSE | Junet 2015 | Part 3 | Question: 49
Match the following for operating system techniques with the most appropriate advantage : ... $\text{(a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)}$
Match the following for operating system techniques with the most appropriate advantage :$\begin{array}{clcl} & \textbf{List-I} && \textbf{List-II}\\ \text{(a)} & \text{...
go_editor
2.0k
views
go_editor
asked
Aug 1, 2016
Operating System
ugcnetcse-june2015-paper3
operating-system
+
–
4
votes
1
answer
28
UGC NET CSE | Junet 2015 | Part 3 | Question: 48
A software design is highly modular if cohesion is functional and coupling is data type cohesion is coincidental and coupling is data type cohesion is sequential and coupling is content type cohesion is functional and coupling is stamp type
A software design is highly modular ifcohesion is functional and coupling is data typecohesion is coincidental and coupling is data typecohesion is sequential and couplin...
go_editor
2.6k
views
go_editor
asked
Aug 1, 2016
IS&Software Engineering
ugcnetcse-june2015-paper3
is&software-engineering
software-design
+
–
3
votes
1
answer
29
UGC NET CSE | Junet 2015 | Part 3 | Question: 47
A Design Concept Refinement is a Top-down approach Complementary of abstraction concept process of elaboration All of the above
A Design Concept Refinement is aTop-down approachComplementary of abstraction conceptprocess of elaborationAll of the above
go_editor
3.7k
views
go_editor
asked
Aug 1, 2016
IS&Software Engineering
ugcnetcse-june2015-paper3
software-design
is&software-engineering
+
–
4
votes
1
answer
30
UGC NET CSE | Junet 2015 | Part 3 | Question: 46
Adaptive maintenance is a maintenance which _____ correct errors that were not discovered till testing phase is carried out to port the existing software to a new environment improves the system performance both B and C
Adaptive maintenance is a maintenance which _____correct errors that were not discovered till testing phaseis carried out to port the existing software to a new environme...
go_editor
3.1k
views
go_editor
asked
Aug 1, 2016
IS&Software Engineering
ugcnetcse-june2015-paper3
software-maintenance
is&software-engineering
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register