Skip to main content

Trimble

Date of visit: 8.9.2018

Online test

Section 1: It consisted of problem statement and sudo code was asked. TOC questions were also there.

Section 2: It consisted of aptitude questions with medium difficulty level.

Section 3: It consisted of 3 coding questions.
1-Sort the given string such that
Characters with prime ASCII(ASCII values that are prime numbers) should be sorted in ascending order and forms the beginning of the string ,followed by Characters with non-prime ASCII which should be sorted in descending order

Technical Interview-1

1) Given a string print characters and no. Of occurrences
Ex: Input :  DAABCFD
Output : D2A2B1C1F1
   I) Sort based on character
   II)Sort based on count

2) Write a program to print the mirror image of a binary tree

3) Write a program to find the middle element of a linked list(Collections.LinkedList should not be used)
1->2->3->4->5->Null output-3
    Interviewer modified the list such that the next pointer of node 5 points to node 3  and asked to edit the program so that it works for the above list as well..

4) Write a program to count the no. Of islands in a matrix using DFS
https://www.geeksforgeeks.org/find-number-of-islands/amp/

5) Print the matrix in Spiral form starting from the middle element

6) Explain Java Static keywords with  simple programs

Comments

  1. Prepare4testDecember 20, 2021 at 3:43 AM

    Prepare4Test the best and reliable platform where you can get accurate MAC-16A question dumps which will assist you in passing your ACMT 2016 MAC Service Certification Exam fast.

    ReplyDelete

Post a Comment

Popular posts from this blog

Sahaj - Online Test and Coding Round

Date of visit : 29/08/2018 Criteria        :  7.5 above First Round Duration : 40 minutes. The first round was a online test that had 50 multiple choice questions. The questions were very standard and covered everything like java, C, C++, Python, CSS, DBMS, OOPs, Networks, OS etc. After the first round 20 people were shortlisted for the second round. Second round Duration : 45 minutes  The second round was a coding round where we were given only one question. The objective of the round was not only to check whether the logic and code was correct but whether the students have used paradigms of the programming language they chose. for example, if we choose java to write our code we must have used OOPs principles. The question was to encode the given string in a format specified. Input : this is a secret procedure : 1. remove the spaces, s = thisisasecret 2. find the length of s, l  = 13 3. find w which is the ceil of sqrt of l,...
7 comments
Read more

Thorogood Associates - online test and Interview experience

Date of Visit : 18.08.2018 Criteria: CGPA 7.5 above, No current arrear First Round Duration: 1 hr This is an online round which had two parts,one is about essay writing,other one is about aptitude. Essay Writing Part had two questions,out of these 2 questions we have to write an essay on any one of the topic within 15 minutes. Question: What do you know about Thorogood and what will you do in your first year of Thorogood? Aptitude Part covered Data Interpretation,Logical Reasoning,Profit-Loss problem and other basics aptitude topics which are in R.S Agarwal Book ( link ) or else in IndiaBix ( link ) and this part lasted for next 45 minutes. Second Round Duration: 30 Minutes In this round,our communication,presentation skills and confidence level were tested. They asked us to explain any one of the projects that we mentioned in our resume. They checked whether we can present the project that we did in a professional way.
Post a Comment
Read more

Ninjacart - coding round

Platform: Hackerrank     The challenge comprised of three questions which were based on arrays and strings .. It may seem easy but the problems were little tricky to solve.. If one is strong enuf in those concepts, then solving them becomes piece of cake😋. I listed two problems(I ve forgot the third one) asked below: Question 1: Buy stocks .. problem link Question 2: Find the number of smooth pairs problem link
1 comment
Read more