TrusTrace is a traceability and compliance data management platform that automates the collection and validation of real-time granular data directly from the supplier network on how products have been made.
The drive was conducted for 2 days.
Day 1
Began with a preplacement talk.
Round 1 :
MCQs based on OOPS(Java), JAVA(intermediate), DSA, Aptitude, and Programming questions output.
No. of questions: 29
Round 2:
Programming round - 1
No. of questions:6
Time:1hr
- Factorial of a number
- Given an array, find the maximum average if you are allowed to choose at most k elements.
- Weird number
- Magical number
- String:
Input:helloworldmono
Array length:3
Hello
Monoworld
Hiiii!
Output:2(no. Of words that can be formed from the given letters in a string) - A person likes Virat, Rohit, Sachin. Given the 1st letter of the string find if a person likes a player.
Round 3:
Time: 1.5 hours
- https://prepinsta.com/tcs-codevita/3-palindromes-problem/
- Find the shortest path-graphs
DAY 2
TECHNICAL ROUND 1:
Questions from your resume are asked
- The entire OOPS was covered-
- Encapsulation
- Abstraction
- Inheritance
- Polymorphism
- Method overloading vs method overriding
- Can the main method of Java be overridden?
- Interface vs abstraction difference
- Difference between class and an object
- Real-time examples of OOPS
C++
- Difference between pointers and reference variables.
- Operators that cannot be overloaded in C++
- Exception handling
- Call by value vs call by reference
Javascript
- Difference between var and let
- Difference between “==” and “===”
- Event listeners in javascript
HTML and CSS
- Difference between div and span tag
- Write the tag for the unordered list
SQL
- Difference between having and where
- Representation of different joins- inner join, outer join, left join and right join.
TECHNICAL ROUND 2:
HTML and CSS:
- Box model in CSS
- Grid System in CSS
- Shorthand property in CSS
- @media and max-width
- How do you place a box in the middle of the page using CSS
Problem-solving
- num1 = [1,2,3,4]
num2 = [1,5,6]
o/p : [2,3,4,5,6] - Find the longest non-repeating sequence in a string
Queries in SQL using joins(Correlated queries)
Output-based questions in Javascript based on Shallow and deep copies of objects
HR round:
- Why trust race?
- Will you leave Trustrace if you get any other offers higher than Trustrace?
- Family background.