Are you looking to make your mark in the IT industry by joining one of the largest and top IT firms in the world? Look no further than Accenture! Based in Dublin, Ireland, Accenture offers unmatched services in Consulting, Strategy, Digital, Technology and Operations across more than 40 industries. They are partners with more than three-quarters of the Fortune Global 500 companies, making them one of the most sought-after employers in the industry.
To join Accenture, you need to clear their recruitment exams that assess your cognitive abilities, technical abilities, coding skills, and communication skills. The Accenture Exam is designed to identify the best talent that can contribute to the growth of the organization.
To prepare for the Accenture placement exam, you need to have access to the right study material, best practices, and advice. You should also practice with placement exam practice questions to get a feel of the exam pattern and syllabus. Additionally, understanding the exam pattern and syllabus will help you prepare for the interview questions that will be asked during the recruitment process.
The registration process for the Accenture placement exam is simple and easy to follow. Once you have registered, it's essential to focus on how to crack the placement exam. The key to success is to stay focused, stay calm, and practice consistently. It's also essential to stay up-to-date with the latest digital trends and technology, as the exam tests your knowledge in these areas.
It's important to note that cheating in the Accenture placement exam is not only unethical but also unnecessary. With the right preparation, you can crack the exam with ease and begin your journey with one of the leading IT companies in the world.
The eligibility criteria for Accenture's recruitment process include:
Academic Qualifications:
College Qualification Required:
Eligible Branches: All Engineering branches are available.
Other Important Criteria:
Please note that the above information is an example of the eligibility criteria and the actual criteria might vary.
Verbal Ability
Critical Reasoning
Abstract Reasoning
Technical Assessment
Fundamental of Networking
Common Applications and MS office
Pseudo Code
Coding Syllabus
The Accenture online written test is divided into five sections, each with its own time limit and set of questions. These sections include:
The entire online test will take approximately 128 minutes to complete, and there is no negative marking for incorrect answers.
The Accenture Selection Process for 2023 consists of four rounds of assessments, as outlined below:
Round 1: Cognitive and Technical Assessment
Technical Assessment: This section includes Pseudo Code, Common Applications & MS Office and Fundamentals of Networking.
Round 2: Coding Assessment
Pure Coding Round (No sectional division): This section includes questions on C, C++, Dot Net, Java and Python.
Round 3: Communication Test
No internal section. Candidates are to be purely judged on their communication skills. This section includes Sentence Mastery, Vocabulary, Fluency and Pronunciation.
Round 4: Interview
Learning Agility and Communication – Tested by panel members. The time for this round varies from candidate to candidate.
It is important to note that the information given above is an example of the selection process and the actual process might vary.
#Popular Question 1
Bubble Sort
Given an Integer N and a list arr. Sort the array using bubble sort algorithm.
#Example 1:
```sh
Input:
N = 5
arr[] = {4, 1, 3, 9, 7}
Output:
1 3 4 7 9
```
#Coding Question 1
The function def differenceofSum(n. m) accepts two integers n, m as arguments Find the sum of all numbers in range from 1 to m(both inclusive) that are not divisible by n. Return difference between sum of integers not divisible by n with sum of numbers divisible by n.
Assumption:
#Solution 1
```sh
n = int(input())
m = int(input())
sum1 = 0
sum2 = 0
for i in range(1,m+1):
if i % n == 0:
sum1+=i
else:
sum2+=i
print(abs(sum2-sum1))
```
#Popular Question 2
Insertion Sort
The task is to complete the insert() function which is used to implement Insertion Sort.
#Example 1:
```sh
Input:
N = 5
arr[] = { 4, 1, 3, 9, 7}
Output:
1 3 4 7 9
```
#Coding Question 2
You are required to implement the following Function def LargeSmallSum(arr).
The function accepts an integers arr of size ’length’ as its arguments you are required to return the sum of second largest largest element from the even positions and second smallest from the odd position of given ‘arr’.
Assumption:
NOTE
#Answer 2
```sh
length = int(input())
arr = list(map(int, input().split()))
even_arr = []
odd_arr = []
for i in range(length):
if i % 2 == 0:
even_arr.append(arr[i])
else:
odd_arr.append(arr[i])
even_arr = sorted(even_arr)
odd_arr = sorted(odd_arr)
print(even_arr[len(even_arr)-2] + odd_arr[len(odd_arr)-2])
```
#Popular Question 3
Write code Check if the given string is Palindrome or not
#Coding Question 3
The function def ProductSmallestPair(sum, arr) accepts an integers sum and an integer array arr of size n. Implement the function to find the pair, (arr[j], arr[k]) where j!=k, Such that arr[j] and arr[k] are the least two elements of array (arr[j] + arr[k] <= sum) and return the product of element of this pair
NOTE
#Solution 3
```sh
n = int(input())
sum1 = int(input())
arr = list(map(int, input().split()))
if n < 2:
print('-1')
arr = sorted(arr)
for i in range(n-1):
if arr[i] + arr[i+1] < sum1:
print(arr[i] * arr[i+1])
break
else:
print('0')
```
#Coding Question 4
You are given a function, Void *ReplaceCharacter(Char str[], int n, char ch1, char ch2);
The function accepts a string ‘ str’ of length n and two characters ‘ch1’ and ‘ch2’ as its arguments . Implement the function to modify and return the string ‘ str’ in such a way that all occurrences of ‘ch1’ in original string are replaced by ‘ch2’ and all occurrences of ‘ch2’ in original string are replaced by ‘ch1’.
Assumption: String Contains only lower-case alphabetical letters.
Note:
#Solution 4
```sh
def swap (user_input, str1, str2):
result = ''
if user_input != None:
result = user_input.replace(str1, '*').replace(str2, str1).replace('*', str2)
return result
return 'Null'
user_input = input()
str1, str2 = map(str,input().split())
print(swap(user_input, str1, str2))
```
#Coding Question 5
You are required to implement the following function, Int Calculate(int m, int n);
The function accepts 2 positive integer ‘m’ and ‘n’ as its arguments.You are required to calculate the sum of numbers divisible both by 3 and 5, between ‘m’ and ‘n’ both inclusive and return the same.
Note:
0 < m <= n
#Answer 5
```sh
m = int(input("M:"))
n = int(input("N:"))
def calculate(m, n):
sum = 0
for i in range(m,n+1,1):
if i%3 == 0 and i%5 == 0:
sum = sum + i
print(sum)
calculate(m,n)
```
#Popular Question 1
Bubble Sort
Given an Integer N and a list arr. Sort the array using bubble sort algorithm.
#Example 1:
```sh
Input:
N = 5
arr[] = {4, 1, 3, 9, 7}
Output:
1 3 4 7 9
```
#Coding Question 1
The function def differenceofSum(n. m) accepts two integers n, m as arguments Find the sum of all numbers in range from 1 to m(both inclusive) that are not divisible by n. Return difference between sum of integers not divisible by n with sum of numbers divisible by n.
Assumption:
#Solution 1
```sh
n = int(input())
m = int(input())
sum1 = 0
sum2 = 0
for i in range(1,m+1):
if i % n == 0:
sum1+=i
else:
sum2+=i
print(abs(sum2-sum1))
```
#Popular Question 2
Insertion Sort
The task is to complete the insert() function which is used to implement Insertion Sort.
#Example 1:
```sh
Input:
N = 5
arr[] = { 4, 1, 3, 9, 7}
Output:
1 3 4 7 9
```
#Coding Question 2
You are required to implement the following Function def LargeSmallSum(arr).
The function accepts an integers arr of size ’length’ as its arguments you are required to return the sum of second largest largest element from the even positions and second smallest from the odd position of given ‘arr’.
Assumption:
NOTE
#Answer 2
```sh
length = int(input())
arr = list(map(int, input().split()))
even_arr = []
odd_arr = []
for i in range(length):
if i % 2 == 0:
even_arr.append(arr[i])
else:
odd_arr.append(arr[i])
even_arr = sorted(even_arr)
odd_arr = sorted(odd_arr)
print(even_arr[len(even_arr)-2] + odd_arr[len(odd_arr)-2])
```
#Popular Question 3
Write code Check if the given string is Palindrome or not
#Coding Question 3
The function def ProductSmallestPair(sum, arr) accepts an integers sum and an integer array arr of size n. Implement the function to find the pair, (arr[j], arr[k]) where j!=k, Such that arr[j] and arr[k] are the least two elements of array (arr[j] + arr[k] <= sum) and return the product of element of this pair
NOTE
#Solution 3
```sh
n = int(input())
sum1 = int(input())
arr = list(map(int, input().split()))
if n < 2:
print('-1')
arr = sorted(arr)
for i in range(n-1):
if arr[i] + arr[i+1] < sum1:
print(arr[i] * arr[i+1])
break
else:
print('0')
```
#Coding Question 4
You are given a function, Void *ReplaceCharacter(Char str[], int n, char ch1, char ch2);
The function accepts a string ‘ str’ of length n and two characters ‘ch1’ and ‘ch2’ as its arguments . Implement the function to modify and return the string ‘ str’ in such a way that all occurrences of ‘ch1’ in original string are replaced by ‘ch2’ and all occurrences of ‘ch2’ in original string are replaced by ‘ch1’.
Assumption: String Contains only lower-case alphabetical letters.
Note:
#Solution 4
```sh
def swap (user_input, str1, str2):
result = ''
if user_input != None:
result = user_input.replace(str1, '*').replace(str2, str1).replace('*', str2)
return result
return 'Null'
user_input = input()
str1, str2 = map(str,input().split())
print(swap(user_input, str1, str2))
```
#Coding Question 5
You are required to implement the following function, Int Calculate(int m, int n);
The function accepts 2 positive integer ‘m’ and ‘n’ as its arguments.You are required to calculate the sum of numbers divisible both by 3 and 5, between ‘m’ and ‘n’ both inclusive and return the same.
Note:
0 < m <= n
#Answer 5
```sh
m = int(input("M:"))
n = int(input("N:"))
def calculate(m, n):
sum = 0
for i in range(m,n+1,1):
if i%3 == 0 and i%5 == 0:
sum = sum + i
print(sum)
calculate(m,n)
```
I started practising on Edyst platform since my 3rd year of college focused on placements & always liked the way they helped us when we were stuck at a particular problem.
Thank you, Edyst for all the assistance and amazing support!
Being a mechanical student and getting into an IT company is very tough. One of the main reason I could able to crack TCS CodeVita is because of Edyst.
Aneeq sir, your doubt clearing sessions, daily assignments & incredible mentors support really brushed up my skills.
When I joined the Edyst courses I received personalized mentoring on how to crack coding rounds of different companies. Through a combination of coding skills and great projects, I received multiple offers above 6+ lakhs per annum. Finally I joined for 8+ Lakhs package. Thanks for all the support, from Edyst Team.
Edyst's training style completely resonated with me. I approached programming as more than a subject. Thanks to Edyst team for the guidance!
#Popular Question 1
Bubble Sort
Given an Integer N and a list arr. Sort the array using bubble sort algorithm.
#Example 1:
```sh
Input:
N = 5
arr[] = {4, 1, 3, 9, 7}
Output:
1 3 4 7 9
```
#Coding Question 1
The function def differenceofSum(n. m) accepts two integers n, m as arguments Find the sum of all numbers in range from 1 to m(both inclusive) that are not divisible by n. Return difference between sum of integers not divisible by n with sum of numbers divisible by n.
Assumption:
#Solution 1
```sh
n = int(input())
m = int(input())
sum1 = 0
sum2 = 0
for i in range(1,m+1):
if i % n == 0:
sum1+=i
else:
sum2+=i
print(abs(sum2-sum1))
```
#Popular Question 2
Insertion Sort
The task is to complete the insert() function which is used to implement Insertion Sort.
#Example 1:
```sh
Input:
N = 5
arr[] = { 4, 1, 3, 9, 7}
Output:
1 3 4 7 9
```
#Coding Question 2
You are required to implement the following Function def LargeSmallSum(arr).
The function accepts an integers arr of size ’length’ as its arguments you are required to return the sum of second largest largest element from the even positions and second smallest from the odd position of given ‘arr’.
Assumption:
NOTE
#Answer 2
```sh
length = int(input())
arr = list(map(int, input().split()))
even_arr = []
odd_arr = []
for i in range(length):
if i % 2 == 0:
even_arr.append(arr[i])
else:
odd_arr.append(arr[i])
even_arr = sorted(even_arr)
odd_arr = sorted(odd_arr)
print(even_arr[len(even_arr)-2] + odd_arr[len(odd_arr)-2])
```
#Popular Question 3
Write code Check if the given string is Palindrome or not
#Coding Question 3
The function def ProductSmallestPair(sum, arr) accepts an integers sum and an integer array arr of size n. Implement the function to find the pair, (arr[j], arr[k]) where j!=k, Such that arr[j] and arr[k] are the least two elements of array (arr[j] + arr[k] <= sum) and return the product of element of this pair
NOTE
#Solution 3
```sh
n = int(input())
sum1 = int(input())
arr = list(map(int, input().split()))
if n < 2:
print('-1')
arr = sorted(arr)
for i in range(n-1):
if arr[i] + arr[i+1] < sum1:
print(arr[i] * arr[i+1])
break
else:
print('0')
```
#Coding Question 4
You are given a function, Void *ReplaceCharacter(Char str[], int n, char ch1, char ch2);
The function accepts a string ‘ str’ of length n and two characters ‘ch1’ and ‘ch2’ as its arguments . Implement the function to modify and return the string ‘ str’ in such a way that all occurrences of ‘ch1’ in original string are replaced by ‘ch2’ and all occurrences of ‘ch2’ in original string are replaced by ‘ch1’.
Assumption: String Contains only lower-case alphabetical letters.
Note:
#Solution 4
```sh
def swap (user_input, str1, str2):
result = ''
if user_input != None:
result = user_input.replace(str1, '*').replace(str2, str1).replace('*', str2)
return result
return 'Null'
user_input = input()
str1, str2 = map(str,input().split())
print(swap(user_input, str1, str2))
```
#Coding Question 5
You are required to implement the following function, Int Calculate(int m, int n);
The function accepts 2 positive integer ‘m’ and ‘n’ as its arguments.You are required to calculate the sum of numbers divisible both by 3 and 5, between ‘m’ and ‘n’ both inclusive and return the same.
Note:
0 < m <= n
#Answer 5
```sh
m = int(input("M:"))
n = int(input("N:"))
def calculate(m, n):
sum = 0
for i in range(m,n+1,1):
if i%3 == 0 and i%5 == 0:
sum = sum + i
print(sum)
calculate(m,n)
```
All Accenture Questions
All Accenture Questions