Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User yuviabhi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by yuviabhi
1
vote
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
answered
in
Databases
Jun 18, 2019
6.2k
views
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$
answered
in
Unknown Category
Jun 18, 2019
1.9k
views
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
answered
in
Verbal Aptitude
Jun 17, 2019
2.5k
views
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
answered
in
Algorithms
Jun 14, 2019
18.6k
views
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$
answered
in
Set Theory & Algebra
Jun 12, 2019
893
views
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$
answered
in
Databases
Jun 12, 2019
1.6k
views
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 : ...
answered
in
Operating System
Jun 12, 2019
978
views
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)
answered
in
Operating System
Jun 12, 2019
1.8k
views
ugcnetcse-jan2017-paper3
operating-system
1
vote
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 ?
answered
in
Operating System
Aug 31, 2018
435
views
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.
answered
in
Theory of Computation
Aug 31, 2018
450
views
regular-language
0
votes
11
Self Doubt
What is Phase structured grammar?
answered
in
Theory of Computation
Aug 31, 2018
180
views
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
answered
in
Databases
Aug 31, 2018
1.5k
views
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}$
answered
in
Digital Logic
Aug 31, 2018
4.0k
views
ugcnetcse-july2018-paper2
digital-logic
k-map
1
vote
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
answered
in
Digital Logic
Aug 31, 2018
3.8k
views
ugcnetcse-july2018-paper2
digital-logic
number-representation
1
vote
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$
answered
in
Digital Logic
Aug 31, 2018
2.1k
views
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)}$
answered
in
Digital Logic
Aug 30, 2018
3.1k
views
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
answered
in
Discrete Mathematics
Aug 30, 2018
1.5k
views
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
answered
in
Databases
Aug 30, 2018
2.2k
views
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
answered
in
Databases
Aug 30, 2018
23.7k
views
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
answered
in
Databases
Aug 30, 2018
4.7k
views
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
answered
in
Theory of Computation
Aug 29, 2018
1.2k
views
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
answered
in
Theory of Computation
Aug 29, 2018
1.9k
views
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
answered
in
Theory of Computation
Aug 29, 2018
5.2k
views
ugcnetcse-july2018-paper2
theory-of-computation
grammar
1
vote
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$
answered
in
Theory of Computation
Aug 29, 2018
1.2k
views
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
answered
in
Theory of Computation
Aug 29, 2018
3.2k
views
ugcnetcse-july2018-paper2
theory-of-computation
pushdown-automata
1
vote
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
answered
in
Theory of Computation
Aug 29, 2018
6.8k
views
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
answered
in
DS
Aug 29, 2018
17.1k
views
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)}$
answered
in
Algorithms
Aug 29, 2018
2.4k
views
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
answered
in
DS
Aug 29, 2018
9.5k
views
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
answered
in
DS
Aug 29, 2018
3.5k
views
ugcnetcse-july2018-paper2
data-structures
binary-search-tree
Page:
1
2
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...