Write a program to shift array element with previous one (Left to Right) . Last element will be replace with first element ?

Q : Write a program to shift array element with previous one (Left to Right) . Last element will be replace with first element ?

Input /Output : 

Solution : 

/*   *******************************

     Girfa : Student Help

     Left shift each element of array from left to right

     for more program visit: http://girfahelp.blogspot.in/p/c-language-array-programming.html

     ********************************

*/

UGC Net Computer Science First Paper December-14 Page 2 Solved

UGC Net Computer Science First Paper December-14 Page 2 Solved

11. Two numbers are in the ratio 3 : 5. If 9 is subtracted from the numbers, the ratio becomes

12 : 23. The numbers are

(A) 30, 50 (B) 36, 60

(C) 33, 55 (D) 42, 70

12. The mean of the ages of father and his son is 27 years. After 18 years, father will be twice

as old as his son. Their present ages are

(A) 42, 12 (B) 40, 14

(C) 30, 24 (D) 36, 18

UGC Net Computer Science First Paper December-14 Page 1

UGC Net Computer Science First Paper December-14 Page 1 Solved

1. The term ‘Yellow Journalism’ refers to

(A) sensational news about terrorism and violence

(B) sensationalism and exaggeration to attract readers / viewers.

(C) sensational news about arts and culture

(D) sensational news prints in yellow paper.

Answer B

2. In the classroom, the teacher sends the message either as words or images. The students

are really

(A) Encoders 

(B) Decoders

(C) Agitators 

(D) Propagators
Answer B

UGC Net Computer Science December 13 Paper 3 Page 1 Solved

UGC Net Computer Science December 13 Paper 3 Page 1 Solved

1. If the primal Linear Programming problem has unbounded solution, then it’s dual problem will have

(A) feasible solution

(B) alternative solution

(C) no feasible solution at all

(D) no bounded solution at all
Answer C
Explanation :-
If the Primal problem is feasible, but unbounded in the direction of optimisation, then the dual has no feasible solution. Otherwise, if the Primal problem has an optimal solution, then the dual has also an optimal solution.

So the answer for your question is that feasibility of the Primal problem does not imply optimality for the Dual problem. It just excludes the possibility that the Dual will be unbounded in the direction of optimisation.