Upload Button Icon Add office photos

Filter interviews by

Trimble Java Developer Interview Questions and Answers

Updated 29 Nov 2024

Trimble Java Developer Interview Experiences

4 interviews found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Oct 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Exception Handling
  • Q2. Collections and Streams
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(2 Questions)

  • Q1. Tell me About your project
  • Ans. 

    Developed a web application for online shopping with features like user authentication, product search, and order management.

    • Used Java Spring framework for backend development

    • Implemented RESTful APIs for communication between frontend and backend

    • Utilized MySQL database for storing user and product information

  • Answered by AI
  • Q2. Explain what is spring security
  • Ans. 

    Spring Security is a powerful and customizable authentication and access control framework for Java applications.

    • Provides authentication and authorization mechanisms for Java applications

    • Supports various authentication methods like form-based, basic, OAuth, etc.

    • Allows for role-based access control and custom security configurations

    • Integrates seamlessly with Spring Framework for easy implementation

  • Answered by AI

Skills evaluated in this interview

Java Developer Interview Questions Asked at Other Companies

asked in Deloitte
Q1. Sort 0 and 1 Problem Statement Given an integer array ARR of size ... read more
Q2. Parent class has run() and walk() . Parent run() - calls walk() C ... read more
asked in Infosys
Q3. Which should be preferred between String and StringBuffer when th ... read more
asked in Deloitte
Q4. Convert BST to Greater Sum Tree Given a Binary Search Tree (BST) ... read more
Q5. 2. What will happen if hashcode only returns a constant? How will ... read more
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Exception Handling
  • Q2. Collections and Streams

I applied via Naukri.com and was interviewed before Mar 2021. There were 2 interview rounds.

Round 1 - HR 

(4 Questions)

  • Q1. Share details of your previous job.
  • Q2. Why are you looking for a change?
  • Q3. Where do you see yourself in 5 years?
  • Q4. Tell me about yourself.
Round 2 - Coding Test 

Java program in data structure

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare core java well, data structures, oops

Trimble interview questions for designations

 Developer

 (1)

 Software Developer

 (2)

 Software Engineer

 (3)

 Network Engineer

 (1)

 AWS Devops Engineer

 (1)

 Senior Software Engineer

 (1)

 Senior QA Engineer

 (1)

 Devops Engineer

 (1)

Interview questions from similar companies

Software Developer Interview Questions & Answers

PTC user image Snehal Jaipurker

posted on 18 Sep 2017

I was interviewed in Jul 2017.

Interview Questionnaire 

6 Questions

  • Q1. Code to print * in five consecutive lines
  • Ans. 

    Code to print * in five consecutive lines

    • Use a loop to iterate five times

    • Inside the loop, print a string containing a single * character

  • Answered by AI
  • Q2. A ball is left from a height of 10 meters. After bouncing first time it looses 10% of its previous height the next time it bounces. Write a code to calculate the number of bounces the ball goes through unt...
  • Ans. 

    Code to calculate number of bounces a ball goes through until it comes to rest.

    • Use a loop to simulate the bounces until the ball stops bouncing

    • Calculate the height of each bounce using the given formula

    • Keep track of the number of bounces in a counter variable

  • Answered by AI
  • Q3. Which is the best and less time consuming way to calculate factorial of a number?
  • Ans. 

    The best and less time consuming way to calculate factorial of a number is using iterative approach.

    • Iteratively multiply the number with all the numbers from 1 to the given number

    • Start with a result variable initialized to 1

    • Multiply the result with each number in the range

    • Return the final result

  • Answered by AI
  • Q4. Write the code to find factorial using function recursion.
  • Ans. 

    Code to find factorial using function recursion

    • Define a function that takes an integer as input

    • Check if the input is 0 or 1, return 1 in that case

    • Otherwise, call the function recursively with input-1 and multiply it with the input

  • Answered by AI
  • Q5. They asked for my introduction.
  • Q6. They asked about my family members.

Interview Preparation Tips

