InfyTQ 583,5,2,2 - Infosys. Practice Test - 2 (Infosys) By: Anonymous; 30 min 30 Ques Start Test. M Practice Test - 4 (Infosys) By: Anonymous; 30 min 30 Ques Start Test. Training @Infosys Mysore Assessment Test: Tips and Suggestions Hands On test will be held after 10 days from your Joining and Objective Test after 11 days from your joining. Objective Test is of 100 marks( 33marks Programming, 33 marks RDBMS and 34.
InfyTQ certification exam was started by Infosys in the year 2019. Its completely based on python programming.
To clear the exam 65% or more marks is required
The benefits of clearing this test includes:
Infosys Career Portal
- You will get a professional certification on python from infosys which will be valid for lifetime
- On spot job interview and an opportunity to join infosys
I will be sharing my experience and few questions that will help you understand the pattern.
The test will have 2 sections.
- 2 coding questions
- 20 MCQ from DS, Algo, DBMS, Programming
Time provided will be 2 hours. Coding questions will be from string manipulation, list or array, matrix or 2d arrays.
Few question that where asked from 2020 batch:
- Given a list of string and numbers, rotate the string by one position to the right if the sum of squares of digits of the corresponding number is even and rotate it twice to the left if the sum of the squares of the digits of the corresponding number is odd.
- Given an array, find the sub array which can be a square matrix with maximum sum. If there are multiple results print the matrices in the order of their orders( i.e, 3×3 matrix will be printed first, then 2X2…so on)
- Given an alphanumeric string, extract all numbers, remove the duplicate digits, and from that set of digits construct the largest even number possible
- Given a mxn matrix select an element if the same element appears at 4 consecutive position again. Return the minimum element from all the gathered elements. What is consecutive? It’s horizontal, vertical and all possible diagonals
- State whether a giving string contains matching braces or not. In case mismatch is present then output the index of mismatch position
- Longest Alphabetic Sequence
- From a alphanumeric string extract all digits, From the smallest odd number with no repeats.
Happy Coding <3
Recommended Posts:
Infosys Training Center
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the 'Improve Article' button below.