Register
Filter

Answers by rajoramanoj

5.0k
views
5 votes
TIFR CSE 2017 | Part B | Question: 1
A vertex colouring with three colours of a graph $G=(V, E)$ is a mapping $c: V \rightarrow \{R, G, B\}$ so that adjacent vertices receive distinct colours. Consider the f...
2.8k
views
0 votes
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
1.6k
views
3 votes
Merge sort
True or FalseMerge sort on Linked list takes O(nlogn)
2.7k
views
0 votes
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
385
views
1 votes
data structure
what is the average number of probes in linear probing if load factor is 0.1
1.3k
views
0 votes
Bit Stuffing
Answer is 4 or 6 ?
477
views
1 votes
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 shou...
382
views
0 votes
CFL Language
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.5k
views
1 votes
Pumping Lemma
Could we say thatPumping lemma is generally used to prove whether given grammar is not regular.
1.2k
views
1 votes
location-of-element-using-row-major-order
https://gateoverflow.in/32836/location-of-element-using-row-major-orderA[5.....15,-8.....8] is A[11][17] and we are supposed to find A[8][5] - Row Major Order Base Addre...
1.6k
views
0 votes
CN ARQ Protocol
True / False?Selective repeat ARQ requires more number of bits in sequence number as compared to Go Back n ARQ.
1.0k
views
0 votes
MadeEasy Subject Test: Theory of Computation - Finite Automata
What is the answer for following question.
289
views
0 votes
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 CSLExplain how.
268
views
0 votes
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 ?
745
views
1 votes
Please solve my doubt
Q if any Grammar is LL(1) definitely LALR(1) ?It is true or falsePlease ans explain in detail.
5.2k
views
2 votes
How many address lines are needed to address each memory locations in a 2048 x 4 memory chip
How many address lines are needed to address each memory locations in a 2048 x 4 memory chip
216
views
0 votes
Self_doubt
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...
4.1k
views
8 votes
Register spilling
Please someone explain me what is Register Spilling by giving example
701
views
0 votes
No of Super key possible
$R=(A,B,C,D)$Candidate key $(AB,DB)$How many super key possible?
624
views
1 votes
No. of super key
$R=(A,B,C,D,F,H)$Candidate key$=(AEH, BEH, DEH)$How many super key possible?
4.7k
views
4 votes
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 function2.Return value of function3. Global v...
2.3k
views
0 votes
Number of Memory Access in Fetch and Execute State in Instruction Cycles
Consider a 32 bit hypothetical processor used to execute the following programme segement INST // MEANING // SIZE(IN WORDS)MOV R0, @3000 // R0 <- M[[3000]] // 2MOV R1,...
441
views
0 votes
gate level minimization
prove thatx'y+xy'+xy=x+y
1.0k
views
0 votes
NPTEL
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
472
views
0 votes
Self Doubt
Primary key is subset or proper subset of superkey ?
1.3k
views
0 votes
functional dependency
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: