Open In App
Related Articles

InfyTQ 2020 Exam Experience

Improve Article
Save Article
Like Article

This is an examination to test your industry readiness by determining your knowledge in Programming and Databases and final year students who will be graduating in 2021 are recruited. Due to COVID circumstances, the things had gone differently this year.

Infosys Technologies Limited is an Indian multinational corporation that provides business consulting, Information technology, outsourcing services, and many more. It has its headquarters in Bangalore, Karnataka. Infosys is the second-largest IT company in India. It provides software development, maintenance, and independent validation services to companies in banking, finance, insurance, manufacturing, and other domains.

For the InfyTQ certification have to registered for the exam and was given the dates for the qualifier exam Round 1. We are required to book a slot for the exam, you have to choose the date from the given dates for your exam.

You have to choose any one language to perform in the exam Only Python/Java. Selected language can not be changed.

Round 1: This was an online exam, you have to give permission to access your webcam. Exam was scheduled on different dates(19,21,23,25 of Feb). Mine was on Feb 23.

This round consisted of 40 MCQs and the time was gallowted 1hour.

  1. 20 MCQs on Python/Java: For me, the easiest section was the python section, and I was able to solve more than 15 questions. All 20 questions are from OOP concepts and If you are aware of the basics you can solve easily.
  2. 10 MCQs on DBMS: DBMS section was moderate, and I was able to solve 8 questions and most of the questions I got were on Joins(left join, right join, outer join .. ) and basic queries were given.
  3. 10 MCQs on Aptitude: The difficult part I was faced with is the Aptitude section because of less time. For solving the above two sections I took mins and I was left with only 10 minutes. I solved only 3 questions.

So have an eye on the timer while writing exams and manage time for all sections. And to be remembered you will be given 1 mark for any correct answer, and 0.25 is deducted for every wrong answer.

The cutoff was not given and after a couple of weeks results were announced, and I was shortlisted. The round was scheduled on March 21 but due to COVID, it was postponed. I had enough time to prepare for the second round. We had round 2 on June 14.

Round 2: Unlike the previous year, This round was also an online round, and we were allowed to take tests from anywhere. This test was a web proctored round with no negative marking and you will be given 3 hours time.

The pattern of this round is:

  • 2 Hands-on coding questions
  • 20 MCQs

To clear this round you have to score at least 65% in the overall exam. There is no internal cutoff. The MCQs were easy and the funny thing is most of the questions were repeated from round 1 all sets. Questions were on OOPs, Data structures, and DBMS. I solved up to 15 questions easily.

The first coding question was easy and the second question was moderate.

Question 1 (Even-Odd series): Given a string and it contains the digits as well as non-digits. We have to find the count of non-digits. If it is odd then remove all the non-digits and print the string as in even-odd order.If it is even then print the string as in odd-even order.

E.g. The given string is */24#5%7&9*3@. We have to count the non-digit. It’s 7, odd. Then remove all the digits from the string and output will become (in a string) 254739. In the problem, we have only 2 even and 4 odd numbers then after the even number of completion print the remaining odd numbers.

Solution: This is a basic question and the time complexity is O(n)


string = input() 
characters = []
even = []
odd = []
for i in string:
    if i.isdigit():
        if int(i)%2==0:
charlen = len(characters)
minlen = min(len(odd),len(even))
result = []
if charlen%2 == 0:
    for i in range(minlen):
    for i in range(minlen):

Question 2: Given a non-empty string S, the task is to print the longest subsequence from the string S which contains alternating vowels and consonants.

Note: If multiple such subsequences exist having the same length, print the subsequence having the maximum sum of ASCII values of its characters.

  1. Example 1: If the input is ‘greatness’ the possible solutions are ‘getes’, ‘gates’, ‘retes’, ‘rates’. Out of these the one with the maximum ASCII sum is ‘retes
  2. Example 2: If the input is ‘ababababab’ , the output is ‘ababababab’.

Solution: This is a moderate question and the Time complexity is O(n).


def isvowel(ch):
    if ch == 'a' or ch == 'e' or ch == 'i' or ch == 'o' or ch=='u':
        return 1
    return 0
s = input()
flag = 0
if isvowel(s[0]):
    flag = 1
result = [s[0]]
for i in s[1:]:
    if isvowel(i) == flag:
        if ord(i)>ord(result[-1]):
            result[-1] = i
        flag = (flag +1)%2

One thing I noticed was that even if you solve this question 2 using combinations stills all the test cases will be passed. There will be not that much time complexity issues in Round 2. I passed all the test cases of both programs. On 6th July, I received a mail congratulating me for clearing the final round. This year the cleared students’ percentage is comparatively high. In my state around 1350 students cleared Round 2

The next round will be HR/Technical interview for the System Engineer role where the interview usually happens on the same day of Round 2. This year, COVID-19 changed the whole thing. The mail has mentioned that the interview will also be digital (virtual meeting) and is yet to happen. If you cleared the Interview you will be given a certificate by Infosys and you will be eligible for the final round. 

This is my overall experience with Infytq. Hope you love this. Enjoy coding!

Thank you!!..

Last Updated : 13 Jul, 2023
Like Article
Save Article
Similar Reads