Round: Test
Experience: Aptitude test was moderately tough. The coding test was on basics of c language of all the topics.
Tips: Solving R. S. Agrawal for Aptitude and videos on YouTube on C language are sufficient to score well.
Duration: 1 hour
Total Questions: 60

Round: Technical Interview
Experience: I wrote the first code correctly. I wrote the second code 75% correct and they explained me my mistakes and I could understand where I was going wrong then I corrected my code and then they were satisfied. They asked me whether I could write the factorial code by function recursion method. I replied that I can write the factorial code but not by function recursion method. They were satisfied.
Tips: Build your coding skills by more practice.

Round: HR Interview
Experience: In this round they just asked me my introduction and said that you are shortlisted for now but we will give you final confirmation after a week.
Tips: Don't lie. Be genuine.

College Name: SCOE, PUNE

Skills evaluated in this interview

Interview Questionnaire 

9 Questions

  • Q1. Tree questions related like traversal?
  • Q2. Locate the sum of 2 numbers in a linear array (Unsorted and sorted) and their complexities
  • Ans. 

    Locate sum of 2 numbers in a linear array (unsorted and sorted) and their complexities

    • For unsorted array, use nested loops to compare each element with every other element until the sum is found

    • For sorted array, use two pointers approach starting from the beginning and end of the array and move them towards each other until the sum is found

    • Complexity for unsorted array is O(n^2) and for sorted array is O(n)

  • Answered by AI
  • Q3. Pointers with increment/decrement, address of and value at operators (++,–,*,&)
  • Ans. 

    Pointers are used to manipulate memory addresses and values in C++. Increment/decrement, address of and value at operators are commonly used.

    • Incrementing a pointer moves it to the next memory location of the same data type

    • Decrementing a pointer moves it to the previous memory location of the same data type

    • The address of operator (&) returns the memory address of a variable

    • The value at operator (*) returns the value sto

  • Answered by AI
  • Q4. A point and a rectangle is present with the given coordinates. How will you determine whether the point is inside or outside the rectangle?
  • Ans. 

    To determine if a point is inside or outside a rectangle, we check if the point's coordinates fall within the rectangle's boundaries.

    • Check if the point's x-coordinate is greater than the left edge of the rectangle

    • Check if the point's x-coordinate is less than the right edge of the rectangle

    • Check if the point's y-coordinate is greater than the top edge of the rectangle

    • Check if the point's y-coordinate is less than the b...

  • Answered by AI
  • Q5. There is a point inside the rectangle. How will you determine the line that passes through the point and divides the rectangle into 2 equal halves?
  • Ans. 

    To find line that divides rectangle into 2 equal halves through a point inside it.

    • Find the center of the rectangle

    • Draw a line from the center to the given point

    • Extend the line to the opposite side of the rectangle

    • The extended line will divide the rectangle into 2 equal halves

  • Answered by AI
  • Q6. There is a scheme which contains 8-bit and 16-bit signed numbers. How many such combinations are possible?
  • Ans. 

    There are multiple combinations of 8-bit and 16-bit signed numbers. How many such combinations are possible?

    • There are 2^8 (256) possible combinations of 8-bit signed numbers.

    • There are 2^16 (65,536) possible combinations of 16-bit signed numbers.

    • To find the total number of combinations, we can add the number of combinations of 8-bit and 16-bit signed numbers.

    • Therefore, the total number of possible combinations is 256 +

  • Answered by AI
  • Q7. You are given an array of elements. Some/all of them are duplicates. Find them in 0(n) time and 0(1) space. Property of inputs – Number are in the range of 1..n where n is the limit of the array
  • Ans. 

    Find duplicates in an array of elements in 0(n) time and 0(1) space.

    • Use the property of inputs to your advantage

    • Iterate through the array and mark elements as negative

    • If an element is already negative, it is a duplicate

    • Return all the negative elements as duplicates

  • Answered by AI
  • Q8. Given a array of digits. print all combination of of these i.e all no formed by these. repetition allowed. and then repetition not allowed example: i/p: arr={1,2,3} o/p: (without repetition) 123, 132, 213,...
  • Q9. Questions on project

Interview Preparation Tips

Round: Test
Duration: 90 minutes
Total Questions: 3

