QUESTION NO.

1
class Node{
int data;
Node previous;
Node next;

Node head,tail=null;
public void insertEnd(int data){
Node newNode = new Node();
newNode.previous=null;
newNode.next=null;
newNode.data=data;
if(head==null){
head=tail = newNode;
head.previous = null;
tail.next = null;
}
else{
tail.next = newNode;
newNode.previous = tail;
tail = newNode;
tail.next = null;
}
}

public void insertStart(int data){

Node newNode=null;
Node newNode1=new Node();
newNode1=head;
head=newNode;
newNode.data=data;
newNode.next=newNode1;
newNode1.previous=newNode;

public void insertIndex(int data,int index){

Node newNode = new Node();
newNode.previous=null;
newNode.next=null;
newNode.data=data;
int i=0;
Node n1 = head;
Node temp1 = null;
while(i!=index){
 temp1=n1;
n1=n1.next;
i++;
}
tail=newNode;
tail.previous=temp1;
tail.next=n1;
temp1.next=newNode;

public void deleteEnd(){

Node n2=head;
Node temp2=null;
while (n2.next!=null){
temp2=n2;
n2=n2.next;
}
temp2.next=null;
n2.next=null;
n2.previous=null;
}

public void deleteStart(){

Node n3=head;
head=n3.next;
n3.next=null;
}

public void deleteIndex(int index){

int i=0;
Node newnode = head;
Node newnode1 = null;
Node newnode2;
while(i!=index){
newnode1=newnode;
newnode=newnode.next;
i++;
}
newnode1.next=newnode.next;
newnode2=newnode.next;
newnode2.previous=newnode1;
newnode.previous=null;
newnode.next=null;
 }

public void display() {

Node newnode = head;

if(head == null) {
System.out.println("List is empty");
return;
}

while(newnode != null) {
System.out.print(newnode.data + " ");
newnode = newnode.next;
}
}
}
public class lab42 {
public static void main(String[] args) {
Node n1 = new Node();

n1.insertEnd(4);
n1.insertEnd(2);
n1.insertEnd(1);
n1.insertEnd(0);
n1.insertEnd(6);
n1.insertEnd(8);
n1.display();
System.out.println("\n");

n1.insertStart(8);
n1.display();
System.out.println("\n");

n1.insertIndex(9,6);
n1.display();
System.out.println("\n");

n1.deleteEnd();
n1.display();
System.out.println("\n");

n1.deleteStart();
n1.display();
System.out.println("\n");
 n1.deleteIndex(2);
n1.display();
System.out.println("\n");

}
}

QUESTION NO. 2
class Node {
int data;

int n=0;
Node next;
Node prev;

Node head, last;

public void insert(int a) {

Node newnode =null;
newnode.data = a;
n++;

if (head == null) {
head = newnode;
newnode.next = head;
newnode.prev = head;
last = head;

} else {

newnode.next = head;
newnode.prev = last;
last.next = newnode;
last = last.next;

void compare(Node newnode, Node newnode1, int newnode2, int newnode3){

int count=0;
if(newnode2!=newnode3){
System.out.println("not equal");
return ;
}
Node n3 = newnode.head;
Node n4 = newnode1.head;
while(n4.data!=n3.data){
n4=n4.next;
 }
for(int i=0;i<newnode2;i++){
if(n3.data==n4.data){
count++;
}
n3=n3.next;
n4=n4.next;
}
if(count==newnode2){
System.out.println("equal");
return ;

}
}

void print() {
Node newnode = head;
do {
System.out.println(newnode.data);
newnode = newnode.next;
}
while (newnode.next != head);

}
}
public class lab42 {
public static void main(String[] args) {

Node newnode = new Node();

newnode.insert(2);
newnode.insert(3);
newnode.insert(4);
newnode.insert(5);
//newnode.print();

Node newnode2 = new Node();

newnode.insert(3);
newnode.insert(4);
newnode.insert(5);
newnode.insert(2);

newnode.compare(newnode,newnode2, newnode.n, newnode2.n);

}
}

QUESTION NO. 3
import java.util.Scanner;
class Node
{
int data;
Node next;
Node prev;

Node head,last;

void insert(int data){

Node newNode = new Node();
newNode.data=data;

if(head==null)
{
head=newNode;
newNode.next = head;
newNode.prev = head;
last = head;
}
else
{
newNode.next=head;
newNode.prev=last;
last.next=newNode;
last=newNode;
}

void swap(int n,int n1)

{
Node newnode = head;
Node newnode1 = head;
Node newnode2 = null;
Node newnode3 = null;
Node newnode4 = null;

while(newnode.data!=n)
{
newnode2=newnode;
newnode = newnode.next;
}
while(newnode1.data!=n1)
{
newnode3=newnode1;
newnode1 = newnode1.next;
}
if (newnode.next==newnode1)
{
System.out.println("cannot perform the task");

} else if (newnode1.next==newnode)
{
 System.out.println("cannot perform the task");

} if (newnode1==newnode)
{
System.out.println("same element");

}
else
{
newnode2.next = newnode1;
newnode4 = newnode1.next;
newnode1.prev = newnode2;
newnode1.next = newnode.next;
newnode3.prev = newnode1;
newnode3.next = newnode;
newnode.prev = newnode3;
newnode.next = newnode4;
newnode4.prev = newnode;
}

}
void print()
{
Node n1 = head;
do
{
System.out.println(n1.data);
n1=n1.next;
}
while(n1!=head);

}
public class lab42
{
public static void main(String[] args)
{
Node newnode = new Node();
newnode.insert(1);
newnode.insert(2);
newnode.insert(3);
newnode.insert(4);
newnode.insert(5);
newnode.print();
Scanner sc = new Scanner(System.in);
System.out.println("enter element to swap (1,2,3,4,5) ");
int n= sc.nextInt();
System.out.println("enter element to be swapped with (1,2,3,4,5) ");
int n1 = sc.nextInt();
 newnode.swap(n,n1);
newnode.print();
}
}

QUESTION NO. 4
class Node
{
int data;
Node next;
Node prev;

Node head;
Node tail;
int count = 0;

public void Insert(int data)

{
Node newNode = new Node();
newNode.data=data;
count++;
if (head==null){
head = newNode;
head.next = head;
head.prev = head;
tail = head;
}
else {
tail.next = newNode;
newNode.prev = tail;
newNode.next = head;
head.prev = newNode;
tail = newNode;
}
}

public void Print(){

Node newnode = head;
do {
if (newnode==tail){
System.out.println(newnode.data + ".");
}
else {
System.out.print(newnode.data + ",");
}
newnode = newnode.next;
}while (newnode!=head);
 }
public void Infinity(){
int i = 0;
Node newnode = head;
Node newnode1 = null;
while (i<=count){
if (i==0){
newnode1 = newnode.next;
}
i++;
System.out.print(newnode.data + ",");
if (i==count-1){
while (newnode1!=newnode){
newnode = newnode.prev;
}
i = 0;
}else {
newnode = newnode.next;
}
}
}
}
public class lab42 {
public static void main(String[] args) {
Node list = new Node();
list.Insert(1);
list.Insert(2);
list.Insert(3);
list.Insert(4);
System.out.println("original elements");
list.Print();
System.out.println("infinite loop");
list.Infinity();
}
}