Management Trainee Recruitment Advertisement No. 01/2019(COAL INDIA/CIL): 

https://www.coalindia.in/career/en-us/managementtrainee201920.aspx

 

posted in PSU Jobs Dec 19, 2019
11,769 views
18
Like
3
Love
0
Haha
0
Wow
0
Angry
0
Sad

128 Comments

128 Comments

Like
60 months service periodπŸ‘
Like
11

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.

Like
Has anybody received ISRO exam admit card for this coming 12th January exam?
Like
3

 

I have found this in their website

Like
1

No @GoalSet1

Like
Anyone has any idea that what should be attached in place of UG degree for 4th year students in the online application form ?
Like

@GoalSet1 you can login to their portal and download the call letter

Like
2

ISRO Admit cards has been released.

CSE people can download through this link  https://apps.isac.gov.in/CentralBE-2019/advt.jsp

Like
The admit card is showing in some unreadable format. Is anyone else seeing this ?
Like
try it on firefox browser...
Like
Yes, I am also seeing some unreadable format
Like
3
after you enter the credentials, it will show a link "Click here to download the Call Letter" .

Now right click and select save option and save it as pdf
Like
For anyone a  warning like "Access to requested page is denied" while downloading GATE Admit Card has been displayed?
Like
Yes, I'm facing the same problem.
Like
Why is it showing like that ? Is there any time restriction to download admit card?
Like
I think there is no restriction.
Like
Yaaa that's it..
Like
Now its working fine....
Like
once try to download using internet explorer.....
Like
I am from electronic and communication branch, am I eligible for this?
Like
as in the information brochure it is mention that eligible branch are computer science and computer enginnering but my branch is computer science and engineering . so i can fill or not
Like
@itssandeepverma Even I have the same doubt.So I just mailed them.In case if you get clarity regarding this please inform by posting it.
Like
Many students of computer science and engineering have filled computer science.
Like
kkkkk
Like
1
Does anyone have an idea like how to cover General Knowledge topics of Paper 1 of Coal India Management Trainee ?Is it enough to be covered for around one year or should we read even older topics?

Anyone suggest some better way to cover GK?
Like
Can you please tell me how to enter subject combination in application for CIL management trainee? I had 10 subjects in class 10 and 6 subjects in 12. I am from science background with physics, chemistry, maths and computers.

Also, Can you please tell me what is the procedure to upload the "Self Attested Matriculation Certificate" ? Should we xerox the certificate, then sign and scan it?
Like
Yess I have taken color Xerox attested,scanned and uploaded it.

We have to enter combination like Subject 1 - Subject 2 - Subject 3-  and so on.
Like
Hey all!

I can't see the CS branch here?

How you people have applied?
Like
1
@cshub.....if you are branch computer engineering related ...like IT, CSE, CS, CTECH all these comes under compuet engineering according to AICTE  otherwise they specificly mention which branch not eligible like other stream they have mentioned.....last time I have verified from BARC help they said Yes......Because ultimately  subjects are same for all this branches....except IT.....only name is different bcz that is BUSINEES OF EDUCATION SYSTEM
Like

@CSHuB You need to choose "systems" as post for computer science branches.

Like
On an all, IT branch is not eligible then,or is it?
Like
CIL is a mining company and there is no CS/IT job profile. They are hiring for a computer operator type of job I think.. :p
Like
For Computer Scienece/IT Paper 2,Engineering Mathematics is in syllabus or not?

And also what would be the expected cutoff this time for CSE/IT?

Anyone please provide some info.
Like
please login and checked syllabus
Like

"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

Like
response sheet is out for cil and objection form is also available.
Like
what is the expected cutoff?
Like
Q.31 Write true ( T ) / false ( F )for each of the following statements:

A. Symbol table is used only in first phase of a compiler.
B. A pretty printer analyses a program and prints it in such a way that the structure of the program becomes early visible.
C. YACC build up LALR parsing table.
D. If a grammar is LALR( 1 ), it is not necessarily SLR( 1)
 
Ans A. T T F T
  B. T T T F
  C. F T T F
  D. F T T T

 

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.

 

Q.46 The following grammar is:
S β†’ Aa | b A c | dc | bda
A β†’ a
 
Ans A. LALR(1) and SLR(1)
  B. LALR(1) but not SLR(1)
  C. Not LALR(1) but SLR(1)
  D. Neither LALR(1) nor SLR(1)

 

I think answer will be option A kindly check and correct me if i am wrong.

 

 

