IBM Summer Internship Program 2023 for freshers for the post of Research Intern-Quantum. Any Graduation can Apply for this position.
IBM Recruitment Drive Details:
Company | IBM |
Role | Research Intern-Quantum |
Qualification | BE/BTech/ME/MTech/PhD |
Batch | 2023/2024 & 2025 |
Salary | ₹ 35000/month |
Job Location | Remote |
Last Date | ASAP |
Experience | Fresher |
At IBM, work is more than a job – it’s a calling: To build. To design. To code. To consult. To think along with clients and sell. To make markets. To invent. To collaborate. Not just to do something better, but to attempt things you’ve never thought possible. Are you ready to lead in this new era of technology and solve some of the world’s most challenging problems? If so, lets talk.
Your Role and Responsibilities:
Summer Internship Program is one of the major activities under the University Relation Program. IBM Research India offers Summer Internship to the bright students at leading technical Universities in India. IBM Research India provides industry experience and world class technologies to these students to show their talent. During internship students work on current projects happening in the lab, they solve problems with the help of their mentors. Idea is to give industry experience to the students and look for future employees.
Tcs CodeVita CollegeRankIII Coding Solution
In C language
#include <stdio.h>
#include <stdlib.h>
// Function to compare two strings as doubles
int compareDoubles(const void *a, const void *b) {
return atof(*(const char **)b) – atof(*(const char **)a);
}
int main() {
int c, n;
scanf(“%d %d”, &c, &n);
int s[c];
for (int i = 0; i < c; i++) {
s[i] = 0;
}
char version[8];
scanf(“%s”, version);
char colleges[c][5][20];
for (int j = 0; j < c; j++) {
colleges[j][0][0] = ‘\0’; // Initialize with empty string
snprintf(colleges[j][1], sizeof(colleges[j][1]), “%d”, j + 1);
}
char l[n][5][20];
for (int i = 0; i < n; i++) {
scanf(“%s %s %s %s %s”, l[i][0], l[i][1], l[i][2], l[i][3], l[i][4]);
snprintf(l[i][1], sizeof(l[i][1]), “%.2f”, atof(l[i][1]));
}
qsort(l, n, sizeof(l[0]), compareDoubles);
char d[n][3][20];
for (int i = 0; i < n; i++) {
int num1 = atoi(l[i][2] + 2);
int num2 = atoi(l[i][3] + 2);
int num3 = atoi(l[i][4] + 2);
if (s[num1 – 1] > 0) {
s[num1 – 1]–;
snprintf(d[i][0], sizeof(d[i][0]), “%s”, l[i][0]);
snprintf(d[i][1], sizeof(d[i][1]), “%s”, l[i][1]);
snprintf(d[i][2], sizeof(d[i][2]), “%s”, l[i][2]);
} else if (s[num2 – 1] > 0) {
s[num2 – 1]–;
snprintf(d[i][0], sizeof(d[i][0]), “%s”, l[i][0]);
snprintf(d[i][1], sizeof(d[i][1]), “%s”, l[i][1]);
snprintf(d[i][2], sizeof(d[i][2]), “%s”, l[i][3]);
} else if (s[num3 – 1] > 0) {
s[num3 – 1]–;
snprintf(d[i][0], sizeof(d[i][0]), “%s”, l[i][0]);
snprintf(d[i][1], sizeof(d[i][1]), “%s”, l[i][1]);
snprintf(d[i][2], sizeof(d[i][2]), “%s”, l[i][4]);
}
}
for (int i = 0; i < n; i++) {
if (s[0] > 0) {
int maxi = 0;
for (int j = 1; j < c; j++) {
if (s[j] > s[maxi]) {
maxi = j;
}
}
s[maxi]–;
snprintf(d[i][0], sizeof(d[i][0]), “%s”, l[i][0]);
snprintf(d[i][1], sizeof(d[i][1]), “%s”, l[i][1]);
snprintf(d[i][2], sizeof(d[i][2]), “C-%d”, maxi + 1);
}
}
char colleges_res[c][3][20];
for (int i = 0; i < c; i++) {
int index = atoi(colleges[i][1]) – 1;
if (colleges[index][2][0] == ‘\0’) {
snprintf(colleges[index][0], sizeof(colleges[index][0]), “%s”, d[i][0]);
snprintf(colleges[index][1], sizeof(colleges[index][1]), “%s”, d[i][1]);
snprintf(colleges[index][2], sizeof(colleges[index][2]), “%d”, index + 1);
} else {
snprintf(colleges[index][2], sizeof(colleges[index][2]), “%d”, index + 1);
snprintf(colleges[index][3], sizeof(colleges[index][3]), “%s”, d[i][0]);
snprintf(colleges[index][4], sizeof(colleges[index][4]), “%s”, d[i][1]);
}
}
for (int i = 0; i < c; i++) {
for (int j = 0; j < 5; j++) {
if (colleges[i][j][0] != ‘\0’) {
if (j == 2) {
printf(“C-%s n/a\n”, colleges[i][2]);
} else {
printf(“C-%s %s\n”, colleges[i][j], colleges[i][j + 1]);
}
}
}
}
return 0;
}
Required Skills:
- Strong programming skills Java/Python/C++,
- data structures,
- algorithms,
- problem solving,
- Quantum Programming (Qiskit/Cirq/Forest),
- Linear Algebra
TCS CodeVita Season 11 | TCS Coding Challenge for Students | Prize Pool is $20,000
Preferred Skills:
Quantum Circuits, Quantum Simulators, Quantum Algorithms, Quantum Mechanic, Complex Analysis, Security fundamentals, Git,
Eligibility Criteria:
- BE/BTech, Dual degree
- ME / MTech
- PhD
[…] IBM Summer Internship Program 2023 | Research Intern-Quantum | Apply Now […]