73. How can you set the status and title for a modal dialog box?

a) In the attributes of the corresponding screen.

b) Before the corresp. call screen statement.

c) In a PBO module of the corresponding screen.

d) In the PAI module of the corresponding screen.



73. How can you set the status and title for a modal dialog box? a) In the attributes of the co..

Answer / saurabh

C) In a pbo module of the corresponding screen.



Thanks

Is This Answer Correct ?    6 Yes 0 No

Post New Answer

More Programming Languages AllOther Interview Questions

Hi guyes, I have cleared 2 technical rounds with cts for liferay and java techonologies, i have client round next week, please tell me how to prepare for this what questions i should be ready to face?

0 Answers  


I have try to write a record in a TDQ from a fle.... what are the steps to do... can anybody plz come with a solution

0 Answers  


what are resources in case of Threads

0 Answers   Satyam,


Differevce between arrays and array builders?

0 Answers  


Data Structure:  How many comparisons are necessary to find the largest and smallest of a set of n distinct elements?  

0 Answers   Student,






how we define two jobs have same name??is it exist??

0 Answers   CTS,


when we use mantis? how learn mantis?

0 Answers  


any drawback are there in mantis?

0 Answers  


why we use abstract in awt?

0 Answers  


i want to open a helkp file that is txt file on link buttons click

1 Answers  


in IBM PC -AT.WAT AT REFERS TO?

0 Answers   IBM,


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  


Categories