Register
Filter

Questions by OneZero

1 votes
1 answer
1
RA in IIT
Is getting into old IIT as RA better than getting in new IIT as TA? Is RA in general a good choice?
Is getting into old IIT as RA better than getting in new IIT as TA?Is RA in general a good choice?
0 votes
2 answers
3
ACE CBT 2018
Identify valid statements pertaining to switching S1: Computer networks are based on packet switching. S2: Packet switching increases the available throughput. (A) Both S1 and S2 (B) S1 only (C) S2 only (D) Neither S1 nor S2
Identify valid statements pertaining to switchingS1: Computer networks are based on packet switching.S2: Packet switching increases the available throughput.(A) Both S1 a...
0 votes
3 answers
4
compiler phase error
int main(){ int a = 10; fun(a); } void fun(int a){ printf(“%d”,a); } Which phase of the compiler will raise an error? Lexical syntax semantics none of the above
int main(){int a = 10;fun(a);}void fun(int a){printf(“%d”,a);}Which phase of the compiler will raise an error?Lexical syntaxsemanticsnone of the above
0 votes
0 answers
6
Self Doubt
Can a tuple in unary-relationship set be in relation with itself. For example, take a tuple T1 in an entity E1 and this entity E1 is related to itself. Now can the Tuple T1 be in relation to tuple T1 ?
Can a tuple in unary-relationship set be in relation with itself. For example, take a tuple T1 in an entity E1 and this entity E1 is related to itself. Now can the Tuple ...
1 votes
1 answer
8
ACE Material
what does the following declaration specify? int *(*q(char*))[ ]
what does the following declaration specify?int *(*q(char*))[ ]
2 votes
0 answers
10
Functional Dependency
Consider a relation R(ABCD) with functional dependency F:{ AD → B, AB → C }. Is AB → C partial or total dependency?
Consider a relation R(ABCD) with functional dependency F:{ AD → B, AB → C }. Is AB → C partial or total dependency?
0 votes
0 answers
12
DFA NFA and ambiguity
Why is Regular grammar obtained from DFA always unambiguous? Why Regular grammar obtained from NFA may or may not be ambiguous?
Why is Regular grammar obtained from DFA always unambiguous?Why Regular grammar obtained from NFA may or may not be ambiguous?
0 votes
0 answers
13
#SELF DOUBT
Prove dijkstra’s algorithm using Heap is O((n+|E|)logn) where n is no.of vertices and |E| is number of edges? Book : Fundamentals of Computer Algorithms By sahni page : 263
Prove dijkstra’s algorithm using Heap is O((n+|E|)logn) where n is no.of vertices and |E| is number of edges?Book : Fundamentals of Computer Algorithms By sahni pa...