Answer / john

For more SAS DI related info visit
http://www.itinterview-madeeasy.com/2012/05/50-sas-di-interview-questions.html

Answer / senthilnathan.k

SC-2 Small Changing Dimension, We used for maintaining the
history of records.

ETL(Extraction, Transformation and Loading) the Data marts
called as target table using proc append, which will
appending the records in the target table using md5
algorithms.

Which will create Surrogate key corresponding to each
record.

Difference between abstract class and Interfaces in Java

9 Answers   Nest, Persistent, Yantro Software,

---

One boy has to climb steps. He can climb 1 or 2 steps at a time. Write a function that will returns number of way a boy can climb the steps. Int WaytoSteps(int n) (eg:- suppose number of steps is n=4 ,the function will return 5 (one-one-one-one ,one-one-two, one-two-one-,two-one-one, two-two)

0 Answers   Persistent,

---

3.Give the formula for determine the range of the data type?

1 Answers  

---

How does the TCP handle the issue of multiplexing?

0 Answers  

---

how do you generate source code for the automatic generation for receipt number

1 Answers   Infosys,

---

how can we maintain the previous version scripts to new version.

0 Answers   DST Global Solutions,

---

what is the difference between Windows application and Unix application?

0 Answers   Satyam,

---

Write a Pseudo Code to find the angle between two hands of a clock for a given time.

6 Answers   Goldman Sachs, HCL,

---

What is meant by QUEUE?

4 Answers   Mascot,

---

In Bioinformatics, a DNA sequence is made up of a combination of 4 characters, namely “A,C,G,T”. A subsequence of a given sequence of characters a0, a1, …an- 1, is any subset of the characters taken in order, of the form ai0 , ai1 ,…..aik-1 where 0 &#8804; i0 <i1….< ik-1 &#8804; n-1. For example in the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, we can have subsequences “A,G,T”, “A,C,A,A” and many more. A subsequence is palindromic if it is the same whether read left to right or right to left. For instance, the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, has many palindromic subsequences, including “A,C,G,C,A” and “A,A,A,A” (on the other hand, the subsequence “A,C,T” is not palindromic). Devise an algorithm (using dynamic programming) that takes a sequence of characters X[0 … n-1] from the alphabet set (A,C,G,T) and returns the (length of the) longest palindromic subsequence. Implement the algorithm in an appropriate language.

1 Answers  

---

1.how to deploy the Maven application in weblogic server? 2.In Real time projects all classes are singleton or some classes only singleton explain? 3.what are the major uses of the designpatterns? 4.explain restful &Soap based services explain?

0 Answers   Accenture,

---

Bonjour, svp je veut voir comment envoyer un mail en java et comment changer le droit d'accé d'un fichier en java: de lecture en lecture/écriture et merci d'avance ;)

0 Answers  

---