June 27, 2011

BEL Probationary Engineer Computer Science Paper 2011

I gave the BEL Probationary Paper in Computer Science on 26th July 2011 in my final year of Engineering.

There were a total of 150 questions (120 - Technical & 30 – English + Aptitude) to be done in 2.30 hrs. Each correct answer gives you +1 mark whereas one wrong answer would fetch you -0.25.

Here is a brief description of the questions (subject wise) that I faced in the examination.
(Answers of some questions are given in bold in bracket at the end of the question)

Technical (120 questions)

Data Structures (10-12 questions)
  1. 2 questions based on insertion of 7 elements in max heap sort.
  2. Worst Case complexity of Selection Sort (nlogn).
  3. A figure was given, we had to tell what type of sort it was (quick sort).
Operating Systems (15 questions)
  1. A table was given with arrival time and burst time of processes; we need to calculate the turnaround time.
  2. A table was given with arrival time and burst time of processes; we need to calculate the average waiting time of process P2.
  3. Two questions based on Belady’s Anomaly.
  4. 2 reasoning questions asking “If we increase the no. of frames in FIFO, then page fault increases”.
  5. FCFS, SJF, Round Robin, Multi-Level Queue Scheduling are examples of (Scheduling Algorithms).
Programming Skills (15 questions)
  1. 3-4 questions were from C Language in which the program was given and we need to find the output (mostly basic questions and very difficult, just tricky).
  2. 4 questions were from Java regarding necessary files required in a program.
  3. A question relating keyword int from C# to .NET.
  4. OOPS was first used in :- a. Java b.C++ c. Small Talk d. Simula) (d)
  5. The keyword goto is :- (a. Defined in both C# and Java, used in C#, but reserved in Java b. Defined in both C# and Java, used in Java, but reserved in C# c. Not defined in both C# and Java d. Defined and used in both C# and Java)
Data Communications & Computer Networks (15 questions)
  1. One numerical based on Go Back N-ARQ.
  2. 2 questions related to IP addresses.
  3. In Manchester Encoding :- (a. Bit rate is same as baud rate b. Bit rate is twice of baud rate c. Bit rate is half of baud rate d. None)
  4. What is Manchester, Unipolar, NRZ, etc. :- (a. Encoding b. Decoding c. Encryption d. Decryption) (a)
Digital Electronics (8-10 questions)
  1. Questions based on no. of NOR gates required to make f= AB+C.
  2. Some questions based on finding the result of a given gate (m0+m1+m2+m3).
DBMS (10-12 questions)
  1. 3-4 questions were based on Normal Forms, i.e., 1NF, 3NF, BCNF, etc.
  2. Some questions related to Relational and logical database.
Others (25-30 questions)
  1. 3-4questions from Microprocessor.
  2. 4-5 questions from Theory of Automation from grammars.
  3. 4-5 questions were from Compiler Design.
  4. Where are variables stored in compilation :- (a. Symbol Table b. Parser Table)
English + Aptitude (30 questions)
  1. 3 fill in the blanks and 2 sentence error finding question.
  2. 2 reasoning questions.
  3. A passage was given with 4 questions which followed it (very easy).
  4. 2-3 questions were from probability (12th Maths but a bit tough).
  5. 1 question from limits (12th Maths).
  6. 2 questions from differential equations (12th Maths).
  7. 1 question from Newton Raphson method.
  8. 3 logical reasoning questions based on 5 men, 5 color ties and 5 sponsoring companies.
  9. 3 more logical reasoning questions based on the passage (Really Difficult).
  10. 4 questions based on information given in the pie chart.
My views about the paper

Overall, the paper was a bit lengthy. So you have to be really fast and don’t waste much time solving a difficult question. About 60% percent of the technical questions were theory based and one word answers. Some of the questions were really easy, but there were some questions that were real hard and were based on general knowledge about things you might not have studied, like UNIX OS (which was asked in the paper) and many others.Overall, I found OS and Programming easy. So have to prepare thoroughly for the paper and time management is very important.

Best of Luck…!!!

Please feel free to comment.


  1. thanks sahil, very good work

  2. great help sir
    Could u plz explain
    Java file questions............

  3. thanx a lot , it really gonna help me a lot...
    can u answer my these questions?
    1. what was the cut off?? how many questions must be solvd to get into the shortlistd candidates??
    2. what to study in JAVA..??
    3. any software engg questions???
    4, what abt distere mathematics and graph theory??

    1. Please find my answers below:

      1. The cut off was very high as there are very few seats (30-40) for computer science students.

      2. In Java, the questions would be from the basic java, completely technical, but easy. So, read Java very carefully.

      3. In 2011, there were very few Software Engineering questions, but they may vary each year.

      4. None or maybe one.

    2. thanx for answering my queries.....
      Well, i have cleared the written xam , now plz guide me for the interview , i will be highly thankful to you....

  4. thanks very much...

  5. Dear Sahil,
    1) is it sectional cut off is there for technical and aptide?

    1. I believe there are sectional cut offs, though I am not really sure as it has been almost 3 years I gave my exam.

  6. thanks sir...c
    you send me question paper to my id ?

  7. thnk u was really helpful

  8. This comment has been removed by the author.

  9. Hi Sahil, Can you please guide me how can I prepare for BEL-2017 exam (CSE)? Only one month left, what strategy should I follow?

  10. Please share the question papers to my id(