Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most answered questions in Others
0
votes
2
answers
81
NIELIT 2021 Dec Scientist A - Section B: 93
Which of the following step is not a part of the requirement engineering process? Feasibility Study Programming Language Requirement Specification Software Requirement Specification Requirement Gathering & Validation
Which of the following step is not a part of the requirement engineering process?Feasibility StudyProgramming Language Requirement SpecificationSoftware Requirement Speci...
soujanyareddy13
265
views
soujanyareddy13
asked
Jan 9, 2022
Others
nielit2021dec-scientista
+
–
0
votes
2
answers
82
NIELIT 2021 Dec Scientist A - Section A: 32
Find the wrong term in the series $5, 11, 29, 83, 245, 765, 2189, 6563 :$ $245$ $765$ $2189$ $6563$
Find the wrong term in the series $5, 11, 29, 83, 245, 765, 2189, 6563 :$$245$$765$$2189$$6563$
soujanyareddy13
715
views
soujanyareddy13
asked
Jan 9, 2022
Others
nielit2021dec-scientista
+
–
0
votes
2
answers
83
NIELIT 2021 Dec Scientist B - Section B: 46
_________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms. $\text{NP}$ $\text{P}$ Hard Complete
_________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms.$\text{NP}$$\text{P}$HardComplete
soujanyareddy13
3.1k
views
soujanyareddy13
asked
Dec 7, 2021
Others
nielit2021dec-scientistb
+
–
0
votes
2
answers
84
NIELIT 2021 Dec Scientist B - Section B: 50
When factorizing the Boolean equation $ \text{Y} = \text{A} \overline {\rm B} + \text{AB},$ the result will be : $\text{A} \overline {\rm B}$ $\text{AB}$ $\text{A}$ $\text{B}$
When factorizing the Boolean equation $ \text{Y} = \text{A} \overline {\rm B} + \text{AB},$ the result will be :$\text{A} \overline {\rm B}$$\text{AB}$$\text{A}$$\text{B}...
soujanyareddy13
483
views
soujanyareddy13
asked
Dec 7, 2021
Others
nielit2021dec-scientistb
+
–
0
votes
2
answers
85
NIELIT 2021 Dec Scientist B - Section B: 51
The ___________ of a relationship is $0$ if there is no explicit need for the relationship to occur or the relationship is optional. modality cardinality entity structured analysis
The ___________ of a relationship is $0$ if there is no explicit need for the relationship to occur or the relationship is optional. modalitycardinalityentitystructured a...
soujanyareddy13
477
views
soujanyareddy13
asked
Dec 7, 2021
Others
nielit2021dec-scientistb
+
–
0
votes
2
answers
86
NIELIT 2021 Dec Scientist B - Section B: 53
The ____________ enables the software engineer to develop models of the information domain and functional domain at the same time. data flow diagram state transition diagram control specification activity diagram
The ____________ enables the software engineer to develop models of the information domain and functional domain at the same time.data flow diagramstate transition diagra...
soujanyareddy13
468
views
soujanyareddy13
asked
Dec 7, 2021
Others
nielit2021dec-scientistb
+
–
0
votes
2
answers
87
NIELIT 2021 Dec Scientist B - Section B: 74
$\text{DELETE [FROM]}$ table $\text{[ WHERE condition]};$ from the syntax if you omit the $\text{WHERE}$ clause. All rows in the table are deleted. It will give you an error. No rows will be deleted. Only one row will be deleted.
$\text{DELETE [FROM]}$ table $\text{[ WHERE condition]};$ from the syntax if you omit the $\text{WHERE}$ clause.All rows in the table are deleted.It will give you an erro...
soujanyareddy13
310
views
soujanyareddy13
asked
Dec 7, 2021
Others
nielit2021dec-scientistb
+
–
0
votes
2
answers
88
NIELIT 2021 Dec Scientist B - Section B: 115
If $\text{A}$ and $\text{B}$ are two sets. A binary relation from set $\text{A}$ and set $\text{B}$ is any subset of the _____________ . Cartesian Product $\text{A} \times \text{B}$ Union $\text{A} \cup \text{B}$ Intersection $\text{A} \cap \text{B}$ Addition $\text{A} + \text{B}$
If $\text{A}$ and $\text{B}$ are two sets. A binary relation from set $\text{A}$ and set $\text{B}$ is any subset of the _____________ .Cartesian Product $\text{A} \times...
soujanyareddy13
253
views
soujanyareddy13
asked
Dec 7, 2021
Others
nielit2021dec-scientistb
+
–
0
votes
2
answers
89
TIFR2021-Maths-A: 11
What is the number of surjective maps from the set $\{1,\dots,10\}$ to the set $\{1,2\}$? $90$ $1022$ $98$ $1024$
What is the number of surjective maps from the set $\{1,\dots,10\}$ to the set $\{1,2\}$?$90$$1022$$98$$1024$
soujanyareddy13
324
views
soujanyareddy13
asked
Sep 27, 2021
Others
tifrmaths2021
+
–
1
votes
2
answers
90
UGC NET CSE | December 2019 | Part 2 | Question: 1
A basic feasible solution of an $m \times n$ transportation problem is said to be non-degenerate, if basic feasible solution contains exactly _______ number of individual allocation in ______ positions. $m+n+1$, independent $m+n-1$, independent $m+n-1$, appropriate $m-n+1$, independent
A basic feasible solution of an $m \times n$ transportation problem is said to be non-degenerate, if basic feasible solution contains exactly _______ number of individual...
soujanyareddy13
2.8k
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
+
–
1
votes
2
answers
91
UGC NET CSE | December 2019 | Part 2 | Question: 4
What are the greatest lower bound $\text{(GLB)}$ and the least upper bound $\text{(LUB)}$ of the sets $A= \{ 3, 9, 12 \}$ and $B=\{1,2,4,5,10 \}$ if they exist in poset $(z^+, / )$? $\text{A(GLB - 3, LUB - 36); B(GLB - 1, LUB - 20)}$ ... $\text{A(GLB - 1, LUB - 36); B(GLB - 2, LUB - 20)}$ $\text{A(GLB - 1, LUB - 12); B(GLB - 2, LUB - 10)}$
What are the greatest lower bound $\text{(GLB)}$ and the least upper bound $\text{(LUB)}$ of the sets $A= \{ 3, 9, 12 \}$ and $B=\{1,2,4,5,10 \}$ if they exist in poset $...
soujanyareddy13
5.0k
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
+
–
0
votes
2
answers
92
UGC NET CSE | December 2019 | Part 2 | Question: 7
A tree has $2n$ vertices of degree $1$, $3n$ vertices of degree $2$, $n$ vertices of degree $3$. Determine the number of vertices and edges in tree. $12, 11$ $11, 12$ $10, 11$ $9, 10$
A tree has $2n$ vertices of degree $1$, $3n$ vertices of degree $2$, $n$ vertices of degree $3$. Determine the number of vertices and edges in tree.$12, 11$$11, 12$$10, 1...
soujanyareddy13
2.1k
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
+
–
2
votes
2
answers
93
UGC NET CSE | December 2019 | Part 2 | Question: 8
How many reflexive relations are there on a set with $4$ elements? $2^4$ $2^{12}$ $4^2$ $2$
How many reflexive relations are there on a set with $4$ elements?$2^4$$2^{12}$$4^2$$2$
soujanyareddy13
429
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
+
–
0
votes
2
answers
94
UGC NET CSE | December 2019 | Part 2 | Question: 9
A non-pipelined system takes $\text{30ns}$ to process a task. The same task can be processed in a four-segment pipeline with a clock cycle of $\text{10ns}$. Determine the speed up of the pipeline for $100$ tasks. $3$ $4$ $3.91$ $2.91$
A non-pipelined system takes $\text{30ns}$ to process a task. The same task can be processed in a four-segment pipeline with a clock cycle of $\text{10ns}$. Determine the...
soujanyareddy13
1.3k
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
co-and-architecture
pipelining
+
–
0
votes
2
answers
95
UGC NET CSE | December 2019 | Part 2 | Question: 11
A micro instruction format has microoperation field which is divided into $2$ sunbfields $F1$ and $F2$ , each having $15$ distinct microoperations, condition field $\text{CD}$ for four status bits, branch field $\text{BR}$ having four options used ... The address space is of $128$ memory words. The size of micro instruction is: $19$ $18$ $17$ $20$
A micro instruction format has microoperation field which is divided into $2$ sunbfields $F1$ and $F2$ , each having $15$ distinct microoperations, condition field $\text...
soujanyareddy13
1.5k
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
+
–
0
votes
2
answers
96
UGC NET CSE | December 2019 | Part 2 | Question: 16
Which tag is used to enclose any number of javascript statements in HTML document? <code> <script> <title> <body>
Which tag is used to enclose any number of javascript statements in HTML document?<code><script><title><body>
soujanyareddy13
407
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
+
–
0
votes
2
answers
97
UGC NET CSE | December 2019 | Part 2 | Question: 24
A counting semaphore is initialized to $8$. $3$ wait ( ) operations and $4$ signal ( ) operations are applied. Find the current value of semaphore variable. $9$ $5$ $1$ $4$
A counting semaphore is initialized to $8$. $3$ wait ( ) operations and $4$ signal ( ) operations are applied. Find the current value of semaphore variable.$9$$5$$1$$4$
soujanyareddy13
736
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
+
–
0
votes
2
answers
98
UGC NET CSE | December 2019 | Part 2 | Question: 28
Suppose a system has $12$ magnetic tape drives and at time $t_0$ ... $\left \langle p_2, p_1, p_0 \right \rangle$ $\left \langle p_0, p_2, p_1 \right \rangle$
Suppose a system has $12$ magnetic tape drives and at time $t_0$, three processes are allotted tape drives out of their need as given below:$$\begin{array}{ccc} & \text{M...
soujanyareddy13
1.1k
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
+
–
0
votes
2
answers
99
UGC NET CSE | December 2019 | Part 2 | Question: 35
Let $a^{2c} \text{ mod } n = (a^c)^2 \text{ mod } n$ and $a^{2c+1}\text{ mod } n= a \cdot (a^c)^2\text{ mod }n$. For $a=7$, $b=17$ and $n=561$, What is the value of $a^b( \text{mod } n)$? $160$ $166$ $157$ $67$
Let $a^{2c} \text{ mod } n = (a^c)^2 \text{ mod } n$ and $a^{2c+1}\text{ mod } n= a \cdot (a^c)^2\text{ mod }n$. For $a=7$, $b=17$ and $n=561$, What is the value of $a^b...
soujanyareddy13
1.3k
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
+
–
0
votes
2
answers
100
UGC NET CSE | December 2019 | Part 2 | Question: 39
Give asymptotic upper and lower bound for $T(n)$ given below. Assume $T(n)$ is constant for $n \leq 2$. $T(n) = 4T( \sqrt{n} ) + \lg^2n$ $T(n) = \theta (\lg ( \lg ^2 n) \lg n )$ $T(n) = \theta ( \lg ^2 n \lg n )$ $T(n) = \theta (\lg ^2 n \lg \lg n )$ $T(n) = \theta (\lg ( \lg n) \lg n )$
Give asymptotic upper and lower bound for $T(n)$ given below. Assume $T(n)$ is constant for $n \leq 2$. $T(n) = 4T( \sqrt{n} ) + \lg^2n$$T(n) = \theta (\lg ( \lg ^2 n) \l...
soujanyareddy13
2.2k
views
soujanyareddy13
asked
May 12, 2021
Others
ugcnetcse-dec2019-paper2
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
...
136
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register