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

  • CMS aptitute test questions (2)
  • CMS interview questions (70)
  • CMS placement papers (1)
  • CMS technical test questions (16)



CMS General Aptitude Interview Questions
Questions Answers Views Company eMail

What are Active X controls

1 3613

aptitude question

1 2716

Post New CMS General Aptitude Interview Questions



Un-Answered Questions

How can we copy attributes(selected only) from Campiagn to Marketing.

1443


What are all the Extended services provided by the OS?

1460


How use Budget in SAP, i want to see the report of variant between budget and actuals.

708


can we define 2 different currency revaluation at a time??

1105


In a beam,stirrups are placed closely at ends than at centre due to shear.similarly where would ties be closer to each other-at center or at ends in a column and slab.

2094






What is log shipping? Can we do logshipping with SQL Server 7.0 - Logshipping is a new feature of SQL Server 2000. We should have two SQL Server - Enterprise Editions. From Enterprise Manager we can configure the logshipping. In logshipping the transactional log file from one server is automatically updated into the backup database on the other server. If one server fails, the other server will have the same db and we can use this as the DR (disaster recovery) plan.

1576


Hello everyone! I am just writing a small test for a windows application. I have a problem with a text output value. The value i am trying to catch is presented in a scrollable textbox. When the text is too long, only a portion of it gets captured. Do you have any experience with this?

1390


What happen when the expansion valve is excessively open?

662


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 }

1884


describe the most complex challenge that you have faced and how you managed it

991


how to relay switch sense the fault?

1279


What is different between Difnit time and instatous over current relay

961


My gre score is 283 and ielts is 5.5, will i get i20 for this score

267


How to create a gateway?

4094


I have a job interview and I will be asked 1)-in depth multi carrier EVDO 2)-Traffic/Capacity engineering Any help is highly appreciated!

1295






CMS General Aptitude Interview Questions
  • C (1)
  • C++ General (1)
  • PHP (1)
  • Programming Languages AllOther (1)
  • Protocols AllOther (1)
  • Networking Administration (3)
  • Networking AllOther (5)
  • ASP.NET (1)
  • Exchange Server (2)
  • Microsoft Related AllOther (18)
  • SQL Server (2)
  • Windows General (3)
  • Windows AllOther (1)
  • Solaris Commands (1)
  • Manual Testing (2)
  • Servers AllOther (1)
  • HR Questions (2)
  • VoIP IP Telephony (1)
  • Telecom General (1)
  • SAP SD (2)
  • Civil Engineering (1)
  • Mechanical Engineering (1)
  • Electronics Communications (3)
  • Engineering AllOther (2)
  • IT Management (2)
  • Taxation (1)
  • Accounting AllOther (2)
  • Call Centre AllOther (2)
  • RRB (2)
  • Everything Else AllOther (7)
  • General Aptitude (2)
  • Placement Papers (2)
  • CCNA (7)
  • Microsoft Certifications (4)
  • Certifications AllOther (1)