Register
Filter

Answers by rajoramanoj

0 votes
2
breadth first search
The max possible height of BFS tree , if BFS is run on a complete bipartite graph Km,n where m>=1 , n>=1 with starting vertex S is
The max possible height of BFS tree , if BFS is run on a complete bipartite graph Km,n where m>=1 , n>=1 with starting vertex S is
3 votes
3
Merge sort
True or False Merge sort on Linked list takes O(nlogn)
True or FalseMerge sort on Linked list takes O(nlogn)
0 votes
6
disk scheduling
In disk scheduling if header movement direction is not given then which way to move? Please provide any link or source in support of your answer. Thanks
In disk scheduling if header movement direction is not given then which way to move? Please provide any link or source in support of your answer. Thanks
1 votes
7
data structure
what is the average number of probes in linear probing if load factor is 0.1
what is the average number of probes in linear probing if load factor is 0.1
0 votes
9
Bit Stuffing
Answer is 4 or 6 ?
Answer is 4 or 6 ?
1 votes
10
Exam queries
Can I crack gate if I start my preparation from today(01/10/17)? If yes then for how much time I should study in a day? I want to score around 60. On which subject I should focus mostly? I know I don't have time to read books so any reference to material will be appreciated.
Can I crack gate if I start my preparation from today(01/10/17)? If yes then for how much time I should study in a day? I want to score around 60. On which subject I shou...
0 votes
11
CFL Language
For A, B ⊆ Σ*, define A/B = {x ∈ Σ* | ∃y ∈ B, xy ∈ A} If L is a CFL and R is regular, then L/R is (A) Regular (B) CFL but not regular (C) Recursive but not CFL (D) None of the above
For A, B ⊆ Σ*, defineA/B = {x ∈ Σ* | ∃y ∈ B, xy ∈ A}If L is a CFL and R is regular, then L/R is(A) Regular(B) CFL but not regular(C) Recursive but not CFL(D)...
1 votes
12
Pumping Lemma
Could we say that Pumping lemma is generally used to prove whether given grammar is not regular.
Could we say thatPumping lemma is generally used to prove whether given grammar is not regular.
0 votes
14
CN ARQ Protocol
True / False? Selective repeat ARQ requires more number of bits in sequence number as compared to Go Back n ARQ.
True / False?Selective repeat ARQ requires more number of bits in sequence number as compared to Go Back n ARQ.
0 votes
16
Identify the language
L1 = {anbmcnd2n n $\geq$ 0, m $>$ 0} L2 = {anb2ncm | 0 $\leq$ n $\leq$ m} L1 is given as a CFL and L2 a CSL Explain how.
L1 = {anbmcnd2n n $\geq$ 0, m $>$ 0}L2 = {anb2ncm | 0 $\leq$ n $\leq$ m}L1 is given as a CFL and L2 a CSLExplain how.
0 votes
17
self doubt
Is decomposition to BCNF ALWAYS POSSIBLE ?? can we decompose a relation to BCNF ALWAYS OR ARE THERE RELATIONS WHICH CANNOT BE DECOMPOSED TO BCNF ?
Is decomposition to BCNF ALWAYS POSSIBLE ??can we decompose a relation to BCNF ALWAYS OR ARE THERE RELATIONS WHICH CANNOT BE DECOMPOSED TO BCNF ?
1 votes
18
Please solve my doubt
Q if any Grammar is LL(1) definitely LALR(1) ? It is true or false Please ans explain in detail.
Q if any Grammar is LL(1) definitely LALR(1) ?It is true or falsePlease ans explain in detail.
0 votes
20
Self_doubt
How computation actually occurs in these type of questions? For ex: If I declare a=10,b=20 and pass them f(a-b,a*2,b-a); Where f has signature like f(int *p,int *q,int *r).How actually things works out if i manipulate are there any temprary variables involved?
How computation actually occurs in these type of questions?For ex:If I declare a=10,b=20and pass them f(a-b,a*2,b-a);Where f has signature like f(int *p,int *q,int *r).Ho...
8 votes
21
Register spilling
Please someone explain me what is Register Spilling by giving example
Please someone explain me what is Register Spilling by giving example
0 votes
22
No of Super key possible
$R=(A,B,C,D)$ Candidate key $(AB,DB)$ How many super key possible?
$R=(A,B,C,D)$Candidate key $(AB,DB)$How many super key possible?
1 votes
23
No. of super key
$R=(A,B,C,D,F,H)$ Candidate key$=(AEH, BEH, DEH)$ How many super key possible?
$R=(A,B,C,D,F,H)$Candidate key$=(AEH, BEH, DEH)$How many super key possible?
4 votes
24
please solve this Q
Q. Which of the following parameter is not included in the activation record of recursive function call? 1.Local variables of function 2.Return value of function 3. Global variables of program 4.Access link
Q. Which of the following parameter is not included in the activation record of recursive function call?1.Local variables of function2.Return value of function3. Global v...
0 votes
26
gate level minimization
prove that x'y+xy'+xy=x+y
prove thatx'y+xy'+xy=x+y
0 votes
27
NPTEL
Which of the following is not a cause of transaction failure? 1. System Crash 2. Deadlock 3. Exception 4. All of the above are causes of transaction failures
Which of the following is not a cause of transaction failure?1. System Crash2. Deadlock3. Exception4. All of the above are causes of transaction failures
0 votes
28
Self Doubt
Primary key is subset or proper subset of superkey ?
Primary key is subset or proper subset of superkey ?
0 votes
29
functional dependency
Let the relation R(X, Y, Z, A, B) with given functional dependencies X -> YZ Z -> A A -> B AZ -> X The number of super keys possible__________ ? Please answer with an explanation.
Let the relation R(X, Y, Z, A, B) with given functional dependenciesX - YZZ - AA - BAZ - XThe number of super keys possible__________ ?Please answer with an explanation.
Page: