Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ugcnetcse-dec2013-paper3
3
votes
1
answer
61
UGC NET CSE | December 2013 | Part 3 | Question: 8
One weakness of boundary value analysis and equivalence partitioning is they are not effective they do not explore combinations of input circumstances they explore combinations of input circumstances none of the above
One weakness of boundary value analysis and equivalence partitioning isthey are not effectivethey do not explore combinations of input circumstancesthey explore combinati...
go_editor
3.8k
views
go_editor
asked
Jul 27, 2016
IS&Software Engineering
ugcnetcse-dec2013-paper3
is&software-engineering
software-testing
+
–
2
votes
1
answer
62
UGC NET CSE | December 2013 | Part 3 | Question: 7
A process which defines a series of tasks that have the following four primary objectives is known as to identify all items that collectively define the software configuration to manage changes to ... Software Quality Management Process Software Configuration Management Process Software Version Management Process Software Change Management Process
A process which defines a series of tasks that have the following four primary objectives is known asto identify all items that collectively define the software configura...
go_editor
1.6k
views
go_editor
asked
Jul 27, 2016
IS&Software Engineering
ugcnetcse-dec2013-paper3
is&software-engineering
software-configuration
+
–
4
votes
1
answer
63
UGC NET CSE | December 2013 | Part 3 | Question: 6
Match the following $:$ ... $\text{a-ii, b-iii, c-iv, d-i}$ $\text{a-iii, b-ii, c-iv, d-i}$
Match the following $:$$\begin{array}{} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Data Coupling} & \text{i. }& \text{Module A and Module B have ...
go_editor
3.1k
views
go_editor
asked
Jul 27, 2016
IS&Software Engineering
ugcnetcse-dec2013-paper3
is&software-engineering
coupling
+
–
2
votes
2
answers
64
UGC NET CSE | December 2013 | Part 3 | Question: 5
Function points can be calculated by UFP * CAF UFP * FAC UFP * Cost UFP * Productivity
Function points can be calculated byUFP * CAFUFP * FACUFP * CostUFP * Productivity
go_editor
5.0k
views
go_editor
asked
Jul 27, 2016
IS&Software Engineering
ugcnetcse-dec2013-paper3
is&software-engineering
cost-estimation-model
+
–
3
votes
1
answer
65
UGC NET CSE | December 2013 | Part 3 | Question: 4
Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be 4, 5 5, 4 3, 1 13, 8
Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be4, 55...
go_editor
10.8k
views
go_editor
asked
Jul 27, 2016
Compiler Design
ugcnetcse-dec2013-paper3
compiler-design
control-flow-graph
+
–
2
votes
1
answer
66
UGC NET CSE | December 2013 | Part 3 | Question: 3
The following Linear Programming problem has: $\text{Max} \quad Z=x_1+x_2$ Subject to $\quad x_1-x_2 \geq 0$ $\quad \quad \quad 3x_1 - x_2 \leq -3$ $\text{and} \quad x_1 , x_2 \geq 0 $ Feasible solution No feasible solution Unbounded solution Single point as solution
The following Linear Programming problem has:$\text{Max} \quad Z=x_1+x_2$Subject to $\quad x_1-x_2 \geq 0$$\quad \quad \quad 3x_1 - x_2 \leq -3$$\text{and} \quad x_1 , x_...
go_editor
2.5k
views
go_editor
asked
Jul 27, 2016
Optimization
ugcnetcse-dec2013-paper3
optimization
linear-programming
+
–
2
votes
1
answer
67
UGC NET CSE | December 2013 | Part 3 | Question: 2
Given the problem to maximize $f(x), X=(x_1, x_2, \dots , x_n)$ subject to m number of in equality constraints. $g_i(x) \leq b_i$, i=1, 2, .... m including the non-negativity constrains $x \geq 0$. Which of the following conditions is a Kuhn-Tucker necessary ... $g_i (\bar{X}) \leq b_i, i=1,2 \dots m$ All of these
Given the problem to maximize $f(x), X=(x_1, x_2, \dots , x_n)$ subject to m number of in equality constraints. $g_i(x) \leq b_i$, i=1, 2, .... m including the non-negati...
go_editor
871
views
go_editor
asked
Jul 27, 2016
Optimization
ugcnetcse-dec2013-paper3
optimization
linear-programming
+
–
3
votes
1
answer
68
UGC NET CSE | December 2013 | Part 3 | Question: 1
If the primal Linear Programming problem has unbounded solution, then it's dual problem will have feasible solution alternative solution no feasible solution at all no alternative solution at all
If the primal Linear Programming problem has unbounded solution, then it's dual problem will havefeasible solutionalternative solutionno feasible solution at allno altern...
go_editor
2.3k
views
go_editor
asked
Jul 27, 2016
Optimization
ugcnetcse-dec2013-paper3
optimization
linear-programming-problem
+
–
2
votes
1
answer
69
UGC NET CSE | June 2012 | Part 3 | Question: 25, UGCNET-Dec2013-III: 42
Which is not the correct statement(s)? Every context sensitive language is recursive There is a recursive language that is not context sensitive I is true II is false I is true and II is true I is false II is false I is false and II is true
Which is not the correct statement(s)?Every context sensitive language is recursiveThere is a recursive language that is not context sensitiveI is true II is falseI is tr...
go_editor
4.6k
views
go_editor
asked
Jul 7, 2016
Theory of Computation
ugcnetcse-june2012-paper3
ugcnetcse-dec2013-paper3
theory-of-computation
+
–
1
votes
1
answer
70
UGC NET CSE | December 2013 | Part 3 | Question: 34
______ comparisons are necessary in the worst case to find both the maximum and minimum of n numbers. 2n – 2 n + floor (lg n) – 2 floor ($\frac{3n}{2}$) – 2 2 lg n – 2
______ comparisons are necessary in the worst case to find both the maximum and minimum of n numbers.2n – 2n + floor (lg n) – 2floor ($\frac{3n}{2}$) – ...
Sanjay Sharma
1.3k
views
Sanjay Sharma
asked
Jun 20, 2016
Programming in C
ugcnetcse-dec2013-paper3
programming
+
–
1
votes
1
answer
71
UGC NET CSE | December 2013 | Part 3 | Question: 57
Find the false statement: The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999) A weak relationship occurs when two relationship types are linked by either Event- ... Quaternary and Quintary relationships are shown through a series of application scenario’s and vignette’s.
Find the false statement:The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999)A weak relationship occurs when two rela...
Sanjay Sharma
1.2k
views
Sanjay Sharma
asked
May 11, 2016
Databases
ugcnetcse-dec2013-paper3
databases
er-diagram
+
–
1
votes
2
answers
72
UGC NET CSE | December 2013 | Part 3 | Question: 52
Serial access memories are useful in applications where Data consists of numbers Short access time is required Each stored word is processed differently. None of these
Serial access memories are useful in applications whereData consists of numbersShort access time is requiredEach stored word is processed differently.None of these
Sanjay Sharma
1.8k
views
Sanjay Sharma
asked
May 11, 2016
CO and Architecture
ugcnetcse-dec2013-paper3
co-and-architecture
+
–
1
votes
2
answers
73
UGC NET CSE | December 2013 | Part 3 | Question: 54
The essential difference between traps and interrupts is traps are asynchronous and interrupts are synchronous with the program. traps are synchronous and interrupts are asynchronous with the program. traps are synchronous and interrupts are asynchronous with the I/O devices. None of these
The essential difference between traps and interrupts istraps are asynchronous and interrupts are synchronous with the program.traps are synchronous and interrupts are as...
Sanjay Sharma
1.8k
views
Sanjay Sharma
asked
May 11, 2016
CO and Architecture
ugcnetcse-dec2013-paper3
microprocessors
+
–
1
votes
1
answer
74
UGC NET CSE | December 2013 | Part 3 | Question: 73
Which statement is not true about process O in the Unix operating system ? Process O is called init process. Process O is not created by fork system call. After forking process 1, process O becomes swapper process. Process O is a special process created when system boots
Which statement is not true about process O in the Unix operating system ?Process O is called init process.Process O is not created by fork system call.After forking proc...
Sanjay Sharma
2.5k
views
Sanjay Sharma
asked
May 7, 2016
Operating System
ugcnetcse-dec2013-paper3
operating-system
unix
+
–
10
votes
3
answers
75
ISRO2014-21, UGCNET-Dec2012-III: 23, UGCNET-Dec2013-III: 22
What are the final values of $\text{Q}_1$ and $\text{Q}_0$ after $4$ clock cycles, if initial values are $00$ in the sequential circuit shown below: $11$ $01$ $10$ $00$
What are the final values of $\text{Q}_1$ and $\text{Q}_0$ after $4$ clock cycles, if initial values are $00$ in the sequential circuit shown below:$11$$01$$10$$00$
focus _GATE
12.4k
views
focus _GATE
asked
Jul 17, 2015
Digital Logic
isro2014
digital-logic
circuit-output
ugcnetcse-dec2012-paper3
ugcnetcse-dec2013-paper3
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register