Recent questions and answers in Unknown Category

0 votes

1 answer

1

KPGCET-CSE-2019-50
In the software testing, the behavioural testing is called White box testing Black box testing Mutation testing Integration testing

In the software testing, the behavioural testing is called White box testing Black box testing Mutation testing Integration testing

answered Aug 31 in Unknown Category nocturnal123 15 views

1 vote

1 answer

2

UGCNET-Nov2017-iii-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 instances suppose ... allocation. If we implement Deadlock detection algorithm we claim that system is ________ Semaphore Deadlock state Circular wait Not in deadlock state

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

answered Aug 29 in Unknown Category Longmei 60 views

0 votes

3 answers

3

the boolean expression y=(a+b'+a'b)c' is given by

answered Aug 25 in Unknown Category Musa 2.7k views

0 votes

2 answers

4

UGCNET-Nov2017-ii-48
Which of the following is not a Clustering method? K-Means method Self Organizing feature map method K- nearest neighbor method Agglomerative method

Which of the following is not a Clustering method? K-Means method Self Organizing feature map method K- nearest neighbor method Agglomerative method

answered Jul 15 in Unknown Category Hradesh patel 1.1k views

0 votes

2 answers

5

UGCNET-Nov2017-ii-44
What is the normal order of activities in which traditional software testing is organized? Integration Testing System Testing Unit Testing Validation Testing (c), (a), (b), (d) (c), (a), (d), (b) (d), (c), (b), (a) (b), (d), (a), (c)

What is the normal order of activities in which traditional software testing is organized? Integration Testing System Testing Unit Testing Validation Testing (c), (a), (b), (d) (c), (a), (d), (b) (d), (c), (b), (a) (b), (d), (a), (c)

answered Jul 15 in Unknown Category Hradesh patel 146 views

1 vote

1 answer

6

UGCNET-Nov2017-ii-43
Which of the following is not a key issue stressed by an agile philosophy of software engineering? The importance of self-organizing teams as well as communication and collaboration between team members and customers Recognition that change represents ... Emphasis on rapid delivery of software that satisfies the customer Having a separate testing phase after a build phase

Which of the following is not a key issue stressed by an agile philosophy of software engineering? The importance of self-organizing teams as well as communication and collaboration between team members and customers Recognition that change represents opportunity Emphasis on rapid delivery of software that satisfies the customer Having a separate testing phase after a build phase

answered Jul 15 in Unknown Category Hradesh patel 141 views

0 votes

1 answer

7

UGCNET-Nov2017-ii-39
Which module gives control of the CPU to the process selected by the short-term schedular? Dispatcher Interrupt Schedular Threading

Which module gives control of the CPU to the process selected by the short-term schedular? Dispatcher Interrupt Schedular Threading

answered Jul 15 in Unknown Category Hradesh patel 180 views

0 votes

1 answer

8

UGCNET-Nov2017-ii-42
Software re-engineering is concerned with Re-constructing the original source code from the existing machine (low-level) code program and modifying it ti make it more user-friendly Scrapping the source code of a software and re-writing it entirely ... systems to make them more maintainable Translating source code of an existing software to a new machine (low-level) language

Software re-engineering is concerned with Re-constructing the original source code from the existing machine (low-level) code program and modifying it ti make it more user-friendly Scrapping the source code of a software and re-writing it entirely from scratch ... software systems to make them more maintainable Translating source code of an existing software to a new machine (low-level) language

answered Jul 15 in Unknown Category Hradesh patel 105 views

0 votes

1 answer

9

UGCNET-Nov2017-ii-41
Software does not wear-out in the traditional sense of the term, but software does tend to deteriorate as it evolves, because Software suffers from exposure to hostile environments Defects are more likely to arise after software has been used often Multiple change requests introduce errors in component interactions Software spare parts become harder to order

Software does not wear-out in the traditional sense of the term, but software does tend to deteriorate as it evolves, because Software suffers from exposure to hostile environments Defects are more likely to arise after software has been used often Multiple change requests introduce errors in component interactions Software spare parts become harder to order

answered Jul 15 in Unknown Category Hradesh patel 86 views

