Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by yuviabhi
1
votes
1
UGC NET CSE | November 2017 | Part 3 | Question: 9
If every non-key attribute is functionally dependent on the primary key, then the relation is in ________ First normal form Second normal form Third normal form Fourth normal form
If every non-key attribute is functionally dependent on the primary key, then the relation is in ________First normal formSecond normal formThird normal formFourth normal...
6.4k
views
answered
Jun 18, 2019
Databases
ugcnetcse-nov2017-paper3
database-normalization
+
–
0
votes
2
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$
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 $...
1.9k
views
answered
Jun 18, 2019
Unknown Category
ugcnetcse-nov2017-paper3
+
–
0
votes
3
UGC NET CSE | July 2018 | Part 2 | Question: 79
A knowledge base contains just one sentence, $\exists x \text{ AsHighAs } (x, \text{Everest})$. Consider the following two sentences obtained after applying existential instantiation. AsHighAs (Everest, Everest) AsHighAs (Kilimanjaro, ... unsound conclusions Sentence a is sound but sentence b is unsound Sentence a is unsound but sentence b is sound
A knowledge base contains just one sentence, $\exists x \text{ AsHighAs } (x, \text{Everest})$. Consider the following two sentences obtained after applying existential i...
2.5k
views
answered
Jun 17, 2019
Verbal Aptitude
ugcnetcse-july2018-paper2
verbal-aptitude
+
–
0
votes
4
Let f(n)= Ω(n), g(n)= O(n) and h(n)= Ѳ(n).
Let $f(n)= Ω(n), g(n)= O(n)$ and $h(n)= Ѳ(n)$. Then $[f(n). g(n)] + h(n)$ is: Ω (n) O (n) Ѳ (n) None of these
Let $f(n)= Ω(n), g(n)= O(n)$ and $h(n)= Ѳ(n)$. Then $[f(n). g(n)] + h(n)$ is:Ω (n)O (n)Ѳ (n)None of these
18.8k
views
answered
Jun 14, 2019
Algorithms
asymptotic-notation
+
–
0
votes
5
UGC NET CSE | January 2017 | Part 2 | Question: 4
How many multiples of $6$ are there between the following pairs of numbers? $0$ and $100$ and $-6$ and $34$ $1$ and $6$ $17$ and $6$ $17$ and $7$ $16$ and $7$
How many multiples of $6$ are there between the following pairs of numbers?$0$ and $100$ and $-6$ and $34$$1$ and $6$$17$ and $6$$17$ and $7$$16$ and $7$
950
views
answered
Jun 12, 2019
Set Theory & Algebra
ugcnetjan2017ii
set-theory&algebra
factors
+
–
0
votes
6
UGC NET CSE | January 2017 | Part 2 | Question: 20
The order of a leaf node in a $B^{+}$ tree is the maximum number of children it can have. Suppose that block size is $1$ kilobytes, the child pointer takes $7$ bytes long and search field value takes $14$ bytes long. The order of the leaf node is _________. $16$ $63$ $64$ $65$
The order of a leaf node in a $B^{+}$ tree is the maximum number of children it can have. Suppose that block size is $1$ kilobytes, the child pointer takes $7$ bytes long...
1.7k
views
answered
Jun 12, 2019
Databases
ugcnetjan2017ii
databases
b+tree
+
–
0
votes
7
UGC NET CSE | January 2017 | Part 2 | Question: 38
Match the following w.r.t Input/Output management : ...
Match the following w.r.t Input/Output management :$\begin{array}{ll} &{\text{List – I}} & & {\text{List – II}} \\ \text{a.} & \text{Device controller} & \text{i.} &...
1.0k
views
answered
Jun 12, 2019
Operating System
ugcnetjan2017ii
operating-system
input-output
+
–
0
votes
8
UGC NET CSE | January 2017 | Part 3 | Question: 66
Names of some of the Operating Systems are given below: MS-DOS XENIX OS/$2$ In the above list, following operating systems didn’t provide multiuser facility. (i) only (i) and (ii)only (ii) and (iii) only (i),(ii) and (iii)
Names of some of the Operating Systems are given below:MS-DOS XENIX OS/$2$In the above list, following operating systems didn’t provide multiuser facility.(i) o...
1.9k
views
answered
Jun 12, 2019
Operating System
ugcnetcse-jan2017-paper3
operating-system
+
–
1
votes
9
Doubt on OS
If an Interrupt occurs during process executing in CPU then the process will move RUN to READY or RUN to WAIT/BLOCK ?
If an Interrupt occurs during process executing in CPU then the process will move RUN to READY or RUN to WAIT/BLOCK ?
481
views
answered
Aug 31, 2018
Operating System
operating-system
process
+
–
0
votes
10
Self doubt, Automata theory
Suppose ∑* over {a,b,c} , whether it is regular or not ? If yes then will it contain this language or not { an . bn . cn | n > 0 } ? If yes then how is sigma* regular ? I am in great confusion plz help.
Suppose ∑* over {a,b,c} , whether it is regular or not ?If yes then will it contain this language or not { an . bn . cn | n 0 } ? If yes then how is sigma* regular ?...
439
views
answered
Aug 31, 2018
Theory of Computation
regular-language
+
–
0
votes
11
Self Doubt
What is Phase structured grammar?
What is Phase structured grammar?
189
views
answered
Aug 31, 2018
0
votes
12
UGC NET CSE | July 2018 | Part 2 | Question: 65
Consider the following schedules involving two transactions. $S_1 : r_1(X) ; r_1(Y); r_2(X); r_2(Y); w_2(Y); w_1(X)$ $S_2 : r_1(X) ; r_2(X); r_2(Y); w_2(Y); r_1(Y); w_1(X)$ Which one of the following statements is correct ... not conflict serializable $S_1$ is not conflict serializable and $S_2$ is conflict serializable
Consider the following schedules involving two transactions.$S_1 : r_1(X) ; r_1(Y); r_2(X); r_2(Y); w_2(Y); w_1(X)$$S_2 : r_1(X) ; r_2(X); r_2(Y); w_2(Y); r_1(Y); w_1(X)$...
1.6k
views
answered
Aug 31, 2018
Databases
ugcnetcse-july2018-paper2
databases
transaction-and-concurrency
conflict-serializable
easy
+
–
0
votes
13
UGC NET CSE | July 2018 | Part 2 | Question: 99
Simplify the following using $\text{K}$ – map : $F(A, B, C, D) = \Sigma (0, 1, 2, 8, 9, 12, 13)$ $d(A, B, C, D) = \Sigma (10, 11, 14, 15)$ $\text{d}$ stands for don't care condition. $A+\bar{B} \bar{D} +BC$ $A+\bar{B} \bar{D} + \bar{B} \bar{C}$ $\bar{A} + \bar{B} \bar{C}$ $\bar{A} + \bar{B} \bar{C} + \bar{B} \bar{D}$
Simplify the following using $\text{K}$ – map :$F(A, B, C, D) = \Sigma (0, 1, 2, 8, 9, 12, 13)$$d(A, B, C, D) = \Sigma (10, 11, 14, 15)$$\text{d}$ stands for don't care...
4.0k
views
answered
Aug 31, 2018
Digital Logic
ugcnetcse-july2018-paper2
digital-logic
k-map
+
–
1
votes
14
UGC NET CSE | July 2018 | Part 2 | Question: 96
Perform the following operation for the binary equivalent of the decimal numbers $(-14)_{10}+(-15)_{10}$. The solution in 8 bit representation is 11100011 00011101 10011101 11110011
Perform the following operation for the binary equivalent of the decimal numbers $(-14)_{10}+(-15)_{10}$. The solution in 8 bit representation is1110001100011101100111011...
3.8k
views
answered
Aug 31, 2018
Digital Logic
ugcnetcse-july2018-paper2
digital-logic
number-representation
+
–
1
votes
15
UGC NET CSE | July 2018 | Part 2 | Question: 92
In $\text{RS}$ flip-flop, the output of the flip-flop at time $(t+1)$ same as the output at time $t$, after the occurrence of a clock pulse if : $S=R=1$ $S=0, R=1$ $S=2, R=0$ $S=R=0$
In $\text{RS}$ flip-flop, the output of the flip-flop at time $(t+1)$ same as the output at time $t$, after the occurrence of a clock pulse if :$S=R=1$$S=0, R=1$$S=2, R=0...
2.1k
views
answered
Aug 31, 2018
Digital Logic
ugcnetcse-july2018-paper2
digital-logic
flip-flop
+
–
2
votes
16
UGC NET CSE | July 2018 | Part 2 | Question: 93
Match the terms in $\textbf{List-I}$ with the options given in $\textbf{List-II}$ ... $\text{(a)-(ii); (b)-(i); (c)-(iv)}$ $\text{(a)-(iv);(b)-(ii); (c)-(i)}$
Match the terms in $\textbf{List-I}$ with the options given in $\textbf{List-II}$ :$\begin{array}{clcl} & \textbf{List-I} & & \textbf{List-II}\\ \text{(a)} & \text{Decod...
3.2k
views
answered
Aug 30, 2018
Digital Logic
ugcnetcse-july2018-paper2
digital-logic
combinational-circuit
+
–
0
votes
17
UGC NET CSE | July 2018 | Part 2 | Question: 86
If $A_i = \{-i, \dots , -2, -1, 0, 1, 2, \dots , i \}$ then $\cup_{i=1}^\infty A_i$ is Z Q R C
If $A_i = \{-i, \dots , -2, -1, 0, 1, 2, \dots , i \}$ then $\cup_{i=1}^\infty A_i$ isZQRC
1.5k
views
answered
Aug 30, 2018
Discrete Mathematics
ugcnetcse-july2018-paper2
discrete-mathematics
+
–
0
votes
18
UGC NET CSE | July 2018 | Part 2 | Question: 68
Database systems that store each relation in a separate operating system file may use the operating system's authorization scheme, instead of defining a special scheme themselves. In this case, which of the following is false? ... Operations on the database are speeded up as the authorization procedure is carried out at the operating system level
Database systems that store each relation in a separate operating system file may use the operating system's authorization scheme, instead of defining a special scheme th...
2.2k
views
answered
Aug 30, 2018
Databases
ugcnetcse-july2018-paper2
databases
+
–
0
votes
19
UGC NET CSE | July 2018 | Part 2 | Question: 64
Relations produced from E-R Model will always be in _____ 1 NF 2 NF 3 NF 4 NF
Relations produced from E-R Model will always be in _____1 NF2 NF3 NF4 NF
23.8k
views
answered
Aug 30, 2018
Databases
databases
er-diagram
database-normalization
ugcnetcse-july2018-paper2
+
–
0
votes
20
UGC NET CSE | July 2018 | Part 2 | Question: 63
In a Hierarchical database, a hashing function is used to locate the ____ Collision Root Foreign Key Records
In a Hierarchical database, a hashing function is used to locate the ____CollisionRootForeign KeyRecords
4.8k
views
answered
Aug 30, 2018
Databases
ugcnetcse-july2018-paper2
databases
hierarchical-database
+
–
0
votes
21
UGC NET CSE | July 2018 | Part 2 | Question: 40
Consider the following statements( ): $S_1$: There exist no algorithm for deciding if any two Turing machine $M_1$ and $M_2$ accept the same language $S_2$: The problem of determining whether a Turing machine halts on any input is undecidable Which ... $S_2$ are correct Both $S_1$ and $S_2$ are not correct Only $S_1$ is correct Only $S_2$ is correct
Consider the following statements( ):$S_1$: There exist no algorithm for deciding if any two Turing machine $M_1$ and $M_2$ accept the same language$S_2$: The problem of ...
1.3k
views
answered
Aug 29, 2018
Theory of Computation
ugcnetcse-july2018-paper2
theory-of-computation
turing-machine
+
–
0
votes
22
UGC NET CSE | July 2018 | Part 2 | Question: 37
Context sensitive language can be recognized by a Finite state machine Deterministic finite automata Non-deterministic finite automata Linear bounded automata
Context sensitive language can be recognized by a Finite state machineDeterministic finite automataNon-deterministic finite automataLinear bounded automata
2.0k
views
answered
Aug 29, 2018
Theory of Computation
ugcnetcse-july2018-paper2
theory-of-computation
context-sensitive
+
–
0
votes
23
UGC NET CSE | July 2018 | Part 2 | Question: 36
Consider the following two Grammars: $G_1 \: : \: S \rightarrow SbS \mid a$ $G_2 : S \rightarrow aB \mid ab, \: A \rightarrow GAB \mid a, \: B \rightarrow ABb \mid b$ Which one of the folloeing options is correct? Only $G_1$ is ambiguous Only $G_2$ is ambiguous Both $G_1$ and $G_2$ are ambiguous Both $G_1$ and $G_2$ are not ambiguous
Consider the following two Grammars:$G_1 \: : \: S \rightarrow SbS \mid a$$G_2 : S \rightarrow aB \mid ab, \: A \rightarrow GAB \mid a, \: B \rightarrow ABb \mid b$Which ...
5.2k
views
answered
Aug 29, 2018
Theory of Computation
ugcnetcse-july2018-paper2
theory-of-computation
grammar
+
–
1
votes
24
UGC NET CSE | July 2018 | Part 2 | Question: 35
To obtain a string of n Terminals from a given Chomsky normal from grammar, the number of productions to be used is $2n-1$ $2n$ $n+1$ $n^2$
To obtain a string of n Terminals from a given Chomsky normal from grammar, the number of productions to be used is$2n-1$$2n$$n+1$$n^2$
1.3k
views
answered
Aug 29, 2018
Theory of Computation
ugcnetcse-july2018-paper2
theory-of-computation
conjunctive-normal-form
+
–
0
votes
25
UGC NET CSE | July 2018 | Part 2 | Question: 34
Pushdown automata can recognize language generated by _______ Only context free grammar Only regular grammar Context free grammar or regular grammar Only context sensitive grammar
Pushdown automata can recognize language generated by _______Only context free grammarOnly regular grammarContext free grammar or regular grammarOnly context sensitive gr...
3.3k
views
answered
Aug 29, 2018
Theory of Computation
ugcnetcse-july2018-paper2
theory-of-computation
pushdown-automata
+
–
1
votes
26
UGC NET CSE | July 2018 | Part 2 | Question: 32
The finite state machine given in figure below recognizes: anu string of odd number of a's anu string of odd number of b's any string of even number of a's and odd number of b's any string of odd number of a's and odd number of b's
The finite state machine given in figure below recognizes:anu string of odd number of a'sanu string of odd number of b'sany string of even number of a's and odd number of...
6.9k
views
answered
Aug 29, 2018
Theory of Computation
ugcnetcse-july2018-paper2
theory-of-computation
finite-automata
+
–
2
votes
27
UGC NET CSE | July 2018 | Part 2 | Question: 28
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number): 45 72 360 450
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number):4572360450
17.2k
views
answered
Aug 29, 2018
DS
ugcnetcse-july2018-paper2
data-structures
radix-sort
+
–
0
votes
28
UGC NET CSE | July 2018 | Part 2 | Question: 27
Match the following with respect to algorithm paradigms : ... $\text{(a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)}$
Match the following with respect to algorithm paradigms :$\begin{array}{clcl} & \textbf{List-I} & {} & \textbf{List-II} \\ \text{(a)} & \text{The 8-Queen's problem} & \t...
2.4k
views
answered
Aug 29, 2018
Algorithms
ugcnetcse-july2018-paper2
algorithms
+
–
0
votes
29
UGC NET CSE | July 2018 | Part 2 | Question: 29
A 5-ary tree in which every internal node has exactly 5 children. The number of left nodes in such a tree with 8 internal nodes will be: 30 33 45 125
A 5-ary tree in which every internal node has exactly 5 children. The number of left nodes in such a tree with 8 internal nodes will be:303345125
9.6k
views
answered
Aug 29, 2018
DS
ugcnetcse-july2018-paper2
data-structures
tree
+
–
0
votes
30
UGC NET CSE | July 2018 | Part 2 | Question: 26
A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves: cannot have more than 37 nodes has exactly 37 nodes has exactly 35 nodes cannot have more than 35 nodes
A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves:cannot have more than...
3.6k
views
answered
Aug 29, 2018
DS
ugcnetcse-july2018-paper2
data-structures
binary-search-tree
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register