Round: HR Interview
Experience: HR interview was all about my projects, my background and a few more typical HR questions. It was pretty easy to answer them.

Skills: Algorithm, Data structure, C++
College Name: IIT ROORKEE

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Sep 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

Aptitude Java CI/CD DevOps Unit testing HTML CSS

Round 3 - Technical 

(1 Question)

  • Q1. Technical questions same as above Puzzles to assess problem solving abilities
Round 4 - HR 

(1 Question)

  • Q1. General questions around CTC and expectations
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Apr 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

Test was simple basic coding questions

Round 3 - Coding Test 

Codes were also easy to medium level

Round 4 - Technical 

(1 Question)

  • Q1. All fundamentals of OOPS, SQL, basic DSA Web dev Qs Internship related Qs and Project based Totally resume based

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare your resume well and be clear with technical fundamentals

I was interviewed in Aug 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 75 minutes
Round difficulty - Medium

This was an online coding round where I had 2 questions to solve under 75 minutes. Both the coding questions were related to DP and were of Medium to Hard level of difficulty.

  • Q1. 

    Longest Common Prime Subsequence Problem Statement

    Imagine Ninja is tackling a puzzle during his long summer vacation. He has two arrays of integers, each with lengths 'N' and 'M'. Ninja's task is to dete...

  • Ans. 

    Find the length of the longest subsequence common to two arrays consisting only of prime numbers.

    • Iterate through both arrays to find prime numbers

    • Use dynamic programming to find the longest common subsequence

    • Consider edge cases like empty arrays or no common prime numbers

  • Answered by AI
  • Q2. 

    Maximum Sum Problem Statement

    You are given an array ARR of N integers. Your task is to perform operations on this array until it becomes empty, and maximize the sum of selected elements. In each operatio...

  • Ans. 

    Given an array, select elements to maximize sum by removing adjacent elements. Return the maximum sum.

    • Iterate through the array and keep track of the frequency of each element.

    • Select the element with the highest frequency first, then remove adjacent elements.

    • Repeat the process until the array becomes empty and calculate the sum of selected elements.

  • Answered by AI
Round 2 - Video Call 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This round had 2 Algorithmic questions wherein I was supposed to code both the problems after discussing their approaches and respective time and space complexities . After that , I was grilled on some OOPS concepts related to C++.

  • Q1. 

    Cycle Detection in a Linked List

    Your task is to determine if a given Singly Linked List of integers forms a cycle.

    Explanation: A cycle in a linked list occurs when there is a node in the list that conn...

  • Ans. 

    Detect if a given singly linked list of integers forms a cycle.

    • Use Floyd's Tortoise and Hare algorithm to detect cycle in linked list

    • Maintain two pointers, one moving at double the speed of the other

    • If they meet at some point, there is a cycle in the linked list

  • Answered by AI
  • Q2. 

    Check If Preorder Traversal Is Valid

    Determine whether a given array ARR of positive integers is a valid Preorder Traversal of a Binary Search Tree (BST).

    A binary search tree (BST) is a tree structure w...

  • Ans. 

    Check if a given array of positive integers is a valid Preorder Traversal of a Binary Search Tree (BST).

    • Create a stack to keep track of nodes.

    • Iterate through the array and compare each element with the top of the stack.

    • If the current element is less than the top of the stack, push it onto the stack.

    • If the current element is greater than the top of the stack, pop elements from the stack until a greater element is found ...

  • Answered by AI
  • Q3. What are Vtable and VPTR in C++?
  • Ans. 

    Vtable and VPTR are used in C++ for implementing polymorphism through virtual functions.

    • Vtable (Virtual Table) is a table of function pointers used to implement dynamic dispatch for virtual functions.

    • VPTR (Virtual Pointer) is a pointer that points to the Vtable of an object.

    • Vtable is created by the compiler for each class that has virtual functions.

    • VPTR is added as a hidden member in each object of a class with virtual...

  • Answered by AI
  • Q4. What are friend functions in C++?
  • Ans. 

    Friend functions in C++ are functions that are not members of a class but have access to its private and protected members.

    • Friend functions are declared inside a class with the keyword 'friend'.

    • They can access private and protected members of the class.

    • They are not member functions of the class, but have the same access rights as member functions.

    • Friend functions are useful when you want to allow a function external to

  • Answered by AI
