The following paradigm can be used to find the solution of the problem in minimum time:
Given a set of non-negative integer, and a value K, determine if there is a subset of the given set with sum equal to K:

(A) Divide and Conquer
(B) Dynamic Programming
(C) Greedy Algorithm
(D) Branch and Bound

Recent Topics

• Consider the following code fragment
  void foo(int x, int y)
  {
  x+=y;
  y+=x;
  }
  main()
  {
  int x=5.5;
  foo(x,x);
  }
  What is the final value of x in both call by value and call by reference, respectively?
  (A) 5 and 16
  (B) 5 and 12
  (C) 5 and 20
  (D) 12 and 20
  
  

  by 
  Anonymous

  1 year, 10 months ago

• Ionisation energy in group 1A varies in the decreasing order as 

  (a) Li > Na > K > Cs 

  (b) Na > Li > K >Cs 

  (c) Li > Cs > K > Na 

  (d) K > Cs > Na > Li

  by 
  Anonymous

  1 year, 11 months ago

• A clustering index is defined on the fields which are of type
  (A) non-key and ordering

  (B) non-key and non-ordering
  (C) key and ordering
  (D) key and non-ordering
  
  

  by 
  Anonymous

  1 year, 10 months ago
• Howare mining activities responsible for land degradation in jharkhand
  by 
  Anonymous

  1 year, 11 months ago

• What is the number of steps required to derive the string ((() ()) ())

  S → SSS → (S)S → ε

  (A) 10
  (B) 15
  (C) 12
  (D) 16
  
  

  by 
  Anonymous

  1 year, 11 months ago