0 votes

1 answer

10

UGCNET-Nov2017-ii-18
Match the following with respect to RDBMS: ... $(a)-iv; (b)-ii; (c)-iii; (d)-i$ $(a)-ii; (b)-iii; (c)-iv; (d)-i$

Match the following with respect to RDBMS: ... $(a)-iv; (b)-ii; (c)-iii; (d)-i$ $(a)-ii; (b)-iii; (c)-iv; (d)-i$

answered Jul 13 in Unknown Category Hradesh patel 53 views

0 votes

1 answer

11

UGCNET-Nov2017-ii-17
In SQL, ________ is an Aggregate function. SELECT CREATE AVG MODIFY

In SQL, ________ is an Aggregate function. SELECT CREATE AVG MODIFY

answered Jul 13 in Unknown Category Hradesh patel 42 views

0 votes

1 answer

12

UGCNET-Nov2017-ii-16
Which of the following is/are true with reference to ‘view’ in DBMS? A ‘view’ is a special stored procedure executed when certain event occurs A ‘view’ is a virtual table, which occurs after executing a pre-compiled query Only (a) is true Only (b) is true Both (a) and (b) are true Neither (a) nor (b) are true

Which of the following is/are true with reference to ‘view’ in DBMS? A ‘view’ is a special stored procedure executed when certain event occurs A ‘view’ is a virtual table, which occurs after executing a pre-compiled query Only (a) is true Only (b) is true Both (a) and (b) are true Neither (a) nor (b) are true

answered Jul 13 in Unknown Category Hradesh patel 39 views

0 votes

1 answer

13

UGCNET-Nov2017-ii-15
Which of the following is not correct (in C++)? Class templates and function templates are instantiated in the same way Class templates differ from function templates in the way they are initiated Class template is initiated by defining an object using the template argument Class templates are generally used for storage classes

Which of the following is not correct (in C++)? Class templates and function templates are instantiated in the same way Class templates differ from function templates in the way they are initiated Class template is initiated by defining an object using the template argument Class templates are generally used for storage classes

answered Jul 13 in Unknown Category Hradesh patel 51 views

1 vote

1 answer

14

UGCNET-Nov2017-iii-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

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

answered Jul 6 in Unknown Category Hradesh patel 59 views

1 vote

1 answer

15

UGCNET-Nov2017-iii-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)$

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)$

answered Jul 6 in Unknown Category Hradesh patel 59 views

1 vote

1 answer

16

UGCNET-Nov2017-iii-54
The Bounded buffer problem is also known as ___________ Producer – consumer problem Reader – writer problem Dining Philosophers problem Both $(2)$ and $(3)$

The Bounded buffer problem is also known as ___________ Producer – consumer problem Reader – writer problem Dining Philosophers problem Both $(2)$ and $(3)$

answered Jul 6 in Unknown Category Hradesh patel 60 views

1 vote

1 answer

17

UGCNET-Nov2017-iii-62
Context free grammar is not closed under Concatenation Complementation Kleene Star Union

Context free grammar is not closed under Concatenation Complementation Kleene Star Union

answered Jul 6 in Unknown Category Hradesh patel 52 views

1 vote

1 answer

18

UGCNET-Nov2017-iii-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 more occupied cells become ... is less than $m+n-1$ When a loop cannot be drawn without using unoccupied cells, except the starting cell of the loop

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

answered Jul 6 in Unknown Category Hradesh patel 63 views

1 vote

1 answer

19

UGCNET-Nov2017-iii-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)}$

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)}$

answered Jul 6 in Unknown Category Hradesh patel 101 views

1 vote

1 answer

20

UGCNET-Nov2017-iii-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)

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)

answered Jul 6 in Unknown Category Hradesh patel 120 views

1 vote

2 answers

21

UGCNET-Nov2017-iii-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)

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)

answered Jul 6 in Unknown Category Hradesh patel 168 views

1 vote

1 answer

22

