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

  • Aspire aptitute test questions (1)
  • Aspire interview questions (34)
  • Aspire technical test questions (3)



Aspire Call Centre AllOther Interview Questions
Questions Answers Views Company eMail

how should we start our self introduction.what is the sequence should we follow.like after our name then what we have to say.

41 510673

Post New Aspire Call Centre AllOther Interview Questions



Un-Answered Questions

what happen ehen synchronisation is done at below rated speed

824


When we are recording in WinRunner and interact with the AUT, what does WinRunner do?

783


I want to do certification in ISTQB please anybody hepl me with the details and site to refer for further details.............if possible give me the material as well on my mail id a.vishwakarma@aol.com. Please help me........Thanks

815


What are the Win Runner tools for functional testing?

1748


Hi all, If Anybody has Advance SAS Certification dumps??? Please share with me. Email: pramod.kalugade03@gmail.com

879






which of the following is not a coding defect? Option 1 Test harness defect Option 2 Data flow defect Option 3 Initialisation defect Option 4 Algorithmic defect

837


What is Profir/Earning Before Tax and Profit after tax any one explaint this Clearly.

845


how we will change our low living standard ?

874


How do you integrate HR (employee) with PP?

293


Budgets are standing plans Policy is a single use plan Explain.

2487


You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

1931


important questions about sip and ims protocols

8946


Why is the Heliconia Caribaea flower called Prince of Darkness?

971


How to design pavement quality concrete by using C.R.C.P Method

544


How will you justify IR value and Charging voltage of any motor,transformer and Cables.......???? . . . . . . . . Plz tell me any body Baljeet Singh, engineer_89@refiff.com

775






Aspire Call Centre AllOther Interview Questions
  • C (2)
  • OOPS (2)
  • MFC (1)
  • CGI Perl (1)
  • VB Script (2)
  • SQL Server (1)
  • MySQL (1)
  • SQL PLSQL (2)
  • Bulnex (1)
  • Operating Systems AllOther (1)
  • QTP (4)
  • Manual Testing (15)
  • Core Java (1)
  • Electrical Engineering (1)
  • Call Centre AllOther (1)
  • APPSC AllOther (1)
  • General Aptitude (1)