import java.util.Scanner;
public class JavaApplication57 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println("Enter two numbers:");
int num1 = scan.nextInt();
int num2 = scan.nextInt();
while (num1 <= num2){
if (num1 %2 == 0){
System.out.print(num1+" ");
}
num1+=1;
}
}
}
I hope this helps!
Answer: I think email
Explanation: not rlly sure tho..
Answer:
Explanation:
The following code is written in Python. It continues looping and asking the user for an oligonucleotide sequence and as long as it is valid it outputs the reverse complement of the sequence. Otherwise it exits the loop
letters = {'A', 'C', 'G', 'T'}
reloop = True
while reloop:
sequence = input("Enter oligonucleotide sequence: ")
for x in sequence:
if x not in letters:
reloop = False;
break
if reloop == False:
break
newSequence = ""
for x in sequence:
if x == 'A':
newSequence += 'T'
elif x == 'T':
newSequence += 'A'
elif x == 'C':
newSequence += 'G'
elif x == 'G':
newSequence += 'C'
print("Reverse Complement: " + newSequence)
Answer:
see explaination
Explanation:
#include <iostream>
#include <string>
using namespace std;
class LinkedList{
class Node{
public :
int data;
Node* next;
Node(int data){
this->data = data;
next = NULL;
}
};
public :
Node *head;
LinkedList(){
this->head = NULL;
}
void insert(int d){
Node* new_node = new Node(d);
new_node->next = head;
head = new_node;
}
// sort the list with selection sort algorithm.
// Pick the smallest element in the unsorted array and place in the first element in the unsorted.
void sort_list(){
if (head == NULL){
return;
}
Node* current = head;
while (current->next != NULL){
Node* min_node = current;
Node* traverse = current->next;
while(traverse != NULL){
if(traverse->data < min_node->data){
min_node = traverse;
}
traverse = traverse->next;
}
int temp = current->data;
current->data = min_node->data;
min_node->data = temp;
current = current->next;
}
}
void print_list(){
Node* current = head;
while(current !=NULL){
cout<<current->data<<" ";
current = current->next;
}
cout<<"\n";
}
};
int main(){
LinkedList ll;
for(int i=0;i<10;i++){
ll.insert(i);
}
ll.print_list();
cout<<"*******************************************\n";
ll.sort_list();
ll.print_list();
cout<<"*******************************************\n";
}
