- Q Who played Sarah Conner in 1984s Terminator
- Q Mention the family, order of Swallower Fish?
- Q Why is it difficult to store linked list in an array?
- Q How do I prompt a "Save As" dialog for an accepted mime type?
- Q What are the features of risk management?
- Q What is gc (garbage collection) and how it works
- Q In 1887 who solved his first case
- Q Can you summarize the steps i have to go through in writing my first cgi?
- Q The smallest group that can have a coalition is a(n) __________-.
- 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.
- Q What is cardiogenic area