- Q What type of group is not available in a domain that is running at the mixed-mode functional level
- Q Where do we store db configuration and how can we change that ?
- Q The technique in which the people create picture of collage or other drawings to depict consumer's perceptions is called
- Q What are the 3 levels that a customer master record can be maintained at? Why do these three levels exist? Give an example of the information stored on these levels.
- Q Manas wildlife sanctuary is located in which state-
- Q What is black box testing?
- Q How do I fix the ::$DATA bug?
- Q What command is used to create the credential store?
- Q List the different kinds of dhcp messages?
- Q Name the commands used to pause and un-pause(resume) an instance
- Q Partitioning You have "n" numbers having values from 1 to n. You have to write a code to partition it into "m" groups such that sum of numbers in each group is equal to n*(n+1)/(2*m). Assume that numbers n and m are such that n*(n+1)/(2*m) is an integer. Your program should print out the numbers in each group. Or if it is not possible to partition the numbers into m groups, then print out that its not possible. Example : n=20 and m=3 Group 1 : 1,8,11,13,18,19 Group 2 : 2,5,12,14,17,20 Group 3 : 3,4,6,7,9,10,15,16 Input: Two integers n,m. Output: Print out to the screen the numbers in each group in a differnt line. Testing: We will run atleast 5 test cases for this problem. So if you cannot write a generalised code which will take care of all n and m, you can try to write codes based on specific conditions.