UGCNET-Nov2017-iii-36
An undirected graph $G(V,E)$ contains $n(n>2)$ nodes named $v_1, v_2, \dots , v_n$. Two nodes $v_i$ and $v_j$ are connected if and only if $0< \mid i-j \mid \leq 2$. Each edge $(v_i, v_j)$ id assigned a weight $i+j$. The cost of the minimum spanning tree of such a graph with $10$ nodes is $88$ $91$ $49$ $21$

An undirected graph $G(V,E)$ contains $n(n>2)$ nodes named $v_1, v_2, \dots , v_n$. Two nodes $v_i$ and $v_j$ are connected if and only if $0< \mid i-j \mid \leq 2$. Each edge $(v_i, v_j)$ id assigned a weight $i+j$. The cost of the minimum spanning tree of such a graph with $10$ nodes is $88$ $91$ $49$ $21$

answered Jul 5 in Unknown Category FathimaMuhzina 85 views

1 vote

1 answer

23

UGCNET-Nov2017-iii-33
Consider the recurrence relation: $\begin{array}{} T(n)& =8T \bigg( \dfrac{n}{2} \bigg) + Cn, \text{if } n>1 \\ & =b, \text{if } n=1 \end{array}$ Where $b$ and $c$ are constants. The order of the algorithm corresponding to above recurrence relation is $n$ $n^2$ $n \lg n$ $n^3$

Consider the recurrence relation: $\begin{array}{} T(n)& =8T \bigg( \dfrac{n}{2} \bigg) + Cn, \text{if } n>1 \\ & =b, \text{if } n=1 \end{array}$ Where $b$ and $c$ are constants. The order of the algorithm corresponding to above recurrence relation is $n$ $n^2$ $n \lg n$ $n^3$

answered Jul 5 in Unknown Category tarulekha 74 views

0 votes

2 answers

24

NIELIT 2016 MAR Scientist C - Section C: 19
When a subroutine is called, then address of the instruction following the CAL instruction is stored in/on the Stack pointer Accumulator Program counter Stack

When a subroutine is called, then address of the instruction following the CAL instruction is stored in/on the Stack pointer Accumulator Program counter Stack

answered Jun 4 in Unknown Category harypotter0 52 views

0 votes

2 answers

25

NIELIT 2016 MAR Scientist C - Section B: 5
If $f(x,y)=x^{3}y+e^{x},$ the partial derivatives, $\dfrac{\partial f}{\partial x},\dfrac{\partial f}{\partial y}$ are $3x^{2}y+1, \: x^{3}+1$ $3x^{2}y+e^{x}, \: x^{3}$ $x^{3}y+xe^{x}, \: x^{3}+e^{x}$ $2x^{2}y+\dfrac{e^{x}}{x}$

If $f(x,y)=x^{3}y+e^{x},$ the partial derivatives, $\dfrac{\partial f}{\partial x},\dfrac{\partial f}{\partial y}$ are $3x^{2}y+1, \: x^{3}+1$ $3x^{2}y+e^{x}, \: x^{3}$ $x^{3}y+xe^{x}, \: x^{3}+e^{x}$ $2x^{2}y+\dfrac{e^{x}}{x}$

answered May 30 in Unknown Category DIBAKAR MAJEE 39 views

1 vote

2 answers

26

NIELIT 2016 MAR Scientist C - Section B: 2
The function $f(x)=x^{5}-5x^{4}+5x^{3}-1$ has one minima and two maxima two minima and one maxima two minima and two maxima one minima and one maxima

The function $f(x)=x^{5}-5x^{4}+5x^{3}-1$ has one minima and two maxima two minima and one maxima two minima and two maxima one minima and one maxima

answered May 30 in Unknown Category DIBAKAR MAJEE 52 views

0 votes

2 answers

27

NIELIT 2016 MAR Scientist C - Section B: 3
The materials $\begin{bmatrix} \cos\theta &-\sin \theta \\ \sin \theta & cos \theta \end{bmatrix}$ and $\begin{bmatrix} a & 0 \\ 0 & b \end{bmatrix}$ commute under the multiplication if $a=b \text{(or)} \theta =n\pi, \: n$ is an integer always never if $a\cos \theta \neq b\sin \theta$

