.png){kind=logo}
.svg)
TCS Ninja NQT
About TCS Ninja NQT Exam
If you're preparing for the TCS Ninja NQT placement exam, there are several best practices and tips to keep in mind. The TCS Ninja exam is a national-level exam conducted by TCS to hire freshers across India for the TCS Ninja profile. To crack the exam, it is essential to understand the exam pattern, syllabus, and prepare with practice questions.
TCS National Qualifier Test (TCS NQT) is an Ability Test that assesses a candidate's competencies and skills. Each candidate who completes the TCS National Qualifier Test (TCS NQT) gets an NQT Score. The NQT (Cognitive Skills) Score is applicable for all industries and job roles. The TCS National Qualifier Test (TCS NQT) is planned to be conducted every quarter. Candidates can take the tests again to improve their previous scores, if desired. There are four Variants - NQT (Cognitive Skills), Attitudinal Alignment NQT (Psychometric Test), Industry NQT and Subject NQT.
To prepare for the TCS Ninja NQT exam, it is recommended to practice aptitude and coding questions, familiarize yourself with the TCS ion platform, and develop a TCS Ninja NQT strategy. It is also important to stay updated with industry trends and the latest technologies used in the TCS Ninja profile.
Candidates can purchase NQT Variant(s) and appear for it in the upcoming tests to improve their NQT score. The TCS Ninja profile is an excellent opportunity for freshers as it offers a competitive salary package and the chance to kickstart a successful career in the technology industry.
Additionally, it is essential to be aware of the TCS Ninja NQT registration process and have all the necessary documents ready. There is no negative marking in the exam, but it is vital to avoid any form of cheating, as it can result in disqualification.
Steps for the TCS Ninja Registration
- Go to the home page of the official website www.tcs.com.
- Click on the Careers option.
- Again click on the Entry Level option.
- On the screen, you can get the login and New Candidate option.
- Click on the Register Here option.
- Choose the IT (Information Technology) option.
- On the screen, you can get the TCS Ninja Application Form.
- Fill in the necessary details without any mistakes.
- Click on the submit option.
- And also complete all the necessary steps.
- Finally, submit the TCS NQT Application Form
Benefits of TCS Ninja NQT Exam
- Opportunity to be a part of TCS, one of the largest IT companies in India and the world.
- Exposure to various domains and technologies through TCS's diverse clientele.
- Competitive salary and benefits package.
- Opportunities for career growth and advancement within the company.
- Access to various training and development programs to enhance skills and knowledge.
- Opportunity to work on challenging and complex projects with clients from various industries.
- A chance to work in a multicultural and diverse environment.
- Exposure to latest technologies and trends in the IT industry.
- Flexible work-life balance and remote working options.
- Exposure to various on-going projects of TCS which gives an opportunity to learn and grow as a professional.
- TCS is known for its employee-friendly policies and culture which makes it an ideal place to build a career.
Please note that the benefits may vary based on the location, role, and other factors.
Eligibility Criteria for TCS Ninja NQT Exam
- Pre-final or final year students from any stream or degree
- Students passing between 2018 – 2024, who are looking for a job
- Working professionals with up to 2 years of experience
Syllabus for TCS Ninja NQT
Numerical Ability Topics
- Arrangements and Series
- P&C
- Number System, LCM & HCF
- Percentages
- Allegations and Mixtures
- Probability
- Ratios, Proportion, and Averages
- Reasoning
- Work and Time
- Speed Time and Distance
- Geometry
- Divisibility
- Profit and Loss
- Ages
- Clocks & Calendar
- Series and Progressions
- Equations
- Averages
- Area, Shapes & Perimeter
- Numbers & Decimal Fractions
Reasoning Ability Topics
- Meaningful Word Creation
- Number Series – Missing Number Single, Missing Number Analogy
- Data Sufficiency – Rank Based Logic, Ages
- Blood Relations
- Coding-Decoding
- Ages
- Odd Man Out – Numbers, Logical
- Distance and Directions
- Statement and Conclusion
- Seating Arrangement (Easy)
- Seating Arrangement (Complex)
- Analogy
- Mathematical Operational Arrangement
- Symbols and Notations
Verbal Ability Topics
- Synonyms
- Antonyms
- Prepositions
- Sentence Completion
- Active and Passive Voice
- Spelling Test
- Spotting Errors
- Passage Completion
- Substitution
- Sentence Arrangement
- Transformation
- Idioms and Phrases
- Sentence Improvement
- Para Completion
- Joining Sentences
- Error Correction (Underlined Part)
- Error Correction (Phrase in Bold)
- Fill in the blanks
Programmic Logic Topics
- Data Types
- Input-Output (based on C)
- Functions and Scope
- Variables and Registers
- Command Line Programming
- Pointers
- Inbuilt Libraries (based on C)
- Call by value/ reference
- Iteration
- Recursion
TCS Ninja NQT Exam Pattern
- Part A: Cognitive Skills
- Verbal Ability: 24 questions, 30 minutes
- Reasoning Ability: 30 questions, 50 minutes
- Numerical Ability: 26 questions, 40 minutes
- Part B: Programming
- Programming Logic: 10 questions, 15 minutes
- Hands-on Coding: 2 questions, 45 minutes
- Total: 92 questions, 180 minutes
TCS Selection Process
The TCS Ninja NQT selection process is a multi-stage competition that aims to identify and recognize the top-performing coders. The competition is designed to test contestants' coding abilities, logical thinking, and problem-solving skills. Based on their performance in the initial round, a select group of contestants will be chosen to proceed to the next stage.
This stage typically involves an online test that further evaluates contestants' coding skills and knowledge of programming languages. After successfully completing the online test, selected contestants will move on to the interview round.
The interview process includes three rounds, each focusing on different aspects of the candidate:
- The Technical Round focuses on evaluating the candidate's technical skills and knowledge of programming languages. The interviewer will ask questions related to the candidate's programming experience, projects, and problem-solving abilities.
- The Managerial Round is focused on evaluating the candidate's leadership skills, team management abilities, and understanding of the industry and business. Candidates are expected to demonstrate their ability to handle projects, work with cross-functional teams, and provide solutions to business problems.
- The HR Round is the final round of the interview process, where the interviewer will assess the candidate's communication skills, attitude, and overall fit with the company culture. The interviewer will also provide an overview of the company's benefits and other relevant information about the role.
If a candidate successfully clears all three rounds, they will receive an offer letter via email from TCS. It's worth noting that the selection process may vary depending on the role and location, and the company reserves the right to add or remove stages as per the requirement.
Popular Questions
#Question 1
Write a program to find the median of two sorted arrays.
#Answer:
```sh
def findMedianSortedArrays(nums1, nums2):
m, n = len(nums1), len(nums2)
if m > n:
nums1, nums2, m, n = nums2, nums1, n, m
i_min, i_max, half_len = 0, m, (m + n + 1) // 2
while i_min <= i_max:
i = (i_min + i_max) // 2
j = half_len - i
if i < m and nums2[j-1] > nums1[i]:
i_min = i + 1
elif i > 0 and nums1[i-1] > nums2[j]:
i_max = i - 1
else:
if i == 0: max_of_left = nums2[j-1]
elif j == 0: max_of_left = nums1[i-1]
else: max_of_left = max(nums1[i-1], nums2[j-1])
if (m + n) % 2 == 1:
return max_of_left
if i == m: min_of_right = nums2[j]
elif j == n: min_of_right = nums1[i]
else: min_of_right = min(nums1[i], nums2[j])
return (max_of_left + min_of_right) / 2
print(findMedianSortedArrays([1, 2, 3], [4, 5, 6])) #3.5
```
#Popular Question 1
Given a maximum of four digit to the base 17(10 -> A, 11 -> B, 12 -> C, 16 -> G) as input, output its decimal value.
#Question 2
Write a program to find the number of occurrences of a given element in a list.
#Answer:
```sh
def count_occurrences(lst, x):
return lst.count(x)
print(count_occurrences([1, 2, 2, 3, 4, 2, 5], 2)) #3
```
#Popular Question
One programming language has the following keywords that cannot be used as identifiers:
break, case, continue, default, defer, else, for, func, goto, if, map, range, return, struct, type, var
Write a program to find if the given word is a keyword or not
#Input:
```sh
defer
```
Output:
```sh
defer is a keyword
```
#Question 3
Write a program to find the intersection of two lists.
#Answer:
```sh
def intersection(lst1, lst2):
return list(set(lst1) & set(lst2))
print(intersection([1, 2, 3, 4], [3, 4, 5, 6])) #[3, 4]
```
#Popular Question
Given a pair of positive integers m and n (m < n; 0 < m < 999; 1 < n < = 999), write a program to smartly affix zeroes, while printing the numbers from m to n.
#Example
#Input
```sh
5 10
```
#Expected output
```sh
05 06 07 08 09 10
```
#Question 4
Write a program to find the union of two lists.
#Answer:
```sh
def union(lst1, lst2):
return list(set(lst1) | set(lst2))
print(union([1, 2
```
#Question 5
Write a program to check if a given string is a palindrome or not.
#Answer:
```sh
def is_palindrome(s):
return s == s[::-1]
print(is_palindrome("madam")) #True
```
Previously Asked Question
#Question 1
Write a program to find the median of two sorted arrays.
#Answer:
```sh
def findMedianSortedArrays(nums1, nums2):
m, n = len(nums1), len(nums2)
if m > n:
nums1, nums2, m, n = nums2, nums1, n, m
i_min, i_max, half_len = 0, m, (m + n + 1) // 2
while i_min <= i_max:
i = (i_min + i_max) // 2
j = half_len - i
if i < m and nums2[j-1] > nums1[i]:
i_min = i + 1
elif i > 0 and nums1[i-1] > nums2[j]:
i_max = i - 1
else:
if i == 0: max_of_left = nums2[j-1]
elif j == 0: max_of_left = nums1[i-1]
else: max_of_left = max(nums1[i-1], nums2[j-1])
if (m + n) % 2 == 1:
return max_of_left
if i == m: min_of_right = nums2[j]
elif j == n: min_of_right = nums1[i]
else: min_of_right = min(nums1[i], nums2[j])
return (max_of_left + min_of_right) / 2
print(findMedianSortedArrays([1, 2, 3], [4, 5, 6])) #3.5
```
#Popular Question 1
Given a maximum of four digit to the base 17(10 -> A, 11 -> B, 12 -> C, 16 -> G) as input, output its decimal value.
#Question 2
Write a program to find the number of occurrences of a given element in a list.
#Answer:
```sh
def count_occurrences(lst, x):
return lst.count(x)
print(count_occurrences([1, 2, 2, 3, 4, 2, 5], 2)) #3
```
#Popular Question
One programming language has the following keywords that cannot be used as identifiers:
break, case, continue, default, defer, else, for, func, goto, if, map, range, return, struct, type, var
Write a program to find if the given word is a keyword or not
#Input:
```sh
defer
```
Output:
```sh
defer is a keyword
```
#Question 3
Write a program to find the intersection of two lists.
#Answer:
```sh
def intersection(lst1, lst2):
return list(set(lst1) & set(lst2))
print(intersection([1, 2, 3, 4], [3, 4, 5, 6])) #[3, 4]
```
#Popular Question
Given a pair of positive integers m and n (m < n; 0 < m < 999; 1 < n < = 999), write a program to smartly affix zeroes, while printing the numbers from m to n.
#Example
#Input
```sh
5 10
```
#Expected output
```sh
05 06 07 08 09 10
```
#Question 4
Write a program to find the union of two lists.
#Answer:
```sh
def union(lst1, lst2):
return list(set(lst1) | set(lst2))
print(union([1, 2
```
#Question 5
Write a program to check if a given string is a palindrome or not.
#Answer:
```sh
def is_palindrome(s):
return s == s[::-1]
print(is_palindrome("madam")) #True
```
Testimonials
Dileep
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.
Madhavi
“My software journey started because of Edyst. Edyst preparation and referrals helped me get my first internship and job. Thank you Edyst!”
.jpg)
Manikanta Javvadi
Daily coding challenge and the doubt session helped me in staying consistent. Also, the leadership board kept me motivated. Edyst gave me the best guiding materials for all the cohorts I joined. I like everything done by Edyst for my success.
.jpg)
Rahil Sayed
I really like the Company specific practice questions they turn out to be super helpfulduring my interview, I didn't face any difficulty, the variety and range of practice questions (especially on arrays) got me my dream job. Also, the online live session were very interactive and helped me in revision and solving doubts. Thank you Edyst.
Saritha
I practice a lot at Edyst platform and what I learnt is how to code, self-learning and more & more about the practical knowledge which gradually increased my confidence level. Edyst was great platform which changed my career.
Harika
I feel the best thing about edyst is its company-specific guidance and the huge problem sets covering up almost all the concepts from beginner to advanced concepts, it helped me a lot for my placement preparation
Coding Interview Round Sample Questions
#Question 1
Write a program to find the median of two sorted arrays.
#Answer:
```sh
def findMedianSortedArrays(nums1, nums2):
m, n = len(nums1), len(nums2)
if m > n:
nums1, nums2, m, n = nums2, nums1, n, m
i_min, i_max, half_len = 0, m, (m + n + 1) // 2
while i_min <= i_max:
i = (i_min + i_max) // 2
j = half_len - i
if i < m and nums2[j-1] > nums1[i]:
i_min = i + 1
elif i > 0 and nums1[i-1] > nums2[j]:
i_max = i - 1
else:
if i == 0: max_of_left = nums2[j-1]
elif j == 0: max_of_left = nums1[i-1]
else: max_of_left = max(nums1[i-1], nums2[j-1])
if (m + n) % 2 == 1:
return max_of_left
if i == m: min_of_right = nums2[j]
elif j == n: min_of_right = nums1[i]
else: min_of_right = min(nums1[i], nums2[j])
return (max_of_left + min_of_right) / 2
print(findMedianSortedArrays([1, 2, 3], [4, 5, 6])) #3.5
```
#Popular Question 1
Given a maximum of four digit to the base 17(10 -> A, 11 -> B, 12 -> C, 16 -> G) as input, output its decimal value.
#Question 2
Write a program to find the number of occurrences of a given element in a list.
#Answer:
```sh
def count_occurrences(lst, x):
return lst.count(x)
print(count_occurrences([1, 2, 2, 3, 4, 2, 5], 2)) #3
```
#Popular Question
One programming language has the following keywords that cannot be used as identifiers:
break, case, continue, default, defer, else, for, func, goto, if, map, range, return, struct, type, var
Write a program to find if the given word is a keyword or not
#Input:
```sh
defer
```
Output:
```sh
defer is a keyword
```
#Question 3
Write a program to find the intersection of two lists.
#Answer:
```sh
def intersection(lst1, lst2):
return list(set(lst1) & set(lst2))
print(intersection([1, 2, 3, 4], [3, 4, 5, 6])) #[3, 4]
```
#Popular Question
Given a pair of positive integers m and n (m < n; 0 < m < 999; 1 < n < = 999), write a program to smartly affix zeroes, while printing the numbers from m to n.
#Example
#Input
```sh
5 10
```
#Expected output
```sh
05 06 07 08 09 10
```
#Question 4
Write a program to find the union of two lists.
#Answer:
```sh
def union(lst1, lst2):
return list(set(lst1) | set(lst2))
print(union([1, 2
```
#Question 5
Write a program to check if a given string is a palindrome or not.
#Answer:
```sh
def is_palindrome(s):
return s == s[::-1]
print(is_palindrome("madam")) #True
```
Technical Interview Round Sample Questions
.svg){kind=icon}
HR Interview Round Sample Questions
TCS Ninja NQT
All TCS Ninja NQT Questions
Services Company Mega Pack
Services Company Mega PackProduct Companies Mega Pack
All TCS Ninja NQT Questions