Company Name Starts with ...
#  A  B  C  D  E   F  G  H  I  J   K  L  M  N  O   P  Q  R  S  T   U  V  W  X  Y  Z

  • iGate aptitute test questions (6)
  • iGate interview questions (361)
  • iGate placement papers (3)
  • iGate technical test questions (14)



iGate Puzzles Interview Questions
Questions Answers Views Company eMail

Two trains at speed 60 km/hr comes in the opposite direction. At a particular time the distance between the two trains is 18km. A shuttle flies between the trains at the speed of 80 km/hr. At the time the two trains crashes what is the distance traveled by shuttle?

4 7112

What is the ten letter city 7 8 9 is a famous festival 3 4 5 is a degree 2 1 is a abbreviation of group of countries 7 6 gives the meaning?

11 12461

Post New iGate Puzzles Interview Questions



Un-Answered Questions

WHAT SHOULD BE THE BEST CURRENT RATINGS (PRIMARY / SECONDARY)FOR A CT INSTALLED AT THE INCOMING 11KV PANE? WILL IT BE CALCULATED ON THE BASES OF MAXIMUM DEMANT VALUE OR ON SUM OF ALL TRANSFORMER'S KVA? NOMALLY MAX DEMAND REPRESENT THE MAXIMUM OPERATING LOAD OF THE PLANT AND TOTAL KVA OF (SAY 5 NUMBERS TRANSFORMERS) REPRESENT THE CONNECTED LOAD. WHICH i.e. MAX DEMAND KVA OR CONNECTED KVA ARE BETTER TO USE FOR CT CURRENT CALCULATION? PLEASE ANSWER.

680


WHY THE DIMENSION OF TWO SAME RATED MACHINE IS DIFFERENT ?

739


How would you compare the computational power of a cortical pyramidal cell with that of a desktop computer?

992


In Stability testing if significant change occurs then what will be the action plan?

2189


Give the safety precaution when working in a high place.

847






Describe the trichromacy vs. opponency theories of color processing.

1267


DC transmission

834


How to check the Bushings of the transformer?

525


A mXn matrix is given and rows and column are sorted as shown below.Write a function that search a desired entered no in the matrix .with minimum complexity 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

2277


How do you communicate with TL / PM / Onsite team ?

1830


How can calculate the rating of a servo stabilizer for given a specific load

2269


How can all organisms share the same 4 bases DNA and still be so diverse?

1581


Do you like to Submit Questions in Bulk under Same Category?? Then use our Bulk ListerDo you like to Submit Questions in Bulk under Same Category?? Then use our Bulk Lister

852


How is the parity flag actually set in the 8085 microprocessor?

984


Technical Ability Test: This was difficult. three questions to be attempted in 60 min. The Coplete Technical Paper was as follows: Write the Pseudo code for the following: 1. Wrie a function which returns the most frequent number in a list of integers. Handle the case of more than one number which meets this criterion. public static int[] GetFrequency(int[] list) 2. Counting in Lojban, an artificial language developed over the last fourty years, is easier than in most languages The numbers from zero to nine are: 0 no 1 pa 2 re 3 ci 4 vo 5 mk 6 xa 7 ze 8 bi 9 so Larger numbers are created by gluing the digit togather. For Examle 123 is pareci Write a program that reads in a lojban string(representing a no less than or equal to 1,000,000) and output it in numbers. 3. Where now stands that small knot of villages known as the Endians, a mighty forest once stood. Indeed, legand has it that you could have stoodon the edge of the wood and seen it stretch out for miles, were it not for the trees getting in the way. In one section of the forest, the trees stood in a row and were of hight from 1 to n, each hight occurring once and once only. A tree was only visible if there were no higher trees before it in the row. For example, if the heights were 324165, the only visible trees would have been those of height 3,4 & 6. Write a Program that takes an array of integers representing the heights of the trees in the row as input and prints the list of the visible trees. //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// ////////////////// Ques1: Given an array containing k nos in the range 1..n and another scratch array of size n. Write an program to remove the duplicates from the array. Ques2: Given a table of the form: Product Sold on A 1/1/1980 B 1/1/1980 C 1/1/1980 A 1/1/1980 B 1/1/1980 C 2/1/1980 A 2/1/1980 There are 30 products and 10,000 records of such type. Also the month period during which sales happened is given to u. Write the program to display the result as: Product Month No. of copies A January 12 A February 15 A March 27 B January 54 B February 15 B March 10 C January 37 Ques3: Definition of priority queue was given. We have to implement the priority queue using array of pointers with the priorities given in the range 1..n. The array could be accessed using the variable top. The list corresponding to the array elements contains the items having the priority as the array index. Adding an item would require changing the value of top if it has higher priority than top. Extracting an item would require deleting the first element from the corresponding queue. The following class was given: Ques4: An array of size 5X5 is given to us. The elements from 1 to 25 are to be inserted in the array, such that starting from a particular position for an element i, the next element i+1can be inserted only at the mentioned positions (u,v), and if these all positions are occupied then it returns giving a count of how many positions have been occupied in the array: //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// ////////////////// Example: if the starting element is 1 with the given positions (1,2), then next element 2 can be placed at any one of the positions marked with *. _ _ _ _ _ 1 _ _ _ * _ _ _ _ _ _ _ * _ _ * _ _ _ _ 2. Four questions of programming in c++, questions were:( 1:30 hr) a) Bubble sort through recursion b) Display Pattern: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 … c) Perform the functionality of 2-D array through 1-D array and in it the functions to be performed were: (1) Display the array in 2-D format (2) Display a particular element (3) Display a particular row (4) Display a particular column d) Give an efficient program for string matching like: Text: this is the code in the text which you have to search by code Pattern: Code Count the no. of occurrences of the pattern to be searched //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////// ////////////////// a) suppose u r given a 4*3 rectangle like (take these values from user) Now u have to calculate the no. of squares in this rectangle like: No. of squares of dimension 1 is 12 No. of squares of dimension 2 is 6 No. of squares of dimension 3 is 2 No. of squares of dimension 4 is 0 Total no. of squares are 20. b) Suppose u r given a string. U have to find the occurance of the characters A-Z in that string. Each character must appear in the string and must appear only once. If It that occurs in string more than one time return 1 showing it is a perfect string otherwise return 0 showing it is not a perfect string. c) Suppose u r given 10000 marks. U have to pick up top 20 top marks from them and display it on the screen. (Use the optimal sorting algorithm) d) Suppose u have a chess board. U have to insert 8 queens on the chessboard in the style that the queens don’t intersect in the diagonals, columns and rows. If they intersect return 1 else return 0.(that is no more than one queen should be present either in row or column or diagonals.) If the queen is inserted at a position in the chessboard, its count is 1.

