Join ACM BIT Mesra
Information regarding recruitment, eligibility, and the annual induction workflow for undergraduate and postgraduate students.
Formal recruitment cycles are announced campus-wide at the start of each academic semester. For off-cycle project collaboration or inquiries, contact the executive team directly.
Focus Tracks
Focus on algorithms, data structures, Codeforces/CodeChef contest performance, and ICPC regional preparation.
Full-stack web applications, developer CLI utilities, distributed services, and open-source contributions.
User experience design, hackathon organization, technical writing, media production, and community initiatives.
Induction Workflow
Fill out the chapter induction form indicating your interest tracks (Competitive Programming, Systems/Web, Design, Operations).
An objective logic and problem-solving assessment evaluating basic analytical reasoning and programming fundamentals.
A peer discussion with senior members reviewing your code, side projects, or problem-solving intuition.
Inducted members join specific Special Interest Groups (SIGs) and receive guidance from senior chapter mentors.
Frequently Asked Questions
Can first-year students apply?
Yes. First-year students are actively encouraged to apply. We value curiosity, problem-solving enthusiasm, and consistency over extensive prior knowledge.
Is prior competitive programming experience required?
No prior contest rating is mandatory. Basic familiarity with any programming language (C++, C, Python, or Java) and logical reasoning are sufficient.
Is membership limited to Computer Science students?
No. ACM BIT Mesra is open to all engineering departments (ECE, EEE, Mechanical, Chemical, Production, etc.) as well as postgraduate students (MCA, M.Tech).
How often are inductions held?
Official chapter inductions take place annually during the Autumn semester for incoming batches, with supplementary recruitment for specialized project roles as needed.
What should I prepare?
Review core programming syntax (loops, arrays, functions, recursion), practice basic algorithmic logic, and prepare to explain any projects you have built.