TCS Digital Hiring process 2019-2020 has been completely discussed in this article. We have also added some sample questions for your convenience. TCS Digital is a hiring process through which it takes placements. TCS Digital hiring is a test based hiring process just like others. In this also there will a test followed by 3 interviews. We will be telling you about everything in detail so make sure you follow us through this article till the end. We assure you truly genuine and complete information at Alpingi.
Contents
TCS Digital Hiring Eligibility Criteria
Eligibility criteria for TCS Digital Hiring 2019:
- Students who are undergraduate and postgraduate passed out in 2019 are eligible to apply (including 5-year integrated programs).
- You must have 60% or above in your complete academics and more than 70% in your highest level of education.
- No backlogs are allowed.
- Eligible branches or discipline (Computer Science, Information Technology, Information Sciences, Electronics & Communication, Electrical & Electronics, Mechanical, Electronics & Telecommunication, MCA with BSc/ BCA (with Math/ Statistics Background), MSc in Computer Science/ Information Technology/ Software).
TCS Digital Hiring Selection Process
The selection process for TCS Digital Hiring 2019 is divided into four parts in which 1st is an online test and then you will have three interviews.
Most Employability Test 2019
1.) Online Test
2.) Technical interview
3.) Managerial interview
4.) HR interview
Digital Hiring Test Pattern
So the pattern of 1st online test is shown in the below table:
TCS Digital Hiring Process 2019-2020 | No. of Questions | Time (in minutes) | Difficulty |
Aptitude | 12 | 30 | Medium |
Lateral thinking | 7 | 30 | High |
Programing logics | 7 | 20 | Medium |
Agility | 2 | 25 | High |
English proficiency | 10 | 15 | Low |
Advanced coding | 1 | 60 | Very high |
TCS Digital Hiring Test Syllabus
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: This section tests the basic understanding of the candidates programming language and also to test whether if candidate know some standard algorithms run on these languages or not. In this section, you will be having one question for which the time allotted will be 60 mins. You can any of these languages to code (C, C++, Java, Python, Perl).
The following is the list of topics for this test:
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 Directory
TCS Next Steps Registration – Apply Here |
TCS Ninja Hiring – Register Here |
TCS ION CCQT – Check Details |
TCS Ignite 2019 Registration |
TCS Eligibility Criteria – Read Here |
Coding Questions of TCS Digital Hiring
Question 1. Given a binary matrix, find out the maximum size square sub-matrix with all 1s.
For example, consider the below binary matrix.
Code in C or C++
[code language=”cpp”]
// C/C++ code for Maximum size square sub-matrix with all 1s
#include<stdio.h>
#define bool int
#define R 6
#define C 5
Answer 1. void printMaxSubSquare(bool M[R][C])
{
int i,j;
int S[R][C];
int max_of_s, max_i, max_j;
/* Set first column of S[][]*/
for(i = 0; i < R; i++)
S[i][0] = M[i][0];
/* Set first row of S[][]*/
for(j = 0; j < C; j++)
S[0][j] = M[0][j];
/* Construct other entries of S[][]*/
for(i = 1; i < R; i++)
{
for(j = 1; j < C; j++)
{
if(M[i][j] == 1)
S[i][j] = min(S[i][j-1], S[i-1][j], S[i-1][j-1]) + 1;
else
S[i][j] = 0;
}
}
/* Find the maximum entry, and indexes of maximum entry
in S[][] */
max_of_s = S[0][0]; max_i = 0; max_j = 0;
for(i = 0; i < R; i++)
{
for(j = 0; j < C; j++)
{
if(max_of_s < S[i][j])
{
max_of_s = S[i][j];
max_i = i;
max_j = j;
}
}
}
printf(“Maximum size sub-matrix is: \n”);
for(i = max_i; i > max_i – max_of_s; i–)
{
for(j = max_j; j > max_j – max_of_s; j–)
{
printf(“%d “, M[i][j]);
}
printf(“\n”);
}
}
/* UTILITY FUNCTIONS */
/* Function to get minimum of three values */
int min(int a, int b, int c)
{
int m = a;
if (m > b)
m = b;
if (m > c)
m = c;
return m;
}
/* Driver function to test above functions */
int main()
{
bool M[R][C] = {{0, 1, 1, 0, 1},
{1, 1, 0, 1, 0},
{0, 1, 1, 1, 0},
{1, 1, 1, 1, 0},
{1, 1, 1, 1, 1},
{0, 0, 0, 0, 0}};
printMaxSubSquare(M);
getchar();
}
[/code]
Code in Java
[code language=”java”]
// JAVA Code for Maximum size square sub-matrix with all 1s
public class GFG
{
// method for Maximum size square sub-matrix with all 1s
static void printMaxSubSquare(int M[][])
{
int i,j;
int R = M.length; //no of rows in M[][]
int C = M[0].length; //no of columns in M[][]
int S[][] = new int[R][C];
int max_of_s, max_i, max_j;
/* Set first column of S[][]*/
for(i = 0; i < R; i++)
S[i][0] = M[i][0];
/* Set first row of S[][]*/
for(j = 0; j < C; j++)
S[0][j] = M[0][j];
/* Construct other entries of S[][]*/
for(i = 1; i < R; i++)
{
for(j = 1; j < C; j++)
{
if(M[i][j] == 1)
S[i][j] = Math.min(S[i][j-1],Math.min(S[i-1][j], S[i-1][j-1])) + 1;
else
S[i][j] = 0;
}
}
/* Find the maximum entry, and indexes of maximum entry
in S[][] */
max_of_s = S[0][0]; max_i = 0; max_j = 0;
for(i = 0; i < R; i++)
{
for(j = 0; j < C; j++)
{
if(max_of_s < S[i][j])
{
max_of_s = S[i][j];
max_i = i;
max_j = j;
}
}
}
System.out.println(“Maximum size sub-matrix is: “);
for(i = max_i; i > max_i – max_of_s; i–)
{
for(j = max_j; j > max_j – max_of_s; j–)
{
System.out.print(M[i][j] + ” “);
}
System.out.println();
}
}
// Driver program
public static void main(String[] args)
{
int M[][] = {{0, 1, 1, 0, 1},
{1, 1, 0, 1, 0},
{0, 1, 1, 1, 0},
{1, 1, 1, 1, 0},
{1, 1, 1, 1, 1},
{0, 0, 0, 0, 0}};
printMaxSubSquare(M);
}
}
[/code]
Interview Questions for TCS Digital Hiring
1.TCS Digital Hiring Technical Interview Questions:
1) In simple terms, explain what is Blockchain Technology.
2) Is Bitcoin a part of Blockchain or vice versa?
3) What is AI, ML and Deep Learning?
4) What is Big Data Analytics?
5) Explain Exception Handling with an example.
6) What is the use of “finally” block in exception handling?
7) Explain the pillars of object-oriented programming namely abstraction, encapsulation, polymorphism and inheritance.
8) Explain Overloading and Overriding.
9) What is Final?
10) Difference between JDK and JRE.
11) What is JVM?
12) Name various data types in Java.
13) Why multiple inheritances are not there in Java?
14) Why pointers are not there in Java?
15) What is Static variable and method in Java?
16) Can you overload the main method?
17) What kind of errors are there in Java?
18) What are the advantages of Java?
19) Name some errors and exceptions?
20) What is the superclass of Exception?
21) What is the superclass of Throwable?
22) What are the ACID properties?
23) What are transactions in databases?
24) What is a linked list?
25) Detection and removal of a loop in a linked list.
26) Difference between call by value and call by reference.
27) Why do we use R?
28) How can we use R to predict something?
29) What are the advantages of R?
30) What happens after you enter the URL of a website?
31) What is Dynamic programming?
32) Explain the difference between Drop, Truncate and Delete.
33) What is Normalization?
34) Difference between Having and Where Clause.
35) Write a query to get the 3rd largest salary from a table.
36) Write queries to declare the primary key and foreign key for some table. (Syntax)
37) Problems based on the usage of increment and decrement operators.
38) Swap two variables without using the third one.
39) Swap two variables without using the third one and without using the arithmetic operators.
40) Describe your projects
2) TCS Digital Hiring Managerial Interview Questions:
1) How do you think facebook manages its data?
2) When you search something on Google, In what way it ranks its results?
3) If advertisements play some part in these results then how do you differentiate between advertised product and Google’s search results?
4) How Big Data is stored and managed in organizations?
3) TCS Digital Hiring HR Interview Questions:
1) There is a 5L jar and a 3L Jar and another jar is given to you(without dimensions) and an infinite supply of water is there, how you will collect 4 liters in the dimensionless jar? You cannot throw water outside.
2) There are 3 bulbs in one room and the 3 switches are in another room, how you will find which switch is for which bulb? You can go to the room where the bulbs are present only once.
This was all from us in this article. If you have any further queries you can comment below. We will be happy to help you. Thank you guys, all the best.