Q.50  
Ans A. 6 seconds
  B. 5 seconds
  C. 7 seconds
  D. 4 second

 

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.

Like
i found at least 4 wrong answers in the technical section .is there any fees for challenge and I think we can preempt in this question if a new process has arrived at that moment
Like
Q.74 A computer uses RAM chips of 1024 x 1 capacity.

How many chips are needed to provide memory capacity of 16K bytes?
 
Ans A. 128
  B. 16
  C. 1024
  D. 8

 

I guess 16 option b must be the answer kindly check

Like
I think no fee for challenge.
Like

@   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.

Like

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

Like
No It should be 128 convert bytes into bits
Like
Add question we will discus
Like
@shivateja MST yes you are correct i made a silly mistake anyways thanks
Like
yes @piyush question number 31 and 46 should be challenged.

but from where we find reference which will be precise.?
Like

and @Piyush #### what  are some other questions which are wrong according to you. please mention.

Like
Q.64 What is mean by stable sorting algorithm?  
Ans A. A sorting algorithm is stable if it preserves the order of all keys
  B. A sorting algorithm is stable if it doesn’t preserve the order of duplicate keys
  C. A sorting algorithm is stable if it preserves the order of duplicate keys
  D. A sorting algorithm is stable if it preserves the order of non-duplicate keys

 

 

Is C option correct or answer should be A?.

Like
Q.49 In hashing, collision resolution is carried out by close addressing. Which of the following is close addressing technique –

I. Buckets (for contiguous storage)
II. Chains (for linked storage)
 
Ans A. Only I
  B. I and II
  C. Only II
  D. None

 

Q.47 The multiplicand register and multiplier register of hardware circuit implementing Booths algorithm have (11101) and (1100). The result shall be:  
Ans A. 
  B. 
  C. 
  D. 

 

 

Q.37 Which of the following statement is false about Prim’s algorithm?  
Ans A. The time complexity is O(E + V log V)using Fibonacci Heap
  B. The complexity is O(E log V) using binary heap
  C. Initially the roots key and nodes are initialized to zero.
  D. It may use binomial max heap to represent the priority queue.

 

I have also doubt in this questions please suggest .

Like
Q.25 Generation of intermediate code based on an abstract machine model is useful in compilers because:  
Ans A. It enhances the portability of the compiler system program
  B. Syntax translations are easier for intermediate code generation
  C. It is difficult to generate executable code from high level language program.
  D. It makes implementation of lexical and syntax analysis easier

 

isnt answer should be A?

 

 

 

 

 

 

 

 

Like

 yes for q25

Like
What could be the expected cutoff?
Like

Expected cutoff?

how many marks you scored?? @ @ @  

Like

c programming question :

What is the output of the following C program

#include

int main( )
{
int i=5;
printf("%d %d %d", i++, i, ++i );

return 0;
}

 

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.

Like
Gcc is standard compiler not turbo c..
Like
Q64 option C
Like
@vijay_kumar2 no the answer will be option d only

It makes implementation of lexical and syntax analysis easier

It was asked in previous year gate as well in compilers.
Like

@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.

Like
@vijay no the answer for stable is also correct as you are saying option a means it should preserve the order of every key so how it will sort it is clearly false as input :   6  -1a  -1b  8  7  3      output : -1a -1b 3 6 7 8

This is what stable means you can see still -1a and -1b is still in the same order but the order of other elements which are not duplicate got changed where as the order of duplicate elements are preserved.
Like

Piyush#### check this ques for intermediate code

https://gateoverflow.in/2453/gate1994-1-12

Like
Guys someone please explain what they did with that average waiting time question as they said we can schedule a process only when it comes or it gets completed if you solve the question keeping this criteria we are getting 19/3 as the average waiting time,

but if you ignore this then indeed the answer is 5.
Like

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.

 

Like
@hitesh159 yes option A seems to be correct thanks, the only thing concerned me in the exam was they said it helps to enhance the portability of the entire compiler system in option a ) but i thought it doesn't effect the backend it only helps to increase the efficiency of the frontend, but in option a they are talking about the entire compiler system.

 

But still option A seems to be stronger so may be it will be the correct answer.
Like

@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

Like

ok thanks there also answer is same

Did you challenged this question

The following grammar is:
S β†’ Aa | b A c | dc | bda
A β†’ a
 
Ans A. LALR(1) and SLR(1)
  B. LALR(1) but not SLR(1)
  C. Not LALR(1) but SLR(1)
  D. Neither LALR(1) nor SLR(1)

.