2624






iGate Puzzles Interview Questions
  • C (4)
  • C++ General (1)
  • Programming Languages AllOther (2)
  • JavaScript (2)
  • VB Script (4)
  • Networking Security (1)
  • Networking AllOther (1)
  • Visual Basic (1)
  • C Sharp (2)
  • ASP.NET (5)
  • Dot Net AllOther (7)
  • Microsoft Related AllOther (2)
  • Oracle General (3)
  • Oracle AllOther (1)
  • SQL Server (3)
  • DB Administration (4)
  • SQL PLSQL (6)
  • Databases AllOther (1)
  • Data Structures (1)
  • WinRunner (3)
  • Load Runner (3)
  • QTP (10)
  • Automation Testing AllOther (1)
  • Manual Testing (24)
  • QA Concepts (1)
  • Mobile Testing (1)
  • Test Cases (2)
  • Testing AllOther (1)
  • Servers AllOther (1)
  • COBOL (11)
  • JCL (8)
  • CICS (2)
  • DB2 (4)
  • VSAM (2)
  • IBM MainFrame AllOther (1)
  • RPG400 (9)
  • IBM AS400 AllOther (4)
  • Core Java (10)
  • Advanced Java (3)
  • EJB (1)
  • Servlets (5)
  • Struts (6)
  • Java J2EE AllOther (1)
  • Teradata (1)
  • Business Objects (7)
  • Cognos (10)
  • Informatica (23)
  • Ab Initio (1)
  • Data Stage (4)
  • Micro Strategy (5)
  • ETL (2)
  • Data Warehouse General (3)
  • HR Questions (3)
  • Project Planning (1)
  • SAP Basis (28)
  • SAP ABAP (6)
  • SAPScript (1)
  • SAP SD (19)
  • SAP FI CO (32)
  • SAP HR (1)
  • SAP CRM (1)
  • SAP Business Warehouse (4)
  • SAP Security (17)
  • SAP ALE IDocs (1)
  • SAP B1 (1)
  • Oracle Apps Technical (4)
  • Oracle Apps Financial (2)
  • Oracle Apps Manufacturing (1)
  • Oracle Apps SCM (8)
  • AI Fuzzy Logic (1)
  • AI General (2)
  • WebMethods (1)
  • Electrical Engineering (1)
  • Marketing Sales (1)
  • Banking Finance (2)
  • CompanyAffairs CS (1)
  • Accounting General (2)
  • Accounting AllOther (5)
  • Call Centre AllOther (3)
  • CDS (1)
  • General Aptitude (4)
  • Puzzles (2)
  • Placement Papers (3)
  • CCNA (1)
  • ISTQB Certification (1)
  • C++ Code (1)
  • C C++ Errors (1)