Management Trainee Recruitment Advertisement No. 01/2019(COAL INDIA/CIL):
@Shivateja MST No it is correct becoz atmost O(log n) comparisons are performed in BST
@s_dr_13 Then what about left or right skewed case?In that height becomes same as no of nodes.If they have mentioned as balanced binary tree then O(logn) would have been right.
@Shivateja MST yes bro.
In the question they havn't mentioned anything about worst case/bestcase/avg case
so it could be O(log n) or O(n). only one of the option matches with best case. so option will be C.
if they have given O(log n) and O(n) as two of the options. then it will have ambuiguity.
@rjking7403 Yaa that's also a point.Thank you.
@s_dr_13 Yaa lets see what they gonna do.
source : wiki
so it should be O(logn) or O(n)
@venkatesh pagadala all options are correct.
Searching an element in tree can't be converted like above question. As we have only n elements in tree it can not exceed O(n) to search an element in the tree how can you give time complexity as O(n^2logn).
According to your explanation , answer for the below one is D as you choose highest upper bound.
what are the questions you guys are going to challenge?
1. The multiplicand register & multiplier register of a hardware circuit
implementing booth’s algorithm have (11101) & (1100). The result shall
ans should be 12.
11101 = -3
1100 = -4
so -3 * -4 = 12
should be both a & d
Buckets for continuous storage is like arrays so it will use linear probing (open addressing)
chains – uses closed addressing.
should be only II.
it should be option A. (previous gate question)
it should be 6 seconds if Scheduling is done only at arrival or completion of process. so how can you pre empt the process while it is executing?
it should be 'c'.
i think D option should be given in terms of 'n' not in terms of V. it is not there in the recurrence equation and will become constant.
option should be A.
please tell me if i missed any question which should be challenged.
@rjking7403 There is one question which has options containing LALR(1) and SLR(1).For that the answer should be both LALR(1) and SLR(1).
And is there any additional fee for raising objection?
thre is no additional fee for raising objections.
this is correct only.
refer this document..
@rjking7403 Bro just now i drew the states and checked it is SLR(1) and therefore LALR(1).
In the document they proved the Grammar is LALR(1) and not SLR(1) by taking A->d instead of A->a.
But in the question (in CIL as well as in document) they mentioned it as A->a.That makes the difference.
Yes @Shivateja MST good point
It should be challenged.
Tq @ vijay kumar 2 .
I think even CIL people might have just seen the example and framed the question without completely looking into it.
@rjking7403 can you just list those 8 in short so it will be easy to see at a place.
for Q24 option (a) is correct for intermediate code generation.
If it is not BST or heap we cant tell exactly how many nodes in RST and LST.
it can be anything because normal Binary tree does not have any criteria like BST or heap while inserting nodes in tree so you can can insert all noeds in either in LST or RST or distribute over LST and RST.
So It can be heap or BST. As per the given options it is tree is not heap so it must be unbalanced BST.
BST is a special type of tree-data structure in Binary Tree.
So I think information hidden intentionally (didn't mention it as Binary Search Tree) same as GATE 2020 Aptitude Question P,R,T given asked Q+S.
So either LST=3,RST=5 should be the correct option or wrongly framed question.
let me know if i am wrong.
selection nature of Objection:
Nature of Objection: Incorrect Answer Key
Remarks: Correct Answer – B
and attach your explanation supporting your answer.
Bro. How many question you are going to challenge ?
This is my list.
Coal INDIA MT2020 Objections
am i provided enough explanation?
let me know if i miss any question to be challenged.