1. Consider the following input and generate the object code
using single pass assembler.
JOHN START 0
USING *,15
L 1,FIVE
A 1,FOUR
ST 1,TEMP
FOUR DC F’4’
FIVE DC F’5’
TEMP DS ‘F
END
- 0 Answers
- 2350 Views
- Wipro, I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Tell me the jobs for the MCA Fresher in delhi, Noida..
Write a shell program. Enter number of days from keyboard. Find out the number of years, month and days it contains
Find out the roles which gives access to all tables in SAP? Thanks in advance.
Suppose server object is not loaded into the memory, and the client request for it , what will happen?
how do i add a column dynamically in a table by using java application?
Given three sides of a triangle. Write the Program to determine whether the triangle is : 1) Invalid 2) Right Angled 3) Isoscales 4) Equilateral 5) Not Special An Isoscales right angled triangle should be taken as a Right Angled Triangle
3 Answers FFC, Goldman Sachs, Student,
I m new to the dbms. Recently i came across words clustered indexes & nonclustered indexes but i dont know what is this all about & whats the difference between them.. So please help me!!!!!!!!
How can recruiter justified that the candidate is expert in Algorithm and datastructure for Software product development ?
what does mean and stack mean in genral programming?
How do you initialize a static member of a class with return value of some function?
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.
Please anyone tell me coding to print prime numbers from 1 to 5000 in c#....
C 
