Answer / seshu

Annex IT Solutions.
Annex IT Solutions Offers Testing Tools Training
in Both Manual And Automation Courses , We Cover QTP ,
QC , Manual Testing ( Faculty : Satish Patnaik )

Other Courses We are Offering :
SQL Server 2005/2008 DBA
PHP , Java Script , Joomla , drupal , HTML ,CSS.

Contact:
Annex IT Solutions
Seshu Babu. V
09246541666
040 42000072
testing.annex@gmail.com
www.annexit.com

Q2. A memory location has physical address D5687h. Compute: a. The offset address if the segment number is D445h. b. The segment number if the offset address is B577h.

0 Answers  

---

I HAVE DONE TESTING TOOLS COURSE,NOW I AM FRESHER,I AM NOT GETTING ANY CALLS,I WANT TO DO THE PROJECT ,WHERE I HAVE TO MEET TO DO THE PROJECT,I AM GOING WITH FAKE EXPERIENCE,SO WHAT I HAVE TO DO.

3 Answers  

---

What is std::auto_ptr?

1 Answers   Amazon,

---

how many languages .net is supporting now?

2 Answers  

---

Write a program to find factorial of a number using functions

0 Answers   Peerless,

---

Why COBOL/400 is giving 95 session error when opening a file even though the file is having key and the screen or display file is having IND ARA defined?

1 Answers   Freelance,

---

Hi, I'm doing B.com 3rd year. Simultaneously I'm doing software engineering in a private institution. I would like to know whether my B.com graduation alone is enough to get me a job in the IT field or should I do some PG course not MBA... suggest me...

1 Answers  

---

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  

---

When we use Windows authentication mode

0 Answers  

---

Given a cube of size n*n*n (i.e made up of n^3 smaller cubes), find the number of smaller cubes on the surface. Extend this to k-dimension.

0 Answers   Amazon,

---

what is the meaning of without standing arrears?

0 Answers   TCS,

---

what is difference between java and c#

2 Answers   Cyient,

---