TCS Code Vita 2024 Sample Questions and Solution | Apply Now
TCS Code VitaGet ready to unlock the world of programming excitement with CodeVita!
Launched in 2012, TCS CodeVita is a global programming competition designed to identify top coders around the world. It’s a dynamic contest that unites people from diverse backgrounds and cultures, shattering boundaries. The “Guinness Book of World Records” listed TCS CodeVita as ‘The world’s largest programming contest’ with registrations from 98 countries/regions, proving it as a true global phenomenon.
In Season 11, participation soared to 444k+ contestants, representing 3,500+ institutes. Imagine participants from 10 regions engaging in an electrifying battle during the grand finale!
This year, we are “United by Code”, celebrating a global community bound by the shared passion for programming. This season 12 promises more thrilling challenges and unforgettable experiences, highlighting the unity and diversity of coders worldwide.
Are you intrigued? Brace yourself for another extraordinary journey with TCS CodeVita, where coding transcends boundaries.
| Company | TCS |
|---|---|
|
Post |
Code Vita 2024 |
|
Degree |
All Degree |
|
Branch |
Science/Engineering |
|
Batch |
2025/2026/2027/2028
Batch |
|
Price |
20000 USD |
|
Apply Link |
So those candidate who meet all the requirement mentioned above are eligible to apply for this post and if you want to know in detail about the actual requirement of this job means what qualities what skills do you actually needed so you can be a perfect fit for this job is given below. This detail is taken from the company official listing that they mentioned in their posting so read it carefully and then apply this will increase the chance of perfect match for this job role
What’s in it for students?
- Top 3 coders to win total prize money of USD 20,000
- Chance to explore exciting careers* with one of the world’s most powerful brands
- Chance to compete with some of the best coders in the world
- Platform to showcase your programming skills
- Finalists stand a chance to travel to India for the season 12 live grand finale experience
A solid cube of 10 cm x 10cm x 10 cm rests on the ground. It has a beetle on it, and some sweet honey spots at various locations on the surface of the cube. The beetle starts at a point on the surface of the cube, and goes to the honey spots in order along the surface of the cube.
Problem Description
A solid cube of 10 cm x 10cm x 10 cm rests on the ground. It has a beetle on it, and some sweet honey spots at various locations on the surface of the cube. The beetle starts at a point on the surface of the cube, and goes to the honey spots in order along the surface of the cube.
1. If it goes from a point to another point on the same face (say X to Y), it goes in an arc of a circle that subtends an angle of 60 degrees at the centre of the circle
2. If it goes from one point to another on a different face, it goes by the shortest path on the surface of the cube, except that it never travels along the bottom of the cube
The beetle is a student of Cartesian geometry, and knows the coordinates (x, y, z) of all the points it needs to go to. The origin of coordinates it uses is one corner of the cube on the ground, and the z axis points up. Hence, the bottom surface (on which it does not crawl) is z=0, and the top surface is z=10. The beetle keeps track of all the distances travelled, and rounds the distance travelled to two decimal places once it reaches the next spot, so that the final distance is a sum of the rounded distances from spot to spot.
Input
The first line gives an integer N, the total number of points (including the starting point) the beetle visits
The second line is a set of 3N comma separated non-negative numbers, with up to two decimal places each. These are to be interpreted in groups of three as the x, y, z coordinates of the points the beetle needs to visit in the given order.
Output
One line with a number giving the total distance travelled by the beetle accurate to two decimal places. Even if the distance travelled is an integer, the output should have two decimal places.
Constraints
None of the points the beetle visits is on the bottom face (z=0) or on any of the edges of the cube (the lines where two faces meet)
2<=N<=10
Difficulty Level
Complex
Time Limit (secs)
1
Examples
Example 1
Input
3
1,1,10,2,1,10,0,1,9
Output
4.05
Explanation
There are three points visited by the beetle (N=3). The beetle starts on the top face of the cube (z=10) at point (1,1,10) and goes to another point on the same face (2,1,10). Though the straight line distance is 1, it travels on the arc of a circle subtending an angle of 60 degrees at the centre of the circle, and hence travels (2*pi)/6 or 1.05 (note that it rounds the distance at each leg of the journey). It then travels from (2,1,10) on the face z=10 to (0,1,9) on the face x=0 along the surface of the cube. This is a distance of 3. The total distance travelled is 1.05+3=4.05. The output is 4.05
Example 2
Input
3
1,1,10,2,1,10,0,5,9
Output
6.05
Explanation
There are three points visited by the beetle (N=3). The beetle starts on the top face of the cube (z=10) at point (1,1,10) and goes to another point on the same face (2,1,10). As before. This distance is 1.05. It then travels from (2,1,10) on the face z=10 to (0,5,9) on the face x=0 along the surface of the cube. The shortest distance on the surface of the cube between these points is 5. The total distance travelled is 1.05+5=6.05. The output is 6.05.
The parcel section of the Head Post Office is in a mess. The parcels that need to be loaded to the vans have been lined up in a row in an arbitrary order of weights. The Head Post Master wants them to be sorted in the increasing order of the weights of the parcels, with one exception. He wants the heaviest (and presumably the most valuable) parcel kept nearest his office.
Problem Description
The parcel section of the Head Post Office is in a mess. The parcels that need to be loaded to the vans have been lined up in a row in an arbitrary order of weights. The Head Post Master wants them to be sorted in the increasing order of the weights of the parcels, with one exception. He wants the heaviest (and presumably the most valuable) parcel kept nearest his office.
You and your friend try to sort these boxes and you decide to sort them by interchanging two boxes at a time. Such an interchange needs effort equals to the product of the weights of the two boxes.
The objective is to reposition the boxes as required with minimum effort.
Input
The first line consists of two space separated positive integers giving the number of boxes (N) and the position of the Head Post Master’s office (k) where the heaviest box must be.
The second line consists of N space separated positive integers giving the weights of the boxes. You may assume that no two weights are equal.
Output
The output is one line giving the total effort taken to get the boxes in sorted order, and the heaviest in position k.
Constraints
N<=50
Weights <= 1000
Difficulty Level
Complex
Time Limit (secs)
1
Examples
Example 1
Input
5 2
20 50 30 80 70
Output
3600
Explanation
There are 5 boxes (N=5) and the heaviest box must be in position 2 (k=2). If we look at the final order (sorted, with the heaviest at position 2), it should be 20 80 30 50 70. If we look at this, we notice that only the 50 and the 80 parcels need to be exchanged. As this takes effort of the product of the weights, the effort is 4000.
Further reduction can be obtained if we use the smallest package (20) as an intermediary. If we exchange 20 with 50 (effort 1000), then with 80 (effort 1600) and back with 50 again (effort 1000), the effect is the same, with a total effort of 3600 (less th an the effort obtained by the direct move)an the effort
The results after the optimal sequence of exchanges are
50 20 30 80 70
50 80 30 20 70
20 80 30 80 70
As this takes an effort of 3600, the output is 3600.
Example 2
Input
6 3
30 20 40 80 70 60
Output
7600
Explanation
There are 6 parcels, and the heaviest should be at position 3. Hence the final order needs to be 20 30 80 40 60 70. If we look at the initial position, we see that 20 and 30 need to be exchanged (effort 600), 40 and 80 need to be exchanged (effort 3200) and 60 and 70 need to be exchanged (effort 4200). Hence the total effort is 600+3200+4200=8000.
If we use the same approach as in Example 1, we get the following efforts
(600) 20 30 40 80 70 60
(3200) 20 30 80 40 70 60
(1200) 60 30 80 40 70 20
(1400) 60 30 80 40 20 70
(1200) 20 30 80 40 60 70
A total effort of 7600 is obtained rather than an effort of 8000, which is the output.
Other Jobs :- Click Here
2024 Batch Passouts Jobs :- Click Here
Internships :- Click Here
IDFC First Bank Jobs :- Click Here
TCS Study Material :- Coming Soon
Wipro Study Material :- Coming Soon
Infosys Study Material :- Coming Soon
Accenture Study Material :- Coming Soon
Apptitude Study Material :- Coming Soon
In first round there will Aptitude Round where question related to check capabilities of the candidate through variety of questions like
- Verbal reasoning questions. …
- Verbal comprehension questions. …
- English language questions. …
- Questions testing abstract reasoning.
The second round is generally a Technical Round in which all the technical related question were asked to candidate according to job role. In this generally the interviewer checks candidate technical ability the depth and breadth of candidaate knowledge
Round 3 is a HR round in some cases TR and HR round are occur concurrently. This round is conducted by Human Resource Professional who ensures that you are the right candidate for the role
If You want to Know how to Apply for this Job Click Here
