Interview experience
BARC interview experiences covering Screening - BARC CBT or valid GATE score, Selection Interview, Medical fitness examination. Round-wise notes, common questions, and what candidates report clears each stage.
BARC Interview Questions and Answers (2026)
Bhabha Atomic Research Centre is India's premier nuclear research institution under the Department of Atomic Energy. It recruits Group A Scientific Officers through the BARC Training Schools OCES and DGFS programs for research in reactor physics, chemistry, and engineering.
HQ: Mumbai, India
Website: barc.gov.in ↗
Explore: Interview experience · HR interview questions · Overview · Placement papers · Preparation guide
Overview
BARC recruits Scientific Officers through the OCES/DGFS training scheme, screening candidates via either its own Computer-Based Test or a valid GATE score, with final selection resting entirely on a single interview.
HR interview questions
BARC HR interview questions with sample answer frameworks - motivation, relocation, STAR stories, and culture-fit prompts.
BARC interview process at a glance
| Round | Duration | What it tests |
|---|---|---|
| Screening - BARC CBT or valid GATE score | Varies (CBT is discipline-specific, curriculum-level) | Core subject fundamentals and problem-solving (CBT), or your GATE score directly |
| Selection Interview | 30-45 min | Core technical depth, project discussion, research/scientific suitability |
| Medical fitness examination | - | Physical fitness for the role |
BARC OCES screening test: quick answers
These answers come from BARC’s official OCES/DGFS-2026 advertisement, GoClasses’ OCES/DGFS 2026 guide for CS and candidate reports (GeeksforGeeks, GATE Overflow). The brochure for your year is the final word.
| Question | Answer |
|---|---|
| How many questions and how long? | 100 single-correct MCQs in 120 minutes, on your core discipline only, with an on-screen calculator (GoClasses 2026 guide). Computer Science candidates report a GATE-like syllabus plus software engineering. |
| When is the online test? | The 2026 cycle’s online exam was on 14 and 15 March 2026 at more than fifty cities, with interviews in May-June 2026 at BARC Mumbai (Hyderabad for Geology and Geophysics). |
| Does it have negative marking? | Yes. The GoClasses 2026 guide and earlier reports describe +3 for a correct answer and -1 for a wrong one. The official advertisement does not state it. |
| Is there aptitude, English or GK? | No. The test has no general aptitude, English or GK sections. |
| Is GATE required? | No, but it is an alternative. For 2026, a GATE 2024, 2025 or 2026 score in the paper matching your degree can shortlist you without the CBT. BARC advises using both channels, because the GATE cutoff is fixed only after the online test. |
| How much is the cutoff? | Not published, and it moves every cycle. Forum reports put Computer Science written scores around the 120-140 band in recent years; one 2023 account says 200+ CS candidates were called for interview. |
| Does the screening score count in the final result? | No. It only shortlists you. Selection is decided by the interview, subject to the medical. |
| Is there coding? | Not in the online test, which is MCQ. In the interview, CS candidates write C code on paper or the board, for example a function that returns the top 3 values of an unsorted array. |
| What is the eligibility? | The 2026 advertisement asks for 60% aggregate or 6.0 CGPA in the listed qualifying degree. Maximum age 26 for General, 29 for OBC-NCL and 31 for SC/ST, as on 1 August 2026. |
| Is there a bond and stipend? | Yes. Selected candidates sign an agreement and indemnity bond to serve DAE for at least three years after training, with no third-party surety. The 2026 stipend is Rs 74,000 a month. |
BARC interview questions by discipline
Most detailed public reports are from Computer Science boards, which ask you to write five favourite subjects on the board and then cross-question each one. They show the level, not a fixed list.
| Discipline | Reported questions and topics |
|---|---|
| Computer Science | C: what a function is, can it return more than one value, write a function for the top 3 values of an array. OS: process vs program and how a program becomes a process. DS: a stack that stores complex numbers. DBMS: 1NF, 2NF, 3NF with example tables. COA: RISC vs CISC, interrupts. Algorithms: check whether one string is a rotation of another. |
| Mechanical, Electrical, Chemical, Electronics | Few detailed public reports. Expect the same format: name your favourite subjects, then answer derivations and “why” questions on each at B.E./B.Tech depth, plus your project. |
| Science streams (Physics, Chemistry and others) | Few detailed public reports. Expect core subject depth from your M.Sc. and research-style “what would happen if” questions. |
Asked across every discipline: your education, GATE score and rank if you have one, higher-study plans, your final-year project, why a government research career, and whether you will relocate to any DAE centre.
Screening - BARC CBT or GATE score
BARC offers two parallel screening channels for the same shortlist: its own Computer-Based Test (discipline-specific, run across 50+ Indian cities, testing B.E./B.Tech-level core subjects only - no general English, GK, or aptitude sections), or a valid GATE score in the matching subject from the current or two preceding GATE years. Either route only shortlists you; the score itself doesn’t carry into final selection.
For the CBT route, candidate reports and preparation guides commonly cite 100 questions in 120 minutes with +3 / −1 marking - accuracy matters as much as speed because negative marking punishes guesses. Eligibility in recent OCES cycles has included 60% aggregate or 6.0 CGPA in the qualifying degree (verify the current notification PDF for your batch). GATE scores from the current year or the two preceding GATE years in the same subject as your degree can substitute for the CBT entirely.
Common questions
- Core-subject fundamentals at B.E./B.Tech curriculum depth (CBT route) - e.g. core CS subjects for Computer Science candidates
- Problem-solving questions within your discipline, without general-aptitude or GK sections
- Cutoffs move every cycle - treat forum cutoffs (e.g. CS written scores in the 120–140 band in recent years) as snapshots, not guarantees
Selection Interview
The entire final selection rests on this one interview, plus medical fitness - screening scores don’t carry forward. Panels go deep on your core discipline and cross-question your final-year project closely, alongside gauging your fit for a research-oriented government scientific career.
Common questions
- Core technical questions from your engineering/science discipline
- Detailed walkthrough of your final-year project or thesis - methodology, results, design choices
- Why a research career at a government scientific establishment like BARC over industry
- Questions assessing scientific curiosity and suitability for long-term, mission-driven research work
Sample answer frameworks are on the BARC HR interview questions page.
Medical fitness examination
After a successful Selection Interview, candidates proceed to a medical fitness check per DAE service rules. It is a gate to appointment - not a scored “round” in the same sense as the board - but failing medical standards can disqualify an otherwise strong interview. Carry notification-listed documents, disclose relevant history honestly, and treat logistics (Mumbai venue, long interview days) as part of prep: candidates report form filling, document verification, biometrics, and waiting before the panel even starts.
Common questions
- Are you fit for laboratory/plant/posting environments described in the brochure?
- Any condition that affects shift work or field posting (answer factually; do not hide)
Why screening scores don’t carry into selection
Unlike most PSU or corporate pipelines where your test score contributes to a final weighted merit, BARC’s OCES/DGFS process treats the CBT or GATE score purely as a gate to reach the interview - once you’re shortlisted, that score is dropped and selection is decided entirely by interview performance (plus clearing the medical exam). That makes the interview far higher-stakes than in a typical weighted-scoring PSU process, so treat screening as a hurdle to clear, not something to bank marks on.
OCES vs DGFS
Both are entry routes to the same Scientific Officer post through the BARC Training Schools, and both use the same screening and interview. OCES (Orientation Course for Engineering Graduates and Science Postgraduates) is the direct route: a one-year training course with a stipend, then appointment as Scientific Officer. DGFS (DAE Graduate Fellowship Scheme) is for engineering graduates who want to do an M.Tech. first: selected candidates study at a participating institute on a DAE fellowship and join as Scientific Officers afterwards.
This page covers both, since the interview is common. Choose the route on the application form, and read the brochure for which institutes and disciplines take DGFS candidates in your year.
Common technical interview questions and answers
Q: What are the four necessary conditions for deadlock, and how is deadlock handled?
Deadlock needs all four of Coffman’s conditions to hold simultaneously: mutual exclusion (a resource is non-shareable), hold and wait (a process holds one resource while requesting another), no preemption (a resource cannot be forcibly taken), and circular wait (a cycle exists in the wait-for graph). Break any one and deadlock cannot occur - requesting all resources at once breaks hold and wait, and imposing a global ordering on resource acquisition breaks circular wait. Avoidance uses the Banker’s algorithm, which grants a request only if the resulting state is safe, meaning some sequence exists in which every process can finish. Detection plus recovery instead lets deadlock happen, finds cycles in the wait-for graph, and kills or rolls back a victim - which is what most general-purpose operating systems effectively do by ignoring the problem.
Q: Explain paging, the TLB, and how effective memory access time is calculated.
Paging divides the logical address space into fixed-size pages and physical memory into frames of the same size, with a page table mapping page numbers to frame numbers, which eliminates external fragmentation at the cost of some internal fragmentation in the last page. A plain page table means two memory accesses per reference - one for the table, one for the data - so a Translation Lookaside Buffer caches recent page-table entries. If the TLB hit ratio is h, TLB access time is t, and memory access time is m, effective access time is h(t + m) + (1 - h)(t + 2m) for a single-level page table. With a hit ratio of 0.9, t = 20 ns and m = 100 ns, that works out to 0.9(120) + 0.1(220) = 130 ns. Multi-level page tables reduce the memory the table itself consumes, but add one more memory reference per level on a TLB miss.
Q: What are the ACID properties, and what anomalies do the SQL isolation levels allow?
Atomicity means a transaction executes fully or not at all; Consistency means it moves the database from one valid state to another respecting all constraints; Isolation means concurrent transactions do not observe each other’s intermediate state; Durability means committed changes survive a crash, typically guaranteed by a write-ahead log flushed before commit. The four SQL isolation levels trade isolation against concurrency: Read Uncommitted permits dirty reads, Read Committed prevents those but permits non-repeatable reads, Repeatable Read prevents those but permits phantom rows, and Serializable prevents all three. Stricter levels need more locking - Serializable typically requires range or predicate locks - so throughput drops as isolation rises.
Q: Why do databases use B+ trees for indexing rather than binary search trees or hash tables?
A B+ tree is a balanced multi-way tree in which every internal node holds many keys and children, so a node maps neatly onto a disk block or page. Because the branching factor is in the hundreds, the height is roughly log base b of n and a lookup on millions of rows costs only three or four disk reads, whereas a binary search tree of the same size would cost around 20. In a B+ tree all actual records live in the leaves and the leaves are chained in a linked list, which makes range queries and ordered scans a single sequential walk. A hash index gives O(1) equality lookup but cannot answer range or ordering queries at all, which is why B+ trees remain the default.
Q: Compare TCP and UDP, and explain how TCP achieves reliability.
TCP is connection-oriented and reliable: it establishes a connection with a three-way handshake (SYN, SYN-ACK, ACK), numbers every byte with sequence numbers, acknowledges receipt, retransmits on timeout or duplicate ACKs, and delivers bytes to the application in order. UDP is connectionless with an 8-byte header, no handshake, no acknowledgement, no ordering, and no congestion control - so it is faster and used for DNS, video streaming, and real-time voice where a late packet is worse than a lost one. TCP also does flow control with a receiver-advertised sliding window, so a fast sender cannot swamp a slow receiver, and congestion control with slow start, congestion avoidance, fast retransmit, and fast recovery, so senders back off when the network is loaded. The cost is per-connection state, handshake latency, and head-of-line blocking.
Q: State the master theorem and use it on merge sort and binary search.
For a recurrence T(n) = aT(n/b) + f(n) with a at least 1 and b greater than 1, compare f(n) with n raised to log base b of a. If f(n) grows polynomially slower, the answer is dominated by the leaves and T(n) is theta of n to the power log base b of a. If they grow at the same rate, T(n) is theta of that same term multiplied by log n. If f(n) grows polynomially faster and satisfies the regularity condition, T(n) is theta of f(n). Merge sort is T(n) = 2T(n/2) + O(n), where log base 2 of 2 is 1 and f(n) is n, so it falls in the second case and gives theta of n log n. Binary search is T(n) = T(n/2) + O(1), where log base 2 of 1 is 0, again the second case, giving theta of log n.
Q: What is instruction pipelining, and what limits the speedup you actually get?
Pipelining overlaps the stages of successive instructions - a classic five-stage RISC pipeline runs fetch, decode, execute, memory access, and write-back concurrently on five different instructions - so throughput approaches one instruction per cycle even though each instruction still takes five cycles end to end. The ideal speedup equals the number of stages, but three classes of hazard erode it. Structural hazards arise when two stages need the same hardware, solved by duplicating units or splitting instruction and data caches. Data hazards arise when an instruction needs a result not yet written back, mitigated by forwarding or bypassing and, where that is not enough, by stalling. Control hazards come from branches, where the pipeline does not yet know the next address, and are handled with branch prediction and delayed branches - a mispredict costs a full pipeline flush.
Q: How should you present your final-year project when the panel cross-questions it?
BARC panels probe the project harder than almost anything else, so structure the answer as problem, approach, alternatives rejected, results, and limitations. Be able to justify every design choice quantitatively - why that algorithm rather than a simpler baseline, what the measured improvement was, and what your test or validation setup was. Own your specific contribution honestly rather than describing the whole team’s work in the first person, because the follow-up question is always about a detail only the person who wrote it would know. Finally, state at least one limitation and what you would do differently with more time; panels read that as scientific honesty rather than weakness, which is precisely the trait a research organisation is screening for.
Q: Why does the OS use separate user and kernel address spaces, and what happens on a system call?
User programs run in an unprivileged mode with a logical address space mapped through page tables; the kernel maintains a separate mapping for its own code, stacks, and device buffers so a buggy user process cannot corrupt kernel structures. A system call is the controlled gateway: the CPU traps to kernel mode, the kernel validates arguments, performs the privileged work (I/O, scheduling, memory mapping), and returns. Panels often chain this into page faults, mode bits, and where the kernel stack lives - 2025 CS reports on GATE Overflow show multi-question OS threads starting exactly here.
Q: Write C code to delete the nth node of a linked list - what edge cases will they probe?
Handle empty list, n larger than length, n negative, and deletion at head, middle, and tail in O(n) with a single pass when possible. Be ready for follow-ups: iterative vs recursive delete, why you need a dummy head node for head deletion, and what breaks if you free the wrong pointer. Public BARC CS experiences describe 20+ cross-questions from one linked-list prompt - every line you write will be challenged.
Q: Are you prepared for classified work, relocation, and radiation-related service conditions?
These are fit prompts inside the same interview, not a separate HR stage. Answer honestly: read OCES service conditions, acknowledge that DAE work can be sensitive and centre postings can be remote, and explain why you still prioritise BARC (mission + technical depth). Avoid claiming comfort you do not feel - panels value integrity over rehearsed bravery.
Frequently asked questions about BARC interviews
Does the BARC OCES online test have negative marking?
Yes - GoClasses’ OCES/DGFS 2026 guide and earlier candidate reports describe +3 for a correct answer and -1 for a wrong one, on a 100-question, 120-minute paper covering only your core discipline. The official 2026 advertisement does not print the marking scheme, so check the instructions on exam day. With under 1.5 minutes a question, skipping doubtful items is usually better than guessing.
What is the BARC OCES cutoff?
BARC does not publish a fixed cutoff; the CBT or GATE score is only used to shortlist for interview, and the line moves every cycle and discipline. The 2026 advertisement says the GATE cutoff is set only after the online test ends. Forum reports put Computer Science written scores in roughly the 120-140 band in recent years. Final selection rests on the interview alone.
What is the BARC interview process for freshers?
BARC’s OCES/DGFS process has 3 stages: screening, a Selection Interview and a medical exam. 1. Screening - either BARC’s own Computer-Based Test (CBT, discipline-specific, held across 50+ Indian cities) or a valid GATE score in the matching subject; candidates choose whichever channel they qualify through. 2. A Selection Interview for shortlisted candidates. 3. Medical fitness examination. Screening scores (CBT or GATE) are used only to shortlist - final selection rests entirely on interview performance plus medical fitness.
Does BARC require its own written exam, or can I get in through GATE alone?
No - GATE alone can get you shortlisted. BARC runs its own Computer-Based Test as one screening channel, but candidates with a valid GATE score (GATE 2024, 2025 or 2026 for the 2026 cycle - the current and two preceding years) in the same subject as their qualifying degree can be screened directly on that score instead - skipping BARC’s CBT entirely. Either way, screening only shortlists you; it doesn’t count toward final selection.
What questions are asked in the BARC interview?
The Selection Interview goes deep on your core discipline at B.E./B.Tech curriculum level - for Computer Science candidates, for example, fundamental CS subjects and problem-solving rather than general aptitude or GK. Expect detailed cross-questioning on your final-year project, and questions probing suitability for a research-driven, mission-critical government scientific role.
How many rounds are there in the BARC interview process?
Effectively two stages: a screening step (BARC’s own CBT or a valid GATE score - either qualifies you) and a Selection Interview. There’s no separate HR round - motivational and fit questions are folded into the same interview alongside technical depth, since selection is scientific-suitability-based.
How should I prepare for BARC interviews?
If you’re going through the CBT route, revise your core discipline at B.E./B.Tech depth - the exam skips general English, GK, and aptitude entirely and tests only subject fundamentals and problem-solving. If you’re using a GATE score to screen in, focus your prep on the interview itself: your final-year project, core-subject depth, and a clear reason for wanting a research career at a government scientific establishment.
What is OCES/DGFS at BARC?
OCES (One Year Orientation Course for Engineering Graduates) and DGFS (DAE Graduate Fellowship Scheme) are BARC’s training programmes for recruiting Scientific Officers into the Department of Atomic Energy - OCES is for direct entrants, DGFS sponsors selected postgraduate study before absorption. Both share the same screening-plus-interview selection process; which scheme you’re considered under depends on your qualifying degree.
What interviewers are scoring at BARC
BARC OCES/DGFS interviews are oral technical exams. Panels score first-principles derivation, board work, and scientific honesty - not HR charm.
| Signal | What a strong answer looks like |
|---|---|
| Subject list | You pick 4-6 subjects and can derive, not only recite MCQs |
| Project | 2-minute clear summary plus failure modes |
| Curiosity | “Why” before “how” when stuck |
| Bond / posting | 3-year bond and DAE locations accepted knowingly |
Behavioural / fit themes (secondary but real)
Why BARC, OCES vs DGFS awareness, research curiosity, and relocation. Prep:
- Why DAE / nuclear research without geopolitical ranting
- Project challenge solved scientifically
- Training school mindset - hostel, stipend, rigorous coursework
Frameworks: BARC HR interview questions.
Is BARC selection based on the interview?
Yes - for OCES the interview decides selection; the CBT or GATE score only gets you to it. Know the brochure for your year.
How should CSE candidates prepare?
Expect deep OS, CN, DBMS, C/DS questions on the board with cross-questions - GATE Overflow-style reports are the right difficulty signal.
Is there a bond?
Yes - the OCES/DGFS training route includes a service bond, commonly cited as 3 years. Read the official brochure.
How to prepare for BARC interviews
- Loop map: Screening - BARC CBT or valid GATE score; Selection Interview; Medical fitness examination. Confirm timings from the drive mail.
- Technical depth: Drill the Q&A section until answers are spoken, not read. Know every resume project cold.
- Experiences: Study round-wise notes on the interview experience page - real prompts beat generic lists.
- HR: Three STAR stories + a specific “Why BARC?” on the HR page.
Who usually fits and who struggles
Good fit: You already live in GATE-level core subjects, you like oral exams, and you can imagine 3+ years in DAE (Mumbai, Kalpakkam, Hyderabad, Indore, Kolkata, plants, etc.). You are fine with hostel during training.
Harder path: You only prepared “coding + HR” for product companies. BARC CBT has no aptitude paper to hide in. Interviewers will walk you off a memorised MCQ into a derivation.
A practical BARC prep plan
Use this as a default four-week loop before a BARC drive. Adjust to your invite timeline.
- Week 1: Oa pattern first: sit one untimed paper, then redo it under the real clock. Open the BARC previous-year sets on this site and mark which sections ate your time. Write the timing on a sticky note. That number is more useful than a 200-problem LeetCode streak you never timed.
- Week 2: Most BARC drives fail people on the first timed paper or OA. Do three timed sits this week. After each one, log every miss in a two-column note: topic and why (slow, wrong formula, bad edge case, panic). The next sit should only add problems from that log.
- Week 3: Technical interviews at BARC usually want a clean project story, one or two CS fundamentals, and (if the process has it) a behavioral or values round. Write STAR stories on paper, not in your head. Practise “Why BARC?” with one concrete product, lab, or business line - not a slogan.
- Week 4: Star stories + one project walkthrough recorded on your phone. If you still have energy, redo only the questions you failed in week 2.
10-day crash version: Days 1-4 timed DSA, days 5-7 resume projects + CS fundamentals, days 8-9 mock interviews out loud, day 10 HR STAR stories on the HR page.
Sources
Interview process details and sample questions on this site are editorially organized from public candidate reports and hiring write-ups, with round structure, prep notes, and company-specific framing added by our team. For round-by-round stories, see the BARC interview experience page. For OA papers and coding drills, use BARC on placementpapers.app. Screening quick answers, FAQs and discipline-wise questions draw on BARC’s official OCES/DGFS-2026 advertisement, GoClasses’ BARC OCES/DGFS 2026 guide for Computer Science, GeeksforGeeks BARC OCES/DGFS and Scientist B (2023) interview experiences and the GATE Overflow reports listed on our BARC interview experience page.