*Eappsys Recruitment drive *
Eappsys Limited is based out of Hyderabad and carry out projects in different technologies including Oracle EBS, APEX, Oracle Cloud, Microsoft - Azure, Power BI to name a few, for our clients across the globe.
*Package - 4 LPA*
2021 Passouts
Only from IT / Computer Science streams.
Eligibility criteria is CGPA 7.
X & XII above 70%
No backlog
Good communication
Good Analytical and problem solving skills.
https://forms.gle/638iskTtK13n8K3U9
Interested Students fill this form
Deadline : Today 5 PM
Eappsys Limited is based out of Hyderabad and carry out projects in different technologies including Oracle EBS, APEX, Oracle Cloud, Microsoft - Azure, Power BI to name a few, for our clients across the globe.
*Package - 4 LPA*
2021 Passouts
Only from IT / Computer Science streams.
Eligibility criteria is CGPA 7.
X & XII above 70%
No backlog
Good communication
Good Analytical and problem solving skills.
https://forms.gle/638iskTtK13n8K3U9
Interested Students fill this form
Deadline : Today 5 PM
Google Docs
Eappsys Recruitment drive
Eappsys Limited is based out of Hyderabad and carry out projects in different technologies including Oracle EBS, APEX, Oracle Cloud, Microsoft - Azure, Power BI to name a few, for our clients across the globe.
Package - 4 LPA
2021 Passouts
Only from IT /โฆ
Package - 4 LPA
2021 Passouts
Only from IT /โฆ
Best of luck everyone
Plz don't send questions in dm
Just post your questions in our group and i will post solutions here so that u can find it easily
Plz don't send questions in dm
Just post your questions in our group and i will post solutions here so that u can find it easily
Mindtree syllabus
6 coding questions
15 quantitative
9 verbal questions
6 coding questions
15 quantitative
9 verbal questions
Forwarded from be.humble
// C++ implementation to find sum of
// first n even numbers
include <bits/stdc++.h>
using namespace std;
// function to find sum of
// first n even numbers
int evenSum(int n)
{
int curr = 2, sum = 0;
// sum of first n even numbers
for (int i = 1; i <= n; i++) {
sum += curr;
// next even number
curr += 2;
}
// required sum
return sum;
}
// Driver program to test above
int main()
{
int n = 20;
cout << "Sum of first " << n
<< " Even numbers is: " << evenSum(n);
return 0;
}
// first n even numbers
include <bits/stdc++.h>
using namespace std;
// function to find sum of
// first n even numbers
int evenSum(int n)
{
int curr = 2, sum = 0;
// sum of first n even numbers
for (int i = 1; i <= n; i++) {
sum += curr;
// next even number
curr += 2;
}
// required sum
return sum;
}
// Driver program to test above
int main()
{
int n = 20;
cout << "Sum of first " << n
<< " Even numbers is: " << evenSum(n);
return 0;
}
Forwarded from Dushyant
#include <stdio.h>
int main()
{
int c = 0, count = 0;
char s[1000];
printf("Input a string\n");
gets(s);
while (s[c] != '\0') {
if (s[c] == 'a' || s[c] == 'A' || s[c] == 'e' || s[c] == 'E' || s[c] == 'i' || s[c] == 'I' || s[c] =='o' || s[c]=='O' || s[c] == 'u' || s[c] == 'U')
count++;
c++;
}
printf("%d", count);
return 0;
}
Mind ๐ tree
C code for count of vowels
int main()
{
int c = 0, count = 0;
char s[1000];
printf("Input a string\n");
gets(s);
while (s[c] != '\0') {
if (s[c] == 'a' || s[c] == 'A' || s[c] == 'e' || s[c] == 'E' || s[c] == 'i' || s[c] == 'I' || s[c] =='o' || s[c]=='O' || s[c] == 'u' || s[c] == 'U')
count++;
c++;
}
printf("%d", count);
return 0;
}
Mind ๐ tree
C code for count of vowels
Forwarded from Dushyant
#include <stdio.h>
int main()
{
int i, n, sum=0;
/* Input upper limit from user */
printf("Enter upper limit: ");
scanf("%d", &n);
for(i=2; i<=n; i+=2)
{
/* Add current even number to sum */
sum += i;
}
printf("Sum of all even number between 1 to %d = %d", n, sum);
return 0;
}
Even Numbers Code๐
int main()
{
int i, n, sum=0;
/* Input upper limit from user */
printf("Enter upper limit: ");
scanf("%d", &n);
for(i=2; i<=n; i+=2)
{
/* Add current even number to sum */
sum += i;
}
printf("Sum of all even number between 1 to %d = %d", n, sum);
return 0;
}
Even Numbers Code๐
Forwarded from Vaibhav Choubey
Vaibhav Choubey
Photo
Code is in java
Send me "candles " full question
@mradal_777
@mradal_777
#include <assert.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/*Birthday Cake Candles Code in C*/
int main() {
int i;
int n;
int max = 0;
scanf("%d", & n);
int a[n];
int count = 0;
for (i = 1; i <= n; i++) {
scanf("%d", & a[i]);
if (max < a[i])
max = a[i];
}
for (i = 1; i <= n; i++)
if (a[i] == max)
count++;
printf("%d", count);
return 0;
}
Candles code in C
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/*Birthday Cake Candles Code in C*/
int main() {
int i;
int n;
int max = 0;
scanf("%d", & n);
int a[n];
int count = 0;
for (i = 1; i <= n; i++) {
scanf("%d", & a[i]);
if (max < a[i])
max = a[i];
}
for (i = 1; i <= n; i++)
if (a[i] == max)
count++;
printf("%d", count);
return 0;
}
Candles code in C
int a[]=new int[N];
while(true)
{
int z=0;
for(int i=1;i<N;i++)
{
a[i]=i+1;
}
boolean b=true;
for(int i=0;i<N && i!=Integer.MAX_VALUE;i++)
{
if(b)
{
a[i]=Integer.MAX_VALUE;
b=false;
}
else
b=true;
if(a[i]!=Integer.MAX_VALUE)
z++;
}
if(z==1)
return z;
}
โ๏ธโ๏ธ
Block code
while(true)
{
int z=0;
for(int i=1;i<N;i++)
{
a[i]=i+1;
}
boolean b=true;
for(int i=0;i<N && i!=Integer.MAX_VALUE;i++)
{
if(b)
{
a[i]=Integer.MAX_VALUE;
b=false;
}
else
b=true;
if(a[i]!=Integer.MAX_VALUE)
z++;
}
if(z==1)
return z;
}
โ๏ธโ๏ธ
Block code