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

PGVCL Paschim Gujarat Vij Company Limited Interview Questions
Questions Answers Views Company eMail

. Which rights was described as the ‘heart and soul of the constitution’ by Dr. B.R. Ambedkar? (1) Right to property (2) Right to equality (3) Right to freedom of religion (4) Right to constitutional remedies

15 120142

transformer cooling fan kharab ho jaye to 1-off kar dena chahiye 2-load kum kar dena chahiye 3-koi frrk nhi padta 4-sub galat hai. choose right option

2 2486

RESISTONS R1 AND R2 in parallel = Total R.? 1-R=R1+R2 2-R=1/R1 + 1/R2 3-1/R + R1+R2 R=R1R2/R1+R2 select one

2 3373

The magnitude of sum of two sinusoidal av voltage is equal to 230 volt.the magnitude of each individual voltage is also equal to 230 volt.what must be the phase difference between voltages?

1142

Post New PGVCL Paschim Gujarat Vij Company Limited Interview Questions




Un-Answered Questions

What is the difference between internal and private in c#?

476


I'm facing a problem while posting a transaction, the errors showing "withholding tax amount exceed the total line item." I know the anmount calculated is more than the Base amount itself. But as i'm not a FI candidate, I want to know from where I have to change so that I can do the transaction, condition is that I cannot change any rate and code of ewt tax. Pls. help me out, it's urgent.

1350


What do you mean by foldleft in scala?

1


WHAT IS THE TOTAL HEAT RATE OF PLANT AND WHAT IS THE HEAT RATE OF BOILER?

1656


Project 2 - Magic Squares design2.txt - due 12/7 before 11:59 PM project2 - due 12/13, before 11:59 PM Orginally by Sue Evans Hit the space bar for next page The Objectives The purpose of this assignment is to give you practice with: recursion using command line arguments using the timing feature and file handling. The Background According to The Math Forum @ Drexel University, A Magic Square is an arrangement of the numbers 1 to n2 in an n x n matrix with each number occuring exactly once, and such that the sum of the entries of any row, any column, or any main diagonal is the same. It is not hard to show that this sum is n(n2 + 1)/2. The simplest magic square is the 1 x 1 magic square whose only entry is the number 1. 1 The next simplest is the 3 x 3 magic square. (8 + 1 + 6) or 3(32 + 1)/2 This is also just ONE of many examples for a 3 x 3 Magic Square!! This 3 x 3 square is definitely magic and satisfies the definition given above. There are 8 different arrangements of entries in a 3 x 3 matrix that fit the definition of a magic square. There are also magic squares of size 4 x 4, 5 x 5, etc. The Background - Continued For small n, say n <= 3, you could obviously sit down with pencil and paper and discover a magic square in a fairly short amount of time. Take a few minutes now and do that, remembering that each of the numbers, 1 through n2, appear only once in the square. Now try it for n = 4 ... Oh, there has to be a better way. :) Of course, the computer doesn't have a patience problem. It can solve the problem for us by using the brute force method. This means that the computer will accomplish its task by trying every single possible arrangement of the numbers in a square and check each of the resulting squares to see if it's a magic square. [6, 2, 7, 5, 4, 8, 3, 9, 1] [4, 2, 7, 6, 5, 8, 3, 9, 1] [7, 4, 2, 6, 5, 8, 3, 9, 1] ... The Task Your assignment will be to determine all of the magic squares when given an n, display permutations that match the magic squares to the screen AND write it to a file. You will only test when n == 3!!! But code it for n of ANY number!! It turns out that finding the magic squares for n >= 4 takes too long for us to run it on the shared machines (linux1, 2 & 3) Since if n == 1, the square is 1 (too easy!!) and since for n == 2 there is no answer!! Your program must come up with every possible arrangement (permutation) of numbers within the square. These are known as the permutations of that list of numbers. Each permutation needs to be checked to see if it has formed a magic square. Program Requirements Your program must: use command line arguments. At the command line the user must enter (in this order): the name of the executable file, n (which will ALWAYS be 3, but again could be run with other numbers) and the name of the output file in which to write the squares. use a recursive permute to give all of the permutations of the square. In other words, your function called "permute", must be a recursive function. So for each permutation, you should check to see if it is a magic square, display it and write it to the file write only the unique magic squares to the SCREEN and FILE. No duplicates allowed. HINT: Let your program produce duplicates first, then see how you can refrain from writing the duplicates. Then modify your code. use a list of size n2. The code for the recursive permute function will be much easier to write if you store the numbers in a list rather than a two-dimensional list (or array) of size n x n. How you print the data is not related. [6, 2, 7, 5, 4, 8, 3, 9, 1, ....] (size to n2) [4, 2, 7, 6, 5, 8, 3, 9, 1, ....] [7, 4, 2, 6, 5, 8, 3, 9, 1, ....] ... close any files that you have opened as soon as you have finished using them. Time how long your program takes to find the magic square and print that time at the end of the SAME file. Sample Run Here is a sample of output of this program. Please note that the sample output only shows what is expected from your program if the user is actually entering everything as instructed. This is not a test of the program at all, but just a sample for your clarification. 2 7 6 9 5 1 4 3 8 2 9 4 7 5 3 6 1 8 4 3 8 9 5 1 2 7 6 4 9 2 3 5 7 8 1 6 6 1 8 7 5 3 2 9 4 6 7 2 1 5 9 8 3 4 8 1 6 3 5 7 4 9 2 8 3 4 1 5 9 6 7 2 Total running time: 4.76 seconds.

2507






What is a ddl command?

513


What asynchronous web service means?

352


What is mean by PDR?

302


What is merge cells in word?

311


How does an exe file work?

533


What is meant by advance ruling? What is the scheme of advance rulings?

1522


what is the difference betn QTP 8.0 AND PREVIOUS VERSION

1931


How can space expand faster than the speed of light?

113


Which collection is ordered in java?

507


please explain the meaning of "In GSM only 30 or 35 peoples can call at at time in a singal carrier but In CDMA apprx 70 peoples can call in a singal carrier at a time."..........

1464