NumberList.java (implements the linked list)public class NumberLis.pdf
•
0 likes•4 views
NumberList.java (implements the linked list) public class NumberList{ Node first; Node last; public NumberList(){ first = null; last = null; } public NumberList(Node node){ this.first = node; this.last = node; } public boolean isEmpty(){ return first == null; } public void setLast(Node node){ this.last = node; } public void insert(Node node){ if (first==null){ this.first = node; this.last = node; } else{ node.previous = this.last; node.previous.next = node; node.next = null; this.last = node; } } public boolean inList(String num){ Node l = first; while (l.next != null){ if (l.number.equals(num)){ return true; } else{ l = l.next; } } return false; } public void printList(){ Node l = first; while(l.next!=null){ System.out.print(l.number+\" \"); l = l.next; } System.out.println(); } } Node.java (implements a single node in the linked list; stores number and pointers) public class Node{ String number; Node previous; Node next; public Node(String num){ number = num; previous = null; next = null; } public Node(String num, Node p, Node n){ number = num; previous = p; next = n; } } Main.java (contains the main method and the helper methods to solve the questions given) import java.util.Scanner; import java.util.List; import java.util.ArrayList; public class Main{ static boolean checkHappiness(String num){ Node current = new Node(num, null, null); NumberList numberList = new NumberList(current); int len = num.length(); int resultant = 0; for (int i=0; i happyNumbersfrom1to10000(){ ArrayList numbers = new ArrayList(); for (int j=0; j<10000; j++){ if (checkHappiness(String.valueOf(j+1))){ numbers.add(String.valueOf(j+1)); } } return numbers; } static void happyNumbersfrom9001to10000(){ for (int j=9001; j<=10000; j++){ //System.out.println(j); if (checkHappiness(String.valueOf(j))){ System.out.println(String.valueOf(j)); } } } static String getLargeHappyNumber(){ for (long i=10000000000000000000L; i<1000000000000000000000L; i++){ if (checkHappiness(String.valueOf(i))){ return String.valueOf(i); } return \"-1\"; } } static String getLargeUnhappyNumber(){ for (long i=10000000000000000000L; i<1000000000000000000000L; i++){ if (!checkHappiness(String.valueOf(i))){ return String.valueOf(i); } return \"-1\"; } } public static void main(String[] args){ happyNumbersfrom9001to10000(); System.out.println(happyNumbersfrom1to10000()); } } Solution NumberList.java (implements the linked list) public class NumberList{ Node first; Node last; public NumberList(){ first = null; last = null; } public NumberList(Node node){ this.first = node; this.last = node; } public boolean isEmpty(){ return first == null; } public void setLast(Node node){ this.last = node; } public void insert(Node node){ if (first==null){ this.first = node; this.last = node; } else{ node.previous = this.last; node.previous.next = node; node.next = null; this.last = node; } } public boolean inList(String num){ Node l = first; while (l.next != null){ if (l.number.equals(num)){ return true; } else{ l = l.
Report
Share
Report
Share
Download to read offline
Recommended
I keep getting NullPointerExcepetion, can someone help me with spinL.pdf
I keep getting NullPointerExcepetion, can someone help me with spinList(int numMoves) and
LinkedList altLists(LinkedList list)?
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
public LinkedList() {
first = null;
last = null;
length = 0;
iterator = null;
}
public LinkedList(T[] array) {
if (array == null) {
return;
}
if (array.length == 0) {
length = 0;
first = null;
last = null;
iterator = null;
} else {
for (T item : array) {
addLast(item);
}
iterator = null;
}
}
public LinkedList(LinkedList original) {
if (original == null) {
return;
}
if (original.length == 0) {
length = 0;
first = null;
last = null;
iterator = null;
} else {
Node temp = original.first;
while (temp != null) {
addLast(temp.data);
temp = temp.next;
}
iterator = null;
}
}
public T getFirst() throws NoSuchElementException {
if(first == null){
throw new NoSuchElementException("getFirst(): List has no element to access");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (last == null){
throw new NoSuchElementException("getLast(): List has no element to access");
}
return last.data;
}
public T getIterator() throws NullPointerException {
if (iterator == null){
throw new NullPointerException("getIterator(): There is no iterator to access");
}
return iterator.data;
}
public int getLength() {
return length;
}
public boolean isEmpty() {
return length == 0;
}
public boolean offEnd() {
return iterator == null;
}
public void addFirst(T data) {
if (length == 0){
first = last = new Node(data);
} else {
Node fill = new Node(data);
fill.next = first;
first.prev = fill;
first = fill;
}
length++;
}
public void addLast(T data) {
if (length == 0) {
first = last = new Node(data);
} else {
Node fill = new Node (data);
fill.prev = last;
last.next = fill;
last = fill;
}
length++;
}
public void addIterator(T data) throws NullPointerException{
if(iterator == null) {
throw new NullPointerException("addIterator(): Can't add the node because iterator points
to null");
} else if(iterator == last){
addLast(data);
} else{
Node fill = new Node(data);
iterator.next.prev = fill;
fill.prev = iterator;
fill.next = iterator.next;
iterator.next = fill;
length++;
}
}
public void removeFirst() throws NoSuchElementException {
if (length == 0) {
throw new NoSuchElementException("removeFirst(): Cannot remove from an empty
List");
} else if(length == 1) {
first = last = null;
} else {
first = first.next;
first.prev = null;
}
length--;
}
public void removeLast() throws NoSuchElementException {
if (length == 0){
throw new NoSuchElementException("removeLast(): Cannot remove from an empty
List");
} else if (length == 1){
first = last = null;
}else{
last = last.prev;
last.next = null;
}
length--;
}
public void removeIterator() throws NullPointerE.
LinkedListOperations.java-class Node{ public int item; .pdf
LinkedListOperations.java:-
class Node
{
public int item;
public Node next;
public Node(int val)
{
item = val;
}
public void displayNode()
{
System.out.println(\"[\" + item + \"] \");
}
}
class LinkedList
{
private Node first;
public LinkedList()
{
first = null;
}
public boolean isEmpty()
{
return (first==null);
}
public void insert(int val)//inserts at beginning of list
{
Node newNode = new Node(val);
newNode.next = first;
first = newNode;
}
public Node delete()//deletes at beginning of list
{
Node temp = first;
first = first.next;
return temp;
}
public void display()
{
System.out.println(\"List items from first to last :\");
Node current = first;
while(current != null)
{
current.displayNode();
current = current.next;
}
System.out.println(\"\");
}
public Node search(int val)
{
Node current = first;
while(current.item != val)
{
if(current.next == null)
return null;
else
current = current.next;
}
return current;
}
public Node delete(int val)
{
Node current = first;
Node previous = first;
while(current.item != val)
{
if(current.next == null)
return null;
else
{
previous = current;
current = current.next;
}
}
if(current == first)
first = first.next;
else
previous.next = current.next;
return current;
}
}
class LinkedListOperations
{
public static void main(String[] args)
{
LinkedList object = new LinkedList();
object.insert(10);
object.insert(20);
object.insert(30);
object.display();
while( !object.isEmpty() )
{
Node member = object.delete();
System.out.print(\"Deleted \");
member.displayNode();
System.out.println(\"\");
}
object.display();
object.insert(40);
object.insert(50);
object.insert(60);
object.display();
Node objecttosearch = object.search(50);
if( objecttosearch != null)
System.out.println(\"Found Node : \" + objecttosearch.item);
else
System.out.println(\"Cannot locate the node\");
Node objecttodelete = object.delete(50);
if( objecttodelete != null )
System.out.println(\"Deleted node : \" + objecttodelete.item);
else
System.out.println(\"Cannot delete the node\");
object.display();
}
}
Solution
LinkedListOperations.java:-
class Node
{
public int item;
public Node next;
public Node(int val)
{
item = val;
}
public void displayNode()
{
System.out.println(\"[\" + item + \"] \");
}
}
class LinkedList
{
private Node first;
public LinkedList()
{
first = null;
}
public boolean isEmpty()
{
return (first==null);
}
public void insert(int val)//inserts at beginning of list
{
Node newNode = new Node(val);
newNode.next = first;
first = newNode;
}
public Node delete()//deletes at beginning of list
{
Node temp = first;
first = first.next;
return temp;
}
public void display()
{
System.out.println(\"List items from first to last :\");
Node current = first;
while(current != null)
{
current.displayNode();
current = current.next;
}
System.out.println(\"\");
}
public Node search(int val)
{
Node current = first;
while(current.item != val)
{
if(current.next == null)
return null;
else
current = current.next;
}
return current;
}
public Node delete(int val)
{
N.
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf
Here is the editable code:
Solution
import java.util.NoSuchElementException;
public class DoublyLinkedListImpl {
private Node head;
private Node tail;
private int size;
public DoublyLinkedListImpl() {
size = 0;
}
private class Node {
E element;
Node next;
Node prev;
public Node(E element, Node next, Node prev) {
this.element = element;
this.next = next;
this.prev = prev;
}
}
public int size() { return size; }
public boolean isEmpty() { return size == 0; }
public void addFirst(E element) {
Node tmp = new Node(element, head, null);
if(head != null ) {head.prev = tmp;}
head = tmp;
if(tail == null) { tail = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
/**
* adds element at the end of the linked list
* @param element
*/
public void addLast(E element) {
Node tmp = new Node(element, null, tail);
if(tail != null) {tail.next = tmp;}
tail = tmp;
if(head == null) { head = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
public void iterateForward(){
System.out.println(\"iterating forward..\");
Node tmp = head;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.next;
}
}
/**
* this method walks backward through the linked list
*/
public void iterateBackward(){
System.out.println(\"iterating backword..\");
Node tmp = tail;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.prev;
}
}
public E removeFirst() {
if (size == 0) throw new NoSuchElementException();
Node tmp = head;
head = head.next;
head.prev = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public E removeLast() {
if (size == 0) throw new NoSuchElementException();
Node tmp = tail;
tail = tail.prev;
tail.next = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public static void main(String a[]){
DoublyLinkedListImpl dll = new DoublyLinkedListImpl();
dll.addFirst(10);
dll.addFirst(34);
dll.addLast(56);
dll.addLast(364);
dll.iterateForward();
dll.removeFirst();
dll.removeLast();
dll.iterateBackward();
}
}
import java.util.Scanner;
/* Class Node */
class Node
{
protected int data;
protected Node next, prev;
/* Constructor */
public Node()
{
next = null;
prev = null;
data = 0;
}
/* Constructor */
public Node(int d, Node n, Node p)
{
data = d;
next = n;
prev = p;
}
/* Function to set link to next node */
public void setLinkNext(Node n)
{
next = n;
}
/* Function to set link to previous node */
public void setLinkPrev(Node p)
{
prev = p;
}
/* Funtion to get link to next node */
public Node getLinkNext()
{
return next;
}
/* Function to get link to previous node */
public Node getLinkPrev()
{
return prev;
}
/* Function to set data to node */
public void setData(int d)
{
data = d;
}
/* Function to get data from node */
public int getData()
{
return data;
}
}
/* Class linkedList */
class linkedList
{
protected Node start;
protected Node end ;
public int size;
/* Constructor */
public linkedList()
{
start = null;
end = null;
size = 0;
}
/* Function to check if list is empty */
public boolean isE.
Please change this method to recursive method. public String post.pdf
Please change this method to recursive method.
public String postfix() {
final ExpressionNodes nodes = new ExpressionNodes();
for (String element : expression.split(\" \")) {
if (isOperator(element)) {
String rightNode = nodes.pop();
String leftNode = nodes.pop();
nodes.push((leftNode + \" \" + rightNode + \" \" + element));
} else {
nodes.push((element));
}
}
return nodes.pop();
}
Solution
public class Main{
public String postfix(int count)
final ExpressiononNodes nodes = new ExpressiononNodes ();
for( String element : expression split(\" \"))
{
if (Is Operator(int element))
{
String rightNode = nodes.pop();
String leftNode = nodes.pop();
nodes.push((leftNode + \" \" + rightNode + \" \" +element));
}
else
{
nodes.push ((element));
}}
if (count <=0)
{
return nodes.pop();
}
else
{
postfix(count - 1);
}}
Public static void Main(String[] args)
{
Main n = new Main();
n.postfix(element);
}.
Help please, I have attached LinkedList.cpp and LinkedList.hPlease.pdf
Help please, I have attached LinkedList.cpp and LinkedList.h
Please help with the implementation of the Stack.h and Stack.cpp as well
LinkedList.cpp
~~~~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
/*Exercise2 */
void LinkedList::insertAtFront(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
if (last == NULL)
first = last = temp;
else
{
temp->next = first;
first = temp;
}
}
bool LinkedList::removeFromFront()
{
if (first == NULL)
return false;
Node *temp = first;
first = first->next;
free(temp);
if (first == NULL)
last = NULL;
return true;
}
LinkedList.h
~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *.
fix the error - class Node{ int data- Node next-.pdf
fix the error :
class Node{
int data;
Node next;
public Node(int data) {
this.data = data;
this.next = null;
}
}
class singlelinkedlist {
public Node head = null;
public Node tail = null;
public void addNode(int data) {
Node newNode = new Node(data);
if(head == null) {
head = newNode;
tail = newNode;
}
else {
tail.next = newNode;
tail = newNode;
}
}
public void sortList() {
Node current = head, index = null;
int temp;
if(head == null) {
return;
}
else {
while(current != null) {
index = current.next;
while(index != null) {
if(current.data > index.data) {
temp = current.data;
current.data = index.data;
index.data = temp;
}
index = index.next;
}
current = current.next;
}
}
}
public void display() {
Node current = head;
if(head == null) {
System.out.println("List is empty");
return;
}
while(current != null) {
System.out.print(current.data + " ");
current = current.next;
}
System.out.println();
}
}
public class JavaApplication46 {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
// TODO code application logic here
SortList sList = new SortList();
sList.addNode(9);
sList.addNode(7);
sList.addNode(2);
sList.addNode(5);
sList.addNode(4);
System.out.println("Original list: ");
sList.display();
sList.sortList();
System.out.println("Sorted list: ");
sList.display();
}
}.
Write a JAVA LinkedListRec class that has the following methods siz.pdf
Write a JAVA LinkedListRec class that has the following methods: size, empty, insertBefore,
insertAfter, addAtHead, addAtEnd, remove, replace, peekFront, peekEnd, removeFront,
removeEnd, toString. Use recursion to implement most of these methods. Write a driver to test
your implemented LinkedListRec class methods.
Solution
import java.util.Scanner;
public class LinkedListRec {
int data;
LinkedListRec prev=null,next=null;
int size(LinkedListRec l)//method which returns the length of the list
{
if(l==null)return 0;
return 1+size(l.next);
}
boolean empty(LinkedListRec l)//method checks whether the list is empty or not...
{
if(l==null)return true;
else return false;
}
LinkedListRec insertBefore(LinkedListRec l,int value,int num_insertbefore)//method which
adds a new number before the given number..
{
if(l==null)return l;
if(l.data == num_insertbefore)
{
LinkedListRec n = new LinkedListRec();
n.data = value;
if(l.prev==null)
{
n.next = l;
l=n;
}
else
{
n.prev = l.prev;
n.next= l;
l.prev = n;
}
return l;
}
return insertBefore(l.next,value,num_insertbefore);
}
LinkedListRec insertAfter(LinkedListRec l,int value,int num_insertafter)//method which adds
the new number after the given number
{
if(l==null)return l;
if(l.data == num_insertafter)
{
LinkedListRec n = new LinkedListRec();
n.data = value;
if(l.next==null)
{
l.next = n;
n.prev = l;
}
else
{
n.next = l.next;
l.next.prev = n;
n.prev = l;
}
return l;
}
return insertAfter(l.next,value,num_insertafter);
}
LinkedListRec addAtHead(LinkedListRec l,int value)//method which adds a new number at
the head position of the list...
{
LinkedListRec n = new LinkedListRec();
n.data=value;
n.next = l;
l=n;
return l;
}
LinkedListRec addAtEnd(LinkedListRec l,int value)//method which adds a new number at
the end position of the list...
{
if(l==null){ l = new LinkedListRec();l.data = value;return l;}
if(l.next==null)
{
LinkedListRec n = new LinkedListRec();
n.data=value;
n.prev = l;
l.next = n;
return l;
}
return addAtEnd(l.next,value);
}
LinkedListRec remove(LinkedListRec l,int value)//method which removes given numbet
from the list....
{
if(l==null)return l;
if(l.data == value)
{
if(l.prev!=null){
l.prev = l.next;
}
else
l=l.next;
return l;
}
return remove(l.next,value);
}
boolean replace(LinkedListRec l,int value,int newvalue)//method which replaces current
number with new number,...
{
if(l==null)return false;
if(l.data == value)
{
l.data = newvalue;
return true;
}
return replace(l.next,value,newvalue);
}
int peekFront(LinkedListRec l)//method which returns the first value of the list...
{
if(l!=null)
return l.data;
else return -1;
}
int peekEnd(LinkedListRec l)//method which returns the last value of the list........
{
if(l==null)return -1;
if(l.next == null)return l.data;
return peekEnd(l.next);
}
LinkedListRec removeFront(LinkedListRec l)//method which removes the first element of the
list..
{
if(l==null)return l;
l=l.next;
return l;
}
boolean removeEnd(LinkedListRec l)//method which removes the last element o.
import java-util-Iterator- import java-util-NoSuchElementException- im.pdf
import java.util.Iterator;
import java.util.NoSuchElementException;
import lab4.util.List;
public class SinglyLinkedList<E> implements List<E> {
@SuppressWarnings("hiding")
private class SinglyLinkedListIterator<E> implements Iterator<E>{
private Node<E> nextNode;
@SuppressWarnings("unchecked")
public SinglyLinkedListIterator() {
this.nextNode = (Node<E>) header.getNext();
}
@Override
public boolean hasNext() {
return nextNode != null;
}
@Override
public E next() {
if (this.hasNext()) {
E result = this.nextNode.getElement();
this.nextNode = this.nextNode.getNext();
return result;
}
else {
throw new NoSuchElementException();
}
}
}
private static class Node<E> {
private E element;
private Node<E> next;
public Node(E element, Node<E> next) {
super();
this.element = element;
this.next = next;
}
public Node() {
super();
}
public E getElement() {
return element;
}
public void setElement(E element) {
this.element = element;
}
public Node<E> getNext() {
return next;
}
public void setNext(Node<E> next) {
this.next = next;
}
}
private Node<E> header;
private int currentSize;
public SinglyLinkedList() {
this.header = new Node<>();
this.currentSize = 0;
}
@Override
public int size() {
return this.currentSize;
}
@Override
public boolean isEmpty() {
return this.size() == 0;
}
@Override
public boolean contains(E e) {
return this.firstIndexOf(e) >= 0;
}
@Override
public int firstIndexOf(E e) {
int i = 0;
for (Node<E> temp = this.header.getNext(); temp != null;
temp = temp.getNext(), ++i) {
if (temp.getElement().equals(e)) {
return i;
}
}
// not found
return -1;
}
@Override
public void add(E e) {
if (this.isEmpty()) {
this.header.setNext(new Node<E>(e, null));
this.currentSize++;
}
else {
Node<E>temp= this.header.getNext();
while (temp.getNext() != null) {
temp = temp.getNext();
}
Node<E> newNode = new Node<>(e, null);
temp.setNext(newNode);
this.currentSize++;
}
}
@Override
public void add(E e, int index) {
if ((index < 0) || (index > this.currentSize)) {
throw new IndexOutOfBoundsException();
}
if (index == this.currentSize) {
this.add(e);
}
else {
Node<E> temp = null;
if (index == 0) {
temp = this.header;
}
else {
temp = this.getPosition(index -1);
}
Node<E> newNode = new Node<>();
newNode.setElement(e);
newNode.setNext(temp.getNext());
temp.setNext(newNode);
this.currentSize++;
}
}
@Override
public E get(int position) {
if ((position < 0) || position >= this.currentSize) {
throw new IndexOutOfBoundsException();
}
Node<E> temp = this.getPosition(position);
return temp.getElement();
}
private Node<E> getPosition(int index){
int currentPosition=0;
Node<E> temp = this.header.getNext();
while(currentPosition != index) {
temp = temp.getNext();
currentPosition++;
}
return temp;
}
@Override
public boolean remove(int index) {
if ((index < 0) || (index >= this.currentSize)){
throw new IndexOutOfBoundsException();
}
else {
Node<E> temp = this.header;
int currentPosition =0;
Node<E> target = null;
while (currentPosition != index) {
temp = temp.getNext();
currentPosit.
Recommended
I keep getting NullPointerExcepetion, can someone help me with spinL.pdf
I keep getting NullPointerExcepetion, can someone help me with spinList(int numMoves) and
LinkedList altLists(LinkedList list)?
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
public LinkedList() {
first = null;
last = null;
length = 0;
iterator = null;
}
public LinkedList(T[] array) {
if (array == null) {
return;
}
if (array.length == 0) {
length = 0;
first = null;
last = null;
iterator = null;
} else {
for (T item : array) {
addLast(item);
}
iterator = null;
}
}
public LinkedList(LinkedList original) {
if (original == null) {
return;
}
if (original.length == 0) {
length = 0;
first = null;
last = null;
iterator = null;
} else {
Node temp = original.first;
while (temp != null) {
addLast(temp.data);
temp = temp.next;
}
iterator = null;
}
}
public T getFirst() throws NoSuchElementException {
if(first == null){
throw new NoSuchElementException("getFirst(): List has no element to access");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (last == null){
throw new NoSuchElementException("getLast(): List has no element to access");
}
return last.data;
}
public T getIterator() throws NullPointerException {
if (iterator == null){
throw new NullPointerException("getIterator(): There is no iterator to access");
}
return iterator.data;
}
public int getLength() {
return length;
}
public boolean isEmpty() {
return length == 0;
}
public boolean offEnd() {
return iterator == null;
}
public void addFirst(T data) {
if (length == 0){
first = last = new Node(data);
} else {
Node fill = new Node(data);
fill.next = first;
first.prev = fill;
first = fill;
}
length++;
}
public void addLast(T data) {
if (length == 0) {
first = last = new Node(data);
} else {
Node fill = new Node (data);
fill.prev = last;
last.next = fill;
last = fill;
}
length++;
}
public void addIterator(T data) throws NullPointerException{
if(iterator == null) {
throw new NullPointerException("addIterator(): Can't add the node because iterator points
to null");
} else if(iterator == last){
addLast(data);
} else{
Node fill = new Node(data);
iterator.next.prev = fill;
fill.prev = iterator;
fill.next = iterator.next;
iterator.next = fill;
length++;
}
}
public void removeFirst() throws NoSuchElementException {
if (length == 0) {
throw new NoSuchElementException("removeFirst(): Cannot remove from an empty
List");
} else if(length == 1) {
first = last = null;
} else {
first = first.next;
first.prev = null;
}
length--;
}
public void removeLast() throws NoSuchElementException {
if (length == 0){
throw new NoSuchElementException("removeLast(): Cannot remove from an empty
List");
} else if (length == 1){
first = last = null;
}else{
last = last.prev;
last.next = null;
}
length--;
}
public void removeIterator() throws NullPointerE.
LinkedListOperations.java-class Node{ public int item; .pdf
LinkedListOperations.java:-
class Node
{
public int item;
public Node next;
public Node(int val)
{
item = val;
}
public void displayNode()
{
System.out.println(\"[\" + item + \"] \");
}
}
class LinkedList
{
private Node first;
public LinkedList()
{
first = null;
}
public boolean isEmpty()
{
return (first==null);
}
public void insert(int val)//inserts at beginning of list
{
Node newNode = new Node(val);
newNode.next = first;
first = newNode;
}
public Node delete()//deletes at beginning of list
{
Node temp = first;
first = first.next;
return temp;
}
public void display()
{
System.out.println(\"List items from first to last :\");
Node current = first;
while(current != null)
{
current.displayNode();
current = current.next;
}
System.out.println(\"\");
}
public Node search(int val)
{
Node current = first;
while(current.item != val)
{
if(current.next == null)
return null;
else
current = current.next;
}
return current;
}
public Node delete(int val)
{
Node current = first;
Node previous = first;
while(current.item != val)
{
if(current.next == null)
return null;
else
{
previous = current;
current = current.next;
}
}
if(current == first)
first = first.next;
else
previous.next = current.next;
return current;
}
}
class LinkedListOperations
{
public static void main(String[] args)
{
LinkedList object = new LinkedList();
object.insert(10);
object.insert(20);
object.insert(30);
object.display();
while( !object.isEmpty() )
{
Node member = object.delete();
System.out.print(\"Deleted \");
member.displayNode();
System.out.println(\"\");
}
object.display();
object.insert(40);
object.insert(50);
object.insert(60);
object.display();
Node objecttosearch = object.search(50);
if( objecttosearch != null)
System.out.println(\"Found Node : \" + objecttosearch.item);
else
System.out.println(\"Cannot locate the node\");
Node objecttodelete = object.delete(50);
if( objecttodelete != null )
System.out.println(\"Deleted node : \" + objecttodelete.item);
else
System.out.println(\"Cannot delete the node\");
object.display();
}
}
Solution
LinkedListOperations.java:-
class Node
{
public int item;
public Node next;
public Node(int val)
{
item = val;
}
public void displayNode()
{
System.out.println(\"[\" + item + \"] \");
}
}
class LinkedList
{
private Node first;
public LinkedList()
{
first = null;
}
public boolean isEmpty()
{
return (first==null);
}
public void insert(int val)//inserts at beginning of list
{
Node newNode = new Node(val);
newNode.next = first;
first = newNode;
}
public Node delete()//deletes at beginning of list
{
Node temp = first;
first = first.next;
return temp;
}
public void display()
{
System.out.println(\"List items from first to last :\");
Node current = first;
while(current != null)
{
current.displayNode();
current = current.next;
}
System.out.println(\"\");
}
public Node search(int val)
{
Node current = first;
while(current.item != val)
{
if(current.next == null)
return null;
else
current = current.next;
}
return current;
}
public Node delete(int val)
{
N.
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf
Here is the editable code:
Solution
import java.util.NoSuchElementException;
public class DoublyLinkedListImpl {
private Node head;
private Node tail;
private int size;
public DoublyLinkedListImpl() {
size = 0;
}
private class Node {
E element;
Node next;
Node prev;
public Node(E element, Node next, Node prev) {
this.element = element;
this.next = next;
this.prev = prev;
}
}
public int size() { return size; }
public boolean isEmpty() { return size == 0; }
public void addFirst(E element) {
Node tmp = new Node(element, head, null);
if(head != null ) {head.prev = tmp;}
head = tmp;
if(tail == null) { tail = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
/**
* adds element at the end of the linked list
* @param element
*/
public void addLast(E element) {
Node tmp = new Node(element, null, tail);
if(tail != null) {tail.next = tmp;}
tail = tmp;
if(head == null) { head = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
public void iterateForward(){
System.out.println(\"iterating forward..\");
Node tmp = head;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.next;
}
}
/**
* this method walks backward through the linked list
*/
public void iterateBackward(){
System.out.println(\"iterating backword..\");
Node tmp = tail;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.prev;
}
}
public E removeFirst() {
if (size == 0) throw new NoSuchElementException();
Node tmp = head;
head = head.next;
head.prev = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public E removeLast() {
if (size == 0) throw new NoSuchElementException();
Node tmp = tail;
tail = tail.prev;
tail.next = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public static void main(String a[]){
DoublyLinkedListImpl dll = new DoublyLinkedListImpl();
dll.addFirst(10);
dll.addFirst(34);
dll.addLast(56);
dll.addLast(364);
dll.iterateForward();
dll.removeFirst();
dll.removeLast();
dll.iterateBackward();
}
}
import java.util.Scanner;
/* Class Node */
class Node
{
protected int data;
protected Node next, prev;
/* Constructor */
public Node()
{
next = null;
prev = null;
data = 0;
}
/* Constructor */
public Node(int d, Node n, Node p)
{
data = d;
next = n;
prev = p;
}
/* Function to set link to next node */
public void setLinkNext(Node n)
{
next = n;
}
/* Function to set link to previous node */
public void setLinkPrev(Node p)
{
prev = p;
}
/* Funtion to get link to next node */
public Node getLinkNext()
{
return next;
}
/* Function to get link to previous node */
public Node getLinkPrev()
{
return prev;
}
/* Function to set data to node */
public void setData(int d)
{
data = d;
}
/* Function to get data from node */
public int getData()
{
return data;
}
}
/* Class linkedList */
class linkedList
{
protected Node start;
protected Node end ;
public int size;
/* Constructor */
public linkedList()
{
start = null;
end = null;
size = 0;
}
/* Function to check if list is empty */
public boolean isE.
Please change this method to recursive method. public String post.pdf
Please change this method to recursive method.
public String postfix() {
final ExpressionNodes nodes = new ExpressionNodes();
for (String element : expression.split(\" \")) {
if (isOperator(element)) {
String rightNode = nodes.pop();
String leftNode = nodes.pop();
nodes.push((leftNode + \" \" + rightNode + \" \" + element));
} else {
nodes.push((element));
}
}
return nodes.pop();
}
Solution
public class Main{
public String postfix(int count)
final ExpressiononNodes nodes = new ExpressiononNodes ();
for( String element : expression split(\" \"))
{
if (Is Operator(int element))
{
String rightNode = nodes.pop();
String leftNode = nodes.pop();
nodes.push((leftNode + \" \" + rightNode + \" \" +element));
}
else
{
nodes.push ((element));
}}
if (count <=0)
{
return nodes.pop();
}
else
{
postfix(count - 1);
}}
Public static void Main(String[] args)
{
Main n = new Main();
n.postfix(element);
}.
Help please, I have attached LinkedList.cpp and LinkedList.hPlease.pdf
Help please, I have attached LinkedList.cpp and LinkedList.h
Please help with the implementation of the Stack.h and Stack.cpp as well
LinkedList.cpp
~~~~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
/*Exercise2 */
void LinkedList::insertAtFront(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
if (last == NULL)
first = last = temp;
else
{
temp->next = first;
first = temp;
}
}
bool LinkedList::removeFromFront()
{
if (first == NULL)
return false;
Node *temp = first;
first = first->next;
free(temp);
if (first == NULL)
last = NULL;
return true;
}
LinkedList.h
~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *.
fix the error - class Node{ int data- Node next-.pdf
fix the error :
class Node{
int data;
Node next;
public Node(int data) {
this.data = data;
this.next = null;
}
}
class singlelinkedlist {
public Node head = null;
public Node tail = null;
public void addNode(int data) {
Node newNode = new Node(data);
if(head == null) {
head = newNode;
tail = newNode;
}
else {
tail.next = newNode;
tail = newNode;
}
}
public void sortList() {
Node current = head, index = null;
int temp;
if(head == null) {
return;
}
else {
while(current != null) {
index = current.next;
while(index != null) {
if(current.data > index.data) {
temp = current.data;
current.data = index.data;
index.data = temp;
}
index = index.next;
}
current = current.next;
}
}
}
public void display() {
Node current = head;
if(head == null) {
System.out.println("List is empty");
return;
}
while(current != null) {
System.out.print(current.data + " ");
current = current.next;
}
System.out.println();
}
}
public class JavaApplication46 {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
// TODO code application logic here
SortList sList = new SortList();
sList.addNode(9);
sList.addNode(7);
sList.addNode(2);
sList.addNode(5);
sList.addNode(4);
System.out.println("Original list: ");
sList.display();
sList.sortList();
System.out.println("Sorted list: ");
sList.display();
}
}.
Write a JAVA LinkedListRec class that has the following methods siz.pdf
Write a JAVA LinkedListRec class that has the following methods: size, empty, insertBefore,
insertAfter, addAtHead, addAtEnd, remove, replace, peekFront, peekEnd, removeFront,
removeEnd, toString. Use recursion to implement most of these methods. Write a driver to test
your implemented LinkedListRec class methods.
Solution
import java.util.Scanner;
public class LinkedListRec {
int data;
LinkedListRec prev=null,next=null;
int size(LinkedListRec l)//method which returns the length of the list
{
if(l==null)return 0;
return 1+size(l.next);
}
boolean empty(LinkedListRec l)//method checks whether the list is empty or not...
{
if(l==null)return true;
else return false;
}
LinkedListRec insertBefore(LinkedListRec l,int value,int num_insertbefore)//method which
adds a new number before the given number..
{
if(l==null)return l;
if(l.data == num_insertbefore)
{
LinkedListRec n = new LinkedListRec();
n.data = value;
if(l.prev==null)
{
n.next = l;
l=n;
}
else
{
n.prev = l.prev;
n.next= l;
l.prev = n;
}
return l;
}
return insertBefore(l.next,value,num_insertbefore);
}
LinkedListRec insertAfter(LinkedListRec l,int value,int num_insertafter)//method which adds
the new number after the given number
{
if(l==null)return l;
if(l.data == num_insertafter)
{
LinkedListRec n = new LinkedListRec();
n.data = value;
if(l.next==null)
{
l.next = n;
n.prev = l;
}
else
{
n.next = l.next;
l.next.prev = n;
n.prev = l;
}
return l;
}
return insertAfter(l.next,value,num_insertafter);
}
LinkedListRec addAtHead(LinkedListRec l,int value)//method which adds a new number at
the head position of the list...
{
LinkedListRec n = new LinkedListRec();
n.data=value;
n.next = l;
l=n;
return l;
}
LinkedListRec addAtEnd(LinkedListRec l,int value)//method which adds a new number at
the end position of the list...
{
if(l==null){ l = new LinkedListRec();l.data = value;return l;}
if(l.next==null)
{
LinkedListRec n = new LinkedListRec();
n.data=value;
n.prev = l;
l.next = n;
return l;
}
return addAtEnd(l.next,value);
}
LinkedListRec remove(LinkedListRec l,int value)//method which removes given numbet
from the list....
{
if(l==null)return l;
if(l.data == value)
{
if(l.prev!=null){
l.prev = l.next;
}
else
l=l.next;
return l;
}
return remove(l.next,value);
}
boolean replace(LinkedListRec l,int value,int newvalue)//method which replaces current
number with new number,...
{
if(l==null)return false;
if(l.data == value)
{
l.data = newvalue;
return true;
}
return replace(l.next,value,newvalue);
}
int peekFront(LinkedListRec l)//method which returns the first value of the list...
{
if(l!=null)
return l.data;
else return -1;
}
int peekEnd(LinkedListRec l)//method which returns the last value of the list........
{
if(l==null)return -1;
if(l.next == null)return l.data;
return peekEnd(l.next);
}
LinkedListRec removeFront(LinkedListRec l)//method which removes the first element of the
list..
{
if(l==null)return l;
l=l.next;
return l;
}
boolean removeEnd(LinkedListRec l)//method which removes the last element o.
import java-util-Iterator- import java-util-NoSuchElementException- im.pdf
import java.util.Iterator;
import java.util.NoSuchElementException;
import lab4.util.List;
public class SinglyLinkedList<E> implements List<E> {
@SuppressWarnings("hiding")
private class SinglyLinkedListIterator<E> implements Iterator<E>{
private Node<E> nextNode;
@SuppressWarnings("unchecked")
public SinglyLinkedListIterator() {
this.nextNode = (Node<E>) header.getNext();
}
@Override
public boolean hasNext() {
return nextNode != null;
}
@Override
public E next() {
if (this.hasNext()) {
E result = this.nextNode.getElement();
this.nextNode = this.nextNode.getNext();
return result;
}
else {
throw new NoSuchElementException();
}
}
}
private static class Node<E> {
private E element;
private Node<E> next;
public Node(E element, Node<E> next) {
super();
this.element = element;
this.next = next;
}
public Node() {
super();
}
public E getElement() {
return element;
}
public void setElement(E element) {
this.element = element;
}
public Node<E> getNext() {
return next;
}
public void setNext(Node<E> next) {
this.next = next;
}
}
private Node<E> header;
private int currentSize;
public SinglyLinkedList() {
this.header = new Node<>();
this.currentSize = 0;
}
@Override
public int size() {
return this.currentSize;
}
@Override
public boolean isEmpty() {
return this.size() == 0;
}
@Override
public boolean contains(E e) {
return this.firstIndexOf(e) >= 0;
}
@Override
public int firstIndexOf(E e) {
int i = 0;
for (Node<E> temp = this.header.getNext(); temp != null;
temp = temp.getNext(), ++i) {
if (temp.getElement().equals(e)) {
return i;
}
}
// not found
return -1;
}
@Override
public void add(E e) {
if (this.isEmpty()) {
this.header.setNext(new Node<E>(e, null));
this.currentSize++;
}
else {
Node<E>temp= this.header.getNext();
while (temp.getNext() != null) {
temp = temp.getNext();
}
Node<E> newNode = new Node<>(e, null);
temp.setNext(newNode);
this.currentSize++;
}
}
@Override
public void add(E e, int index) {
if ((index < 0) || (index > this.currentSize)) {
throw new IndexOutOfBoundsException();
}
if (index == this.currentSize) {
this.add(e);
}
else {
Node<E> temp = null;
if (index == 0) {
temp = this.header;
}
else {
temp = this.getPosition(index -1);
}
Node<E> newNode = new Node<>();
newNode.setElement(e);
newNode.setNext(temp.getNext());
temp.setNext(newNode);
this.currentSize++;
}
}
@Override
public E get(int position) {
if ((position < 0) || position >= this.currentSize) {
throw new IndexOutOfBoundsException();
}
Node<E> temp = this.getPosition(position);
return temp.getElement();
}
private Node<E> getPosition(int index){
int currentPosition=0;
Node<E> temp = this.header.getNext();
while(currentPosition != index) {
temp = temp.getNext();
currentPosition++;
}
return temp;
}
@Override
public boolean remove(int index) {
if ((index < 0) || (index >= this.currentSize)){
throw new IndexOutOfBoundsException();
}
else {
Node<E> temp = this.header;
int currentPosition =0;
Node<E> target = null;
while (currentPosition != index) {
temp = temp.getNext();
currentPosit.
hi i have to write a java program involving link lists. i have a pro.pdf
hi i have to write a java program involving link lists. i have a problem with the nodes, as it is
posting errors with the nodes.
please help me with this problem. thank you.
public class LinkLists {
/* only need to store a single pointer to the node at the head
* of the list.
* The pointer is null if the list is empty.
* Also record the size of the list.
*/
protected Node head;
/* invariant: size is the number of nodes in the list pointed to by head */
protected int size;
/* no-arguments default constructor creates an empty list */
public LinkLists() {
head = null; // start with an empty list
size = 0;
}
/* accessor method */
public int size() {
return size;
}
/* value to add to the end of the list
*/
public void add(T value) {
head = addAtEnd(head, value);
size++;
}
/* node of the list to which the value should be added
* value to add to the end of the list
*/
private Node addAtEnd(Node node, T value) {
if (node == null) { // special case
return new Node(value, null);
} else if (node.getNext() == null) { // other special case
node.setNext(new Node(value, null));
} else {
addAtEnd(node.getNext(), value);
}
return node;
}
/* iterative implementation of the same method
* value to add to the end of the list
*/
public void add2(T value) {
if (head == null) {
head = new Node(value, null);
} else {
Node node = head; // guaranteed not to be null initially
while (node.getNext() != null) {
node = node.getNext(); // guaranteed not to be null here
}
// now, node.getNext() is guaranteed to be null
// similar to the second special case in addAtEnd
node.setNext(new Node(value, null));
}
size++;
}
public void remove(int position) throws BadItemCountException {
if ((position < 1) || (position > size)) {
throw new
BadItemCountException(\"invalid position \" + position +
\", only 1..\" + size + \" available\");
}
if (position == 1) {
head = head.getNext();
} else {
Node node = head;
for (int i = 2; i < position; i++) {
node = node.getNext();
}
node.setNext(node.getNext().getNext());
}
size--; // one less item
}
public String toString() {
return toString(head);
}
private String toString(Node node) {
if (node == null) {
return \"\";
} else {
return node.getValue() + \"\ \" + toString(node.getNext());
}
}
public static void main(String[] args) {
/* create two empty lists, make sure they print out correctly */
LinkLists list1 = new LinkLists();
LinkLists list2 = new LinkLists();
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* insert some items, keep checking */
list1.add(\"hello\");
list1.add(\"world\");
list2.add(\"foo\");
list2.add(\"bar\");
list2.add(\"baz\");
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* remove an item at an invalid position */
boolean caught = false;
try {
list2.remove(4);
} catch .
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Labprogram.java
LinkedList.java
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
/**** CONSTRUCTORS ****/
public LinkedList() {
first = null;
last = null;
iterator = null;
length = 0;
}
/**
* Converts the given array into a LinkedList
*
* @param array the array of values to insert into this LinkedList
* @postcondition
*/
public LinkedList(T[] array) {
}
/**
* Instantiates a new LinkedList by copying another List
*
* @param original the LinkedList to copy
* @postcondition a new List object, which is an identical,
* but separate, copy of the LinkedList original
*/
public LinkedList(LinkedList original) {
}
public T getFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
return last.data;
}
public T getIterator() throws NullPointerException {
if (iterator != null) {
return iterator.data;
} else {
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
public int getLength() {
return length;
}
public boolean isEmpty() {
return length == 0;
}
public boolean offEnd() {
return iterator == null;
}
public void addFirst(T data) {
Node newNode = new Node(data);
if (isEmpty()) {
first = newNode;
last = newNode;
} else {
newNode.next = first;
first.prev = newNode;
first = newNode;
}
length++;
}
public void addLast(T data) {
Node newNode = new Node(data);
if (isEmpty()) {
first = newNode;
last = newNode;
} else {
last.next = newNode;
newNode.prev = last;
last = newNode;
}
length++;
}
public void addIterator(T data) throws NullPointerException {
if (offEnd()) {
throw new NullPointerException("addIterator Iterator is off end.");
}
if (iterator == last) {
addLast(data);
} else {
Node newNode = new Node(data);
Node next = iterator.next;
newNode.next = next;
newNode.prev = iterator;
iterator.next = newNode;
next.prev = newNode;
length++;
}
}
public void removeFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
if (length == 1) {
first = null;
last = null;
iterator = null;
} else {
if (iterator == first) {
iterator = null;
}
first = first.next;
first.prev = null;
}
length--;
}
public void removeLast() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
if (length == 1) {
first = null;
last = null;
iterator = null;
} else {
if (iterator == last) {
iterator = null;
}
last = last.prev;
last.next = null;
}
length--;
}
public void removeIterator() throws NullPointerException {
if (offEnd()) {
throw new NullPointerException("Iterator is off the end opf the list.");
}
if (iterator .
I will provide my LinkedList from my last lab.LinkedList.cpp~~~~.pdf
I will provide my LinkedList from my last lab.
LinkedList.cpp
~~~~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
/*Exercise2 */
void LinkedList::insertAtFront(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
if (last == NULL)
first = last = temp;
else
{
temp->next = first;
first = temp;
}
}
bool LinkedList::removeFromFront()
{
if (first == NULL)
return false;
Node *temp = first;
first = first->next;
free(temp);
if (first == NULL)
last = NULL;
return true;
}
LinkedList.h
~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
/*Exercise2 */
vo.
Note Given Code modified as required and required met.pdf
Note:
Given Code modified as required and required methods added.
Code:
// class node
class Node
{
// declare the required variable
String data;
Node next;
// constructor
Node(){}
// constructor with arguments
Node(String data)
{
this.data = data;
next = null;
}
// method to get the data
public String getData()
{
return data;
}
// method to set the data
public void setData(String data)
{
this.data = data;
}
// method to get the next data
public Node getNext()
{
return next;
}
// method to set the next data
public void setNext(Node next)
{
this.next = next;
}
}
// class for a linked list
class MyLInkedList
{
Node head;alue into a list
// method to add the v
public void add(String num)
{
if (head == null)
{
head = new Node(num);
}
else{
Node temp = new Node(num);
Node current = head;
if (current != null) {
while (current.getNext() != null) {
current = current.getNext();
}
current.setNext(temp);
}
}
}
// method to search a value from a list
public void search(String num)
{
Node current = head;
boolean flag=true;
if (current != null)
{
while (current != null)
{
if(current.getData() == num)
{
System.out.println(\"Search value \"+
current.getData()+\" is available\");
flag=false;
}
current = current.getNext();
}
if (flag==true)
{
System.out.println(\"Search value \"+
current.getData()+\" is not available\");
}
}
else
{
System.out.println(\"Linked list is empty\");
}
}
// method to delete a value from a list
public void delete(String num)
{
//Node current = head;
boolean flag=true;
if (head == null)
{
System.out.println(\"Can\'t Delete, Linked list is
empty\");
return;
}
if(head.getData() == num)
{
head=head.getNext();
return;
}
Node temp = new Node(num);
Node cr = head;
Node prev=null;
while ((cr != null) && !(cr.getData() == num))
{
prev=cr;
cr = cr.getNext();
}
prev.setNext(cr.getNext());
}
// method to print the list
public void print()
{
Node current = head;
if (current != null) {
while (current != null) {
System.out.println(current.getData());
current = current.getNext();
}
}
}
}
// method to test the class
public class MyLInkedListTester
{
// main method to perform the linked list operatrions
public static void main(String args[])
{
MyLInkedList llist = new MyLInkedList();
// insert the values into list
llist.add(\"1\");
llist.add(\"2\");
llist.add(\"3\");
llist.add(\"4\");
// print the list values
llist.print();
// sear the values in a list
llist.search(\"1\");
llist.print();
// delete the value from a list
llist.delete(\"4\");
System.out.println(\"List after deletion:\");
llist.print();
}
}
Result:
1
2
3
4
Search value 1 is available
1
2
3
4
List after deletion:
1
2
3
Solution
Note:
Given Code modified as required and required methods added.
Code:
// class node
class Node
{
// declare the required variable
String data;
Node next;
// constructor
Node(){}
// constructor with arguments
Node(String data)
{
this.data = data;
next = null;
}
// method to get the data
public String getData()
{
return data;
}
// method to set the data
public void se.
Create a new java class called ListNode. Implement ListNode as a gen.pdf
Create a new java class called ListNode. Implement ListNode as a generic version of IntNode.
public class ListNode { }
Create a generic class called Queue, which is a linked list implementation of a queue data type.
Queue must have the following methods:
• public void enqueue(T value){} This method should add a new node to the back of the queue.
• public T dequeue(){} This method should remove a node from the front of the queue and return
its value
• public T peek(){} This method should return the value of the front node without removing it
from the queue
Create a new generic class called Stack, which is a linked list implementation of a stack data
type. Stack must have the following methods:
• public void push(T value){} This method should add a new node to the top of the stack.
• public T pop(){} This method should remove a node from the top of the stack and return its
integer value
• public T peek(){} This method should return the integer value of the top node without
removing it from the stack
Solution
import java.util.Iterator;
public class LinkedList extends AbstractList {
private ListNode front; // refers to first node in list (null if empty)
public LinkedList() {
front = null; // null front means empty
}
public void add(int index, E value) {
if (index == 0) {
// insert at the front
front = new ListNode(value, front);
} else {
ListNode current = goTo(index - 1);
ListNode newNode = new ListNode(value, current.next);
current.next = newNode;
}
}
public E get(int index) {
ListNode current = goTo(index);
return current.data;
}
public int indexOf(E value) {
int index = 0;
ListNode current = front;
while (current != null) {
if (current.data == value) {
return index;
}
index++;
current = current.next;
}
return -1;
}
public Iterator iterator() {
return new LinkedListIterator();
}
public void remove(int index) {
if (index == 0) {
// removing from the front
front = front.next;
} else {
ListNode current = goTo(index - 1);
current.next = current.next.next; // deletes the node
}
}
public void set(int index, E value) {
ListNode current = goTo(index);
current.data = value;
}
public int size() {
int count = 0;
ListNode current = front;
while (current != null) {
current = current.next;
count++;
}
return count;
}
public String toString() {
if (front == null) {
return \"[]\";
} else {
String result = \"[\" + front.data;
ListNode current = front.next;
while (current != null) {
result += \", \" + current.data;
current = current.next;
}
result += \"]\";
return result;
}
}
private ListNode goTo(int index) {
ListNode current = front;
for (int i = 0; i < index; i++) {
current = current.next;
}
return current;
}
public class ListNode {
public E data;
public ListNode next;
public ListNode(E data) {
this.data = data;
this.next = null;
}
public ListNode(E data, ListNode next) {
this.data = data;
this.next = next;
}
}
private class LinkedListIterator implements Iterator {
private ListNode current; // current position in list
public LinkedListIterator() {
current = f.
In C++Write a recursive function to determine whether or not a Lin.pdf
In C++
Write a recursive function to determine whether or not a Linked List is in sorted order (smallest
value to largest value).
Add the following function prototypes to your List class under the section for access functions,
then implement the functions below the class definition:
public:
/**Access Functions*/
bool isSorted();
//Wrapper function that calls the isSorted helper function to determine whether
//a list is sorted in ascending order.
//We will consider that a list is trivially sorted if it is empty.
//Therefore, no precondition is needed for this function
private:
bool isSorted(Nodeptr node);
//Helper function for the public isSorted() function.
//Recursively determines whether a list is sorted in ascending order.
#include //for NULL
#include
#include
using namespace std;
template //list stores generic list data, not any specific C++ type
class List
{
private:
struct Node
{
listdata data;
Node* next;
Node* previous;
Node(listdata data): data(data), next(NULL), previous(NULL){}
};
typedef struct Node* Nodeptr;
Nodeptr first;
Nodeptr last;
Nodeptr iterator;
int size;
public:
/**Constructors and Destructors*/
List();
//Default constructor; initializes and empty list
//Postcondition: numeric values equated to zero, or strings should be empty.
List(const List &list);
~List();
//Destructor. Frees memory allocated to the list
//Postcondition: position NodePtr at next Node
/**Accessors*/
listdata getFirst();
//Returns the first element in the list
//Precondition:NodePtr points to the first node on list
listdata getLast();
//Returns the last element in the list
//Precondition: make new node first on the list
listdata getIterator();
bool isEmpty();
//Determines whether a list is empty.
int getSize();
//Returns the size of the list
/**Manipulation Procedures*/
void startIterator();
void advanceIterator();
void removeLast();
//Removes the value of the last element in the list
//Precondition: list is not empty, not the first element.
//Postcondition: one remaining node
void removeIterator();
void removeFirst();
//Removes the value of the first element in the list
//Precondition: list is not empty
//Postcondition: no nodes left
void insertLast(listdata data);
//Inserts a new element at the end of the list
//If the list is empty, the new element becomes both first and last
//Postcondition: next equal to null
void insertFirst(listdata data);
//Inserts a new element at the start of the list
//If the list is empty, the new element becomes both first and last
//Postcondition:point nodePtr next node on list
/**Additional List Operations*/
bool offEnd();
void printList();
//Prints to the console the value of each element in the list sequentially
//and separated by a blank space
//Prints nothing if the list is empty
void insertIterator(listdata data);
bool operator==(const List &list);
};
// constructor definition
template
List::List(): first(NULL), last(NULL), iterator(NULL), size(0) {}
template
List::List(const List &list): size(list.size)
{
if(list..
Help I keep getting the same error when running a code. Below is the.pdf
Help I keep getting the same error when running a code. Below is the code and the instructions
about the code.
import java.util.Arrays;
public class Album implements Comparable {
private final int id;
private final String[] artists;
private final int numSongs;
public Album(int id, String title, String[] artists, int numSongs) {
this.id = id;
this.artists = new String[]{Arrays.toString(artists)};
this.numSongs = numSongs;
}
public int getId() {
return id;
}
@Override
public int compareTo(Album other) {
return Integer.compare(this.numSongs, other.numSongs);
}
@Override
public String toString() {
StringBuilder artistNames = new StringBuilder();
for (String artist : artists) {
artistNames.append(artist).append(", ");
}
artistNames.delete(artistNames.length() - 2, artistNames.length());
return "ID: " + id + " -- " + numSongs + " songs -- [" + artistNames + "]";
}
}
import java.util.Random;
public class DoublyLinkedList {
private static class Node {
T data;
Node prev;
Node next;
Node(T data) {
this.data = data;
}
}
private Node head;
private Node tail;
private int size;
public DoublyLinkedList() {
head = null;
tail = null;
size = 0;
}
public Node append(T data) {
Node newNode = new Node<>(data);
if (head == null) {
head = newNode;
} else {
tail.next = newNode;
newNode.prev = tail;
}
tail = newNode;
size++;
return newNode;
}
public Node insert(int location, T data) {
if (location < 0 || location > size) {
throw new IllegalArgumentException("Invalid location");
}
Node newNode = new Node<>(data);
if (location == 0) {
newNode.next = head;
if (head != null) {
head.prev = newNode;
}
head = newNode;
if (tail == null) {
tail = newNode;
}
} else if (location == size) {
tail.next = newNode;
newNode.prev = tail;
tail = newNode;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
newNode.prev = current.prev;
newNode.next = current;
current.prev.next = newNode;
current.prev = newNode;
}
size++;
return newNode;
}
public Node delete(int location) {
if (location < 0 || location >= size) {
throw new IllegalArgumentException("Invalid location");
}
Node deletedNode;
if (location == 0) {
deletedNode = head;
head = head.next;
if (head != null) {
head.prev = null;
} else {
tail = null;
}
} else if (location == size - 1) {
deletedNode = tail;
tail = tail.prev;
tail.next = null;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
deletedNode = current;
current.prev.next = current.next;
current.next.prev = current.prev;
}
size--;
return deletedNode;
}
public int getIndex(T data) {
Node current = head;
for (int i = 0; i < size; i++) {
if (current.data.equals(data)) {
return i;
}
current = current.next;
}
return -1;
}
@Override
public String toString() {
StringBuilder result = new StringBuilder();
Node current = head;
while (current != null) {
result.append(current.data).append(" -> ");
current = current.next;
}
result.append("NULL");
return result.toString();
}
public Node shuffle() {
Random r.
PROBLEM STATEMENTIn this assignment, you will complete DoubleEnde.pdf
PROBLEM STATEMENT:
In this assignment, you will complete DoubleEndedList.java that implements the ListInterface as
well as an interface called DoubleEndedInterface which represents the list's entries by using a
chain of nodes that has both a head reference and a tail reference. Be sure to read through the
code and understand the implementation.
WHAT IS PROVIDED:
- A driver class to test your code. You should not modify this file!
- A list interface (ListInterface.java)
- A double ended interface (DoubleEndedInterface.java)
- An incomplete DoubleEndedList class (DoubleEndedList.java)
WHAT YOU NEED TO DO:
4. Complete the DoubleEndedList class
4. Run the driver and make sure your output is exactly the same as mine (at the bottom of
Driver.java)
\} // end else numberofEntries--; else throw new IndexOut0fBoundsException("Illegal position
given to remove operation."); return result; // Return removed entry }//endreturnreve public T
replace(int givenPosition, T newEntry) \{ T replace(int givenPosition, T newEntry) \{ if
((givenPosition >=1)&& (givenPosition <= numberOfEntries)) \{ // Assertion: The list is not
empty Node desiredNode = getNodeAt (givenPosition); ToriginalEntry = desiredNode.getData();
desiredNode.setData(newEntry); return originalEntry; f // end if else throw new
IndexOut0fBoundsException("Illegal position given to replace operation."); replace if ((
givenPosition >=1)&& (givenPosition <= number0fEntries)) \{ // Assertion: The list is not
empty Node desiredNode = getNodeAt ( givenPosition); T originalEntry = desiredNode.
getData( ); desiredNode.setData(newEntry); return originalentry; \} // end if throw new
Index0ut0fBoundsException("Illegal position given to replace operation."); \} // end replace
public T getEntry(int givenPosition) \{ if ((givenPosition >=1) \&\& (givenPosition < =
number0fEntries ) ) \{ // Assertion: The list is not empty return getNodeAt (givenPosition).
getData(); else // end if throw new IndexOut0fBoundsException("Illegal position given to
getEntry operation."); \} // end getEntry public boolean contains ( T anEntry) \{ boolean found =
false; Node currentNode = firstNode; while (!found && (currentNode != null)) \{ if
(anEntry.equals (currentNode.getData())) else found = true; \} // end while currentNode =
currentNode. getNextNode () ; return found; \} // end contains public int getLength() \{ return
numberofEntries; \} // end getLength public boolean isEmpty() \{ return number0fEntries ==0;
\} // end isEmpty public T[] toArray() \{ // The cast is safe because the new array contains null
entries aSuppressWarnings ("unchecked") T[] result =(T[]) new 0bject [numberofEntries]; //
Unchecked cast int index =0; Node currentNode = firstNode; while ((index < numberOfEntries)
\&\& (currentNode != null)) \& result [ index ]= currentNode. getData () ; currentNode =
currentNode.getNextNode ( ); index++; 3 // end while return result; 3 // end toArray // Returns a
reference to the node at a given position. // Precondition: L.
How do I fix it in javaLinkedList.java Defines a doubl.pdf
How do I fix it in java?
LinkedList.java:
/**
* Defines a doubly-linked list class
* @author
* @author
*/
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
/**** CONSTRUCTORS ****/
/**
* Instantiates a new LinkedList with default values
* @postcondition
*/
public LinkedList() {
first = null;
last = null;
iterator = null;
length = 0;
}
/**
* Converts the given array into a LinkedList
* @param array the array of values to insert into this LinkedList
* @postcondition
*/
public LinkedList(T[] array) {
}
/**
* Instantiates a new LinkedList by copying another List
* @param original the LinkedList to copy
* @postcondition a new List object, which is an identical,
* but separate, copy of the LinkedList original
*/
public LinkedList(LinkedList original) {
}
/**** ACCESSORS ****/
public T getFirst() throws NoSuchElementException {
if (isEmpty()){
throw new NoSuchElementException("The list is empty");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (isEmpty()){
throw new NoSuchElementException("The list is empty");
}
return last.data;
}
/**
* Returns the data stored in the iterator node
* @precondition
* @return the data stored in the iterator node
* @throw NullPointerException
*/
public T getIterator() throws NullPointerException {
if (iterator != null){
return iterator.data;
}else{
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
/**
* Returns the current length of the LinkedList
* @return the length of the LinkedList from 0 to n
*/
public int getLength() {
return length;
}
/**
* Returns whether the LinkedList is currently empty
* @return whether the LinkedList is empty
*/
public boolean isEmpty() {
return length == 0;
}
/**
* Returns whether the iterator is offEnd, i.e. null
* @return whether the iterator is null
*/
public boolean offEnd() {
return iterator == null;
}
/**** MUTATORS ****/
public void addFirst(T data) {
Node newNode = new Node(data);
if(isEmpty()){
first = newNode;
last = newNode;
}
else{
newNode.next = first;
first.prev = newNode;
first = newNode;
}
length++;
}
public void addLast(T data) {
Node newNode = new Node(data);
if(isEmpty()){
first = newNode;
last = newNode;
}
else{
last.next = newNode;
newNode.prev = last;
last = newNode;
}
length++;
}
/**
* Inserts a new element after the iterator
* @param data the data to insert
* @precondition
* @throws NullPointerException
*/
public void addIterator(T data) throws NullPointerException{
if(iterator != null){
Node newNode = new Node(data);
newNode.next = iterator.next;
iterator.next = newNode;
if (iterator == first){
first = newNode;
}
}else{
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
/
public void removeFirst() throws NoSuchElementException {
if(is.
How do I fix it in LinkedList.javaLinkedList.java Define.pdf
How do I fix it in LinkedList.java?
LinkedList.java:
/**
* Defines a doubly-linked list class
* @author
* @author
*/
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
/**** CONSTRUCTORS ****/
/**
* Instantiates a new LinkedList with default values
* @postcondition
*/
public LinkedList() {
first = null;
last = null;
iterator = null;
length = 0;
}
/**
* Converts the given array into a LinkedList
* @param array the array of values to insert into this LinkedList
* @postcondition
*/
public LinkedList(T[] array) {
}
/**
* Instantiates a new LinkedList by copying another List
* @param original the LinkedList to copy
* @postcondition a new List object, which is an identical,
* but separate, copy of the LinkedList original
*/
public LinkedList(LinkedList original) {
}
/**** ACCESSORS ****/
public T getFirst() throws NoSuchElementException {
if (isEmpty()){
throw new NoSuchElementException("The list is empty");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (isEmpty()){
throw new NoSuchElementException("The list is empty");
}
return last.data;
}
/**
* Returns the data stored in the iterator node
* @precondition
* @return the data stored in the iterator node
* @throw NullPointerException
*/
public T getIterator() throws NullPointerException {
if (iterator != null){
return iterator.data;
}else{
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
/**
* Returns the current length of the LinkedList
* @return the length of the LinkedList from 0 to n
*/
public int getLength() {
return length;
}
/**
* Returns whether the LinkedList is currently empty
* @return whether the LinkedList is empty
*/
public boolean isEmpty() {
return length == 0;
}
/**
* Returns whether the iterator is offEnd, i.e. null
* @return whether the iterator is null
*/
public boolean offEnd() {
return iterator == null;
}
/**** MUTATORS ****/
public void addFirst(T data) {
Node newNode = new Node(data);
if(isEmpty()){
first = newNode;
last = newNode;
}
else{
newNode.next = first;
first.prev = newNode;
first = newNode;
}
length++;
}
public void addLast(T data) {
Node newNode = new Node(data);
if(isEmpty()){
first = newNode;
last = newNode;
}
else{
last.next = newNode;
newNode.prev = last;
last = newNode;
}
length++;
}
/**
* Inserts a new element after the iterator
* @param data the data to insert
* @precondition
* @throws NullPointerException
*/
public void addIterator(T data) throws NullPointerException{
if(iterator != null){
Node newNode = new Node(data);
newNode.next = iterator.next;
iterator.next = newNode;
if (iterator == first){
first = newNode;
}
}else{
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
/
public void removeFirst() throws NoSuchElementExcept.
In an ancient land, the beautiful princess Eve had many suitors She d.pdf
Find four separate health care organization\'\'s net worth terms in published news sources such as
The Wall Street Journal or Business Week.
Comment on whether the net worth term you have found appear to be referring to for-profit
corporations; for-profit sole proprietors or partnerships, or not-for-profit companies. What led
you to believe this?
Through research identify the mission/vision statements of the four organizations you have
identified. Discuss the pros and cons of each organization\'s for profit and not for profit status
If you were the author of these articles, would you have been more specific? If so, why? If not,
why not?
Solution
Mitchell\'s blog offers an opportunity to share some of the knowledge he\'s gathered over the
years on this topic and encourage others to participate by sharing their thoughts.
For my first 15 or so years in the business I have only discussed with the few clients who bring it
up. While it has been a passion of mine for years, I feel it is my role as an advisor to work with
my clients on the things that are important to them and not have my values get in the way of
what the client is trying to achieve.
This blog is not meant as a place to share hot stock tips or try to judge the market conditions at
any particular moment in time. It is meant to share some of the knowledge I\'ve gathered over the
years on these topics and add food for thought to the reader\'s thoughts in this area. I\'ll try to
keep you informed of any current trends or articles I find of interest. The opinions voiced in this
material are for general information only and are not intended to provide specific advice or
recommendations for any individual. All performance referenced is historical and is no guarantee
of future results. All indices are unmanaged and may not be invested into directly. Third party
posts found on this profile do not reflect the views of LPL Financial and have not been reviewed
by LPL Financial as to accuracy or completeness.
July 2, 2018
The Wall Street Journal posted a column last week entitled \"IF YOU WANT TO DO GOOD,
EXPECT TO DO BADLY\" discussing reasons the author believes ESG investing is foolish. The
response from US-SIF was not published from what I can tell, but feel it is important enough to
share:
James Mackintosh’s June 28 article, “If You Want To Do Good, Expect To Do Badly: Investors
need to choose between backing their beliefs with dollars, or being profit-minded capitalists”
misses the mark and is out of touch with the latest studies, data and trends from Barclays,
INVESTMENT GIANTS STEP UP GOVERNANCE OVERSIGHT\" in Corporate
Responsibility Magazine. The article goes on to say how some of the world\'s biggest investment
firms such as Vanguard, Blackrock and State Street \"are putting the thousands of companies in
their portfolios on notice that their governance practices and strategies will be more closely
monitored by the funds in the future. And they’re not looking just for traditional
govern.
The LinkedList1 class implements a Linked list. class.pdf
/**
The LinkedList1 class implements a Linked list.
*/
class LinkedList1
{
/**
The Node class stores a list element
and a reference to the next node.
*/
private class Node
{
String value;
Node next;
/**
Constructor.
@param val The element to store in the node.
@param n The reference to the successor node.
*/
Node(String val, Node n)
{
value = val;
next = n;
}
/**
Constructor.
@param val The element to store in the node.
*/
Node(String val)
{
// Call the other (sister) constructor.
this(val, null);
}
}
private Node first; // list head
private Node last; // last element in list
/**
Constructor.
*/
public LinkedList1()
{
first = null;
last = null;
}
/**
The isEmpty method checks to see
if the list is empty.
@return true if list is empty,
false otherwise.
*/
public boolean isEmpty()
{
return first == null;
}
/**
The size method returns the length of the list.
@return The number of elements in the list.
*/
public int size()
{
int count = 0;
Node p = first;
while (p != null)
{
// There is an element at p
count ++;
p = p.next;
}
return count;
}
/**
The add method adds an element to
the end of the list.
@param e The value to add to the
end of the list.
*/
public void add(String e)
{
if (isEmpty())
{
first = new Node(e);
last = first;
}
else
{
// Add to end of existing list
last.next = new Node(e);
last = last.next;
}
}
/**
The add method adds an element at a position.
@param e The element to add to the list.
@param index The position at which to add
the element.
@exception IndexOutOfBoundsException When
index is out of bounds.
*/
public void add(int index, String e)
{
if (index < 0 || index > size())
{
String message = String.valueOf(index);
throw new IndexOutOfBoundsException(message);
}
// Index is at least 0
if (index == 0)
{
// New element goes at beginning
first = new Node(e, first);
if (last == null)
last = first;
return;
}
// Set a reference pred to point to the node that
// will be the predecessor of the new node
Node pred = first;
for (int k = 1; k <= index - 1; k++)
{
pred = pred.next;
}
// Splice in a node containing the new element
pred.next = new Node(e, pred.next);
// Is there a new last element ?
if (pred.next.next == null)
last = pred.next;
}
/**
The toString method computes the string
representation of the list.
@return The string form of the list.
*/
public String toString()
{
StringBuilder strBuilder = new StringBuilder();
// Use p to walk down the linked list
Node p = first;
while (p != null)
{
strBuilder.append(p.value + \"\ \");
p = p.next;
}
return strBuilder.toString();
}
/**
The remove method removes the element at an index.
@param index The index of the element to remove.
@return The element removed.
@exception IndexOutOfBoundsException When index is
out of bounds.
*/
public String remove(int index)
{
if (index < 0 || index >= size())
{
String message = String.valueOf(index);
throw new IndexOutOfBoundsException(message);
}
String element; // The element to return
if (index == 0)
{
// Removal of first item in the list
element.
Что нам готовит грядущий C#7?
Не так давно вышел C# 6, основанный на новом компиляторе Roslyn. Обновление языка содержит большое количество приятных синтаксических конструкций, которые упрощают написание кода и делают его более лаконичным. Но Microsoft на этом не успокоились: прямо сейчас ведётся работа над 7-ой версией языка, которую планируют сделать ещё удобнее, благодаря реализации современных тенденций написания кода. В этом докладе мы поговорим о том, что может войти в C# 7. В числе прочего будут обсуждаться Tuples, Pattern matching, Records / algebraic data types, Nullability tracking и многое другое.
There is something wrong with my program-- (once I do a for view all t.pdf
There is something wrong with my program.. (once I do a for view all this is the outcome in the
console...(carnea:Name: carnea, Address: 30 repeated..) why is this?
import java.util.Scanner;
public class AddressBook {
public static void main(String[] args) {
Tablea addressBook = new Tablea();
Scanner scanner = new Scanner(System.in);
String name, address;
String action = null;
boolean moreEntries = true;
while (moreEntries) {
System.out.println("/nMenu");
System.out.println("n.Add Entry");
System.out.println("d. Delete Entry");
System.out.println("u. Update Entry");
System.out.println("l. Search");
System.out.println("a. View All");
System.out.println("q. Exit");
action = scanner.nextLine();
// Insert a new entry into the address book
switch (action) {
case "n":
System.out.print("Enter a name: ");
name = scanner.nextLine();
System.out.print("Enter an address: ");
address = scanner.nextLine();
addressBook.insert(name, address);
System.out.println("New Contact has been added,");
break;
// Delete an entry from the address book
case "d":
System.out.println("Enter a name to delete: ");
name = scanner.nextLine();
boolean deleted = addressBook.delete(name);
if (deleted) {
System.out.println("Address deleted");
} else {
System.out.println("Name not found");
}
break;
// Update an entry in the address book
case "u":
System.out.print("Enter a name to update: ");
name = scanner.nextLine();
System.out.print("Enter a new address: ");
address = scanner.nextLine();
boolean updated = addressBook.update(name, address);
if (updated) {
System.out.println("Address updated");
} else {
System.out.println("Name not found");
}
break;
// Lookup an entry in the address book
case "l":
System.out.print("Enter a name to look up: ");
name = scanner.nextLine();
String result = addressBook.lookUp(name);
if (result != null) {
System.out.println("Address: " + result);
} else {
System.out.println("Name not found");
}
break;
// Display all entries in the address book
case "a":
System.out.println("All entries:");
addressBook.displayAll();
break;
// Quit the program
case"q":
System.out.println("Quitting...");
}
}
}
}
public class Node {
private String name;
private String address;
private Node next;
public Node(String name, String address) {
// add here ..
this.name = name;
this.address = address;
}
public String getName() {
// add here ..
return this.name;
}
public void setName(String name) {
// add here ..
this.name = name;
}
public String getAddress() {
// add here ..
return this.address;
}
public void setAddress(String address) {
// add here ..
this.address = address;
}
public Node getNext() {
// add here ..
return this.next;
}
public String toString() {
return "Name: "+ name +", Address:" +address;
}
public void setNext(Node node) {
// add here ..
this.next = next;
}
public void setAddress (Object newValue) {
this.address = address;
}
public void setName(Object newValue) {
this.name = name;
}
}
import java.util.Scanner;
public class Tablea {
private Node mark;
public Node get.
using set identitiesSolutionimport java.util.Scanner; c.pdf
using set identities
Solution
import java.util.Scanner;
/* category Node */
class Node
creator */
public Node()
/* builder */
public Node(int d,Node n)
/* perform to line link to next Node */
public void setLink(Node n)
/* perform to line knowledge to current Node */
public void setData(int d)
/* perform to urge link to next node */
public Node getLink()
come back link;
}
/* perform to urge knowledge from current Node */
public int getData()
come back data;
}
}
/* category linkedList */
class linkedList
begin ;
protected Node finish ;
public int size ;
/* builder */
public linkedList()
begin = null;
finish = null;
size = 0;
}
/* perform to envision if list is empty */
public mathematician isEmpty()
come back begin == null;
}
/* perform to urge size of the list */
public int getSize()
come back size;
}
/* perform to insert part at the begining */
public void insertAtStart(int val)
{
Node nptr = new Node(val,null);
nptr.setLink(start);
if(start == null)
{
begin = nptr;
nptr.setLink(start);
finish = start;
}
else
{
end.setLink(nptr);
begin = nptr;
}
size++ ;
}
/* perform to insert part at finish */
public void insertAtEnd(int val)
{
Node nptr = new Node(val,null);
nptr.setLink(start);
if(start == null)
{
begin = nptr;
nptr.setLink(start);
finish = start;
}
else
{
end.setLink(nptr);
finish = nptr;
}
size++ ;
}
/* perform to insert part at position */
public void insertAtPos(int val , int pos)
one ;
for (int i = 1; i < size - 1; i++)
ptr = ptr.getLink();
}
size++ ;
}
/* perform to delete part at position */
public void deleteAtPos(int pos)
one && pos == 1)
begin = null;
finish = null;
size = 0;
return ;
}
if (pos == 1)
begin = begin.getLink();
end.setLink(start);
size--;
return ;
}
if (pos == size)
whereas (s != end)
end = t;
end.setLink(start);
size --;
return;
}
Node ptr = start;
pos = pos - one ;
for (int i = 1; i < size - 1; i++)
ptr = ptr.getLink();
}
size-- ;
}
/* perform to show contents */
public void display()
making object of linkedList */
linkedList list = new linkedList();
System.out.println(\"Circular individually coupled List Test\ \");
char ch;
/* Perform list operations */
do
{
System.out.println(\"\ Circular individually coupled List Operations\ \");
System.out.println(\"1. insert at begining\");
System.out.println(\"2. insert at end\");
System.out.println(\"3. insert at position\");
System.out.println(\"4. delete at position\");
System.out.println(\"5. check empty\");
System.out.println(\"6. get size\");
int selection = scan.nextInt();
switch (choice).
package singlylinkedlist; public class Node { public String valu.pdf
package singlylinkedlist;
public class Node {
public String value;
public Node next;
public Node(String value) {
this.value = value;
}
@Override
public String toString() {
return value;
}
}
SingleyLinkedList.java :
package singlylinkedlist;
import java.io.*;
import java.util.*;
/**
* Defines the interface for a singly-linked list.
*
*/
public interface SinglyLinkedList {
/**
* @return Reference to the first node. If the list is empty, this method
* returns null.
*/
public Node getFirst();
/**
* @return Reference to the last node . If the list is empty, this method
* returns null.
*/
public Node getLast();
/**
* @return Number of nodes in the list
*/
public int size();
/**
* @return true if the list has no nodes; false otherwise
*/
public boolean isEmpty();
/**
* Removes all nodes in the list.
*/
public void clear();
/**
* Inserts a new node with the given value after cursor.
*
* @param cursor
* The node to insert after. Set this to null to insert value as
the
* new first Node.
* @param value
* The value to insert
* @return a reference to the newly inserted Node
*/
public Node insert(Node cursor, String value);
/**
* Inserts a new node with the given value at the "end" of the list.
*
* @param value
* @return a reference to the newly inserted Node
*/
public Node append(String value);
/**
* Removes the node after the specified Node (cursor) from the list.
*
* @param cursor
* A reference to the Node to remove.
*/
public void removeAfter(Node cursor);
/**
* Returns a reference to the first Node containing the key, starting from
the
* given Node.
*
* @param start
* @param key
* @return a reference to the first Node containing the key
*/
public Node find(Node start, String key);
/**
* Prints the values of all the items in a list
*/
public void printWholeList();
}
SinglyLinkedTester.java:
package sbccunittest;
import static java.lang.Math.*;
import static java.lang.System.*;
import static org.apache.commons.lang3.StringUtils.*;
import static org.junit.Assert.*;
import static sbcc.Core.*;
import java.io.*;
import java.lang.reflect.*;
import java.nio.file.*;
import java.util.*;
import java.util.stream.*;
import org.apache.commons.lang3.*;
import org.junit.*;
import org.w3c.dom.ranges.*;
import sbcc.*;
import singlylinkedlist.*;
/**
* 09/16/2021
*
* @author sstrenn
*
*/
public class SinglyLinkedListTester {
public static String newline = System.getProperty("line.separator");
public static int totalScore = 0;
public static int extraCredit = 0;
public static boolean isZeroScore = false;
public static String scorePreamble = "";
@BeforeClass
public static void beforeTesting() {
totalScore = 0;
extraCredit = 0;
}
@AfterClass
public static void afterTesting() {
if (isZeroScore) {
totalScore = 0;
extraCredit = 0;
}
println(scorePreamble + "Estimated score (w/o late penalties, etc.) is:
" + totalScore + " out of 25.");
// If the project follows the naming convention, save the results in a
folder on
// the desktop. (Alex Kohanim)
try {
String directory =
substri.
Java AssignmentUsing the ListNode.java file below Write method.pdf
Java Assignment
Using the ListNode.java file below
Write methods called min and max that return the smallest and largest values in the linked list.
These methods will be added to your ListNode class. For example if a variable called list stores
{11, -7, 3, 42, 0, 14], the call of list.min() should return -7 and the call of list.max() should return
42. If the list is empty, return -1. Print the returned value.
Write a method called insertNode that inserts a new node anywhere in your linked list. Display
your linked list with new value.
Write a program to test these methods to ensure accuracy and successful implementation. Upload
your modified version of the ListNode java file only.
Note: Original code should still be included. You will make additions and slight modifications
where necessary. Throw exceptions where you think is necessary. // Listlode is a class for storing
a single node of a linked // list. This node class is for a list of integer values. public class Listlode
\{ public int data; //data stored in this node public Listliode front;//points to head node public
Listliode next; /f link to next node in the list // post: constructs a node with data and null link
public Listlode() \{ 3. // post: constructs a node with given data and null link: public Listlode(int
data) \{ this(data, null); 3 // post: constructs a node with given data and given link. public
Listlode(int data, Listliode next) \{ this.data = data; this. next = next; 3 public String toString() \{
if (front = null) : \} else \{ String result = " ["+ front data; Listliode current = front. next; while
(current != null) \{ result +=m,m+ current data, current = current. next; 3 result += " ]n - return
result; 3. }// post: appends the given value to the end of the list public void add(int value) \&
puolic void aod if (front = nult) \{. front = new Listlode (value); 3 else \{ Listlode current =
front; whistiode current = front; while (current next I= null) \{ current = current. next; 3 current.
next = new Listliode (value ); 3. 3 J// post : returns the position of the first occurrence of the
given /l value (-1 if not found ) public void remove (int index) \{ if ( index =){ \} else \{ Listiode
current = nodeAt ( index - 1); current. next = current. next. next, 3 3 3// pre : <=i< size() // post:
returns a reference to the node at the given index public Listlode nodeAt (int index) : List Node
current = front; for (int i=0;i< index; i++) \{ current = current. next. \}. return current; 3.
Solve using Java programming language- ----------------------------.pdf
Solve using Java programming language.
//************************** SLL.java *********************************
// a generic singly linked list class
public class SLL<T> {
private class SLLNode<T> {
private T info;
private SLLNode<T> next;
public SLLNode() {
this(null,null);
}
public SLLNode(T el) {
this(el,null);
}
public SLLNode(T el, SLLNode<T> ptr) {
info = el; next = ptr;
}
}
protected SLLNode<T> head, tail;
public SLL() {
head = tail = null;
}
public boolean isEmpty() {
return head == null;
}
public void addToHead(T el) {
head = new SLLNode<T>(el,head);
if (tail == null)
tail = head;
}
public void addToTail(T el) {
if (!isEmpty()) {
tail.next = new SLLNode<T>(el);
tail = tail.next;
}
else head = tail = new SLLNode<T>(el);
}
public T deleteFromHead() { // delete the head and return its info;
if (isEmpty())
return null;
T el = head.info;
if (head == tail) // if only one node on the list;
head = tail = null;
else head = head.next;
return el;
}
public T deleteFromTail() { // delete the tail and return its info;
if (isEmpty())
return null;
T el = tail.info;
if (head == tail) // if only one node in the list;
head = tail = null;
else { // if more than one node in the list,
SLLNode<T> tmp; // find the predecessor of tail;
for (tmp = head; tmp.next != tail; tmp = tmp.next);
tail = tmp; // the predecessor of tail becomes tail;
tail.next = null;
}
return el;
}
public void delete(T el) { // delete the node with an element el;
if (!isEmpty())
if (head == tail && el.equals(head.info)) // if only one
head = tail = null; // node on the list;
else if (el.equals(head.info)) // if more than one node on the list;
head = head.next; // and el is in the head node;
else { // if more than one node in the list
SLLNode<T> pred, tmp;// and el is in a nonhead node;
for (pred = head, tmp = head.next;
tmp != null && !tmp.info.equals(el);
pred = pred.next, tmp = tmp.next);
if (tmp != null) { // if el was found;
pred.next = tmp.next;
if (tmp == tail) // if el is in the last node;
tail = pred;
}
}
}
@Override
public String toString() {
if(head == null)
return "[ ]";
String str = "[ ";
SLLNode<T> tmp = head;
while(tmp != null){
str += tmp.info + " ";
tmp = tmp.next;
}
return str+"]";
}
public boolean contains(T el) {
if(head == null)
return false;
SLLNode<T> tmp = head;
while(tmp != null){
if(tmp.info.equals(el))
return true;
tmp = tmp.next;
}
return false;
}
public int size(){
if(head == null)
return 0;
int count = 0;
SLLNode<T> p = head;
while(p != null) {
count++;
p = p.next;
}
return count;
}
}
Given the code above, solve the following tasks (please show the solution for every task
clearly):
For part (c) this is the code for the test program:
public class SLL_Driver {
public static void main(String[] args) {
SLL<String> myList = new SLL<String>();
String[] cityNames = {"Jubail", "Riyadh", "Abha", "Dammam", "Taif"};
for(int i = 0; i < cityNames.length; i++)
myList.addToHead(cityNames[i]);
System.out.println("The list is: " + myList);
System.out.println("It is " + myLis.
How do you stop infinite loop Because I believe that it is making a.pdf
How do you stop infinite loop? Because I believe that it is making an infinite circular list.
c++ code:
Here is the list class:
#ifndef LIN_J_LIST
#define LIN_J_LIST
typedef unsigned int uint;
#include
#include
using namespace std;
/**
* a simplified generic singly linked list class to illustrate C++ concepts
* @author Jerry Lin
* @version 2/17/17
*/
template< typename Object >
class List
{
private:
/**
* A class to store data and provide a link to the next node in the list
*/
class Node
{
public:
/**
* The constructor
* @param data the data to be stored in this node
*/
explicit Node( const Object & data )
: data{ data }, next{ nullptr } {}
Object data;
Node * next;
};
public:
/**
* The constructor for an empty list
*/
List()
: size{ 0 }, first{ nullptr }, last{ nullptr } {}
/**
* the copy constructor-creates and copy the list
*/
List( List && rhs ) = delete;
List( const List & rhs )
{
count = 0;
size = 0;
if(rhs.size != 0)
{
push_front(rhs.front());
Node * current = rhs.first;
Node * tempNode = first;
size++;
while(current->next != nullptr)
{
current = current->next;
Node *newNode = new Node(current->data); //transfer the data. basic op.
count++;
tempNode->next = newNode;
last = newNode;
tempNode = tempNode->next;
size++;
}
}
// you document and implement this method
}
/**
* the operator= method-copies the list
*/
List & operator=( List && rhs) = delete;
List & operator=( const List & rhs )
{
count = 0;
size = 0;
if( size != 0 )
{
Node * current = first;
Node * temp;
while( current != nullptr )
{
temp = current;
current = current->next;
delete temp;
}
}
if(rhs.size!= 0)
{
push_front(rhs.front());
Node * current = rhs.first;
Node * tempNode = first; //create a temporary to store
size++;
while(current -> next != nullptr)
{
current = current->next;
Node *newNode = new Node(current->data); //transfer the data. basic op
count++;
tempNode->next = newNode;
last = newNode;
tempNode = tempNode -> next;
size++;
}
}
return *this;
// you document and implement this method
}
/**
* accessor
* @return count
*/
int get_count() const
{
return count;
}
/**
* The destructor that gets rid of everything that\'s in the list and
* resets it to empty. If the list is already empty, do nothing.
*/
~List()
{
if( size != 0 )
{
Node * current = first;
Node * temp;
while( current != nullptr )
{
temp = current;
current = current->next;
delete temp;
}
}
}
/**
* Put a new element onto the beginning of the list
* @param item the data the new element will contain
*/
void push_front( const Object& item )
{
Node * new_node = new Node( item );//basic op.
if(is_empty())
{
last = new_node;
}
else
{
new_node->next = first;
}
first = new_node;
size++;
/* you complete the rest */
}
/**
* Remove the element that\'s at the front of the list. Causes an
* assertion error if the list is empty.
*/
void pop_front()
{
assert( !is_empty() );
Node * temp = first;
if( first == last )
{
first = last = nullptr;
}
else
{
first = first->next;
}
delete temp;
size--;
}
/**
* Accessor to return the da.
Step1 First compound has 2 double bonds ; Second .pdf
Step1 First compound has 2 double bonds ; Second compound has 5 double bonds;
Third compound has 1 double bond. Step2 Second molecule requires maximum energy due to 5
double bonds.This is likely to to have UV/ Visible absorption.
Solution
Step1 First compound has 2 double bonds ; Second compound has 5 double bonds;
Third compound has 1 double bond. Step2 Second molecule requires maximum energy due to 5
double bonds.This is likely to to have UV/ Visible absorption..
Molarity = molesvolume9liter) Molarity of NH4Cl.pdf
Molarity = moles/volume9liter) Molarity of NH4Cl = 4.50 mol /2.00L=2.25 M
Solution
Molarity = moles/volume9liter) Molarity of NH4Cl = 4.50 mol /2.00L=2.25 M.
More Related Content
Similar to NumberList.java (implements the linked list)public class NumberLis.pdf
hi i have to write a java program involving link lists. i have a pro.pdf
hi i have to write a java program involving link lists. i have a problem with the nodes, as it is
posting errors with the nodes.
please help me with this problem. thank you.
public class LinkLists {
/* only need to store a single pointer to the node at the head
* of the list.
* The pointer is null if the list is empty.
* Also record the size of the list.
*/
protected Node head;
/* invariant: size is the number of nodes in the list pointed to by head */
protected int size;
/* no-arguments default constructor creates an empty list */
public LinkLists() {
head = null; // start with an empty list
size = 0;
}
/* accessor method */
public int size() {
return size;
}
/* value to add to the end of the list
*/
public void add(T value) {
head = addAtEnd(head, value);
size++;
}
/* node of the list to which the value should be added
* value to add to the end of the list
*/
private Node addAtEnd(Node node, T value) {
if (node == null) { // special case
return new Node(value, null);
} else if (node.getNext() == null) { // other special case
node.setNext(new Node(value, null));
} else {
addAtEnd(node.getNext(), value);
}
return node;
}
/* iterative implementation of the same method
* value to add to the end of the list
*/
public void add2(T value) {
if (head == null) {
head = new Node(value, null);
} else {
Node node = head; // guaranteed not to be null initially
while (node.getNext() != null) {
node = node.getNext(); // guaranteed not to be null here
}
// now, node.getNext() is guaranteed to be null
// similar to the second special case in addAtEnd
node.setNext(new Node(value, null));
}
size++;
}
public void remove(int position) throws BadItemCountException {
if ((position < 1) || (position > size)) {
throw new
BadItemCountException(\"invalid position \" + position +
\", only 1..\" + size + \" available\");
}
if (position == 1) {
head = head.getNext();
} else {
Node node = head;
for (int i = 2; i < position; i++) {
node = node.getNext();
}
node.setNext(node.getNext().getNext());
}
size--; // one less item
}
public String toString() {
return toString(head);
}
private String toString(Node node) {
if (node == null) {
return \"\";
} else {
return node.getValue() + \"\ \" + toString(node.getNext());
}
}
public static void main(String[] args) {
/* create two empty lists, make sure they print out correctly */
LinkLists list1 = new LinkLists();
LinkLists list2 = new LinkLists();
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* insert some items, keep checking */
list1.add(\"hello\");
list1.add(\"world\");
list2.add(\"foo\");
list2.add(\"bar\");
list2.add(\"baz\");
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* remove an item at an invalid position */
boolean caught = false;
try {
list2.remove(4);
} catch .
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Labprogram.java
LinkedList.java
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
/**** CONSTRUCTORS ****/
public LinkedList() {
first = null;
last = null;
iterator = null;
length = 0;
}
/**
* Converts the given array into a LinkedList
*
* @param array the array of values to insert into this LinkedList
* @postcondition
*/
public LinkedList(T[] array) {
}
/**
* Instantiates a new LinkedList by copying another List
*
* @param original the LinkedList to copy
* @postcondition a new List object, which is an identical,
* but separate, copy of the LinkedList original
*/
public LinkedList(LinkedList original) {
}
public T getFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
return last.data;
}
public T getIterator() throws NullPointerException {
if (iterator != null) {
return iterator.data;
} else {
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
public int getLength() {
return length;
}
public boolean isEmpty() {
return length == 0;
}
public boolean offEnd() {
return iterator == null;
}
public void addFirst(T data) {
Node newNode = new Node(data);
if (isEmpty()) {
first = newNode;
last = newNode;
} else {
newNode.next = first;
first.prev = newNode;
first = newNode;
}
length++;
}
public void addLast(T data) {
Node newNode = new Node(data);
if (isEmpty()) {
first = newNode;
last = newNode;
} else {
last.next = newNode;
newNode.prev = last;
last = newNode;
}
length++;
}
public void addIterator(T data) throws NullPointerException {
if (offEnd()) {
throw new NullPointerException("addIterator Iterator is off end.");
}
if (iterator == last) {
addLast(data);
} else {
Node newNode = new Node(data);
Node next = iterator.next;
newNode.next = next;
newNode.prev = iterator;
iterator.next = newNode;
next.prev = newNode;
length++;
}
}
public void removeFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
if (length == 1) {
first = null;
last = null;
iterator = null;
} else {
if (iterator == first) {
iterator = null;
}
first = first.next;
first.prev = null;
}
length--;
}
public void removeLast() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
if (length == 1) {
first = null;
last = null;
iterator = null;
} else {
if (iterator == last) {
iterator = null;
}
last = last.prev;
last.next = null;
}
length--;
}
public void removeIterator() throws NullPointerException {
if (offEnd()) {
throw new NullPointerException("Iterator is off the end opf the list.");
}
if (iterator .
I will provide my LinkedList from my last lab.LinkedList.cpp~~~~.pdf
I will provide my LinkedList from my last lab.
LinkedList.cpp
~~~~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
/*Exercise2 */
void LinkedList::insertAtFront(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
if (last == NULL)
first = last = temp;
else
{
temp->next = first;
first = temp;
}
}
bool LinkedList::removeFromFront()
{
if (first == NULL)
return false;
Node *temp = first;
first = first->next;
free(temp);
if (first == NULL)
last = NULL;
return true;
}
LinkedList.h
~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
/*Exercise2 */
vo.
Note Given Code modified as required and required met.pdf
Note:
Given Code modified as required and required methods added.
Code:
// class node
class Node
{
// declare the required variable
String data;
Node next;
// constructor
Node(){}
// constructor with arguments
Node(String data)
{
this.data = data;
next = null;
}
// method to get the data
public String getData()
{
return data;
}
// method to set the data
public void setData(String data)
{
this.data = data;
}
// method to get the next data
public Node getNext()
{
return next;
}
// method to set the next data
public void setNext(Node next)
{
this.next = next;
}
}
// class for a linked list
class MyLInkedList
{
Node head;alue into a list
// method to add the v
public void add(String num)
{
if (head == null)
{
head = new Node(num);
}
else{
Node temp = new Node(num);
Node current = head;
if (current != null) {
while (current.getNext() != null) {
current = current.getNext();
}
current.setNext(temp);
}
}
}
// method to search a value from a list
public void search(String num)
{
Node current = head;
boolean flag=true;
if (current != null)
{
while (current != null)
{
if(current.getData() == num)
{
System.out.println(\"Search value \"+
current.getData()+\" is available\");
flag=false;
}
current = current.getNext();
}
if (flag==true)
{
System.out.println(\"Search value \"+
current.getData()+\" is not available\");
}
}
else
{
System.out.println(\"Linked list is empty\");
}
}
// method to delete a value from a list
public void delete(String num)
{
//Node current = head;
boolean flag=true;
if (head == null)
{
System.out.println(\"Can\'t Delete, Linked list is
empty\");
return;
}
if(head.getData() == num)
{
head=head.getNext();
return;
}
Node temp = new Node(num);
Node cr = head;
Node prev=null;
while ((cr != null) && !(cr.getData() == num))
{
prev=cr;
cr = cr.getNext();
}
prev.setNext(cr.getNext());
}
// method to print the list
public void print()
{
Node current = head;
if (current != null) {
while (current != null) {
System.out.println(current.getData());
current = current.getNext();
}
}
}
}
// method to test the class
public class MyLInkedListTester
{
// main method to perform the linked list operatrions
public static void main(String args[])
{
MyLInkedList llist = new MyLInkedList();
// insert the values into list
llist.add(\"1\");
llist.add(\"2\");
llist.add(\"3\");
llist.add(\"4\");
// print the list values
llist.print();
// sear the values in a list
llist.search(\"1\");
llist.print();
// delete the value from a list
llist.delete(\"4\");
System.out.println(\"List after deletion:\");
llist.print();
}
}
Result:
1
2
3
4
Search value 1 is available
1
2
3
4
List after deletion:
1
2
3
Solution
Note:
Given Code modified as required and required methods added.
Code:
// class node
class Node
{
// declare the required variable
String data;
Node next;
// constructor
Node(){}
// constructor with arguments
Node(String data)
{
this.data = data;
next = null;
}
// method to get the data
public String getData()
{
return data;
}
// method to set the data
public void se.
Create a new java class called ListNode. Implement ListNode as a gen.pdf
Create a new java class called ListNode. Implement ListNode as a generic version of IntNode.
public class ListNode { }
Create a generic class called Queue, which is a linked list implementation of a queue data type.
Queue must have the following methods:
• public void enqueue(T value){} This method should add a new node to the back of the queue.
• public T dequeue(){} This method should remove a node from the front of the queue and return
its value
• public T peek(){} This method should return the value of the front node without removing it
from the queue
Create a new generic class called Stack, which is a linked list implementation of a stack data
type. Stack must have the following methods:
• public void push(T value){} This method should add a new node to the top of the stack.
• public T pop(){} This method should remove a node from the top of the stack and return its
integer value
• public T peek(){} This method should return the integer value of the top node without
removing it from the stack
Solution
import java.util.Iterator;
public class LinkedList extends AbstractList {
private ListNode front; // refers to first node in list (null if empty)
public LinkedList() {
front = null; // null front means empty
}
public void add(int index, E value) {
if (index == 0) {
// insert at the front
front = new ListNode(value, front);
} else {
ListNode current = goTo(index - 1);
ListNode newNode = new ListNode(value, current.next);
current.next = newNode;
}
}
public E get(int index) {
ListNode current = goTo(index);
return current.data;
}
public int indexOf(E value) {
int index = 0;
ListNode current = front;
while (current != null) {
if (current.data == value) {
return index;
}
index++;
current = current.next;
}
return -1;
}
public Iterator iterator() {
return new LinkedListIterator();
}
public void remove(int index) {
if (index == 0) {
// removing from the front
front = front.next;
} else {
ListNode current = goTo(index - 1);
current.next = current.next.next; // deletes the node
}
}
public void set(int index, E value) {
ListNode current = goTo(index);
current.data = value;
}
public int size() {
int count = 0;
ListNode current = front;
while (current != null) {
current = current.next;
count++;
}
return count;
}
public String toString() {
if (front == null) {
return \"[]\";
} else {
String result = \"[\" + front.data;
ListNode current = front.next;
while (current != null) {
result += \", \" + current.data;
current = current.next;
}
result += \"]\";
return result;
}
}
private ListNode goTo(int index) {
ListNode current = front;
for (int i = 0; i < index; i++) {
current = current.next;
}
return current;
}
public class ListNode {
public E data;
public ListNode next;
public ListNode(E data) {
this.data = data;
this.next = null;
}
public ListNode(E data, ListNode next) {
this.data = data;
this.next = next;
}
}
private class LinkedListIterator implements Iterator {
private ListNode current; // current position in list
public LinkedListIterator() {
current = f.
In C++Write a recursive function to determine whether or not a Lin.pdf
In C++
Write a recursive function to determine whether or not a Linked List is in sorted order (smallest
value to largest value).
Add the following function prototypes to your List class under the section for access functions,
then implement the functions below the class definition:
public:
/**Access Functions*/
bool isSorted();
//Wrapper function that calls the isSorted helper function to determine whether
//a list is sorted in ascending order.
//We will consider that a list is trivially sorted if it is empty.
//Therefore, no precondition is needed for this function
private:
bool isSorted(Nodeptr node);
//Helper function for the public isSorted() function.
//Recursively determines whether a list is sorted in ascending order.
#include //for NULL
#include
#include
using namespace std;
template //list stores generic list data, not any specific C++ type
class List
{
private:
struct Node
{
listdata data;
Node* next;
Node* previous;
Node(listdata data): data(data), next(NULL), previous(NULL){}
};
typedef struct Node* Nodeptr;
Nodeptr first;
Nodeptr last;
Nodeptr iterator;
int size;
public:
/**Constructors and Destructors*/
List();
//Default constructor; initializes and empty list
//Postcondition: numeric values equated to zero, or strings should be empty.
List(const List &list);
~List();
//Destructor. Frees memory allocated to the list
//Postcondition: position NodePtr at next Node
/**Accessors*/
listdata getFirst();
//Returns the first element in the list
//Precondition:NodePtr points to the first node on list
listdata getLast();
//Returns the last element in the list
//Precondition: make new node first on the list
listdata getIterator();
bool isEmpty();
//Determines whether a list is empty.
int getSize();
//Returns the size of the list
/**Manipulation Procedures*/
void startIterator();
void advanceIterator();
void removeLast();
//Removes the value of the last element in the list
//Precondition: list is not empty, not the first element.
//Postcondition: one remaining node
void removeIterator();
void removeFirst();
//Removes the value of the first element in the list
//Precondition: list is not empty
//Postcondition: no nodes left
void insertLast(listdata data);
//Inserts a new element at the end of the list
//If the list is empty, the new element becomes both first and last
//Postcondition: next equal to null
void insertFirst(listdata data);
//Inserts a new element at the start of the list
//If the list is empty, the new element becomes both first and last
//Postcondition:point nodePtr next node on list
/**Additional List Operations*/
bool offEnd();
void printList();
//Prints to the console the value of each element in the list sequentially
//and separated by a blank space
//Prints nothing if the list is empty
void insertIterator(listdata data);
bool operator==(const List &list);
};
// constructor definition
template
List::List(): first(NULL), last(NULL), iterator(NULL), size(0) {}
template
List::List(const List &list): size(list.size)
{
if(list..
Help I keep getting the same error when running a code. Below is the.pdf
Help I keep getting the same error when running a code. Below is the code and the instructions
about the code.
import java.util.Arrays;
public class Album implements Comparable {
private final int id;
private final String[] artists;
private final int numSongs;
public Album(int id, String title, String[] artists, int numSongs) {
this.id = id;
this.artists = new String[]{Arrays.toString(artists)};
this.numSongs = numSongs;
}
public int getId() {
return id;
}
@Override
public int compareTo(Album other) {
return Integer.compare(this.numSongs, other.numSongs);
}
@Override
public String toString() {
StringBuilder artistNames = new StringBuilder();
for (String artist : artists) {
artistNames.append(artist).append(", ");
}
artistNames.delete(artistNames.length() - 2, artistNames.length());
return "ID: " + id + " -- " + numSongs + " songs -- [" + artistNames + "]";
}
}
import java.util.Random;
public class DoublyLinkedList {
private static class Node {
T data;
Node prev;
Node next;
Node(T data) {
this.data = data;
}
}
private Node head;
private Node tail;
private int size;
public DoublyLinkedList() {
head = null;
tail = null;
size = 0;
}
public Node append(T data) {
Node newNode = new Node<>(data);
if (head == null) {
head = newNode;
} else {
tail.next = newNode;
newNode.prev = tail;
}
tail = newNode;
size++;
return newNode;
}
public Node insert(int location, T data) {
if (location < 0 || location > size) {
throw new IllegalArgumentException("Invalid location");
}
Node newNode = new Node<>(data);
if (location == 0) {
newNode.next = head;
if (head != null) {
head.prev = newNode;
}
head = newNode;
if (tail == null) {
tail = newNode;
}
} else if (location == size) {
tail.next = newNode;
newNode.prev = tail;
tail = newNode;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
newNode.prev = current.prev;
newNode.next = current;
current.prev.next = newNode;
current.prev = newNode;
}
size++;
return newNode;
}
public Node delete(int location) {
if (location < 0 || location >= size) {
throw new IllegalArgumentException("Invalid location");
}
Node deletedNode;
if (location == 0) {
deletedNode = head;
head = head.next;
if (head != null) {
head.prev = null;
} else {
tail = null;
}
} else if (location == size - 1) {
deletedNode = tail;
tail = tail.prev;
tail.next = null;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
deletedNode = current;
current.prev.next = current.next;
current.next.prev = current.prev;
}
size--;
return deletedNode;
}
public int getIndex(T data) {
Node current = head;
for (int i = 0; i < size; i++) {
if (current.data.equals(data)) {
return i;
}
current = current.next;
}
return -1;
}
@Override
public String toString() {
StringBuilder result = new StringBuilder();
Node current = head;
while (current != null) {
result.append(current.data).append(" -> ");
current = current.next;
}
result.append("NULL");
return result.toString();
}
public Node shuffle() {
Random r.
PROBLEM STATEMENTIn this assignment, you will complete DoubleEnde.pdf
PROBLEM STATEMENT:
In this assignment, you will complete DoubleEndedList.java that implements the ListInterface as
well as an interface called DoubleEndedInterface which represents the list's entries by using a
chain of nodes that has both a head reference and a tail reference. Be sure to read through the
code and understand the implementation.
WHAT IS PROVIDED:
- A driver class to test your code. You should not modify this file!
- A list interface (ListInterface.java)
- A double ended interface (DoubleEndedInterface.java)
- An incomplete DoubleEndedList class (DoubleEndedList.java)
WHAT YOU NEED TO DO:
4. Complete the DoubleEndedList class
4. Run the driver and make sure your output is exactly the same as mine (at the bottom of
Driver.java)
\} // end else numberofEntries--; else throw new IndexOut0fBoundsException("Illegal position
given to remove operation."); return result; // Return removed entry }//endreturnreve public T
replace(int givenPosition, T newEntry) \{ T replace(int givenPosition, T newEntry) \{ if
((givenPosition >=1)&& (givenPosition <= numberOfEntries)) \{ // Assertion: The list is not
empty Node desiredNode = getNodeAt (givenPosition); ToriginalEntry = desiredNode.getData();
desiredNode.setData(newEntry); return originalEntry; f // end if else throw new
IndexOut0fBoundsException("Illegal position given to replace operation."); replace if ((
givenPosition >=1)&& (givenPosition <= number0fEntries)) \{ // Assertion: The list is not
empty Node desiredNode = getNodeAt ( givenPosition); T originalEntry = desiredNode.
getData( ); desiredNode.setData(newEntry); return originalentry; \} // end if throw new
Index0ut0fBoundsException("Illegal position given to replace operation."); \} // end replace
public T getEntry(int givenPosition) \{ if ((givenPosition >=1) \&\& (givenPosition < =
number0fEntries ) ) \{ // Assertion: The list is not empty return getNodeAt (givenPosition).
getData(); else // end if throw new IndexOut0fBoundsException("Illegal position given to
getEntry operation."); \} // end getEntry public boolean contains ( T anEntry) \{ boolean found =
false; Node currentNode = firstNode; while (!found && (currentNode != null)) \{ if
(anEntry.equals (currentNode.getData())) else found = true; \} // end while currentNode =
currentNode. getNextNode () ; return found; \} // end contains public int getLength() \{ return
numberofEntries; \} // end getLength public boolean isEmpty() \{ return number0fEntries ==0;
\} // end isEmpty public T[] toArray() \{ // The cast is safe because the new array contains null
entries aSuppressWarnings ("unchecked") T[] result =(T[]) new 0bject [numberofEntries]; //
Unchecked cast int index =0; Node currentNode = firstNode; while ((index < numberOfEntries)
\&\& (currentNode != null)) \& result [ index ]= currentNode. getData () ; currentNode =
currentNode.getNextNode ( ); index++; 3 // end while return result; 3 // end toArray // Returns a
reference to the node at a given position. // Precondition: L.
How do I fix it in javaLinkedList.java Defines a doubl.pdf
How do I fix it in java?
LinkedList.java:
/**
* Defines a doubly-linked list class
* @author
* @author
*/
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
/**** CONSTRUCTORS ****/
/**
* Instantiates a new LinkedList with default values
* @postcondition
*/
public LinkedList() {
first = null;
last = null;
iterator = null;
length = 0;
}
/**
* Converts the given array into a LinkedList
* @param array the array of values to insert into this LinkedList
* @postcondition
*/
public LinkedList(T[] array) {
}
/**
* Instantiates a new LinkedList by copying another List
* @param original the LinkedList to copy
* @postcondition a new List object, which is an identical,
* but separate, copy of the LinkedList original
*/
public LinkedList(LinkedList original) {
}
/**** ACCESSORS ****/
public T getFirst() throws NoSuchElementException {
if (isEmpty()){
throw new NoSuchElementException("The list is empty");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (isEmpty()){
throw new NoSuchElementException("The list is empty");
}
return last.data;
}
/**
* Returns the data stored in the iterator node
* @precondition
* @return the data stored in the iterator node
* @throw NullPointerException
*/
public T getIterator() throws NullPointerException {
if (iterator != null){
return iterator.data;
}else{
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
/**
* Returns the current length of the LinkedList
* @return the length of the LinkedList from 0 to n
*/
public int getLength() {
return length;
}
/**
* Returns whether the LinkedList is currently empty
* @return whether the LinkedList is empty
*/
public boolean isEmpty() {
return length == 0;
}
/**
* Returns whether the iterator is offEnd, i.e. null
* @return whether the iterator is null
*/
public boolean offEnd() {
return iterator == null;
}
/**** MUTATORS ****/
public void addFirst(T data) {
Node newNode = new Node(data);
if(isEmpty()){
first = newNode;
last = newNode;
}
else{
newNode.next = first;
first.prev = newNode;
first = newNode;
}
length++;
}
public void addLast(T data) {
Node newNode = new Node(data);
if(isEmpty()){
first = newNode;
last = newNode;
}
else{
last.next = newNode;
newNode.prev = last;
last = newNode;
}
length++;
}
/**
* Inserts a new element after the iterator
* @param data the data to insert
* @precondition
* @throws NullPointerException
*/
public void addIterator(T data) throws NullPointerException{
if(iterator != null){
Node newNode = new Node(data);
newNode.next = iterator.next;
iterator.next = newNode;
if (iterator == first){
first = newNode;
}
}else{
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
/
public void removeFirst() throws NoSuchElementException {
if(is.
How do I fix it in LinkedList.javaLinkedList.java Define.pdf
How do I fix it in LinkedList.java?
LinkedList.java:
/**
* Defines a doubly-linked list class
* @author
* @author
*/
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
/**** CONSTRUCTORS ****/
/**
* Instantiates a new LinkedList with default values
* @postcondition
*/
public LinkedList() {
first = null;
last = null;
iterator = null;
length = 0;
}
/**
* Converts the given array into a LinkedList
* @param array the array of values to insert into this LinkedList
* @postcondition
*/
public LinkedList(T[] array) {
}
/**
* Instantiates a new LinkedList by copying another List
* @param original the LinkedList to copy
* @postcondition a new List object, which is an identical,
* but separate, copy of the LinkedList original
*/
public LinkedList(LinkedList original) {
}
/**** ACCESSORS ****/
public T getFirst() throws NoSuchElementException {
if (isEmpty()){
throw new NoSuchElementException("The list is empty");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (isEmpty()){
throw new NoSuchElementException("The list is empty");
}
return last.data;
}
/**
* Returns the data stored in the iterator node
* @precondition
* @return the data stored in the iterator node
* @throw NullPointerException
*/
public T getIterator() throws NullPointerException {
if (iterator != null){
return iterator.data;
}else{
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
/**
* Returns the current length of the LinkedList
* @return the length of the LinkedList from 0 to n
*/
public int getLength() {
return length;
}
/**
* Returns whether the LinkedList is currently empty
* @return whether the LinkedList is empty
*/
public boolean isEmpty() {
return length == 0;
}
/**
* Returns whether the iterator is offEnd, i.e. null
* @return whether the iterator is null
*/
public boolean offEnd() {
return iterator == null;
}
/**** MUTATORS ****/
public void addFirst(T data) {
Node newNode = new Node(data);
if(isEmpty()){
first = newNode;
last = newNode;
}
else{
newNode.next = first;
first.prev = newNode;
first = newNode;
}
length++;
}
public void addLast(T data) {
Node newNode = new Node(data);
if(isEmpty()){
first = newNode;
last = newNode;
}
else{
last.next = newNode;
newNode.prev = last;
last = newNode;
}
length++;
}
/**
* Inserts a new element after the iterator
* @param data the data to insert
* @precondition
* @throws NullPointerException
*/
public void addIterator(T data) throws NullPointerException{
if(iterator != null){
Node newNode = new Node(data);
newNode.next = iterator.next;
iterator.next = newNode;
if (iterator == first){
first = newNode;
}
}else{
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
/
public void removeFirst() throws NoSuchElementExcept.
In an ancient land, the beautiful princess Eve had many suitors She d.pdf
Find four separate health care organization\'\'s net worth terms in published news sources such as
The Wall Street Journal or Business Week.
Comment on whether the net worth term you have found appear to be referring to for-profit
corporations; for-profit sole proprietors or partnerships, or not-for-profit companies. What led
you to believe this?
Through research identify the mission/vision statements of the four organizations you have
identified. Discuss the pros and cons of each organization\'s for profit and not for profit status
If you were the author of these articles, would you have been more specific? If so, why? If not,
why not?
Solution
Mitchell\'s blog offers an opportunity to share some of the knowledge he\'s gathered over the
years on this topic and encourage others to participate by sharing their thoughts.
For my first 15 or so years in the business I have only discussed with the few clients who bring it
up. While it has been a passion of mine for years, I feel it is my role as an advisor to work with
my clients on the things that are important to them and not have my values get in the way of
what the client is trying to achieve.
This blog is not meant as a place to share hot stock tips or try to judge the market conditions at
any particular moment in time. It is meant to share some of the knowledge I\'ve gathered over the
years on these topics and add food for thought to the reader\'s thoughts in this area. I\'ll try to
keep you informed of any current trends or articles I find of interest. The opinions voiced in this
material are for general information only and are not intended to provide specific advice or
recommendations for any individual. All performance referenced is historical and is no guarantee
of future results. All indices are unmanaged and may not be invested into directly. Third party
posts found on this profile do not reflect the views of LPL Financial and have not been reviewed
by LPL Financial as to accuracy or completeness.
July 2, 2018
The Wall Street Journal posted a column last week entitled \"IF YOU WANT TO DO GOOD,
EXPECT TO DO BADLY\" discussing reasons the author believes ESG investing is foolish. The
response from US-SIF was not published from what I can tell, but feel it is important enough to
share:
James Mackintosh’s June 28 article, “If You Want To Do Good, Expect To Do Badly: Investors
need to choose between backing their beliefs with dollars, or being profit-minded capitalists”
misses the mark and is out of touch with the latest studies, data and trends from Barclays,
INVESTMENT GIANTS STEP UP GOVERNANCE OVERSIGHT\" in Corporate
Responsibility Magazine. The article goes on to say how some of the world\'s biggest investment
firms such as Vanguard, Blackrock and State Street \"are putting the thousands of companies in
their portfolios on notice that their governance practices and strategies will be more closely
monitored by the funds in the future. And they’re not looking just for traditional
govern.
The LinkedList1 class implements a Linked list. class.pdf
/**
The LinkedList1 class implements a Linked list.
*/
class LinkedList1
{
/**
The Node class stores a list element
and a reference to the next node.
*/
private class Node
{
String value;
Node next;
/**
Constructor.
@param val The element to store in the node.
@param n The reference to the successor node.
*/
Node(String val, Node n)
{
value = val;
next = n;
}
/**
Constructor.
@param val The element to store in the node.
*/
Node(String val)
{
// Call the other (sister) constructor.
this(val, null);
}
}
private Node first; // list head
private Node last; // last element in list
/**
Constructor.
*/
public LinkedList1()
{
first = null;
last = null;
}
/**
The isEmpty method checks to see
if the list is empty.
@return true if list is empty,
false otherwise.
*/
public boolean isEmpty()
{
return first == null;
}
/**
The size method returns the length of the list.
@return The number of elements in the list.
*/
public int size()
{
int count = 0;
Node p = first;
while (p != null)
{
// There is an element at p
count ++;
p = p.next;
}
return count;
}
/**
The add method adds an element to
the end of the list.
@param e The value to add to the
end of the list.
*/
public void add(String e)
{
if (isEmpty())
{
first = new Node(e);
last = first;
}
else
{
// Add to end of existing list
last.next = new Node(e);
last = last.next;
}
}
/**
The add method adds an element at a position.
@param e The element to add to the list.
@param index The position at which to add
the element.
@exception IndexOutOfBoundsException When
index is out of bounds.
*/
public void add(int index, String e)
{
if (index < 0 || index > size())
{
String message = String.valueOf(index);
throw new IndexOutOfBoundsException(message);
}
// Index is at least 0
if (index == 0)
{
// New element goes at beginning
first = new Node(e, first);
if (last == null)
last = first;
return;
}
// Set a reference pred to point to the node that
// will be the predecessor of the new node
Node pred = first;
for (int k = 1; k <= index - 1; k++)
{
pred = pred.next;
}
// Splice in a node containing the new element
pred.next = new Node(e, pred.next);
// Is there a new last element ?
if (pred.next.next == null)
last = pred.next;
}
/**
The toString method computes the string
representation of the list.
@return The string form of the list.
*/
public String toString()
{
StringBuilder strBuilder = new StringBuilder();
// Use p to walk down the linked list
Node p = first;
while (p != null)
{
strBuilder.append(p.value + \"\ \");
p = p.next;
}
return strBuilder.toString();
}
/**
The remove method removes the element at an index.
@param index The index of the element to remove.
@return The element removed.
@exception IndexOutOfBoundsException When index is
out of bounds.
*/
public String remove(int index)
{
if (index < 0 || index >= size())
{
String message = String.valueOf(index);
throw new IndexOutOfBoundsException(message);
}
String element; // The element to return
if (index == 0)
{
// Removal of first item in the list
element.
Что нам готовит грядущий C#7?
Не так давно вышел C# 6, основанный на новом компиляторе Roslyn. Обновление языка содержит большое количество приятных синтаксических конструкций, которые упрощают написание кода и делают его более лаконичным. Но Microsoft на этом не успокоились: прямо сейчас ведётся работа над 7-ой версией языка, которую планируют сделать ещё удобнее, благодаря реализации современных тенденций написания кода. В этом докладе мы поговорим о том, что может войти в C# 7. В числе прочего будут обсуждаться Tuples, Pattern matching, Records / algebraic data types, Nullability tracking и многое другое.
There is something wrong with my program-- (once I do a for view all t.pdf
There is something wrong with my program.. (once I do a for view all this is the outcome in the
console...(carnea:Name: carnea, Address: 30 repeated..) why is this?
import java.util.Scanner;
public class AddressBook {
public static void main(String[] args) {
Tablea addressBook = new Tablea();
Scanner scanner = new Scanner(System.in);
String name, address;
String action = null;
boolean moreEntries = true;
while (moreEntries) {
System.out.println("/nMenu");
System.out.println("n.Add Entry");
System.out.println("d. Delete Entry");
System.out.println("u. Update Entry");
System.out.println("l. Search");
System.out.println("a. View All");
System.out.println("q. Exit");
action = scanner.nextLine();
// Insert a new entry into the address book
switch (action) {
case "n":
System.out.print("Enter a name: ");
name = scanner.nextLine();
System.out.print("Enter an address: ");
address = scanner.nextLine();
addressBook.insert(name, address);
System.out.println("New Contact has been added,");
break;
// Delete an entry from the address book
case "d":
System.out.println("Enter a name to delete: ");
name = scanner.nextLine();
boolean deleted = addressBook.delete(name);
if (deleted) {
System.out.println("Address deleted");
} else {
System.out.println("Name not found");
}
break;
// Update an entry in the address book
case "u":
System.out.print("Enter a name to update: ");
name = scanner.nextLine();
System.out.print("Enter a new address: ");
address = scanner.nextLine();
boolean updated = addressBook.update(name, address);
if (updated) {
System.out.println("Address updated");
} else {
System.out.println("Name not found");
}
break;
// Lookup an entry in the address book
case "l":
System.out.print("Enter a name to look up: ");
name = scanner.nextLine();
String result = addressBook.lookUp(name);
if (result != null) {
System.out.println("Address: " + result);
} else {
System.out.println("Name not found");
}
break;
// Display all entries in the address book
case "a":
System.out.println("All entries:");
addressBook.displayAll();
break;
// Quit the program
case"q":
System.out.println("Quitting...");
}
}
}
}
public class Node {
private String name;
private String address;
private Node next;
public Node(String name, String address) {
// add here ..
this.name = name;
this.address = address;
}
public String getName() {
// add here ..
return this.name;
}
public void setName(String name) {
// add here ..
this.name = name;
}
public String getAddress() {
// add here ..
return this.address;
}
public void setAddress(String address) {
// add here ..
this.address = address;
}
public Node getNext() {
// add here ..
return this.next;
}
public String toString() {
return "Name: "+ name +", Address:" +address;
}
public void setNext(Node node) {
// add here ..
this.next = next;
}
public void setAddress (Object newValue) {
this.address = address;
}
public void setName(Object newValue) {
this.name = name;
}
}
import java.util.Scanner;
public class Tablea {
private Node mark;
public Node get.
using set identitiesSolutionimport java.util.Scanner; c.pdf
using set identities
Solution
import java.util.Scanner;
/* category Node */
class Node
creator */
public Node()
/* builder */
public Node(int d,Node n)
/* perform to line link to next Node */
public void setLink(Node n)
/* perform to line knowledge to current Node */
public void setData(int d)
/* perform to urge link to next node */
public Node getLink()
come back link;
}
/* perform to urge knowledge from current Node */
public int getData()
come back data;
}
}
/* category linkedList */
class linkedList
begin ;
protected Node finish ;
public int size ;
/* builder */
public linkedList()
begin = null;
finish = null;
size = 0;
}
/* perform to envision if list is empty */
public mathematician isEmpty()
come back begin == null;
}
/* perform to urge size of the list */
public int getSize()
come back size;
}
/* perform to insert part at the begining */
public void insertAtStart(int val)
{
Node nptr = new Node(val,null);
nptr.setLink(start);
if(start == null)
{
begin = nptr;
nptr.setLink(start);
finish = start;
}
else
{
end.setLink(nptr);
begin = nptr;
}
size++ ;
}
/* perform to insert part at finish */
public void insertAtEnd(int val)
{
Node nptr = new Node(val,null);
nptr.setLink(start);
if(start == null)
{
begin = nptr;
nptr.setLink(start);
finish = start;
}
else
{
end.setLink(nptr);
finish = nptr;
}
size++ ;
}
/* perform to insert part at position */
public void insertAtPos(int val , int pos)
one ;
for (int i = 1; i < size - 1; i++)
ptr = ptr.getLink();
}
size++ ;
}
/* perform to delete part at position */
public void deleteAtPos(int pos)
one && pos == 1)
begin = null;
finish = null;
size = 0;
return ;
}
if (pos == 1)
begin = begin.getLink();
end.setLink(start);
size--;
return ;
}
if (pos == size)
whereas (s != end)
end = t;
end.setLink(start);
size --;
return;
}
Node ptr = start;
pos = pos - one ;
for (int i = 1; i < size - 1; i++)
ptr = ptr.getLink();
}
size-- ;
}
/* perform to show contents */
public void display()
making object of linkedList */
linkedList list = new linkedList();
System.out.println(\"Circular individually coupled List Test\ \");
char ch;
/* Perform list operations */
do
{
System.out.println(\"\ Circular individually coupled List Operations\ \");
System.out.println(\"1. insert at begining\");
System.out.println(\"2. insert at end\");
System.out.println(\"3. insert at position\");
System.out.println(\"4. delete at position\");
System.out.println(\"5. check empty\");
System.out.println(\"6. get size\");
int selection = scan.nextInt();
switch (choice).
package singlylinkedlist; public class Node { public String valu.pdf
package singlylinkedlist;
public class Node {
public String value;
public Node next;
public Node(String value) {
this.value = value;
}
@Override
public String toString() {
return value;
}
}
SingleyLinkedList.java :
package singlylinkedlist;
import java.io.*;
import java.util.*;
/**
* Defines the interface for a singly-linked list.
*
*/
public interface SinglyLinkedList {
/**
* @return Reference to the first node. If the list is empty, this method
* returns null.
*/
public Node getFirst();
/**
* @return Reference to the last node . If the list is empty, this method
* returns null.
*/
public Node getLast();
/**
* @return Number of nodes in the list
*/
public int size();
/**
* @return true if the list has no nodes; false otherwise
*/
public boolean isEmpty();
/**
* Removes all nodes in the list.
*/
public void clear();
/**
* Inserts a new node with the given value after cursor.
*
* @param cursor
* The node to insert after. Set this to null to insert value as
the
* new first Node.
* @param value
* The value to insert
* @return a reference to the newly inserted Node
*/
public Node insert(Node cursor, String value);
/**
* Inserts a new node with the given value at the "end" of the list.
*
* @param value
* @return a reference to the newly inserted Node
*/
public Node append(String value);
/**
* Removes the node after the specified Node (cursor) from the list.
*
* @param cursor
* A reference to the Node to remove.
*/
public void removeAfter(Node cursor);
/**
* Returns a reference to the first Node containing the key, starting from
the
* given Node.
*
* @param start
* @param key
* @return a reference to the first Node containing the key
*/
public Node find(Node start, String key);
/**
* Prints the values of all the items in a list
*/
public void printWholeList();
}
SinglyLinkedTester.java:
package sbccunittest;
import static java.lang.Math.*;
import static java.lang.System.*;
import static org.apache.commons.lang3.StringUtils.*;
import static org.junit.Assert.*;
import static sbcc.Core.*;
import java.io.*;
import java.lang.reflect.*;
import java.nio.file.*;
import java.util.*;
import java.util.stream.*;
import org.apache.commons.lang3.*;
import org.junit.*;
import org.w3c.dom.ranges.*;
import sbcc.*;
import singlylinkedlist.*;
/**
* 09/16/2021
*
* @author sstrenn
*
*/
public class SinglyLinkedListTester {
public static String newline = System.getProperty("line.separator");
public static int totalScore = 0;
public static int extraCredit = 0;
public static boolean isZeroScore = false;
public static String scorePreamble = "";
@BeforeClass
public static void beforeTesting() {
totalScore = 0;
extraCredit = 0;
}
@AfterClass
public static void afterTesting() {
if (isZeroScore) {
totalScore = 0;
extraCredit = 0;
}
println(scorePreamble + "Estimated score (w/o late penalties, etc.) is:
" + totalScore + " out of 25.");
// If the project follows the naming convention, save the results in a
folder on
// the desktop. (Alex Kohanim)
try {
String directory =
substri.
Java AssignmentUsing the ListNode.java file below Write method.pdf
Java Assignment
Using the ListNode.java file below
Write methods called min and max that return the smallest and largest values in the linked list.
These methods will be added to your ListNode class. For example if a variable called list stores
{11, -7, 3, 42, 0, 14], the call of list.min() should return -7 and the call of list.max() should return
42. If the list is empty, return -1. Print the returned value.
Write a method called insertNode that inserts a new node anywhere in your linked list. Display
your linked list with new value.
Write a program to test these methods to ensure accuracy and successful implementation. Upload
your modified version of the ListNode java file only.
Note: Original code should still be included. You will make additions and slight modifications
where necessary. Throw exceptions where you think is necessary. // Listlode is a class for storing
a single node of a linked // list. This node class is for a list of integer values. public class Listlode
\{ public int data; //data stored in this node public Listliode front;//points to head node public
Listliode next; /f link to next node in the list // post: constructs a node with data and null link
public Listlode() \{ 3. // post: constructs a node with given data and null link: public Listlode(int
data) \{ this(data, null); 3 // post: constructs a node with given data and given link. public
Listlode(int data, Listliode next) \{ this.data = data; this. next = next; 3 public String toString() \{
if (front = null) : \} else \{ String result = " ["+ front data; Listliode current = front. next; while
(current != null) \{ result +=m,m+ current data, current = current. next; 3 result += " ]n - return
result; 3. }// post: appends the given value to the end of the list public void add(int value) \&
puolic void aod if (front = nult) \{. front = new Listlode (value); 3 else \{ Listlode current =
front; whistiode current = front; while (current next I= null) \{ current = current. next; 3 current.
next = new Listliode (value ); 3. 3 J// post : returns the position of the first occurrence of the
given /l value (-1 if not found ) public void remove (int index) \{ if ( index =){ \} else \{ Listiode
current = nodeAt ( index - 1); current. next = current. next. next, 3 3 3// pre : <=i< size() // post:
returns a reference to the node at the given index public Listlode nodeAt (int index) : List Node
current = front; for (int i=0;i< index; i++) \{ current = current. next. \}. return current; 3.
Solve using Java programming language- ----------------------------.pdf
Solve using Java programming language.
//************************** SLL.java *********************************
// a generic singly linked list class
public class SLL<T> {
private class SLLNode<T> {
private T info;
private SLLNode<T> next;
public SLLNode() {
this(null,null);
}
public SLLNode(T el) {
this(el,null);
}
public SLLNode(T el, SLLNode<T> ptr) {
info = el; next = ptr;
}
}
protected SLLNode<T> head, tail;
public SLL() {
head = tail = null;
}
public boolean isEmpty() {
return head == null;
}
public void addToHead(T el) {
head = new SLLNode<T>(el,head);
if (tail == null)
tail = head;
}
public void addToTail(T el) {
if (!isEmpty()) {
tail.next = new SLLNode<T>(el);
tail = tail.next;
}
else head = tail = new SLLNode<T>(el);
}
public T deleteFromHead() { // delete the head and return its info;
if (isEmpty())
return null;
T el = head.info;
if (head == tail) // if only one node on the list;
head = tail = null;
else head = head.next;
return el;
}
public T deleteFromTail() { // delete the tail and return its info;
if (isEmpty())
return null;
T el = tail.info;
if (head == tail) // if only one node in the list;
head = tail = null;
else { // if more than one node in the list,
SLLNode<T> tmp; // find the predecessor of tail;
for (tmp = head; tmp.next != tail; tmp = tmp.next);
tail = tmp; // the predecessor of tail becomes tail;
tail.next = null;
}
return el;
}
public void delete(T el) { // delete the node with an element el;
if (!isEmpty())
if (head == tail && el.equals(head.info)) // if only one
head = tail = null; // node on the list;
else if (el.equals(head.info)) // if more than one node on the list;
head = head.next; // and el is in the head node;
else { // if more than one node in the list
SLLNode<T> pred, tmp;// and el is in a nonhead node;
for (pred = head, tmp = head.next;
tmp != null && !tmp.info.equals(el);
pred = pred.next, tmp = tmp.next);
if (tmp != null) { // if el was found;
pred.next = tmp.next;
if (tmp == tail) // if el is in the last node;
tail = pred;
}
}
}
@Override
public String toString() {
if(head == null)
return "[ ]";
String str = "[ ";
SLLNode<T> tmp = head;
while(tmp != null){
str += tmp.info + " ";
tmp = tmp.next;
}
return str+"]";
}
public boolean contains(T el) {
if(head == null)
return false;
SLLNode<T> tmp = head;
while(tmp != null){
if(tmp.info.equals(el))
return true;
tmp = tmp.next;
}
return false;
}
public int size(){
if(head == null)
return 0;
int count = 0;
SLLNode<T> p = head;
while(p != null) {
count++;
p = p.next;
}
return count;
}
}
Given the code above, solve the following tasks (please show the solution for every task
clearly):
For part (c) this is the code for the test program:
public class SLL_Driver {
public static void main(String[] args) {
SLL<String> myList = new SLL<String>();
String[] cityNames = {"Jubail", "Riyadh", "Abha", "Dammam", "Taif"};
for(int i = 0; i < cityNames.length; i++)
myList.addToHead(cityNames[i]);
System.out.println("The list is: " + myList);
System.out.println("It is " + myLis.
How do you stop infinite loop Because I believe that it is making a.pdf
How do you stop infinite loop? Because I believe that it is making an infinite circular list.
c++ code:
Here is the list class:
#ifndef LIN_J_LIST
#define LIN_J_LIST
typedef unsigned int uint;
#include
#include
using namespace std;
/**
* a simplified generic singly linked list class to illustrate C++ concepts
* @author Jerry Lin
* @version 2/17/17
*/
template< typename Object >
class List
{
private:
/**
* A class to store data and provide a link to the next node in the list
*/
class Node
{
public:
/**
* The constructor
* @param data the data to be stored in this node
*/
explicit Node( const Object & data )
: data{ data }, next{ nullptr } {}
Object data;
Node * next;
};
public:
/**
* The constructor for an empty list
*/
List()
: size{ 0 }, first{ nullptr }, last{ nullptr } {}
/**
* the copy constructor-creates and copy the list
*/
List( List && rhs ) = delete;
List( const List & rhs )
{
count = 0;
size = 0;
if(rhs.size != 0)
{
push_front(rhs.front());
Node * current = rhs.first;
Node * tempNode = first;
size++;
while(current->next != nullptr)
{
current = current->next;
Node *newNode = new Node(current->data); //transfer the data. basic op.
count++;
tempNode->next = newNode;
last = newNode;
tempNode = tempNode->next;
size++;
}
}
// you document and implement this method
}
/**
* the operator= method-copies the list
*/
List & operator=( List && rhs) = delete;
List & operator=( const List & rhs )
{
count = 0;
size = 0;
if( size != 0 )
{
Node * current = first;
Node * temp;
while( current != nullptr )
{
temp = current;
current = current->next;
delete temp;
}
}
if(rhs.size!= 0)
{
push_front(rhs.front());
Node * current = rhs.first;
Node * tempNode = first; //create a temporary to store
size++;
while(current -> next != nullptr)
{
current = current->next;
Node *newNode = new Node(current->data); //transfer the data. basic op
count++;
tempNode->next = newNode;
last = newNode;
tempNode = tempNode -> next;
size++;
}
}
return *this;
// you document and implement this method
}
/**
* accessor
* @return count
*/
int get_count() const
{
return count;
}
/**
* The destructor that gets rid of everything that\'s in the list and
* resets it to empty. If the list is already empty, do nothing.
*/
~List()
{
if( size != 0 )
{
Node * current = first;
Node * temp;
while( current != nullptr )
{
temp = current;
current = current->next;
delete temp;
}
}
}
/**
* Put a new element onto the beginning of the list
* @param item the data the new element will contain
*/
void push_front( const Object& item )
{
Node * new_node = new Node( item );//basic op.
if(is_empty())
{
last = new_node;
}
else
{
new_node->next = first;
}
first = new_node;
size++;
/* you complete the rest */
}
/**
* Remove the element that\'s at the front of the list. Causes an
* assertion error if the list is empty.
*/
void pop_front()
{
assert( !is_empty() );
Node * temp = first;
if( first == last )
{
first = last = nullptr;
}
else
{
first = first->next;
}
delete temp;
size--;
}
/**
* Accessor to return the da.
Similar to NumberList.java (implements the linked list)public class NumberLis.pdf (20)
hi i have to write a java program involving link lists. i have a pro.pdf
hi i have to write a java program involving link lists. i have a pro.pdf
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
I will provide my LinkedList from my last lab.LinkedList.cpp~~~~.pdf
I will provide my LinkedList from my last lab.LinkedList.cpp~~~~.pdf
Note Given Code modified as required and required met.pdf
Note Given Code modified as required and required met.pdf
Create a new java class called ListNode. Implement ListNode as a gen.pdf
Create a new java class called ListNode. Implement ListNode as a gen.pdf
In C++Write a recursive function to determine whether or not a Lin.pdf
In C++Write a recursive function to determine whether or not a Lin.pdf
Help I keep getting the same error when running a code. Below is the.pdf
Help I keep getting the same error when running a code. Below is the.pdf
PROBLEM STATEMENTIn this assignment, you will complete DoubleEnde.pdf
PROBLEM STATEMENTIn this assignment, you will complete DoubleEnde.pdf
How do I fix it in javaLinkedList.java Defines a doubl.pdf
How do I fix it in javaLinkedList.java Defines a doubl.pdf
How do I fix it in LinkedList.javaLinkedList.java Define.pdf
How do I fix it in LinkedList.javaLinkedList.java Define.pdf
In an ancient land, the beautiful princess Eve had many suitors She d.pdf
In an ancient land, the beautiful princess Eve had many suitors She d.pdf
The LinkedList1 class implements a Linked list. class.pdf
The LinkedList1 class implements a Linked list. class.pdf
There is something wrong with my program-- (once I do a for view all t.pdf
There is something wrong with my program-- (once I do a for view all t.pdf
using set identitiesSolutionimport java.util.Scanner; c.pdf
using set identitiesSolutionimport java.util.Scanner; c.pdf
package singlylinkedlist; public class Node { public String valu.pdf
package singlylinkedlist; public class Node { public String valu.pdf
Java AssignmentUsing the ListNode.java file below Write method.pdf
Java AssignmentUsing the ListNode.java file below Write method.pdf
Solve using Java programming language- ----------------------------.pdf
Solve using Java programming language- ----------------------------.pdf
How do you stop infinite loop Because I believe that it is making a.pdf
How do you stop infinite loop Because I believe that it is making a.pdf
More from anjanacottonmills
Step1 First compound has 2 double bonds ; Second .pdf
Step1 First compound has 2 double bonds ; Second compound has 5 double bonds;
Third compound has 1 double bond. Step2 Second molecule requires maximum energy due to 5
double bonds.This is likely to to have UV/ Visible absorption.
Solution
Step1 First compound has 2 double bonds ; Second compound has 5 double bonds;
Third compound has 1 double bond. Step2 Second molecule requires maximum energy due to 5
double bonds.This is likely to to have UV/ Visible absorption..
Molarity = molesvolume9liter) Molarity of NH4Cl.pdf
Molarity = moles/volume9liter) Molarity of NH4Cl = 4.50 mol /2.00L=2.25 M
Solution
Molarity = moles/volume9liter) Molarity of NH4Cl = 4.50 mol /2.00L=2.25 M.
HOCH2CH2OH is more soluble in water. more OH grou.pdf
HOCH2CH2OH is more soluble in water. more OH groups the alcohol has, more
easily to form hydrogen bond with water molecules. As a result, it is more soluble.
Solution
HOCH2CH2OH is more soluble in water. more OH groups the alcohol has, more
easily to form hydrogen bond with water molecules. As a result, it is more soluble..
z=(2n+1)4where n=all integersSolutionz=(2n+1)4where n=al.pdf
z=(2n+1)/4
where n=all integers
Solution
z=(2n+1)/4
where n=all integers.
This above plant name is Solidago sempervirens, belong to genus Soli.pdf
This above plant name is Solidago sempervirens, belong to genus Solidago. Species
S.sempervirens commonly know as seaside goldenrod. Authority L.
Solidago sempervirens is a succulent, herbaceous perennial that reaches heights of 4–6 feet (120-
180 cm). It is unusual in the genus in having toothless, hair-less leaves, thicker than those of
most other Solidago species. Flower heads are found in a large paniculiforminflorescence at the
top of the plant, often with branches that bend backwards towards the base. This species blooms
in late summer and well into the fall, later in the season than most of its relatives. Its fruits are
wind-dispersed achenes. They are yellow often, and have sprouts of buds at the end of the short
branchesKingdomPlantaePlants, but not fungi, lichens, or algae (from Stearn’s Botanical
Latin)SubkingdomTracheobiontaVascular plants—plants with a “circulatory system” for
delivering water and nutrientsDivisionMagnoliophytaFlowering plants, also known as
angiospermsClassMagnoliopsidaDicotyledons—plants with two initial seed
leavesSubclassAsteridaeA large class that encompasses astersOrderAsteralesFlowering plants
with a central disk flower and surrounding petals, like daisiesFamilyAsteraceaeThe aster family,
which also includes daisies and sunflowers; from the Greek , “star,” for the star-shaped
flowersGenusSolidagoFrom Latin solido, “to make whole or heal,” because it was believed
these species had healing propertiesSpeciessempervirens\"Evergreen\"
Solution
This above plant name is Solidago sempervirens, belong to genus Solidago. Species
S.sempervirens commonly know as seaside goldenrod. Authority L.
Solidago sempervirens is a succulent, herbaceous perennial that reaches heights of 4–6 feet (120-
180 cm). It is unusual in the genus in having toothless, hair-less leaves, thicker than those of
most other Solidago species. Flower heads are found in a large paniculiforminflorescence at the
top of the plant, often with branches that bend backwards towards the base. This species blooms
in late summer and well into the fall, later in the season than most of its relatives. Its fruits are
wind-dispersed achenes. They are yellow often, and have sprouts of buds at the end of the short
branchesKingdomPlantaePlants, but not fungi, lichens, or algae (from Stearn’s Botanical
Latin)SubkingdomTracheobiontaVascular plants—plants with a “circulatory system” for
delivering water and nutrientsDivisionMagnoliophytaFlowering plants, also known as
angiospermsClassMagnoliopsidaDicotyledons—plants with two initial seed
leavesSubclassAsteridaeA large class that encompasses astersOrderAsteralesFlowering plants
with a central disk flower and surrounding petals, like daisiesFamilyAsteraceaeThe aster family,
which also includes daisies and sunflowers; from the Greek , “star,” for the star-shaped
flowersGenusSolidagoFrom Latin solido, “to make whole or heal,” because it was believed
these species had healing propertiesSpeciessempervirens\"Evergreen\".
The Java Program for the above given isimport java.io.File;impo.pdf
The Java Program for the above given is:
import java.io.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.util.Scanner;
import java.util.NoSuchElementException;
import java.io.PrintWriter;
public class InputPrototype
{
public static void main(String[] args)
throws FileNotFoundException
{
Scanner in = new Scanner(System.in);
System.out.print(\"Input File Name: \");
String inputFileName = in.next();
System.out.print(\"Output File Name: \");
String outputFileName = in.next();
File inputFile = new File(inputFileName);
Scanner input = new Scanner(inputFile);
PrintWriter out = new PrintWriter(outputFileName);
double total= 0;
while (in.hasNextDouble())
{
double value = in.nextDouble();
out.printf(\"%15.2f\ \", value);
total = total + value;
}
out.printf(\"Total: %8.2f\ \", total);
in.close();
out.close();
}
}
}
Solution
The Java Program for the above given is:
import java.io.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.util.Scanner;
import java.util.NoSuchElementException;
import java.io.PrintWriter;
public class InputPrototype
{
public static void main(String[] args)
throws FileNotFoundException
{
Scanner in = new Scanner(System.in);
System.out.print(\"Input File Name: \");
String inputFileName = in.next();
System.out.print(\"Output File Name: \");
String outputFileName = in.next();
File inputFile = new File(inputFileName);
Scanner input = new Scanner(inputFile);
PrintWriter out = new PrintWriter(outputFileName);
double total= 0;
while (in.hasNextDouble())
{
double value = in.nextDouble();
out.printf(\"%15.2f\ \", value);
total = total + value;
}
out.printf(\"Total: %8.2f\ \", total);
in.close();
out.close();
}
}
}.
The fidelity of DNA replication determines the genome stability and .pdf
The fidelity of DNA replication determines the genome stability and it plays a main role in
evolution of species. The DNA replication fidelity is a key factor of mutations which in turn
leads to many human diseases.
The high fidelity of DNA replication in E.coli is achieved by DNA polymerase III
holoenzyme, which is a complex of 17 proteins. This is responsible for simultaneous replication
of both leading and lagging DNA strand with high speed and high fidelity. There are also four
other accessory DNA polymerases present in E.coli such as Pol I, II, IV and V.
Pol II plays an important role in proofreading of DNA intra-strand crosslinks, DNA
strand exposed to UV irradiation, oxidation, stress-induced mutagenesis. This enzyme is
responsible for translesion synthesis. Pol IV and V are specific to lagging stand. Pol IV is
responsible for proceeding the DNA replication even when there is a mismatch. The Pol IV has a
high constitutive intracellular concentration. Pol V is induced constitutively in the absence of
exogenous DNA damage. The primary role of Pol I in DNA replication is to remove RNA
primers and fill the resulting gap during maturation of Okazaki fragments in the lagging strand.
In eukaryotes, the replication of leading and lagging strands takes place by Pol and Pol
respectively, which leads to fidelity differences. Whereas in E.coli the replication of both leading
and lagging strands takes place by same enzyme polymerase III. This is also one of the reason
why E.coli has high fidelity of DNA replication.
The tau subunit of Pol III plays a central role in DNA replication fidelity, as it interacts with both
leading and lagging strand. This subunit also contributes for polymerase switching during
replication.
Solution
The fidelity of DNA replication determines the genome stability and it plays a main role in
evolution of species. The DNA replication fidelity is a key factor of mutations which in turn
leads to many human diseases.
The high fidelity of DNA replication in E.coli is achieved by DNA polymerase III
holoenzyme, which is a complex of 17 proteins. This is responsible for simultaneous replication
of both leading and lagging DNA strand with high speed and high fidelity. There are also four
other accessory DNA polymerases present in E.coli such as Pol I, II, IV and V.
Pol II plays an important role in proofreading of DNA intra-strand crosslinks, DNA
strand exposed to UV irradiation, oxidation, stress-induced mutagenesis. This enzyme is
responsible for translesion synthesis. Pol IV and V are specific to lagging stand. Pol IV is
responsible for proceeding the DNA replication even when there is a mismatch. The Pol IV has a
high constitutive intracellular concentration. Pol V is induced constitutively in the absence of
exogenous DNA damage. The primary role of Pol I in DNA replication is to remove RNA
primers and fill the resulting gap during maturation of Okazaki fragments in the lagging strand.
In eukaryotes, the replication of leading .
E= 0.28V reactants are favored .pdf
E= 0.28V reactants are favored
Solution
E= 0.28V reactants are favored.
The differences between ipv4 and ipv6 are as below1. Header1.Ch.pdf
The differences between ipv4 and ipv6 are as below
1. Header:
1.Checksum and options feild are present and the length of header with 20 bytes in ipv4.
2.extension header is present with length 40 bytes in ipv6.
2.Addressing scheme:
1. A 32-bit permiting a amont of 2^32 in ipv4.
2. The adress of ipv6 is 128 bit.
3.Translation: Ipv4 is using 4 bytes and ipv6 is is utilizing 16 bytes to transit from ipv4 to ipv6.
4.Data flow: The ipv4 is unable to recognise packet flow for QOS handling.In ipv6 flow label is
present to describe packet flow for QOS handling.
5.Duplicate adress detection: in ipv4 ARP is used to detect the duplicate adress and in ipv6
SLAAC +DHPCPV6 is used.
6.Multicast and routing: ipv6 is healthier in multicast routing when compared to ipv6.in ipv4
with TCP protocol is about 576 bytes.where as in ipv6 with 120 bytes.
7.current status of ipv6 adoption: Gooogle dignified ipv6 adoption at arriving 10% positioning
spot.
Solution
The differences between ipv4 and ipv6 are as below
1. Header:
1.Checksum and options feild are present and the length of header with 20 bytes in ipv4.
2.extension header is present with length 40 bytes in ipv6.
2.Addressing scheme:
1. A 32-bit permiting a amont of 2^32 in ipv4.
2. The adress of ipv6 is 128 bit.
3.Translation: Ipv4 is using 4 bytes and ipv6 is is utilizing 16 bytes to transit from ipv4 to ipv6.
4.Data flow: The ipv4 is unable to recognise packet flow for QOS handling.In ipv6 flow label is
present to describe packet flow for QOS handling.
5.Duplicate adress detection: in ipv4 ARP is used to detect the duplicate adress and in ipv6
SLAAC +DHPCPV6 is used.
6.Multicast and routing: ipv6 is healthier in multicast routing when compared to ipv6.in ipv4
with TCP protocol is about 576 bytes.where as in ipv6 with 120 bytes.
7.current status of ipv6 adoption: Gooogle dignified ipv6 adoption at arriving 10% positioning
spot..
TCP - TCP breaks data into manageable packets and tracks information.pdf
TCP - TCP breaks data into manageable packets and tracks information such as source and
destination of packets. It is able to reroute packets and is responsible for guaranteed delivery of
the data.
IP - This is a connectionless protocol, which means that a session is not created before sending
data. IP is responsible for addressing and routing of packets between computers. It does not
guarantee delivery and does not give acknowledgement of packets that are lost or sent out of
order as this is the responsibility of higher layer protocols such as TCP.
UDP - A connectionless, datagram service that provides an unreliable, best-effort delivery.
ICMP - Internet Control Message Protocol enables systems on a TCP/IP network to share status
and error information such as with the use of PING and TRACERT utilities.
SMTP - Used to reliably send and receive mail over the Internet.
FTP - File transfer protocol is used for transferring files between remote systems. Must resolve
host name to IP address to establish communication. It is connection oriented (i.e. verifies that
packets reach destination).
TFTP - Same as FTP but not connection oriented.
ARP - provides IP-address to MAC address resolution for IP packets. A MAC address is your
computer\'s unique hardware number and appears in the form 00-A0-F1-27-64-E1 (for example).
Each computer stores an ARP cache of other computers ARP-IP combinations.
POP3 - Post Office Protocol. A POP3 mail server holds mail until the workstation is ready to
receive it.
IMAP - Like POP3, Internet Message Access Protocol is a standard protocol for accessing e-
mail from your local server. IMAP (the latest version is IMAP4) is a client/server protocol in
which e-mail is received and held for you by your Internet server.
TELNET - Provides a virtual terminal or remote login across the network that is connection-
based. The remote server must be running a Telnet service for clients to connect.
HTTP - The Hypertext Transfer Protocol is the set of rules for exchanging files (text, graphic
images, sound, video, and other multimedia files) on the World Wide Web. It is the protocol
controlling the transfer and addressing of HTTP requests and responses.
HTTPS - Signifies that a web page is using the Secure Sockets Layer (SSL) protocol and is
providing a secure connection. This is used for secure internet business transactions.
NTP - Network Time Protocol is a protocol that is used to synchronize computer clock times in
a network of computers.
SNMP - Stands for Simple Network Management Protocol and is used for monitoring and status
information on a network. SNMP can be used to monitor any device that is SNMP capable and
this can include computers, printers, routers, servers, gateways and many more using agents on
the target systems. The agents report information back to the management systems by the use of
“traps” which capture snapshot data of the system. This trap information could be system errors,
resource information, or other info.
Static arrays are structures whose size is fixed at compile time and.pdf
Static arrays are structures whose size is fixed at compile time and therefore cannot be extended
or reduced to fit the data set. A dynamic array can be extended by doubling the size but there is
overhead associated with the operation of copying old data and freeing the memory associated
with the old data structure. One potential problem of using arrays for storing data is that arrays
require a contiguous block of memory which may not be available, if the requested contiguous
block is too large. However the advantages of using arrays are that each element in the array can
be accessed very efficiently using an index. However, for applications that can be better
managed without using contiguous memory we define a concept called “linked lists”.
A linked list is a collection of objects linked together by references from one object to another
object. By convention these objects are named as nodes. So the basic linked list is collection of
nodes where each node contains one or more data fields AND a reference to the next node. The
last node points to a NULL reference to indicate the end of the list.
Types of Linked Lists
Linked lists are widely used in many applications because of the flexibility it provides. Unlike
arrays that are dynamically assigned, linked lists do not require memory from a contiguous
block. This makes it very appealing to store data in a linked list, when the data set is large or
device (eg: PDA) has limited memory. One of the disadvantages of linked lists is that they are
not random accessed like arrays. To find information in a linked list one must start from the head
of the list and traverse the list sequentially until it finds (or not find) the node. Another advantage
of linked lists over arrays is that when a node is inserted or deleted, there is no need to “adjust”
the array.
There are few different types of linked lists. A singly linked list as described above provides
access to the list from the head node. Traversal is allowed only one way and there is no going
back. A doubly linked list is a list that has two references, one to the next node and another to
previous node. Doubly linked list also starts from head node, but provide access both ways. That
is one can traverse forward or backward from any node. A multilinked list (see figures 1 & 2) is
a more general linked list with multiple links from nodes. For examples, we can define a Node
that has two references, age pointer and a name pointer. With this structure it is possible to
maintain a single list, where if we follow the name pointer we can traverse the list in alphabetical
order of names and if we traverse the age pointer, we can traverse the list sorted by ages. This
type of node organization may be useful for maintaining a customer list in a bank where same
list can be traversed in any order (name, age, or any other criteria) based on the need.
Designing the Node of a Linked List
Linked list is a collection of linked nodes. A node is a struct with at least a.
c) H2(g) + 12 O2(g) -H2O (l) as all are in the.pdf
c) H2(g) + 1/2 O2(g) ->H2O (l) as all are in there natural state. therefore it will
represent the enthalpy of formation
Solution
c) H2(g) + 1/2 O2(g) ->H2O (l) as all are in there natural state. therefore it will
represent the enthalpy of formation.
MagicSquareTest.java import java.util.Scanner;public class Mag.pdf
MagicSquareTest.java
import java.util.Scanner;
public class MagicSquareTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter Number of rows:\");
int rows = scan.nextInt();
System.out.println(\"Enter Nummber of columns:\");
int cols = scan.nextInt();
int a[][] = new int[rows][cols];
System.out.println(\"Enter matrix elements;\");
for(int i=0; i
Solution
MagicSquareTest.java
import java.util.Scanner;
public class MagicSquareTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter Number of rows:\");
int rows = scan.nextInt();
System.out.println(\"Enter Nummber of columns:\");
int cols = scan.nextInt();
int a[][] = new int[rows][cols];
System.out.println(\"Enter matrix elements;\");
for(int i=0; i.
Interphase.This is the phase where the cell prepares for the next .pdf
Interphase.
This is the phase where the cell prepares for the next round of division. It has three phases
further, Gap1, synthesis, and gap 2. During Gap1, the cell acquired nutrients and increases in
size. The checkpoints ensure that the cell is normal and all the things necessary for DNA
synthesis are prepared. During synthesis phase, DNA replicates. During the Gap 2 phase, the cell
grow further and the checkpoints ensure that the cell is correctly prepared for mitosis phase. The
cell spends most of its time in G1 phase, followed by S phase. Remaining phases comprise only
very short period of the cell cycle.
Solution
Interphase.
This is the phase where the cell prepares for the next round of division. It has three phases
further, Gap1, synthesis, and gap 2. During Gap1, the cell acquired nutrients and increases in
size. The checkpoints ensure that the cell is normal and all the things necessary for DNA
synthesis are prepared. During synthesis phase, DNA replicates. During the Gap 2 phase, the cell
grow further and the checkpoints ensure that the cell is correctly prepared for mitosis phase. The
cell spends most of its time in G1 phase, followed by S phase. Remaining phases comprise only
very short period of the cell cycle..
B.the rotation will be zero as L and D will cance.pdf
B.the rotation will be zero as L and D will cancel out each other..
Solution
B.the rotation will be zero as L and D will cancel out each other...
In the above conversation it is belonging to stereotypes.Stereotyp.pdf
In the above conversation it is belonging to stereotypes.
Stereotypes are a form of generalization. When we generalize, we group or classify people,
places, or things according to the traits they have in common. For example, we may say most
Masai tribesmen are unusually tall or Scandinavians are usually fair-skinned. If our observations
are careless or too limited, the generalization may be faulty, as when someone says, \"Hollywood
hasn\'t produced any quality movies in the past fifteen years.\"
But stereotypes are more serious than mere faulty generalizations. They are fixed, unbending
generalizations about people, places, or things. When a stereotype is challenged, the person who
holds it is unlikely to modify or discard it, because it is based on a distortion of perception. As
Walter Lippmann explains, when we stereotype,\" we do not so much see this man and that
sunset; rather we notice that the thing is man or sunset, and then see chiefly what our mind is full
of on those subjects.\"75
The most common kinds of stereotyping are ethnic and religious. Jews are shrewd and cunning,
clannish, have a financial genius matched only by their greed. Italians are hot-tempered, coarse,
and sensual. The Irish, like the Poles, are big and stupid; in addition, they brawl, lust after heavy
liquor and light conversation. Blacks are primitive and slowwitted. (Often each of these
stereotypes includes a virtue or two – Jews are good family members, Italians artistic, Poles
brave, the Irish devout, blacks athletic.)
Beyond these stereotypes are numerous other, less common ones; Swedish women, foreign film
directors, Southern senators, physical education instructors, fundamentalist clergymen, agnostics,
atheists, democrats, republicans, Mexicans, scientist, prostitutes, politicians, English teachers,
psychiatrists, construction workers, black militants, college dropouts, homosexuals, and society
matrons. There are stereotypes of institutions as well: marriage, the church, government, the
military, the Founding Fathers, Western culture, the Judeo-Christian tradition. (A full list would
include even God and mother.)
FACTS DON\'T MATTER
It is pleasant to assume that when the facts are known, stereotypes disappear. However, that is
seldom the case. The late Harvard psychologist Gordon Allport, in The nature of Prejudice,
pointed out that \"it is possible for a stereotype to grow in defiance of all evidence…\"76 People
who stereotype don\'t dust accept the facts that are offered to them. They measure those facts
against what they already \"know.\" That is, they measure them against the stereotype itself.
Instead of seeing that the stereotype is false and therefore dismissing it, they reject the unfamiliar
facts.
People who think in terms of stereotypes tend to be selective in their perceptions. They reject
conditions that challenge their preformed judgment and retain those that reinforce it. Thus a
person can notice the Jewish employer promoting another Jew but ign.
In general, the objective of an audit is to assess the risk of mater.pdf
In general, the objective of an audit is to assess the risk of material misstatements in the financial
statements. Material misstatements can arise from inadequacies in internal controls and from
inaccurate management assertions. Thus, testing the validity of the various implicit managerial
assertions is a key objective of an auditor.
Existence and Completeness
Auditing standards require that auditors test basic underlying management assertions implicit in
the financial statements. Key among these various assertions are existence or occurrence, which
describe a singular concept: Journal entries are not fiction. As the name implies, an auditor will
conduct various procedures to verify that assets do in fact exist and that recorded transactions did
in fact occur. Additionally, an auditor will seek evidence of completeness, so that the financial
statements include all material transactions that occurred, and so the records do not omit material
transactions for any reason.
Rights and Obligations
The various rights and obligations of the company are important management assertions inherent
in the financial statements. Thus, an auditor will obtain evidence regarding a company\'s rights,
such as proper title to assets and status of intellectual property. An auditor will be concerned
with assertions relating to the company\'s obligations, such as accounts payable balances, long-
term debts and tax liabilities. Thus, the audit objectives will be fulfilled upon validating these
specific assertions.
Valuation or Allocation
Valuation or allocation are managerial assertions which are often material to the financial
statements; thus, an auditor will diligently conduct audit procedures relating to these objectives.
Generally accepted accounting principles, or GAAP, require that certain balance sheet items be
presented using different valuation methodologies. Meeting these standards is a key audit
objective, as the risk of material misstatement is low in probability, but high in magnitude. Thus,
among other things, the historical cost of assets is verified, depreciation methods are scrutinized
and the fair value of investments are calculated to satisfy this objective.
Presentation and Disclosure
Another specific audit objective is validating the presentation of the financial statements and the
adequacy of the disclosures therein. Financial statements should conform to certain requirements
and expectations, and should include the balance sheet, income statement, statement of cash
flows and the statement of owner\'s equity. Relating to disclosure, the auditor will consider the
sufficiency and clarity of footnotes and the transparency in management discussion and analysis,
so he can assess the risk of material misstatement and fulfill the audit objective.
Specific audit objectives are the application of the general audit objectives to a given class of
transactions, account balance, or presentation and disclosure. There must be at least one specific
audit object.
if one can understand a few things it is easier to solve these kind .pdf
if one can understand a few things it is easier to solve these kind of questions.
first comes to I which codes for repressor. there are 3 types - I+ Wild type and is normal and
make Z and Y products in the presence of lactose only. I- is a recessive mutation will make
products of Z and Y in the presence and the absence of lactose. Is is a dominant mutation will
stop both the products Z and Y. if you have atlease one Is in the question neither the products
will from no matter whether the lactose is presence or not.
then comes to Operator (O) ,O+ is a wild type and can produce both the products of Z and Y. in
the presence of lactose.and Oc is the mutation and can produce both Z and Y products in the
Presence and even in the absence of lactose.
next comes to Z+ represents production of -galactosidase and Z- represents no production of -
galactosidase.
1.Ans. I+P-O+Z+Y+
In this haploid genotype the transcription of operon genes totally absent. Transcription of
structural genes is not occured. because here P- indicates the mutation in the promoter site, the
RNA polymerase unable to bind to the Promoter and initiate transcription of structural genes. so
these cells cannot able to grow on media which contain lactose as sole carbon source. the Strain
is lac-
2.Ans.I+P+OcZ+Y-
here Oc is the mutation and can produce both Z and Y products in the Presence and even in the
absence of lactose means constitutively. but here only the product beta galctosidase produced
constitutively and the permease is not produced because Permease gene is is mutated (Y-). these
cells also cannot able to grow on media which contain lactose as sole carbon source.because the
absence of functional permease enzyme so the Strain is lac-
3.Ans. I-P+OcZ+Y+
here I- is a recessive mutation will make products of Z and Y in the presence and the absence of
lactose and Oc is the mutation and can produce both Z and Y products in the Presence and even
in the absence of lactose. so this haploid genotype transcribes operon genes constitutively. and
both the products of Z and Y expressed continuously, so these cells able to grow on the media
which contain lactose as sole carbon source. the strain is lac+
b. partially diploid cap-I+P+O+Z-Y+/Cap+I-P+O+Z+Y-
these cells can able to grow on lactose medium because these cells have presence of wild
promoter which can able to active the transcription of structural genes. so these cells can able to
grow on the media which contain lactose as sole carbon source.
ii. Transcription of beta-galactosidase and permease is Inducible
though diploid cell have mutated inducer region which can able to activate constitutive
expression but Wild type (I+) is dominant over I- . so it is inducible operon.
Solution
if one can understand a few things it is easier to solve these kind of questions.
first comes to I which codes for repressor. there are 3 types - I+ Wild type and is normal and
make Z and Y products in the presence of lactose only. I- is a recessive mutation .
More from anjanacottonmills (20)
Step1 First compound has 2 double bonds ; Second .pdf
Step1 First compound has 2 double bonds ; Second .pdf
Molarity = molesvolume9liter) Molarity of NH4Cl.pdf
Molarity = molesvolume9liter) Molarity of NH4Cl.pdf
HOCH2CH2OH is more soluble in water. more OH grou.pdf
HOCH2CH2OH is more soluble in water. more OH grou.pdf
z=(2n+1)4where n=all integersSolutionz=(2n+1)4where n=al.pdf
z=(2n+1)4where n=all integersSolutionz=(2n+1)4where n=al.pdf
This above plant name is Solidago sempervirens, belong to genus Soli.pdf
This above plant name is Solidago sempervirens, belong to genus Soli.pdf
The Java Program for the above given isimport java.io.File;impo.pdf
The Java Program for the above given isimport java.io.File;impo.pdf
The fidelity of DNA replication determines the genome stability and .pdf
The fidelity of DNA replication determines the genome stability and .pdf
The differences between ipv4 and ipv6 are as below1. Header1.Ch.pdf
The differences between ipv4 and ipv6 are as below1. Header1.Ch.pdf
TCP - TCP breaks data into manageable packets and tracks information.pdf
TCP - TCP breaks data into manageable packets and tracks information.pdf
Static arrays are structures whose size is fixed at compile time and.pdf
Static arrays are structures whose size is fixed at compile time and.pdf
c) H2(g) + 12 O2(g) -H2O (l) as all are in the.pdf
c) H2(g) + 12 O2(g) -H2O (l) as all are in the.pdf
MagicSquareTest.java import java.util.Scanner;public class Mag.pdf
MagicSquareTest.java import java.util.Scanner;public class Mag.pdf
Interphase.This is the phase where the cell prepares for the next .pdf
Interphase.This is the phase where the cell prepares for the next .pdf
B.the rotation will be zero as L and D will cance.pdf
B.the rotation will be zero as L and D will cance.pdf
In the above conversation it is belonging to stereotypes.Stereotyp.pdf
In the above conversation it is belonging to stereotypes.Stereotyp.pdf
In general, the objective of an audit is to assess the risk of mater.pdf
In general, the objective of an audit is to assess the risk of mater.pdf
if one can understand a few things it is easier to solve these kind .pdf
if one can understand a few things it is easier to solve these kind .pdf
Recently uploaded
Home assignment II on Spectroscopy 2024 Answers.pdf
Answers to Home assignment on UV-Visible spectroscopy: Calculation of wavelength of UV-Visible absorption
Operation Blue Star - Saka Neela Tara
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
Francesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
Digital Tools and AI for Teaching Learning and Research
This Presentation in details discusses on Digital Tools and AI for Teaching Learning and Research
A Strategic Approach: GenAI in Education
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
The approach at University of Liverpool.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH ANSWERS.
Unit 8 - Information and Communication Technology (Paper I).pdf
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Overview on Edible Vaccine: Pros & Cons with Mechanism
This ppt include the description of the edible vaccine i.e. a new concept over the traditional vaccine administered by injection.
1.4 modern child centered education - mahatma gandhi-2.pptx
Child centred education is an educational approach that priorities the interest, needs and abilities of the child in the learning process.
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal labor is also termed spontaneous labor, defined as the natural physiological process through which the fetus, placenta, and membranes are expelled from the uterus through the birth canal at term (37 to 42 weeks
Supporting (UKRI) OA monographs at Salford.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
The Challenger.pdf DNHS Official Publication
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Digital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Pavilions
NGV Architecture Commission Competition
MPavilion Commission Competition
Other Pavilion Designs
Recently uploaded (20)
Home assignment II on Spectroscopy 2024 Answers.pdf
Home assignment II on Spectroscopy 2024 Answers.pdf
Francesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk - How can education support child empowerment.pptx
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Overview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with Mechanism
1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal Labour/ Stages of Labour/ Mechanism of Labour
Digital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Investigating Pavilion Designs
Group Presentation 2 Economics.Ariana Buscigliopptx
Group Presentation 2 Economics.Ariana Buscigliopptx
NumberList.java (implements the linked list)public class NumberLis.pdf
- 1. NumberList.java (implements the linked list) public class NumberList{ Node first; Node last; public NumberList(){ first = null; last = null; } public NumberList(Node node){ this.first = node; this.last = node; } public boolean isEmpty(){ return first == null; } public void setLast(Node node){ this.last = node; } public void insert(Node node){ if (first==null){ this.first = node; this.last = node; } else{ node.previous = this.last; node.previous.next = node; node.next = null; this.last = node; } } public boolean inList(String num){ Node l = first; while (l.next != null){ if (l.number.equals(num)){ return true;
- 2. } else{ l = l.next; } } return false; } public void printList(){ Node l = first; while(l.next!=null){ System.out.print(l.number+" "); l = l.next; } System.out.println(); } } Node.java (implements a single node in the linked list; stores number and pointers) public class Node{ String number; Node previous; Node next; public Node(String num){ number = num; previous = null; next = null; } public Node(String num, Node p, Node n){ number = num; previous = p; next = n; } } Main.java (contains the main method and the helper methods to solve the questions given) import java.util.Scanner; import java.util.List;
- 3. import java.util.ArrayList; public class Main{ static boolean checkHappiness(String num){ Node current = new Node(num, null, null); NumberList numberList = new NumberList(current); int len = num.length(); int resultant = 0; for (int i=0; i happyNumbersfrom1to10000(){ ArrayList numbers = new ArrayList(); for (int j=0; j<10000; j++){ if (checkHappiness(String.valueOf(j+1))){ numbers.add(String.valueOf(j+1)); } } return numbers; } static void happyNumbersfrom9001to10000(){ for (int j=9001; j<=10000; j++){ //System.out.println(j); if (checkHappiness(String.valueOf(j))){ System.out.println(String.valueOf(j)); } } } static String getLargeHappyNumber(){ for (long i=10000000000000000000L; i<1000000000000000000000L; i++){ if (checkHappiness(String.valueOf(i))){ return String.valueOf(i); } return "-1"; } } static String getLargeUnhappyNumber(){ for (long i=10000000000000000000L; i<1000000000000000000000L; i++){ if (!checkHappiness(String.valueOf(i))){ return String.valueOf(i);
- 4. } return "-1"; } } public static void main(String[] args){ happyNumbersfrom9001to10000(); System.out.println(happyNumbersfrom1to10000()); } } Solution NumberList.java (implements the linked list) public class NumberList{ Node first; Node last; public NumberList(){ first = null; last = null; } public NumberList(Node node){ this.first = node; this.last = node; } public boolean isEmpty(){ return first == null; } public void setLast(Node node){ this.last = node; } public void insert(Node node){ if (first==null){ this.first = node; this.last = node; }
- 5. else{ node.previous = this.last; node.previous.next = node; node.next = null; this.last = node; } } public boolean inList(String num){ Node l = first; while (l.next != null){ if (l.number.equals(num)){ return true; } else{ l = l.next; } } return false; } public void printList(){ Node l = first; while(l.next!=null){ System.out.print(l.number+" "); l = l.next; } System.out.println(); } } Node.java (implements a single node in the linked list; stores number and pointers) public class Node{ String number; Node previous; Node next; public Node(String num){ number = num; previous = null;
- 6. next = null; } public Node(String num, Node p, Node n){ number = num; previous = p; next = n; } } Main.java (contains the main method and the helper methods to solve the questions given) import java.util.Scanner; import java.util.List; import java.util.ArrayList; public class Main{ static boolean checkHappiness(String num){ Node current = new Node(num, null, null); NumberList numberList = new NumberList(current); int len = num.length(); int resultant = 0; for (int i=0; i happyNumbersfrom1to10000(){ ArrayList numbers = new ArrayList(); for (int j=0; j<10000; j++){ if (checkHappiness(String.valueOf(j+1))){ numbers.add(String.valueOf(j+1)); } } return numbers; } static void happyNumbersfrom9001to10000(){ for (int j=9001; j<=10000; j++){ //System.out.println(j); if (checkHappiness(String.valueOf(j))){ System.out.println(String.valueOf(j)); } } }
- 7. static String getLargeHappyNumber(){ for (long i=10000000000000000000L; i<1000000000000000000000L; i++){ if (checkHappiness(String.valueOf(i))){ return String.valueOf(i); } return "-1"; } } static String getLargeUnhappyNumber(){ for (long i=10000000000000000000L; i<1000000000000000000000L; i++){ if (!checkHappiness(String.valueOf(i))){ return String.valueOf(i); } return "-1"; } } public static void main(String[] args){ happyNumbersfrom9001to10000(); System.out.println(happyNumbersfrom1to10000()); } }