CODING SOLUTIONS | IBM | AMAZON CODING SOLUTIONS
Ir al canal en Telegram
8 815
Suscriptores
Sin datos24 horas
-207 días
-11730 días
Archivo de publicaciones
CPA python answers will be given freely today
👑👑👑👑👑👑👑👑👑👑👑👑👑👑
Key points of Biz skill session :
Mock assessment will be conducted in next week probably
Final exam schedule will also be shared shortly in knome portal
Eligibility for assessments will be posted in knome portal
Assessments will be conducted in mettl platform
Only one attempt for one cycle
Mock assessment is not track specific more for like infrastructure check only
For biz skill - 60 QS, 90 min, 100 maximum marks
6 types of questions in Biz skill assessment :
True or False - MCQ
Fill in the blanks - single blank, MCQ
Fill in the blanks - Double blank, MCQ
Fill in the blanks - Double blank, MSQ
No blank - MCQ
No blank - MSQ
Recording of the session : 67338
Bizskill Exam Pattern:
Platform - Mettl
Total qns - 60
Duration - 90 Mins
We will get this type of pattern questions only
1. True/False
2. MCQ, MSQ (Generic)
3. Fill ups... single blank - single selection... Double blanks - single selection... Double blank - multiple selection
MCQ - Radio button , MSQ - check box
For recording session 67338
*DCA track May assessment details are out* 🥳
Evaluation will consist of -
— Objective based questions (MCQ)
— Will be conducted on mettl platform.
"Maximum" of 40 Q's (it might be less for an associate depending on complexity of questions especially the coding ones)
Time - 60 minutes
Coding based questions (as per your chosen track) will be there (in MCQ format only, no hands-on)
No aptitude, reasoning, English etc Questions, only technology related questions will be there.
"No negative marking" for wrong questions.
Associates cannot refer to any other external website during exam.
Have to pass DCA track assesment with distinction (70% or above)
Attempt - Per cycle (May/August/November) one attempt allowed.
If distinction - can't give in next cycle.
If pass/fail - can attempt in upcoming cycles also.
Syllabus (track wise) will be posted on knome once band details are received (may be by today 12th May).
Mocks (not track specific but general) will be made available on knome once bands details are recieved.
Exam will be online and remotely proctored (no need to go to base/depute/project locations)
One can switch or toggle between questions but not between tabs/sreen.
On start of exam - show tcs ID card. If you haven't got, show offer letter + any one govt ID with a photo.
Assesment can be taken on TCS asset/personal machine but ensure you run the mocks (once available) on the same machine to avoid last minute technical issues.
Whom to contact in case of technical issue will be intimated shortly via a detailed knome blog so please keep a tab on it (download the knome app from Uxapps to access it easily from phone).
Eligibility list (track wise confirmation) will be posted on knome once band details are received.
Unallocated people - eligibility list will be posted on knome by Monday 2022.
Recording of this session will be available on course ID - 64355 from 13th May onwards.
*Doubt bursted* - Only a DCA track and a non tech track assesment is enough to get digital via Wings 1 (for those who are ninja).
🔴Tomorrow CPA answers will be given here both python & Java
https://t.me/coding_solutions_all
https://t.me/coding_solutions_all
https://t.me/coding_solutions_all
ACCENTURE CODING SOLUTION: (PYTHON 3)
1.) Number Sum
n=input()
s=list(map(int, input().split(',')))
maxi=max(s) # finding the maximum number
mini=min(s) # finding the minimum number
print((maxi)+(mini))
2.) Modular Exponentiation
b=int(input())
e=int(input())
m=int(input())
print((b**e)%m) #main operation
3.) Next Greater Number
from itertools import permutations
r=int(input()) #length
n=input() #taking the input as a string
a = permutations(n, r)
#print(a)
y = [''.join(i) for i in a] # joining the digits to a y
y=sorted(y)
q=y.index(n) #finding the index of the input value from the list
#print(q)
print(y[q+1])
4.) Factorials
n=int(input())
fact=1
for i in range(1,n+1):
fact=fact*i;
print(str(fact))
5.) Anagrams
n=input()
m=input()
count=0
l=len(m)
for i in n:
if i in m:
count=count+1
else:
pass
if count == l:
print("Yes")
else:
print("No")
6.) String within String
n=input()
m=input()
if m in n:
print("yes")
else:
print("No")
7.) Maximum Sum of Column and Row (Java 3)
public class CodeWindow {
public static void main(String[] args) {
int input1=3;
int input2=3;
int [] input3={3,6,9,1,4,7,2,8,9};
int ans= max( input1,input2,input3);
System.out.println(ans);
}
private static int max(int input1, int input2, int[] input3) {
int rows = input1;
int cols = input2;
int sumRow, sumCol;
int [] [] a= new int[input1][input2];
int count=0;
for(int i=0;i<input1;i++)
{
for(int j=0;j<input2;j++)
{
if(count==input3.length) break;
a[i][j]=input3[count];
count++;
}
}
int maxRow = Integer.MIN_VALUE;
for(int i = 0; i < rows; i++){
sumRow = 0;
for(int j = 0; j < cols; j++){
sumRow = sumRow + a[i][j];
}
maxRow=Math.max(maxRow,sumRow);
}
int maxCol=Integer.MIN_VALUE;
for(int i = 0; i < cols; i++){
sumCol = 0;
for(int j = 0; j < rows; j++){
sumCol = sumCol + a[j][i];
}
maxCol=Math.max(maxCol,sumCol);
}
return maxCol+maxRow;
}
}
8.) Nth Prime Number
l=int(input())
n=0
i=0
a=[]
while n<100:
i+=1
count=1
for j in range(2,i):
if i%j==0:
count=0
break
if count==1:
a.append(i)
n+=1
#print(a) #to check the series
print(a[l])
9.) Second Largest Number
l=int(input())
arr=list(map(int, input().split()))
arr=list(set(arr))
length_list=len(arr)
arr.sort()
#print("set = ",arr)
#print("length of set: ",length_list)
print(arr[length_list-2])
10.) Adam’s Charity
n=int(input())
sum=0
for i in range(1,n+1):
sum=sum+(i**2)
print(sum)
Python 3
ACCENTURE CODING
FRAUD FRAUD FRAUD FRAUD
⚠⚠⚠⚠⚠⚠⚠⚠⚠⚠⚠⚠⚠
Be careful with scammers
TCS
62779
Final Answers 🤩
1.3
2.3
3.1
4.1
5.1
6.3
7.2
8.4
9.2
10.2
11.2
12.4
13.1
14.1
15.2
16.1
17.3
18.2
