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

Convergys C Interview Questions
Questions Answers Views Company eMail

we have a 3litres jug and a 5 litres jug and no measures on them. using these two jugs how can we measure 4 litres of water?

2 5153

Write the program with at least two functions to solve the following problem. The members of the board of a small university are considering voting for a pay increase for their 10 faculty members. They are considering a pay increase of 8%. Write a program that will prompt for and accept the current salary for each of the faculty members, then calculate and display their individual pay increases. At the end of the program, print the total faculty payroll before and after the pay increase, and the total pay increase involved.

2624

Post New Convergys C Interview Questions




Un-Answered Questions

What are the cascade types in hibernate?

151


What is the difference between mvc and asp.net? : Asp.Net MVC

458


What is the Self & starter? what does it do in the in Genset

1728


hw will u use awk in replacing cahrs and files

2707


When does a 'this' pointer get created?

596






How to increase the size of splunk data storage?

134


What is the meaning of value in excel?

271


sale cycle

1471


Mention the rules for using option explicit statement?

463


What are the different types of validation used in jsf?

76


Explain me how many different media queries are used by the bootstrap grid system by default?

3


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 }

2684


What is the advantage of cassandra?

61


What is isolation levels?

546


What is a Bluetooth dongle?

1748