Management Trainee Recruitment Advertisement No. 01/2019(COAL INDIA/CIL):
https://www.coalindia.in/career/en-us/managementtrainee201920.aspx
6.0 OTHERS 6.1 Compensation / Pay - Selected candidates will be placed as Management Trainee in E1 grade in the scale of pay of Rs. 16,400 β 40,500 at the initial Basic of Rs.16,400/- during the first year (Training period). On successful Completion of Training and passing the test conducted for the purpose, regularization will be in E2 grade in the scale of pay of Rs. 20,600 β 46,500 at the initial Basic of Rs.20,600/- with probation for 1 year. Besides basic pay, candidates will also be entitled to other pay and perks including Dearness Allowance, HRA, perquisites and allowances under cafeteria approach and other allowances as applicable for the post. Benefits such as leave, medical treatment, CMPF, pension, gratuity etc. will be admissible as per company rules in force during training and after absorption. 6.2 Posting: Candidates may be posted anywhere in Coal India / Subsidiary companies especially in coalfield areas. 6.3 Service Agreement Bond: A candidate is required to serve the company for a minimum period of 50 months. An amount of Rs.1000/- per month will be deducted from the salary for a period of 50 months. Failure on the part of candidate to serve the Company for a minimum period of 50(fifty) months would result in forfeiture of the said deposit and the balance may be recovered from the candidate. The amount so deducted will be refunded in full without interest on completion of 50 months of service. 6.4 Medical Examination: Before joining service, the selected candidates will have to undergo initial medical examination by the company Medical Officer as per the Medical Attendance Rules of the company.
I have found this in their website
No @GoalSet1
@GoalSet1 you can login to their portal and download the call letter
ISRO Admit cards has been released.
CSE people can download through this link https://apps.isac.gov.in/CentralBE-2019/advt.jsp
@CSHuB You need to choose "systems" as post for computer science branches.
"During 1st hour, 100 questions of Paper-I will be available to answer and after one hour upon clicking the SUBMIT button, all 200 questions will be displayed to the candidates to answer/attempt."
this is mentioned in hall tickit . can we attempt after submit button again those not covered in 1 hours or is it sectional time
I think answer will be option D as it is not necessary if a grammar is LALR1 then it may or may not be SLR 1. Kindly correct me if i am wrong.
I think answer will be option A kindly check and correct me if i am wrong.
I think answer will be 6 seconds kindly correct me if i am wrong. As it is clearly said we cannot preempt a process as sheduling is carried out only at arrival or completion of process.
I guess 16 option b must be the answer kindly check
@ Piyush #### Regarding Q31 and Q46, as you mentioned,the options should be D and A respectively.But for Q50 i think 5 seconds is correct as I have got 5 seconds in exam.
Yes i found nearly 7 to 8 questions as incorrect and i listed them as well what is your opinion about those question @hitesh159 @vijay kumar
and @Piyush #### what are some other questions which are wrong according to you. please mention.
Is C option correct or answer should be A?.
I have also doubt in this questions please suggest .
isnt answer should be A?
vijay kumar 2 yes for q25
Expected cutoff? how many marks you scored?? @Susmita Paul @hitesh159 @ vijay kumar 2
c programming question :
in gcc: 677
https://ideone.com/f2OCJe
in turbo c : 666
can we challenge this?
As output depends on thecompiler and calling convention so behavior of i is undefined.
@vijay The answer for prims is also correct as in prims we need to get the minimum wt vertex out every time and for that we need min heap so we cannot use binomial max heap.
Piyush#### check this ques for intermediate code
https://gateoverflow.in/2453/gate1994-1-12
yes piyush for stable sort you are right .
but the link you mentioned for compiler question there also the answer is
"to enhances the portability of the front end of the compiler"
and for prims we do not make each node to 0 .
and what about hashing question(Q.49)
And
if anyone have reference for booth algorithm question than please suggest or explain its answer or solve this problem in detail.
@vijay Booth algo Gateoverflow source : https://gateoverflow.in/170945/computer-architecture
Other source :http://examradar.com/computer-architecture-mcqs-set-4/ see qn 8
https://compscibits.com/Computer-Architecture/Computer-Arithmetic/discussion/6781
ok thanks there also answer is same
Did you challenged this question
.
Bro if u don't mind can u ping me, the question paper or response sheet. I haven't appeared for the exam. I want to see the questions. Might help for upcoming exams. @Piyush ####
@pranay562 https://solutionsadda.in/cil/ Goto this link and you will get CIL 2020 qn paper.
https://www.edufever.com/wp-content/uploads/2017/04/CIL-Paper-2.zip
https://www.edufever.com/wp-content/uploads/2017/04/CIL-Paper-1.zip
@rjking7403 Thankyou.So the exam will not be conducted yearly?It seems like it was lastly conducted in 2017.
Consider the binary search tree with n elements. The time required to search given element is: _______
A. O(n log n)
B. O(n2)
C. O(log n)
D. O(n2 log n)
It seems like this question is also wrong.In BST if we consider the worst case(left or right skewed),then time taken to search a given element will be O(n) and it doesn't match with any of the options.
@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?
my list:
1. The multiplicand register & multiplier register of a hardware circuit implementing boothβs algorithm have (11101) & (1100). The result shall be A. (812) B. (-12) C. (12) D. (-812)
ans should be 12.
11101 = -3
1100 = -4
so -3 * -4 = 12
2.
A.primary key
B.foreign key
C.candidate key
D.natural key
should be both a & d
3.
Buckets for continuous storage is like arrays so it will use linear probing (open addressing)
chains β uses closed addressing.
should be only II.
4.
it should be option A. (previous gate question)
5.
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?
6.
it should be 'c'.
7.
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.
8.
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 one??
this is correct only.
refer this document..
http://people.cs.vt.edu/~ryder/515/f05/homework/hw1ans.pdf
@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.
https://gateoverflow.in/1664/gate1998-1-27
@Shatakshi_mishra 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
In Remarks:
Ex. Remarks: Correct Answer β B
and attach your explanation supporting your answer.
@Shatakshi_mishra
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.
64.3k questions
77.9k answers
243k comments
79.6k users