Trainee software engineer Interview Questions

I got shortlisted for further rounds with NetCracker.

could you please say the programming questions which were asked in coding section

Find the missing in the array suppose array a={1,2,4,5}. Then the answer should be missing element is 3

easy

code for array of numbers addition where enter n,enter n array elemts ,first line specifies add other numbers except first index store in an another array,second line except second index add other. ex-4 1 2 3 4 output: 9, 8, 7, 6 programming #include main() { int arr[10],n,i,j,ri,res[10],sum=0; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&arr[i]); } for(j=1;j<=n;j++) { for(i=1;i<=n;i++) { sum+=arr[i]; } ri++; sum=sum-arr[j];//to subtract respective index value res[ri]=sum;//to store res array to print ri is important to refer index sum=0;//to calculate further value } for(i=1;i<=n;i++) { if(i

superrr

What is In logical Round??

Programs :- Wap for Prime nos. wap for armstrong nos

Only 2 programs okk Thank You

I managed to find pattern in number arrangement , but was unable to write a program that would do it.

Can you elaborate question again

Can you elaborate question again

I was not able to answer every question.

what were the programs that were asked?

1) Split a large number into two unequal or equal (k and n-k)parts and check if they are divisible by two numbers given by the user. Example: 12002100 here 1200 is divisible by 12 and 2100 is divisible by 7. 2) There are two strings and we have to find how many ways are there so that characters can be altered to make strings equal. Example; Ramesh and Rajesh- we have two ways adding j after m in string1 and adding m before j in string2; adding j before m in string 1 and adding m after j in string 2. 3) Print input string in concatenated zigzag format. Input: COMPANYISHIRING Zigzag: (for 4 rows) ``` C Y I O N I R N M A S I G P H ``` Output: CYIONIRNMASIGPH Number of rows are entered by user. String is also entered by user.

Not entirely sure, but this should work. s = int(input()) arr = list(map(int, input().split())) count = 0 for i in range(len(arr)): for j in range(len(arr)): if i != j: if arr[i] + arr[j] == s: count += 1 print(int(count/2))

// in C Programing. #include int main() { int i,j; int Array[] = {1,4,7,-2,8,11,5}; int len = sizeof(Array)/sizeof(Array[0]); printf("%d",len); for(i=0;i

// in C Programing. #include int main() { int i,j; int Array[] = {1,4,7,-2,8,11,5}; int len = sizeof(Array)/sizeof(Array[0]); for(i=0;i

ans-- he/she attempted total of 84 questions in which 74 are right and 10 wrong 74*5-10*3= 370-30=340

Why cann't it be total 100 questions? Where 80 correct=80*5 20 incorrect =-20*3 means total 400-60=340. The question may give multiple answers.

this question have multiple answer total attempt ques = 68+((8/5)* no of wrong Question) where wrong ques = any integer value * 5;