The materials $\begin{bmatrix} \cos\theta &-\sin \theta \\ \sin \theta & cos \theta \end{bmatrix}$ and $\begin{bmatrix} a & 0 \\ 0 & b \end{bmatrix}$ commute under the multiplication if $a=b \text{(or)} \theta =n\pi, \: n$ is an integer always never if $a\cos \theta \neq b\sin \theta$

answered May 30 in Unknown Category DIBAKAR MAJEE 39 views

0 votes

1 answer

28

NIELIT 2016 MAR Scientist C - Section B: 13
$\displaystyle \lim_{x \rightarrow 0}\frac{1}{x^{6}} \displaystyle \int_{0}^{x^{2}}\frac{t^{2}dt}{t^{6}+1}=$? $1/4$ $1/3$ $1/2$ $1$

$\displaystyle \lim_{x \rightarrow 0}\frac{1}{x^{6}} \displaystyle \int_{0}^{x^{2}}\frac{t^{2}dt}{t^{6}+1}=$? $1/4$ $1/3$ $1/2$ $1$

answered May 24 in Unknown Category haralk10 33 views

0 votes

3 answers

29

UGCNET-DEC2018-II: 98
Consider a vocabulary with only four propositions A, B, C and D. How many models are there for the following sentence? $\neg A \vee \neg B \vee \neg C \vee \neg D$ $7$ $8$ $15$ $16$

Consider a vocabulary with only four propositions A, B, C and D. How many models are there for the following sentence? $\neg A \vee \neg B \vee \neg C \vee \neg D$ $7$ $8$ $15$ $16$

answered May 16 in Unknown Category Nbhardwaj 355 views

0 votes

1 answer

30

UGCNET-DEC2018-II: 97
Consider the following minimax game tree search What will be the value probagated at the root? $3$ $4$ $5$ $6$

Consider the following minimax game tree search What will be the value probagated at the root? $3$ $4$ $5$ $6$

answered May 16 in Unknown Category Nbhardwaj 179 views

0 votes

2 answers

31

UGCNET-DEC2018-II: 76
______ system call creates new process in Unix. create create new fork fork new

______ system call creates new process in Unix. create create new fork fork new

answered May 16 in Unknown Category DIBAKAR MAJEE 275 views

0 votes

2 answers

32

UGCNET-DEC2018-II: 77
An attribute $A$ of datatype varchar($20$) has the value $‘xyz’$, and the attribute $B$ of datatype char($20$) has the value $“lmnop”$, then the attribute $A$ has _____ spaces and attribute $B$ has ____ spaces. $3, 5$ $20, 20$ $3, 20$ $20, 5$

An attribute $A$ of datatype varchar($20$) has the value $‘xyz’$, and the attribute $B$ of datatype char($20$) has the value $“lmnop”$, then the attribute $A$ has _____ spaces and attribute $B$ has ____ spaces. $3, 5$ $20, 20$ $3, 20$ $20, 5$

answered May 16 in Unknown Category DIBAKAR MAJEE 204 views

0 votes

2 answers

33

UGCNET-DEC2018-II: 78
Data warehouse contains _____ data that is never found in operational environment. Summary Encoded Encrypted Scripted

Data warehouse contains _____ data that is never found in operational environment. Summary Encoded Encrypted Scripted

answered May 16 in Unknown Category DIBAKAR MAJEE 200 views

0 votes

2 answers

34

UGCNET-DEC2018-II: 79
_______ command is used to remove a relation from SQL database. Drop table Delete table Remove table Update table

_______ command is used to remove a relation from SQL database. Drop table Delete table Remove table Update table

answered May 16 in Unknown Category DIBAKAR MAJEE 159 views

0 votes

2 answers

35

UGCNET-DEC2018-II: 80
Which of the following statement/s is/are true ? Facebook has the world’s largest Hadoop Cluster. Hadoop $2.0$ allows live stream processing of Real time data. Choose the correct answer from the code given below : $Code :$ (i) only (ii) only Both (i) and (ii) Neither (i) nor (ii)

