Tech Interview Preparation Module 4 – Getting interviews
Applications, referrals and campus drives
Choose between careers sites, referrals, campus drives and contests, write a resume that proves a job’s stated qualifications, and ask for a referral well.
What you will learn
- Choose the ways in that fit your profile among careers sites, referrals, campus drives and contests
- Rewrite a resume for one job so that each bullet proves a qualification the job states
- Calculate when your next application can go in under a rolling cap
- Ask for a referral in a way that respects the referrer’s time
- Avoid application habits that waste limited chances
Before you start
What you’ll learn · Before you start
What you will learn
- Choose the ways in that fit your profile among careers sites, referrals, campus drives and contests
- Rewrite a resume for one job so that each bullet proves a qualification the job states
- Calculate when your next application can go in under a rolling cap
- Ask for a referral in a way that respects the referrer’s time
- Avoid application habits that waste limited chances
Before you start
On this page
Google accepts up to three job applications from one person in any rolling 30 days, and it fills most of its openings on a rolling basis: A way of hiring in which applications are reviewed as they arrive and a role closes once it is filled, instead of waiting for a fixed deadline., until someone is hired. Chances to be read are few and come early, so where you apply and what you send decide more than how many forms you fill in. This lesson compares four ways in: an employer’s careers site, a referral: A recommendation in which someone who works at an employer puts a candidate forward, ideally with what they know first-hand about the candidate's work. from someone who works there, a drive run by a college’s placement office, and contests that some employers hold. You will rewrite a resume so that each bullet proves a qualification the job states, work out when your next application can go in, write a referral request that a busy person can act on, and drop the habits that waste chances.
Not affiliated
MySmartCoPilot is independent of every employer, institute and contest named here. Each statement about one of them comes from its own pages, listed under References; read the current page before you apply.
Four ways in, and the one that fits you
The four ways in differ in who reads your application first, what each asks of you and how many chances it gives. An employer’s own careers site is open to anyone: you choose a role, read the qualifications it states and apply on the employer’s own domain. Google’s hiring page caps this at three applications in any rolling 30 days and asks candidates to narrow their choice to jobs that truly match, while Microsoft’s careers site lets you apply to several jobs at once through its Job Cart. Applying there is also your first protection against fake jobs. The US Federal Trade Commission tells job seekers to start with safe and reliable sources and to look up the company or the person hiring them, and notes that honest employers never ask you to pay to get a job.
A referral is a recommendation from someone who works at the employer. PostHog’s public handbook spells out what it buys: “Referring someone means we’ll review them carefully. It doesn’t guarantee they’ll get an interview.” The same handbook calls a referral strong when the referrer has worked directly with the candidate and can speak to their abilities, and it counts a resume forwarded without context as insufficient. So a referral is worth asking for only from someone who knows your work.
Contests are held by some employers for students, under rules of their own. TCS CodeVita Season 14 accepts science and engineering students of any recognised institute in the world who expect to complete their course in 2027, 2028, 2029 or 2030, and it allows only C, C++, Java and Python. Its page offers a global rank certificate to top coders and says nothing about interviews, so read what a contest says it leads to before you plan around it.
Campus drives
Where an Indian college has a placement cell: The office of a college or university that runs recruitment on its campus: it registers students, schedules employers and applies the institute's placement rules., recruitment on campus runs through it, and each employer sets its eligibility in a job form that the cell circulates. IIT Kanpur’s form asks whether there is a minimum CGPA for shortlisting, whether students with backlogs may apply and which branches and programmes are eligible. Its policy adds a one-student-one-job rule: an offer takes you out of the season, the only offer of a slot must be accepted, and several offers in one slot mean choosing one at its end. Cut-offs can be written as percentages, and universities convert a CGPA by different rules: 8.2 is 82 % under Anna University’s regulations (CGPA × 10) and 77 % under JNTUH’s ((CGPA − 0.5) × 10). Use your own university’s rule, and read your cell’s policy before the season starts.
Which ways in fit you depends on three facts about you. Answer them in the table: it marks the ways in that fit and says why the others do not.
Answer the questions above: the table then marks what fits your case and says why the rest does not.
| Way in | Who can use it | What it asks of you | Limits on chances | Scam risk |
|---|---|---|---|---|
| Employer's careers site Who reads it first: the employer's recruiters or hiring team | Good anyone who meets the job's stated minimum qualifications | Mixed a resume rewritten for each job | Mixed Google: up to three applications in any rolling 30 days | Good the employer's own site: a safe, reliable source |
| Referral Who reads it first: a recruiter, with the referrer's note | Mixed someone who works there and knows your work first-hand | Mixed the job link, your resume and three lines on your fit | Mixed a careful review, never a promise of an interview | Good a person you already know at the employer |
| Campus drive Who reads it first: the employer, after the cell's eligibility filter | Mixed the institute's registered students who meet the job form's rules | Mixed the CGPA, backlog and branch rules the employer set | Poor cell rules apply: at IIT Kanpur, one job per student | Good the placement cell deals with the employer |
| Contest Who reads it first: a score, then the organiser | Mixed students in the years it names: CodeVita Season 14 takes 2027 to 2030 | Mixed its rules and languages: C, C++, Java or Python for CodeVita | Mixed a rank; read what the contest page says it leads to | Mixed reach it from the organiser's own site, never a forwarded link |
How the answers decide
- “Are you a student at an institute whose placement cell runs recruitment on campus?” No: rules out Campus drive. A campus drive is open only to the institute's own registered students who meet the eligibility the employer set in its job form.
- “Does someone who works at the employer know your work first-hand?” No, or only socially: adds a caveat to Referral. Someone who has not seen your work can only pass your name on. PostHog's handbook counts resume forwarding without context as an insufficient referral.
- “Are you a student in the course years that the contest you found accepts?” No, or not a student: rules out Contest. A contest takes only the students it names: TCS CodeVita Season 14 takes students expected to complete their course in 2027, 2028, 2029 or 2030.
- “Are you a student at an institute whose placement cell runs recruitment on campus?” Yes: adds a caveat to Employer's careers site. Read your cell's rules before you apply off campus: IIT Kanpur's forbids it for employers visiting that year or in the two years before.
You can use two at once: the careers site for every role you choose, and a referral wherever someone knows your work. A student whose cell runs a season adds its drives, and reads its rules before applying anywhere else.
CGPA to Percentage Calculator (India) Convert a CGPA by your own university's rule before you compare it with a drive's percentage cut-off.Checkpoint
Check: Four ways in to an interview
Each resume starts from the job’s stated qualifications
Google’s advice on resumes is direct: keep an old resume beside you for ideas, but start each one from a blank document, written for that one job. Line your experience up with the job description, make sure you meet the minimum qualifications: The requirements a job posting says every applicant must meet. Preferred qualifications make an application stronger but are not required. and that the resume shows it, and be specific about outcomes, leaning on its formula “accomplished [X] as measured by [Y], by doing [Z].” PostHog’s handbook goes further and reads an application that was not tailored to the role as a sign that the candidate is not that excited about working there.
Here is the method on one invented job, an early-career payments role at Larkspur Pay. It states three minimum qualifications (a computer science degree, code in Java, Go or Python, and work with SQL databases) and two preferred ones (REST APIs and automated tests). Step through Asha’s resume as she rewrites it from her generic version:
The drawing shows the whole scene; its 7 steps are listed below.
Every step as text
- The job's five asks. The job states three minimum qualifications (MQ), which every applicant must meet, and two preferred ones (PQ), which make an application stronger. A resume for this job has to prove each of them.
- The generic resume. The generic resume's best bullet is a list of languages. It touches MQ2 only by naming Java and Python, with no work to back it, and the other four asks have no evidence at all.
- Start again from a blank page. The rewrite drops the skills list and starts from the asks. The degree goes first, with the CGPA a campus form may ask for, and it proves MQ1.
- One project, three asks. The canteen-ordering API was written in Java, stores its data in PostgreSQL and serves REST endpoints, so one bullet with a usage number proves PQ1, MQ3 and MQ2.
- A result with a measure. The internship bullet follows Google's formula. The accomplishment is a faster report, the measure is 9 s down to 0.4 s and the means is two indexes and one rewritten join.
- The last gap closes. Writing 140 tests is evidence for PQ2, and because they are pytest tests, a second proof of Python for MQ2.
- Every ask has evidence. Each of the five qualifications now has at least one bullet behind it, and every bullet carries a number. That is what the program in the next part of the section reports, five of five against one of five.
The rewrite added no skill she lacks. It put a number and a means behind work she had already done, and it pointed every bullet at an ask. The program below checks the same thing. You tell it which qualifications each bullet proves, and it lists the qualifications with no evidence, the bullets without a number and the bullets longer than 30 words, about two lines of a one-column resume. Press Edit, put your own job and bullets in place of these, and run it:
"""Trace each resume bullet to the qualifications a job states, then list the gaps."""
# An invented early-career job at an invented company, Larkspur Pay.
# MQ = minimum qualification, PQ = preferred qualification.
QUALIFICATIONS = {
"MQ1": "Degree in computer science or a related field",
"MQ2": "Writes code in Java, Go or Python",
"MQ3": "Has worked with SQL databases",
"PQ1": "Has built or tested REST APIs",
"PQ2": "Writes automated tests",
}
# Each bullet with the qualifications its writer says it proves.
GENERIC = [
("Worked on many projects using various technologies.", []),
("Good knowledge of Java, Python, C, C++, HTML, CSS and JavaScript.", ["MQ2"]),
("Took part in a hackathon and learned a lot about teamwork.", []),
(
"Did an internship at a startup where I helped the backend team with "
"many different tasks, fixed bugs in their system and also wrote some "
"of the documentation for the rest of the engineering team.",
[],
),
]
TAILORED = [
(
"Built a canteen-ordering REST API in Java with 9 endpoints and a "
"PostgreSQL schema, used by 1,200 students placing about 4,000 orders "
"a week.",
["MQ2", "MQ3", "PQ1"],
),
(
"Cut a report query from 9 s to 0.4 s in a 10-week internship by "
"adding two indexes and rewriting one join.",
["MQ3"],
),
(
"Wrote 140 unit and API tests with pytest, raising the line coverage "
"of the intern project from 38 % to 81 %.",
["MQ2", "PQ2"],
),
("B.Tech. in computer science, CGPA 8.2 out of 10.", ["MQ1"]),
]
MAX_WORDS = 30 # about two lines of a one-column resume
def report(name: str, bullets: list[tuple[str, list[str]]]) -> None:
print(name)
proved = 0
for qid, text in QUALIFICATIONS.items():
proof = [str(i) for i, (_, ids) in enumerate(bullets, start=1) if qid in ids]
if proof:
proved += 1
label = "bullet " if len(proof) == 1 else "bullets "
evidence = label + ", ".join(proof) if proof else "NO EVIDENCE"
print(f" {qid} {text}: {evidence}")
for i, (text, _) in enumerate(bullets, start=1):
problems = []
if not any(ch.isdigit() for ch in text):
problems.append("no number")
words = len(text.split())
if words > MAX_WORDS:
problems.append(f"{words} words")
print(f" bullet {i}: {', '.join(problems) or 'ok'}")
print(f" proves {proved} of {len(QUALIFICATIONS)} stated qualifications")
report("Generic resume", GENERIC)
report("Tailored resume", TAILORED) Output
Generic resume MQ1 Degree in computer science or a related field: NO EVIDENCE MQ2 Writes code in Java, Go or Python: bullet 2 MQ3 Has worked with SQL databases: NO EVIDENCE PQ1 Has built or tested REST APIs: NO EVIDENCE PQ2 Writes automated tests: NO EVIDENCE bullet 1: no number bullet 2: no number bullet 3: no number bullet 4: no number, 35 words proves 1 of 5 stated qualifications Tailored resume MQ1 Degree in computer science or a related field: bullet 4 MQ2 Writes code in Java, Go or Python: bullets 1, 3 MQ3 Has worked with SQL databases: bullets 1, 2 PQ1 Has built or tested REST APIs: bullet 1 PQ2 Writes automated tests: bullet 3 bullet 1: ok bullet 2: ok bullet 3: ok bullet 4: ok proves 5 of 5 stated qualifications
Recorded with Python 3.14.8 on macOS 26 arm64. To run it yourself: mise exec python@3.14.8 -- python3 tailor_check.py
Runs on this device, in your browser. The first run downloads Python (about 13.5 MB), which is kept for the next runs.
Your run, in this browser
The generic resume proves one of the five qualifications, none of its four bullets carries a number and the last one runs to 35 words. The tailored resume proves all five with four bullets, because the API bullet alone covers three asks. The program reads no meaning: it trusts the labels you give it, so the work it makes you do, deciding what each bullet proves, is the part that matters.
Copying the job's keywords instead of proving them
A skills line stuffed with the posting’s keywords may raise an automated match, but it proves nothing to the person who reads next. Microsoft’s careers site shows a match indicator on postings and says that the indicator does not guarantee any outcome for an application. Put each keyword into a bullet that shows the work, or leave it out.
A cover letter, where you send one, follows the same rule: Google suggests tailoring it to the job and backing it up with data, although it does not require one.
Key idea
Write each resume for one job: start from its stated qualifications, give each one a bullet with a measured result, and cut what proves none of them.
Checkpoint
Check: A resume written for one job
Three applications in 30 days: choose, then apply early
A cap changes the arithmetic of applying. Under Google’s rule, any 30 days in a row may hold at most three of your applications, so each one keeps its place for 30 days, and a weak fit sent today can block a strong one posted next week. Google recommends narrowing your choices to a few jobs that truly match your skills, experience and interests, instead of applying to anything that resembles your ideal job. Because most of its openings take applications on a rolling basis until they are filled, it also encourages applying sooner rather than later, and it asks people who were not selected to wait at least a year before they apply again for the same type of role.
Walk through one month of Asha’s search under that cap, from her first application to the day her fourth can go in:
- Day 3
A backend role that fits every minimum qualification
Asha sends her first application, with a resume rewritten for this job. It counts against the cap from today up to day 32.
- Day 10
A data engineering role, a partial fit
The second application, for a role that matches two of its four minimum qualifications. Two of the three places in the window are now used.
- Day 21
The payments role she wants most
The third application uses the last place. Until day 33 all three still count, so the cap is full.
- Day 25
A better match appears, and has to wait cap reached
A fourth posting fits her better than the day-10 one did, but sending it now would put four applications in one 30-day window. She saves it. Google says most of its openings take applications on a rolling basis until they are filled, so every day she waits is a day the role could close.
- Day 33
The first application stops counting
Day 3 is now 30 days back, so only the day-10 and day-21 applications count, and the saved posting goes in. Had she skipped the weaker day-10 role, this posting could have gone in on day 25.
- Day 40
The next place opens
The day-10 application stops counting, which leaves room for one more. If she uses it, the next place opens on day 51, when the day-21 application stops counting too. The lesson's exercise computes these days for any list of applications.
The timeline has 6 events, from Day 3 to Day 40.
One rule sets every date: an application sent on day a counts until day a + 29, so a fourth waits until the oldest of the three stops counting. Choosing well is what makes the cap cheap. Had Asha skipped the weaker day-10 role, the better match would have gone in on day 25, eight days sooner.
Caps on campus
Placement cells cap applications too. IIT Kanpur’s policy limits each student to 50 applications on its portal in the first part of the season, allows no withdrawal after a company’s deadline and lets no one re-apply to an opening they withdrew from. A false claim found in a resume after an offer costs the offer.
Checkpoint
Check: Caps and rolling deadlines
A referral request a busy person can act on
A referral costs the referrer time and a little of their standing, so the request has to make both easy to give. Ask someone who has seen your work, and ask before you apply: PostHog’s scheme, for one, generally does not count a referral for someone who has already applied. Then put everything in one message. Follow one request from that message to the recruiter’s review:
The drawing shows the whole scene; its 6 steps are listed below.
Every step as text
- Choose who to ask. Ask someone who has seen your work, such as a former teammate or the mentor of your internship. Ask before you apply, because some referral schemes do not count a candidate who has already applied.
- One message, three things. The message carries the job link, your resume and three lines that tie your evidence to the job's stated qualifications. It also gives an easy way to say no.
- The referrer checks the fit. The referrer compares your three lines with the job and decides whether they can speak for you. If they have not seen your work, the honest version is to pass your name on and say how they know you.
- Consent, then context. With your agreement, the referrer submits you with what they know first-hand, such as what you built together and how you handled a deadline. A resume forwarded with no context adds almost nothing.
- A careful look, not a promise. PostHog's handbook says a referral earns a careful review, which is no promise of an interview. Referred candidates meet the same bar as everyone else.
- Close the loop. Thank the referrer the same day and tell them how the process goes, including a rejection. The next time you ask, they will remember both.
Here is the difference on one request, before and after editing. Before: “Hi, hope you are well! Can you refer me to your company? I am looking for a job. My resume is attached.” It names no role, gives the referrer nothing to check and leaves them all the work.
After: “Hi Priya, Larkspur Pay has an early-career backend role on its payments team (link). Three lines on fit: I built the canteen-ordering API we worked on together, in Java with PostgreSQL, used by 1,200 students; in my internship I cut a report query from 9 s to 0.4 s; and I wrote 140 pytest tests for that project. My resume is attached. If you think I fit, would you refer me? If not, no problem at all, and thank you for reading.”
The edited message names and links the role, ties each line to a stated qualification, reminds Priya what she saw for herself and leaves an easy way to say no. A busy person can check it in a minute and forward it with a sentence of their own.
Asking someone to vouch for work they have not seen
A friend of a friend, or a connection you have never worked with, cannot speak for your abilities, and PostHog’s handbook lists generic connections the referrer does not actually know among the referrals that do not count. Ask such a person what the team is like or whether the role is still open, and apply through the careers site yourself.
Checkpoint
Check: Asking for a referral
Habits that spend chances for nothing
Six habits waste applications without adding anything. Each one below costs a place under a cap, a referrer’s goodwill or a slot in a season, and each has a cheaper alternative:
| Habit | What it costs | Do this instead |
|---|---|---|
| Applying to every role that looks close | A place under a cap, for 30 days, on a role you would not take | Apply where you meet every minimum qualification and want the work |
| Sending one resume everywhere | Bullets that prove no stated qualification | Start from a blank page for each job |
| Waiting weeks for a perfect resume | A rolling-basis role filled before you apply | Apply early with bullets that prove the minimum qualifications |
| Applying through a link in a message | The risk of a fake job; honest employers never charge to hire | Find the role on the employer’s own careers site |
| Stretching a number | Your credibility: Microsoft expects honesty at every stage | Keep every number one you can explain |
| Asking a stranger to vouch | A referral that adds nothing, and a contact who stops replying | Ask someone who knows your work |
The first habit is the most expensive under a cap. At three applications in any 30 days, a dozen near matches take 90 days to send even at the fastest pace the cap allows, while three strong matches go in on one day.
Checkpoint
Check: Habits that waste chances
Practise: when can the next application go in?
The exercise turns the cap into code: given the days of your past applications, return the earliest day on which one more stays within the cap. Its sample tests run in your browser and include the timeline’s edge cases: an application exactly 30 days old, several sent on one day and a different cap.
Exercise · Easy · Python
The earliest day for your next application
Some employers cap how often one person may apply: Google, for example, accepts up to three applications in any rolling 30 days. Write next_application_day(applied, today, limit=3, window=30), which returns the earliest day, from today on, on which one more application stays within the cap.
- Days are whole numbers counted from any starting day: day 0, day 1 and so on.
appliedlists the days of your past applications, in any order and each on or beforetoday; several can fall on the same day. - An application made on day
astill counts on daydwhiled - a < window. With a window of 30 days, an application sent on day 3 counts up to day 32 and no longer on day 33. - You may apply on day
dwhen fewer thanlimitapplications count on that day.
For example, with applications on days 3, 10 and 21 and today = 25, all three still count, so the answer is 33, the first day on which the day-3 application no longer counts.
Starter code · apply_day.py
"""The earliest day for your next application under a rolling cap."""
def next_application_day(applied, today, limit=3, window=30):
"""The earliest day, from today on, on which one more application stays within the cap.
applied: the days of past applications, in any order, each on or before today.
An application made on day a still counts on day d while d - a < window.
>>> next_application_day([3, 10, 21], 25)
33
"""
# Write your solution here.
return today The sample tests · test_apply_day.py
from apply_day import next_application_day
def test_nothing_sent_yet():
"""with no applications sent, you can apply today"""
assert next_application_day([], 12) == 12
def test_under_the_cap():
"""two applications count, so a third can go today"""
assert next_application_day([4, 20], 25) == 25
def test_cap_reached():
"""days 3, 10 and 21 fill the cap until the day-3 application stops counting, on day 33"""
assert next_application_day([3, 10, 21], 25) == 33
def test_order_does_not_matter():
"""the days may be listed in any order"""
assert next_application_day([21, 3, 10], 25) == 33
def test_old_applications_stop_counting():
"""an application sent exactly 30 days ago no longer counts"""
assert next_application_day([0, 10, 20], 30) == 30
def test_next_slot_after_using_one():
"""after a fourth application on day 33, the next slot opens when day 10 stops counting"""
assert next_application_day([3, 10, 21, 33], 34) == 40
def test_same_day_applications():
"""three applications sent on one day stop counting on the same day"""
assert next_application_day([10, 10, 10], 15) == 40
def test_another_cap_and_window():
"""a cap of two applications in any seven days"""
assert next_application_day([1, 5], 6, limit=2, window=7) == 8 A hint
Keep only the applications that still count today (today - a < window) and sort them. If fewer than limit are left, you can apply today. If not, the oldest ones have to stop counting first: count how many must go, find the last of them in the sorted list, and add window to its day.
Results of the sample tests
| Test | Result | Details |
|---|
What your code printed
The sample tests run on this device, in your browser (Pyodide): nothing is sent to mysmartcopilot.com. The first run downloads Python (about 13.5 MB), which is kept for the next runs. A check in your browser is feedback for you, not proof that the code is right for every input.
The self-check below covers all five ideas of the lesson. It opens where your answers have been weakest so far and moves on as they come out right:
Practice that adapts to you
Practise this lesson
13 questions about 5 ideas of this lesson. Each answer is explained at once, and what you get right is kept in this browser.
Interview questions
Recruiters and interviewers may begin with how you found the role and who referred you, and then test the evidence behind your resume:
Model answers open with any pass: ₹79 for 1 week ($2.99), one payment that never renews.
-
Fresher to mid · Warm-up
How did you hear about this role, and why did you apply?
Name the real source in a few words, then spend the rest of the answer on why you applied. "I found it on your careers site while looking for payments roles" or "Priya, who built a project with me, told me about it" is enough for the first half. For the second half, give two reasons tied to what the job states: one piece of your own evidence for a minimum qualification, and one thing about the work that you want to do. For example: "The role asks for SQL and REST APIs, and I built a canteen-ordering API on PostgreSQL that 1,200 students used. I want to work on payments, where the same problems run at a far larger scale." Avoid saying that you applied everywhere, and avoid answers that only praise the brand.
-
Fresher to senior · Warm-up
You were referred by one of our engineers. How do you know them?
Say exactly how you know them and what they have seen of your work, in two or three sentences: "Priya and I built the canteen-ordering API in our third year. She wrote the front end and I wrote the Java service and its database schema, so she has seen how I handle deadlines and code review." Do not stretch the relationship, because the interviewer may ask the referrer the same question and the two answers should match. If the referrer knows you only socially, say so and move to your own evidence: "We met at a meetup, so she knows my interests better than my work. Here is what I have built." Then connect one thing they saw to a qualification the role states.
-
Fresher to mid
Pick one bullet on your resume. How did you measure its result, and what would you do differently next time?
-
Fresher to mid
This role asks for experience with SQL databases, and your resume shows it only from coursework. Why should we move you forward?
Key takeaways
- Apply through the employer’s own careers site: it is a safe and reliable source, and the place where a role’s stated qualifications are written down.
- Ask for a referral only from someone who knows your work, before you apply, with the job link, your resume and three lines of fit.
- Start each resume from a blank page for one job, give each stated qualification a bullet with a measured result, and cut what proves none of them.
- Under a cap such as three applications in any 30 days, each application holds a place for 30 days, so choose strong matches and send them early.
- Campus drives follow the cell’s policy and the employer’s eligibility form: read both before the season, and convert your CGPA by your own university’s rule.
Terms in this lesson
- minimum qualifications
- The requirements a job posting says every applicant must meet. Preferred qualifications make an application stronger but are not required.
- placement cell
- The office of a college or university that runs recruitment on its campus: it registers students, schedules employers and applies the institute's placement rules.
- referral
- A recommendation in which someone who works at an employer puts a candidate forward, ideally with what they know first-hand about the candidate's work.
- rolling basis
- A way of hiring in which applications are reviewed as they arrive and a role closes once it is filled, instead of waiting for a fixed deadline.
References
- Our hiring process (How we hire) (Google Careers)
- Hiring tips (Microsoft Careers)
- Hiring process (PostHog handbook): referrals and application review (PostHog)
- Job scams (US Federal Trade Commission)
- TCS CodeVita: eligibility and rules (Tata Consultancy Services)
- Information for companies: recruitment procedure and policy (Students' Placement Office, IIT Kanpur)
- Placement policy for registered students (Students' Placement Office, IIT Kanpur)
- Job announcement form (eligibility: CGPA, backlogs, branches) (Students' Placement Office, IIT Kanpur)
- Undergraduate academic regulations 2021, clause 15.5.3 (CGPA to percentage) (Anna University)
- R22 B.Tech. academic regulations, clause 11.2 (CGPA to percentage) (Jawaharlal Nehru Technological University Hyderabad)
Related tools
Report a problem with this lesson
Kept only in this browser. Your Learn progress