Diff between Proc transpose and Arrays with example?
- 2 Answers
- 5982 Views
- Accenture, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / imrankhan
proc transpose does not deal with missing values and cannot show the missing values in report. the work around for this problem is to use datastep with arrays.
| Is This Answer Correct ? | 1 Yes | 0 No |
Answer / anil
If the data contains missing values then, there is an
advantage with transpose, the program does not have to
change. Automatically, PROC TRANSPOSE creates as many
variables as are needed.
While coming to the datastep it requires significant
changes.
| Is This Answer Correct ? | 1 Yes | 2 No |
Difference between views and index in sas programming
swap two number wthout using third variable
You are given a dictionary of all valid words. You have the following 3 operations permitted on a word: delete a character, insert a character, replace a character. Now given two words - word1 and word2 - find the minimum number of steps required to convert word1 to word2. (one operation counts as 1 step.)
How do i find out the number of parameters passed into function?
why you have to became a software developer?
What is the worst case of AVL tree?
can we use commit,rollback in triggers and how?
It is possible to take number of controls added to form at run-time.ex-when user enter 6, 6 text boxes get added to form,next time number of controls get change as per user number enter. What is code for that?
For a binary tree with n nodes, How many nodes are there which has got both a parent and a child?
what is jackson structured develepment?? and how is it different from OMT??
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 ≤ i0 <i1….< ik-1 ≤ 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.
Write a program to reverse a number?
C 