Which of the following statement/s is/are true ? Facebook has the world’s largest Hadoop Cluster. Hadoop $2.0$ allows live stream processing of Real time data. Choose the correct answer from the code given below : $Code :$ (i) only (ii) only Both (i) and (ii) Neither (i) nor (ii)

answered May 16 in Unknown Category DIBAKAR MAJEE 218 views

0 votes

1 answer

36

UGCNET-DEC2018-II: 45
In $3D$ Graphics, which of the following statements is/are true? P: Back-face culling is an example of image-precision visible-surface determination procedure. Q: Z- buffer is a $16$-bit, $32$-bit, or $64$ bit field associated with each pixel in ... surfaces at each pixel Choose the correct answer from the code given below : $Code:$ P only Q only P and Q Neither P nor Q

In $3D$ Graphics, which of the following statements is/are true? P: Back-face culling is an example of image-precision visible-surface determination procedure. Q: Z- buffer is a $16$-bit, $32$-bit, or $64$ bit field associated with each pixel in a frame ... visible surfaces at each pixel Choose the correct answer from the code given below : $Code:$ P only Q only P and Q Neither P nor Q

answered May 16 in Unknown Category Nbhardwaj 335 views

0 votes

2 answers

37

UGCNET-DEC2018-II: 25
A binary search tree is constructed by inserting the following numbers in order : $60, 25, 72, 15, 30, 68, 101, 13, 18, 47, 70, 34$ The number of nodes in the left subtree is $5$ $6$ $7$ $3$

A binary search tree is constructed by inserting the following numbers in order : $60, 25, 72, 15, 30, 68, 101, 13, 18, 47, 70, 34$ The number of nodes in the left subtree is $5$ $6$ $7$ $3$

answered May 7 in Unknown Category Girjesh Chouhan 596 views

0 votes

1 answer

38

NIELIT 2016 MAR Scientist C - Section C: 58
For $x$ and $y$ are variables as declared below $\textit{double }x=0.005, \: y = – 0.01;$ What is the value of $\text{ceil }(x+y)$, where $\text{ceil }$ is a function to compute ceiling of a number? $1$ $0$ $0.005$ $0.5$

For $x$ and $y$ are variables as declared below $\textit{double }x=0.005, \: y = – 0.01;$ What is the value of $\text{ceil }(x+y)$, where $\text{ceil }$ is a function to compute ceiling of a number? $1$ $0$ $0.005$ $0.5$

answered May 3 in Unknown Category Mohit Kumar 6 40 views

0 votes

1 answer

39

NIELIT 2016 MAR Scientist C - Section C: 36
Odd parity of word can be conveniently tested by OR gate AND gate NOR gate XOR gate

Odd parity of word can be conveniently tested by OR gate AND gate NOR gate XOR gate

answered May 3 in Unknown Category Mohit Kumar 6 40 views

0 votes

1 answer

40

NIELIT 2016 MAR Scientist C - Section C: 35
Consider the schema $R=(\text{S T U V})$ and the dependencies $ S \rightarrow T, T \rightarrow U, U \rightarrow V$, and $V \rightarrow S.$ If $R=(R1 \text{ and } R2)$ be a decomposition such that $R1 \cap R2= \phi$ ... $\text{3 NF}$ in $\text{3 NF}$ but not in $\text{2 NF}$ in both $\text{2 NF}$ and $\text{3 NF}$

Consider the schema $R=(\text{S T U V})$ and the dependencies $ S \rightarrow T, T \rightarrow U, U \rightarrow V$, and $V \rightarrow S.$ If $R=(R1 \text{ and } R2)$ be a decomposition such that $R1 \cap R2= \phi$ then decomposition is not in $\text{2 NF}$ in $\text{2 NF}$ but not in $\text{3 NF}$ in $\text{3 NF}$ but not in $\text{2 NF}$ in both $\text{2 NF}$ and $\text{3 NF}$

answered May 3 in Unknown Category Mohit Kumar 6 42 views

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

Subjects

Network Sites

Recent questions and answers in Unknown Category

Log In

Register

Recent Posts

Subjects

Recent Blog Comments

Network Sites

Recent questions and answers in Unknown Category