Like
I haven't challenged any question till now but soon will challenge a few, can you get me that SJF question as how 5 will be the answer for it ? As they said we can't preempt a process when it begins execution they how come 5 will be the answer.
Like
i also got answer 5 because i ignored that point " we can't preempt a process " so may be the question is ambiguous .
Like
Ok thanks.
Like
No the answer will be 5 we will start p0 at 0 and at t=1 it will be prompted because a new process namely p1 has arrived and then p1 will run till completion and after that p0 will continue and run till completion and after that p2 will start and run till completion..

What is wrong in this???
Like
It is clearly mentioned that scheduling takes place only when new process arrives or a process is completed which means we can preempt a process when a new process has arrived
Like

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 #### 

Like

@pranay562  https://solutionsadda.in/cil/ Goto this link and you will get CIL 2020 qn paper.

Like
@hitesh159 ,@Piyush ####,@vijay kumar 2 ,@Shivateja MST,@rjking7403,@Dhruv Bhardwaj 2 what do you guys are thinking,  what will be the cutoff?
Like
bro last year general cutoff is 147  for  20 posts.
i think it would be around (general)140-145 for 46 posts.
what about you bro?
Like
I think cut off might be between 135-145
Like
1
Bhai generally prediction about CIL cutoff is hard to make as last time for mechanical it went as high as 175 but i too think cutoff can be in a window of 135-145, i checked on few websites some even say cutoff can go as low as 125-135 but i think if someone is getting around 135+ (General) he/she has a good chance,
Like
Let's open a thread dedicated to only CIL question paper as it might be helpful for upcoming examinations and also for future aspirants?
Like
I think answer keys given by them for some questions are incorrect
Like
Yes.Even I too feel the cutoff would be in range of 135-145.I feel like around 6 questions in technical sections are wrong.

Can anyone just mention how was the paper when compared to that of last year?I couldn't find any source to check last year's paper.
Like
yes at least 6 wrong in technical section but i am not sure what kind of reference they will accept
Like
So are u guys gonna challenge it ?
Like

@rjking7403 Thankyou.So the exam will not be conducted yearly?It seems like it was lastly conducted in 2017.

Like

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.

Like

@Shivateja MST No it is correct becoz atmost O(log n) comparisons are performed in BST 

Like
1

@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.

Like
What needs to be selected as Option ID while objecting incorrect answer keys?( whether the answer key given by CIL or the answer we think is correct), I tried asking CIL support but they said refer to advertisement but nothing is mentioned in it.
Like

@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.

Like

@rjking7403 Yaa that's also a point.Thank you.

Like
I think this question has incorrect answer key as none of the option matches
Like
@Shivat

I think seeing options u should have guessed it ( they are implicitly assuming the tree to be balanced,otherwise one of the options would have been O(n)  !!

 

anyhow,comparisons are atmost O(height of the tree)

 

It was a tricky question ....LOL
Like

@s_dr_13 Yaa lets see what they gonna do.

Like
anyway the answer O(logn) is wrong rest all three can be accepted since they are not asking the tightest upper bound ,so any upper bound will do.but i don't think they will correct it beacuse its not gate
Like
option D is correct, because if f(n) = O(log  n) it means, $$f(n) \leq c. log(n)$$

also, $$f(n) \leq c_1. n^2, \\ f(n) \leq c_2. n. log(n),\\ f(n) \leq c_3. n^2. log(n)$$

we need to consider the highest upper bound, which is D.
Like

 
source : wiki

so it should be O(logn) or O(n)

 

edited Mar 5, 2020 by
Like
Generally, it is O(n) but we can also represent O(n) as O(n^2) or O(n^2 log n).

 

The given question can be converted to the following question.

The first positive number is less than or equal to ____________

a) 1

b) 2

c) 3

d) 4

what is the answer?
Like
1

@ 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.

Q.90 The time complexity of searching an element in linked list of length n will be:  
Ans A. O(n log n)
  B. O(log n)
  C. O(n)
  D. O(n2)
Like
Actually the problem is with the big O notation, if the options are given in theta notation then your answers will be correct.
edited Mar 6, 2020 by
Like

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 ______ is the combination of one or more column values in a table that make a row of data unique within the table.

A.primary key

B.foreign key

C.candidate key

D.natural key

 

should be both a & d

3.

In hashing, collision resolution is carried out by close addressing. Which of the following is close addressing technique –

I. Buckets (for contiguous storage)
II. Chains (for linked storage)

 

A. Only I
B. Only II
C. I and II
D. None

