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

  • Cap Gemini aptitute test questions (31)
  • Cap Gemini interview questions (1089)
  • Cap Gemini placement papers (1)
  • Cap Gemini technical test questions (46)



Cap Gemini Dot Net AllOther Interview Questions
Questions Answers Views Company eMail

Which Binding best suits where a WCF Service and the client application resides in the same machine?

2 3984

Post New Cap Gemini Dot Net AllOther Interview Questions




Un-Answered Questions

whats is mean by connectionpooling

737


WHERE CAN I GET SQL SERVER NOTES SOFT COPY?

543


IS THERE IS ANY EXUMTION FOR THE NEW CONCER TO NOT THE DEDUCT TDS IN THE 1st YEAR OF ITS INCORPORATION IF THE TURNVOER EXEED THE SPECIFIED LIMIT IN THE 1st YEAR.

1020


any from electronics proffesional i want to generate 12v automotive voltage regulator in the latest technology plz provide me some technical notes on it.

666


can any one find and tell the difference between dot net and php which one is best ? which one we get more salary? which one is stable and which one is best for freshers and also better in future and carrer ? which one we wil get more salary sir ? please send ur valuable suggestions to kiranpulsar2007@gmail.com

691






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.

2453


what is deemed sales? how to calculated

861


what is PWM in IGBT and how it works for drive.?

347


I am working in footwear company at Himachal Pradesh. we want to send raw material - (leather) for Job work our other branch. now my question is that will have we any permission taken from excise & sale tax deppt.

3002


What is Mikrotik Nstreme or Ubiquiti AirMAX modes?

578


. what are insurance items?

901


Hello,I would like to know the Technical Test Queries for B.P.O.So please reply to my queries at your earliest possibility.

888


There is only requirements document. You have 10 days and 8 resources to release the system.At the end of the 8th day u tell ur TL that system is ready for release. How will you proceed with the testing process or in other words what all approach you will follow once you get requirements

638


How can data caching have a negative effect on load testing results?

1460


HOW LIGHTENING PROTECTION IS DONE ON ROOF OF SQUARE SHAPE AND HAVE PARTUCULARLY BIG SURFACE AREA.

611






Cap Gemini Dot Net AllOther Interview Questions
  • C (2)
  • OOPS (2)
  • C++ General (1)
  • COM DCOM (2)
  • VC++ AllOther (1)
  • Programming Languages AllOther (2)
  • CGI Perl (1)
  • VB Script (10)
  • Shell Script (4)
  • UDP (1)
  • Networking AllOther (1)
  • Visual Basic (1)
  • C Sharp (1)
  • ASP.NET (6)
  • Crystal Reports (1)
  • BizTalk (1)
  • Dot Net Framework (3)
  • Dot Net AllOther (1)
  • Exchange Server (1)
  • Oracle General (9)
  • Database Management (2)
  • Forms Reports (1)
  • Oracle AllOther (4)
  • SQL Server (18)
  • MySQL (1)
  • DB Administration (2)
  • SQL PLSQL (15)
  • Databases AllOther (1)
  • Linux AllOther (1)
  • Unix Commands (3)
  • Unix General (4)
  • Unix AllOther (1)
  • Solaris AllOther (3)
  • Operating Systems General Concepts (1)
  • WinRunner (1)
  • Load Runner (3)
  • QTP (40)
  • Test Director (1)
  • Selenium (1)
  • Automation Testing AllOther (1)
  • Manual Testing (83)
  • QA Concepts (15)
  • Mobile Testing (1)
  • Test Cases (7)
  • Test Documents Reporting (1)
  • Testing AllOther (19)
  • COBOL (21)
  • JCL (16)
  • CICS (14)
  • DB2 (31)
  • IMS (2)
  • Natural (1)
  • MVS (1)
  • VSAM (5)
  • RPG400 (8)
  • COBOL400 (1)
  • DB400 (3)
  • Core Java (17)
  • Advanced Java (5)
  • Swing (1)
  • Struts (2)
  • JDBC (1)
  • Weblogic (2)
  • Java J2EE AllOther (4)
  • Java Related AllOther (4)
  • MQSeries (2)
  • Middleware AllOther (1)
  • SOAP (1)
  • Teradata (9)
  • Business Objects (17)
  • Cognos (24)
  • Informatica (67)
  • Ab Initio (2)
  • Data Stage (19)
  • SAS (3)
  • ETL (4)
  • Data Warehouse General (2)
  • HR Questions (5)
  • WiFi Security (1)
  • SAP Basis (27)
  • SAP ABAP (108)
  • SAPScript (3)
  • SAP SD (96)
  • SAP MM (16)
  • SAP PP (2)
  • SAP FI CO (63)
  • SAP HR (27)
  • SAP CRM (55)
  • SAP APO (1)
  • SAP Business Warehouse (9)
  • SAP Security (19)
  • SAP Netweaver (1)
  • SAP ALE IDocs (2)
  • SAP B1 (1)
  • SAP Business Objects BO BOBJ (1)
  • CRM General (1)
  • Siebel (14)
  • Oracle Apps Technical (11)
  • Oracle Apps Financial (18)
  • Oracle Apps Manufacturing (1)
  • Oracle Apps HRMS (1)
  • Oracle Apps SCM (6)
  • WebMethods (10)
  • TIBCO (1)
  • Mechanical Engineering (2)
  • Electrical Engineering (4)
  • Electronics Communications (2)
  • Engineering AllOther (3)
  • Marketing Sales (2)
  • Banking Finance (3)
  • Audit (2)
  • Taxation (3)
  • Accounting General (14)
  • Accounting AllOther (15)
  • Call Centre AllOther (3)
  • BSRB AllOther (1)
  • Everything Else AllOther (1)
  • English (2)
  • General Aptitude (24)
  • Placement Papers (1)
  • CCNA (1)
  • Certifications AllOther (1)
  • H1B Visa (2)
  • USA Student Visa F1 Visa (1)
  • L1 Visa (2)
  • USA Business Visa B1 Visa (1)
  • USA Dependent Visa H4 Visa (2)
  • C Code (1)
  • Programming Code AllOther (1)
  • Oracle Errors (1)
  • MySQL Errors (1)