Monthly Archives: February 2018



  • After submitting the enquiry, you will be contacted by our team.
  • Payilagam Team will get to know about your training needs.
  • They will update you how could they help you.
  • Trainers(IT Professionals) may contact you if you need any clarification.
  • Your contact information will be kept highly confidential & not be shared to 3rd Parties.
Quick Enquiry

ThinkPalm Technologies Fresher Interview Questions

Our candidates from Payilagam attended ThinkPalm Technologies Fresher Interview yesterday. In ThinkPalm Technologies, at first they test the technical and logical thinking ability of the candidates. For that, they conduct both Technical Written for 1 Hour and Normal Aptitude test for 20 minutes. There will be 50 Technical Aptitude questions and 20 Logical Aptitude Questions. The questions are not much tough. One notable point here is, technical questions are taken from all corners of IT. Some questions are from C language, few are from DBMS, a few questions from Software Testing. Thus, only candidates from IT or CSE background can clear the first round easily. ThinkPalm Technologies Fresher Interview Questions 1) Abbreviation of ACID (from DBMS) 2) Difference between Constant and Variable (Programming) 3) Which software model doesn’t allow changes. (Software Testing) 4) What is Black Box TestingĀ (Software Testing) 5) What is DML 6) Find the output for below program void add() { int a=5, b=-7, c=0, d; d= ++a && ++b || ++c; System.out.println(d); } 7) 10 years ago b is twice of a. Now, ratio of a and b is 3:4.what is the total value of a and b? 8) The average of 20 numbers is zero. Of them, at the most, how many may be greater than zero? Please note, though the questions are not much tougher ones, they mentioned that for every incorrect answer – there will be 0.25 negative mark applied.

By |February 21st, 2018|Blogs|0 Comments

RGS Construction Technologies Interview Question with Answer – 1

Hi, Last week, one of our trainees attended Interview in RGS Construction Technologies in Chennai. They focus mainly on the logical thinking and ability of the candidates. It is a good approach to find out good programmers. One Interview question asked there to find out Longest Bitonic Subsequence. Hope you understand the below program. Comments are added then and there in the program itself to understand clearly. For time being, it is taken from geeksforgeeks, as they have similar, straight forward question in their portal. class LongestBitonicSubsequence { /* lbs() returns the length of the Longest Bitonic Subsequence in arr[] of size n. The function mainly creates two temporary arrays lis[] and lds[] and returns the maximum lis[i] + lds[i] – 1. lis[i] ==> Longest Increasing subsequence ending with arr[i] lds[i] ==> Longest decreasing subsequence starting with arr[i] */ static int lbs( int arr[], int n ) { int i, j; /* Allocate memory for LIS[] and initialize LIS values as 1 for all indexes */ int[] lis = new int[n]; for (i = 0; i < n; i++) lis[i] = 1; /* Compute LIS values from left to right */ for (i = 1; i < n; i++) for (j = 0; j < i; j++) if (arr[i] > arr[j] && lis[i] < lis[j] + 1) lis[i] = lis[j] + 1; /* Allocate memory for lds and initialize LDS values for all indexes */ int[] lds = new int [n]; for (i = 0; i < n; i++) lds[i] = 1; /* Compute LDS values from right to left */ for (i = n-2; i >= 0; i–) for (j = n-1; j > i; j–) if (arr[i] > arr[j] && lds[i] < lds[j] […]

By |February 20th, 2018|Blogs|0 Comments