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

  • EXL aptitute test questions (5)
  • EXL interview questions (60)
  • EXL placement papers (2)



EXL COBOL Interview Questions
Questions Answers Views Company eMail

What are ISOLATION LEVELS? Where do we need to specify them?

3 6072

Post New EXL COBOL Interview Questions



Un-Answered Questions

If specific gravity of cement is less than 3.15 what is the cause?

878


General Ledger Process flow

2997


How to configure TMS?

587


What are the new features of Framework 1.1 ?

2090


Senior engineer's please help me, what is Loop Checking and Loop test? and write difference also? soon urgent

862






plz tll me wch area i will prepare 4 IOCL EXAM............

851


How do you map org. structure?

945


What is the output power of a BTS, in dbm &watts if trx=2+2+2... if trx=4+4+4..

1458


At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with these names could be kept in that shelf as in this example: bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf. All these packets are to be loaded on cars. The cars are lined in order, so that the packet could be loaded on them. The cars are also named [A, B, C, D, E,………….]. Each Car will load the packet with the same alphabet. So, for example, car ‘A’ will load all the packets with name ‘A’. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car ‘B’ will come and take all the packets with name ‘B’ from the shelf, then car ‘C’ will come. No matter how deep in the shelf any packet ‘B’ is, all of the ‘B’ packets will be displaced before the ‘C’ car arrives. For that purpose, some additional shelves are provided. The packets which are after the packet B, are kept in those shelves. Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name X is in it, then only the packets having names X will be kept in it. That shelf will look like [XXXXXXX]. If any shelf is used once, then it could be used again only if it is vacant. Packets from the initial shelf could be unloaded from top only. Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.

974


what's accounts payable

8169


 What is TraceSQL?  TracePC?  TracePPR? TraceAE?  Where is this set?  How do you set the values?

775


write a progrmm in c language take user interface generate table using for loop?

820


why choose compter science chourse

942


Define the overload capacity of the motor?

811


how service tax work.

1121






EXL COBOL Interview Questions
  • Dot Net Framework (1)
  • Test Cases (1)
  • COBOL (1)
  • RPG400 (1)
  • Informatica (1)
  • SAS (2)
  • HR Questions (1)
  • SAP HR (1)
  • Oracle Apps Technical (1)
  • Mechanical Engineering (1)
  • Banking Finance (1)
  • Human Resources (1)
  • Taxation (3)
  • Accounting General (5)
  • Accounting AllOther (1)
  • Call Centre AllOther (38)
  • POs (1)
  • General Knowledge_Current Affairs (1)
  • Law AllOther (1)
  • General Aptitude (1)
  • Puzzles (1)
  • Placement Papers (2)