Buckets for continuous storage is like arrays so it will use linear probing (open addressing)

chains – uses closed addressing.

should be only II.

4.

Q.24 Generation of intermediate code based on an abstract machine model is useful in compilers because:  
Ans A. Syntax translations are easier for intermediate code generation
  B. It enhances the portability of the compiler system program
  C. It is difficult to generate executable code from high level language program.
  D. It makes implementation of lexical and syntax analysis easier

 

it should be option A. (previous gate question)

 

5. 

A. 4 seconds
B. 5 seconds
C. 6 seconds
D. 7 seconds

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. 

Q.50 Write true ( T ) / false ( F )for each of the following statements:

A. Symbol table is used only in first phase of a compiler.
B. A pretty printer analyses a program and prints it in such a way that the structure of the program becomes early visible.
C. YACC build up LALR parsing table.
D. If a grammar is LALR( 1 ), it is not necessarily SLR( 1)
 
Ans A. T T F T
  B. T T T F
  C. F T T T
  D. F T T F

 

it should be 'c'.

7.

Q.59 Solve the following recurrence relation

T(n) = 4T(n/2) + n
 
Ans A. O(n /2)
  B. Ο(n)
  C. O(log n)
  D. O(v2)

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. 

Q.76 The following grammar is:
S β†’ Aa | b A c | dc | bda
A β†’ a
 
Ans A. LALR(1) and SLR(1)
  B. Neither LALR(1) nor SLR(1)
  C. LALR(1) but not SLR(1)
  D. Not LALR(1) but SLR(1)

 

option should be A.

please tell me if i missed any question which should be challenged.

 

Like

@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?

Like

thre is  no additional fee for raising objections.

This one??

Q.76 The following grammar is:
S β†’ Aa | b A c | dc | bda
A β†’ a
 
Ans A. LALR(1) and SLR(1)
  B. Neither LALR(1) nor SLR(1)
  C. LALR(1) but not SLR(1)
  D. Not LALR(1) but SLR(1)

this is correct only.

refer this document..

http://people.cs.vt.edu/~ryder/515/f05/homework/hw1ans.pdf

Like
1

@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.

Like
yes bro. i missed this. i choose A as option in exam then we can challenge this also.
Like

Yes @Shivateja MST    good point

It should be challenged.

 

Like
any question apart from these 8?
Like
1

Tq @ .

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.

Like
ok bro@Shivateja MST
Like

for Q24 option (a) is correct for intermediate code generation.

https://gateoverflow.in/1664/gate1998-1-27

Like
the following is the sequence of insertion in a binary tree 45 65 35 40  33 70  60 75  691

1. LST=3 , RST =5

2. LST=6, RST =2

3 LST =5, RST =3

4 LST =2, RST =6

Answer given is option 1 , but answer should be option 3 , because option 1 is the answer of binary search tree but in question binary tree is given.
edited Mar 8, 2020 by
Like

@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.

Like
While submitting any objection in CIL MT objection link , when the given answer key is incorrect , what we have to fill in option id ?

1. Answer key given by CIL.

2. Answer key we think is correct.
Like

selection nature of Objection:

Nature of Objection: Incorrect Answer Key 

In Remarks:

Ex.
Remarks: Correct Answer – B

and attach your explanation supporting your answer.

 

 

Like
@rjking7403

But there is one more choice of option id , what to fill in that?
Like
I think we need to fill it with the CIL Answer Key.
Like
@rjking7403

okky πŸ™‚
Like

@

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.

 

Like
A person marks his goods 40% above the cost price. He sold 30% of goods at marked
price, 60% of the remaining at a discount of 20% and remaining at 40% discount. What
is his overall gain percent?

In this question, all options are wrong. I was getting 12.56% gain in the exam...
Like
given answer is correct 17.6
Like
(100-(1.4*30+0.8*1.4*60+0.6*1.4*10))/100=17.6%
Like
They said "60% of the remaining"

not 60% of original items, as u did.

the wording of the question are very vague
Like
yes.. I missed that.. Have you challenged it?
Like
How is the selection exactly done? They said interview is going to be of 10 marks only. So is the final merit list going to be generated out of 210 marks(200 for written and 10 for interview) or the written marks is going to get scaled down?
Like
Coal India results were announced.
Like
Can we check our marks of CBT, just like ISRO ? Or there is any other provision ?
Like
They have just provided the list of shortlisted candidates.
Like
Can we check our individual marks ?

How we can review our response sheet again ?
Like
did the interview and final selection happen after that  for Systems?
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true