.png){kind=logo}
.svg)
TCS Digital
About TCS Digital
Looking to crack the TCS Digital placement exam? Here's what you need to know.
The TCS Digital exam is a highly competitive national-level exam that is conducted twice a year to recruit candidates for the TCS Digital profile. To crack the exam, it is important to have a clear understanding of the exam pattern, syllabus, and best practices.
The TCS Digital exam consists of aptitude questions, advanced coding questions, and TCS Xplore course and quizzes. It is important to practice aptitude and coding questions and familiarize yourself with the TCS Xplore course and quizzes. Additionally, developing a TCS Digital exam strategy and staying updated with industry trends and the latest technologies used in the TCS Digital profile can also be helpful.
The TCS Digital profile is a highly sought-after position for freshers, offering a competitive salary package of 7 LPA and the opportunity to work with cutting-edge technologies. It is a great opportunity for those interested in pursuing a career in the technology industry and working with a reputed organization like TCS.
If you are interested in appearing for TCS placement exams, it is important to understand the registration process, interview questions, and the best practices to crack the exams. Remember, cheating in placement exams is not only unethical but can also have serious consequences. So, it's best to stay away from such practices and focus on preparing well to crack the exams.
Steps for the TCS Digital Registration
Candidates often face problems during the online registration and some of them are unable to find the official website of Tata Consultancy Services.
Follow these instructions for registering for the TCS Off Campus Drive 2021 :
- Go to the homepage of the official website.
- Click on the Careers option.
- Click on the Entry Level option.
- You can see the login and the new candidate option.
- Click on the Register Here option.
- Choose the IT(Information Technology) or BPS (Business Process Services) option.
- On the screen, you will find the TCS Digital Application Form.
- Fill in the necessary details without any errors.
- Click on the submit button.
- And complete all the necessary steps.
- Finally, submit the TCS Digital Application Form.
Benefits of TCS Digital 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 Digital Exam
- All Branches B.Tech, M.Tech.
- Percentage in X and XII – 60% or 6.0 CGPA
- In Pursuing Degree – 70% or 7.0 CGPA
- In UG (for PGs) – 60% or 6.0 CGPA.
- The applicant must not have any active backlog/arrear/ATKT while appearing for the TCS Selection process.
- It is mandatory to declare academic gaps. The overall academic break should not exceed 24 months.
Syllabus for TCS Digital
Aptitude:
- Permutations and Combinations
- Basic counting techniques
- Principle of inclusion and exclusion
- Permutations and combinations of non-distinct objects
- Elementary partitions
- Simple combinatorial probability
- Conditional probability
- Divisibility by prime numbers
- Elementary modulo arithmetic
- Elementary algebra
- Expansions using Binomial theorem
- Roots of polynomials
- Relations between roots and coefficients
- Averages, Mean, median and mode
- Time and distance related concepts
- Elementary Geometry,
- Pythagoras theorem
- Congruence and similarity of triangles
- Area and circumference of a circle
- Elementary trigonometry
- Basic algorithmic thinking
Programming Logic:
- Error Detection in code snippet (in C)
- Input-output prediction (in C)
- Snippet Code Fix (in C)
- Stacks
- Queues
- Linked Lists
- Strings and Arrays
- Trees
- Time Complexity
- Matrices
Advanced Coding:
- Data structures:
- Array
- Stack
- Queue
- List
- Hashtable
- Binary tree
- Algorithms:
- Search algorithms – searching an array, tree traversal
- Common sort algorithms
- Time & space complexity of these algorithms
- Dynamic programming
TCS Digital Exam Pattern
Verbal Ability:
- Time: 10 minutes
- Number of questions: 15
Quantitative Aptitude:
- Time: 40 minutes
- Number of questions: 15
Advanced Coding:
- Time: 60 minutes
- Number of questions: 2
TCS Digital Selection Process
After taking the TCS Digital exam, candidates move on to the selection process which includes two rounds of interviews.
The first interview round, known as the Technical Round, assesses 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 final round of the interview process, known as the HR round, focuses on evaluating 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.
Based on the results of these interviews, TCS selects candidates for the job. 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 longest common prefix among an array of strings.
#Answer:
```sh
def longest_common_prefix(strs):
if len(strs) == 0:
return ""
if len(strs) == 1:
return strs[0]
strs.sort()
first = strs[0]
last = strs[-1]
for i, char in enumerate(first):
if char != last[i]:
return first[:i]
return first
print(longest_common_prefix(["flower","flow","flight"])) #"fl"
```
#Popular Question
Problem Description -: Given an array Arr[ ] of N integers and a positive integer K. The task is to cyclically rotate the array clockwise by K.
Note : Keep the first of the array unaltered.
Example
#Input:
```sh
- 5 —Value of N
- {10, 20, 30, 40, 50} —Element of Arr[ ]
- 2 —–Value of K
```
#Output :
```sh
40 50 10 20 30
```
#Question2
Write a program to find the second highest number in an array.
#Answer:
```sg
def second_highest(arr):
first = max(arr)
arr.remove(first)
return max(arr)
print(second_highest([1, 2, 3, 4, 5, 6])) #5
```
#Popular Question
Problem Description -: Given two non-negative integers n1 and n2, where n1
For example:
Suppose n1=11 and n2=15.
There is the number 11, which has repeated digits, but 12, 13, 14 and 15 have no repeated digits. So, the output is 4.
Example
#Input:
```sh
- 11 — Vlaue of n1
- 15 — value of n2
```
#Output:
```sh
- 4
```
#Question 3
Write a program to implement a stack using a queue.
#Answer:
```sh
class Stack:
def __init__(self):
self.queue = []
def push(self, item):
self.queue.append(item)
def pop(self):
for i in range(len(self.queue) - 1):
item = self.queue.pop(0)
self
```
#Popular Question
Given a maximum of 100 digit numbers as input, find the difference between the sum of odd and even position digits.
#Input :
```sh
4567
```
#Expected output:
```sh
2
```
#Question 4
Write a program to find the number of vowels in a given string.
#Answer:
```sh
def count_vowels(string):
vowels = "aeiouAEIOU"
return sum(1 for c in string if c in vowels)
print(count_vowels("Hello World")) #3
```
#Question5
Write a program to find the most frequent element in an array.
#Answer:
```sh
from collections import Counter
def most_frequent(arr):
return Counter(arr).most_common(1)[0][0]
print(most_frequent([1, 2, 3, 4, 2, 2, 3, 4, 5, 4])) #4
```
Previously Asked Question
#Question 1
Write a program to find the longest common prefix among an array of strings.
#Answer:
```sh
def longest_common_prefix(strs):
if len(strs) == 0:
return ""
if len(strs) == 1:
return strs[0]
strs.sort()
first = strs[0]
last = strs[-1]
for i, char in enumerate(first):
if char != last[i]:
return first[:i]
return first
print(longest_common_prefix(["flower","flow","flight"])) #"fl"
```
#Popular Question
Problem Description -: Given an array Arr[ ] of N integers and a positive integer K. The task is to cyclically rotate the array clockwise by K.
Note : Keep the first of the array unaltered.
Example
#Input:
```sh
- 5 —Value of N
- {10, 20, 30, 40, 50} —Element of Arr[ ]
- 2 —–Value of K
```
#Output :
```sh
40 50 10 20 30
```
#Question2
Write a program to find the second highest number in an array.
#Answer:
```sg
def second_highest(arr):
first = max(arr)
arr.remove(first)
return max(arr)
print(second_highest([1, 2, 3, 4, 5, 6])) #5
```
#Popular Question
Problem Description -: Given two non-negative integers n1 and n2, where n1
For example:
Suppose n1=11 and n2=15.
There is the number 11, which has repeated digits, but 12, 13, 14 and 15 have no repeated digits. So, the output is 4.
Example
#Input:
```sh
- 11 — Vlaue of n1
- 15 — value of n2
```
#Output:
```sh
- 4
```
#Question 3
Write a program to implement a stack using a queue.
#Answer:
```sh
class Stack:
def __init__(self):
self.queue = []
def push(self, item):
self.queue.append(item)
def pop(self):
for i in range(len(self.queue) - 1):
item = self.queue.pop(0)
self
```
#Popular Question
Given a maximum of 100 digit numbers as input, find the difference between the sum of odd and even position digits.
#Input :
```sh
4567
```
#Expected output:
```sh
2
```
#Question 4
Write a program to find the number of vowels in a given string.
#Answer:
```sh
def count_vowels(string):
vowels = "aeiouAEIOU"
return sum(1 for c in string if c in vowels)
print(count_vowels("Hello World")) #3
```
#Question5
Write a program to find the most frequent element in an array.
#Answer:
```sh
from collections import Counter
def most_frequent(arr):
return Counter(arr).most_common(1)[0][0]
print(most_frequent([1, 2, 3, 4, 2, 2, 3, 4, 5, 4])) #4
```
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.
Diksha Sharma
Edyst platform gave a place to practice as many questions as possible, and their live sessions were highly informative; most importantly, they resolved all students' queries.
Coding Interview Round Sample Questions
#Question 1
Write a program to find the longest common prefix among an array of strings.
#Answer:
```sh
def longest_common_prefix(strs):
if len(strs) == 0:
return ""
if len(strs) == 1:
return strs[0]
strs.sort()
first = strs[0]
last = strs[-1]
for i, char in enumerate(first):
if char != last[i]:
return first[:i]
return first
print(longest_common_prefix(["flower","flow","flight"])) #"fl"
```
#Popular Question
Problem Description -: Given an array Arr[ ] of N integers and a positive integer K. The task is to cyclically rotate the array clockwise by K.
Note : Keep the first of the array unaltered.
Example
#Input:
```sh
- 5 —Value of N
- {10, 20, 30, 40, 50} —Element of Arr[ ]
- 2 —–Value of K
```
#Output :
```sh
40 50 10 20 30
```
#Question2
Write a program to find the second highest number in an array.
#Answer:
```sg
def second_highest(arr):
first = max(arr)
arr.remove(first)
return max(arr)
print(second_highest([1, 2, 3, 4, 5, 6])) #5
```
#Popular Question
Problem Description -: Given two non-negative integers n1 and n2, where n1
For example:
Suppose n1=11 and n2=15.
There is the number 11, which has repeated digits, but 12, 13, 14 and 15 have no repeated digits. So, the output is 4.
Example
#Input:
```sh
- 11 — Vlaue of n1
- 15 — value of n2
```
#Output:
```sh
- 4
```
#Question 3
Write a program to implement a stack using a queue.
#Answer:
```sh
class Stack:
def __init__(self):
self.queue = []
def push(self, item):
self.queue.append(item)
def pop(self):
for i in range(len(self.queue) - 1):
item = self.queue.pop(0)
self
```
#Popular Question
Given a maximum of 100 digit numbers as input, find the difference between the sum of odd and even position digits.
#Input :
```sh
4567
```
#Expected output:
```sh
2
```
#Question 4
Write a program to find the number of vowels in a given string.
#Answer:
```sh
def count_vowels(string):
vowels = "aeiouAEIOU"
return sum(1 for c in string if c in vowels)
print(count_vowels("Hello World")) #3
```
#Question5
Write a program to find the most frequent element in an array.
#Answer:
```sh
from collections import Counter
def most_frequent(arr):
return Counter(arr).most_common(1)[0][0]
print(most_frequent([1, 2, 3, 4, 2, 2, 3, 4, 5, 4])) #4
```
Technical Interview Round Sample Questions
.svg){kind=icon}
HR Interview Round Sample Questions
TCS Digital
All TCS Digital Questions
Services Company Mega Pack
Services Company Mega PackProduct Companies Mega Pack
All TCS Digital Questions