Consider four protons at rest at the corners of a square. The protons are bound together so they cannot move. Then the bonds holding one of the protons break so that proton is free to move. Determine that proton\'s acceleration (both direction and magnitude) at the instant after it is no longer bound as well as its speed when it has moved far away. You know the proton\'s charge, its mass, and the length of the sides of the square. Solution Here we need to note that the like charges repel each other, hence the proton will be pushed away along the diagonal of the square. We will assume that the mass of the proton is Mp and charge is q while the length of the side of the square is a. The net force due to the proton diagonally opposite would be along the diagonal, and also due to the other two charges. Hence the net force would be: 2kq22/a2 + kq2/2a2 = (kq2/a2)[22 + 1/2] along the diagonal. The acceleration would be given as: Force / mass = (kq2/Mpa2)[22 + 1/2] So as to determine the speed of the proton once it gets far away, we will use the prinicple of conservation of energy. Hence the initial potential energy of the proton would be equal to its final kinetic energy hence giving us the speed. That is. 2kq2/a + kq2/a2 = (kq2/a)[2 + 1/2] = Mpv2/2 or, V = sqrt[(2kq2/Mpa)[2 + 1/2]] which is the required expression for the speed of the proton..

1. Create your own Linked list from scratch (singly linked list).
Solution
Hi Friend, You have not mentioned about programming language.
Please try to mention all details.
I have implemented LinkedList in Java.
class NodeList {
int data;
NodeList next;
public NodeList(int data) {
this.data = data;
next = null;
}
}
public class LinkedList {
private NodeList head, tail;
private int size;
public LinkedList() {
head = null;
size = 0;
tail = null;
}
public void append(int data) {
// if list is null
if(head == null){
head = new NodeList(data);
tail = head;
return;
}
NodeList newNode = new NodeList(data);
tail.next = newNode;
tail = newNode;
}

2. public void deleteLast(){
if(head == null){
System.out.println("List is empty");
return ;
}
if(head.next == null){ // only one node
head = tail = null;
}
NodeList temp = head;
while(temp.next != tail)
temp = temp.next;
temp.next = null;
tail = temp;
}
public void deleteNthNode(int n){
if(size < n){
System.out.println("Less than "+n+"node in list");
return;
}
if(n==1){// delete first element
head = head.next;
return;
}
if(size == n){ // delete last
deleteLast();
return;
}
NodeList temp = head;

3. for(int i=1; i size + 1){
System.out.println("Total number of elements in list is "+size);
return;
}
NodeList newNode = new NodeList(data);
if(n==1){//inserting at first
newNode.next = head;
head = newNode;
if(tail == null)
tail = head;
}
else if(size+1 == n){ // inserting at last
tail.next = newNode;
tail = newNode;
}
else{
NodeList temp = head;
for(int i=1; i");
else
System.out.println(temp.data);
temp = temp.next;
}
System.out.println();
}
}
####################
public class TestLinkedList {
public static void main(String[] args) {
LinkedList list = new LinkedList();
list.append(1);
list.append(2);

4. list.append(3);
list.display();
list.insertAfter(4, 1);
list.display();
}
}
/*
Sample run:
1-->2-->3
4-->1-->2-->3
*/