Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
yuviabhi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by yuviabhi
2
answers
1
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.8k
views
commented
Jul 6, 2020
Unknown Category
ugcnetcse-nov2017-paper3
+
–
1
answer
2
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.1k
views
commented
Oct 11, 2019
Digital Logic
ugcnetcse-july2018-paper2
digital-logic
combinational-circuit
+
–
3
answers
3
UGC NET CSE | July 2018 | Part 2 | Question: 9
Which of the following statements is/are True regarding the solution of the visibility problem in 3D graphics? S1: The painter's algorithm sorts polygons by depth and then paints (scan - converts) each Polygon on to the screen ... Culling refers to eliminating geometry with backfacing normals S1 only S2 only Both S1 and S2 Neither S1 nor S2
Which of the following statements is/are True regarding the solution of the visibility problem in 3D graphics?S1: The painter's algorithm sorts polygons by depth and then...
3.3k
views
commented
Jun 20, 2019
Computer Graphics
ugcnetcse-july2018-paper2
computer-graphics
3d-graphics
+
–
18
answers
4
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.0k
views
answered
Jun 18, 2019
Databases
ugcnetcse-nov2017-paper3
database-normalization
+
–
0
answers
5
MadeEasy Test Series 2018: Theory Of Computation - Regular Languages
485
views
commented
Jun 17, 2019
Theory of Computation
made-easy-test-series
theory-of-computation
regular-language
+
–
3
answers
6
MadeEasy Test Series: Theory Of Computation - Regular Languages
Consider the following statements: $S_1:\{(a^n)^m|n\leq m\geq0\}$ $S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $ Which of the following is regular? $S_1$ only $S_2$ only Both Neither of the above
Consider the following statements:$S_1:\{(a^n)^m|n\leq m\geq0\}$$S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $Which of the following is regular?$S_1$ only$S_2...
1.7k
views
commented
Jun 17, 2019
Theory of Computation
made-easy-test-series
theory-of-computation
regular-language
+
–
3
answers
7
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.4k
views
answered
Jun 17, 2019
Verbal Aptitude
ugcnetcse-july2018-paper2
verbal-aptitude
+
–
7
answers
8
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.5k
views
answered
Jun 14, 2019
Algorithms
asymptotic-notation
+
–
2
answers
9
UGC NET CSE | Junet 2015 | Part 3 | Question: 34
Consider a hash table of size m=100 and the hash function h(k)=floor (m(kA mod 1)) for $A=\frac{ (\sqrt{5}-1)}{2} = 0.618033$. Compute the location to which the key k=123456 is placed in hash table 77 82 88 89
Consider a hash table of size m=100 and the hash function h(k)=floor (m(kA mod 1)) for $A=\frac{ (\sqrt{5}-1)}{2} = 0.618033$. Compute the location to which the key k=123...
5.9k
views
commented
Jun 14, 2019
DS
ugcnetcse-june2015-paper3
data-structures
hashing
+
–
1
answer
10
UGC NET CSE | Junet 2015 | Part 3 | Question: 32
The travelling salesman problem can be solved in Polynomial time using dynamic programming algorithm Polynomial time using branch-and-bound algorithm Exponential time using dynamic programming algorithm or branch-and-bound algorithm Polynomial time using back tracking algorithm
The travelling salesman problem can be solved inPolynomial time using dynamic programming algorithmPolynomial time using branch-and-bound algorithmExponential time using ...
5.7k
views
commented
Jun 14, 2019
Algorithms
algorithms
p-np-npc-nph
ugcnetcse-june2015-paper3
+
–
2
answers
11
UGC NET CSE | Junet 2015 | Part 3 | Question: 2
Consider a 32-bit microprocessor, with a 16-bit external data bus, driven by an 8 MHz input clock. Assume that this microprocessor has a bus cycle whose minimum duration equals four input clock cycles. What is the maximum data transfer rate for this microprocessor? ... /sec $4 \times 10^6$ bytes/sec $16 \times 10^6$ bytes/sec $4 \times 10^9$ bytes/sec
Consider a 32-bit microprocessor, with a 16-bit external data bus, driven by an 8 MHz input clock. Assume that this microprocessor has a bus cycle whose minimum duration ...
8.7k
views
commented
Jun 14, 2019
CO and Architecture
ugcnetcse-june2015-paper3
co-and-architecture
data-transfer
+
–
2
answers
12
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$
875
views
answered
Jun 12, 2019
Set Theory & Algebra
ugcnetjan2017ii
set-theory&algebra
factors
+
–
3
answers
13
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.6k
views
answered
Jun 12, 2019
Databases
ugcnetjan2017ii
databases
b+tree
+
–
4
answers
14
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.} &...
950
views
answered
Jun 12, 2019
Operating System
ugcnetjan2017ii
operating-system
input-output
+
–
3
answers
15
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.8k
views
answered
Jun 12, 2019
Operating System
ugcnetcse-jan2017-paper3
operating-system
+
–
2
answers
16
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.5k
views
commented
Dec 13, 2018
DS
ugcnetcse-july2018-paper2
data-structures
tree
+
–
2
answers
17
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.8k
views
commented
Oct 18, 2018
Theory of Computation
ugcnetcse-july2018-paper2
theory-of-computation
finite-automata
+
–
4
answers
18
UGC NET CSE | July 2018 | Part 2 | Question: 48
Decrypt the message "WTAAD" using the Caesar Cipher with key =15 LIPPS HELLO PLLEH DAATW
Decrypt the message "WTAAD" using the Caesar Cipher with key =15LIPPSHELLOPLLEHDAATW
5.3k
views
commented
Sep 7, 2018
Others
ugcnetcse-july2018-paper2
cryptography
encryption-decryption
+
–
2
answers
19
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 ?
428
views
answered
Aug 31, 2018
Operating System
operating-system
process
+
–
2
answers
20
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 ?...
410
views
answered
Aug 31, 2018
Theory of Computation
regular-language
+
–
1
answer
21
Self Doubt
What is Phase structured grammar?
What is Phase structured grammar?
176
views
answered
Aug 31, 2018
1
answer
22
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.5k
views
answered
Aug 31, 2018
Databases
ugcnetcse-july2018-paper2
databases
transaction-and-concurrency
conflict-serializable
easy
+
–
1
answer
23
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
+
–
3
answers
24
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.7k
views
answered
Aug 31, 2018
Digital Logic
ugcnetcse-july2018-paper2
digital-logic
number-representation
+
–
3
answers
25
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
+
–
1
answer
26
UGC NET CSE | July 2018 | Part 2 | Question: 87
Match the following in $\textbf{List-I}$ and $\textbf{List-II}$, for a function $f$ ... $\text{(a)-(ii), (b)-(i), (c)-(iii)}$ $\text{(a)-(ii), (b)-(iii), (c)-(i)}$
Match the following in $\textbf{List-I}$ and $\textbf{List-II}$, for a function $f$ :$\begin{array}{clcl} \text{} & \textbf{List-I} & & \textbf{List-II} \\ \text{(a)} & ...
1.2k
views
commented
Aug 31, 2018
Mathematical Logic
ugcnetcse-july2018-paper2
discrete-mathematics
functions
+
–
7
answers
27
UGC NET CSE | July 2018 | Part 2 | Question: 100
In 8085 microprocessor, what is the output of following program? LDA 8000H MVI B, 30H ADD B STA 8001 H Read a number from input port and store it in memory Read a number from input device with address 8000H and store it ... location 8001H Load A with data from input device with address 8000H and display it on the output device with address 8001H
In 8085 microprocessor, what is the output of following program?LDA 8000H MVI B, 30H ADD B STA 8001 HRead a number from input port and store it in memoryRead a number fro...
1.6k
views
commented
Aug 30, 2018
CO and Architecture
ugcnetcse-july2018-paper2
co-and-architecture
8085-microprocessor
microprocessors
+
–
4
answers
28
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
+
–
4
answers
29
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
+
–
7
answers
30
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.6k
views
answered
Aug 30, 2018
Databases
databases
er-diagram
database-normalization
ugcnetcse-july2018-paper2
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register