Round 3 - Video Call 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was also a DS/Algo round where I was given 2 questions to solve and I was expected to come up with the optimal approach as far as possible. I solved both the questions with the optimal time and space complexities and then I was asked some more questions related to DBMS towards the end of the interview.

  • Q1. 

    Top View of a Binary Tree

    You are given a binary tree. Your task is to print the Top View of the Binary Tree, displaying the nodes from left to right order.

    Input:

    The first line contains an integer 't'...
  • Ans. 

    The task is to print the Top View of a Binary Tree from left to right order.

    • Use a map to store the horizontal distance of each node from the root.

    • Perform a level order traversal of the tree and keep track of the horizontal distance of each node.

    • Print the nodes in the map in ascending order of their horizontal distance.

    • Handle the case where multiple nodes have the same horizontal distance by printing the one that appear

  • Answered by AI
  • Q2. 

    Count Palindromic Substrings Problem Statement

    Given a string STR, determine the total number of palindromic substrings within STR.

    Input:

    The first line contains an integer 't' representing the number ...
  • Ans. 

    Count the total number of palindromic substrings in a given string.

    • Iterate through each character in the string and expand around it to find palindromic substrings.

    • Use dynamic programming to store previously calculated palindromic substrings.

    • Consider both odd and even length palindromes while counting.

    • Example: For input 'abbc', palindromic substrings are ['a', 'b', 'b', 'c', 'bb']. Total count is 5.

  • Answered by AI
  • Q3. What is the difference between the DELETE and TRUNCATE commands in a DBMS?
  • Ans. 

    DELETE removes specific rows from a table, while TRUNCATE removes all rows and resets auto-increment values.

    • DELETE is a DML command, while TRUNCATE is a DDL command.

    • DELETE can be rolled back, while TRUNCATE cannot be rolled back.

    • DELETE triggers delete triggers, while TRUNCATE does not trigger any triggers.

    • DELETE is slower as it maintains logs, while TRUNCATE is faster as it does not maintain logs.

    • Example: DELETE FROM t

  • Answered by AI
  • Q4. What is meant by normalization and denormalization?
  • Ans. 

    Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity, while denormalization is the process of intentionally introducing redundancy to improve performance.

    • Normalization involves breaking down a table into smaller tables and defining relationships between them to reduce redundancy and dependency.

    • Denormalization involves combining tables and duplicating data to impr...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPACadence Design Systems interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
Not Selected
Round 1 - Technical 

(2 Questions)

  • Q1. What is oops, Mostly Debugging Questions
  • Q2. Pointers, Memory Allocation

Trimble Interview FAQs

How many rounds are there in Trimble Java Developer interview?
Trimble interview process usually has 1-2 rounds. The most common rounds in the Trimble interview process are Technical, HR and Coding Test.
How to prepare for Trimble Java Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Trimble. The most common topics and skills that interviewers at Trimble expect are Coding, JQuery, Javascript, Linux and SQL.
What are the top questions asked in Trimble Java Developer interview?

Some of the top questions asked at the Trimble Java Developer interview -

  1. Explain what is spring secur...read more
  2. Collections and Stre...read more
  3. Exception Handl...read more

Tell us how to improve this page.

Trimble Java Developer Interview Process

based on 3 interviews

Interview experience

4
  
Good
View more

Trimble Java Developer Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

5.0

Salary

5.0

Job security

5.0

Company culture

5.0

Promotions

5.0

Work satisfaction

Explore 1 Review and Rating
Senior Software Engineer
106 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
104 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
68 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior GIS Analyst
63 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Lead Software Engineer
61 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Trimble with

Bentley Systems

4.3
Compare

Autodesk

4.2
Compare

ESRI India Technologies

3.9
Compare

Hexagon AB

4.2
Compare
Did you find this page helpful?
Yes No
write
Share an Interview