I am failing a few tests with my Double Linked List program. Can som.pdf
•
0 likes•2 views
How are the Baldrige Principles evident in your workplace, a self owned business, ( bakery). Which ones are most prominent? Are there any that are missing? Solution He explained some core values and practices to be followed by people at workplaces to become success at their work. They are: These are important to become succesful in the given field. If I starts a won business, i may follow most of these values at my workplace, and my workers may follow these by looking at me. I may not insist my workers to follow all these becasue i convinced and interested in the above. They must beleive that, these will be help to them personally and professionally in their lives. Then they must follow all these. From above all, I give high priority to RESPECT STAFF, FACULTY & PATTERNS, I can say that, every human must carry respect irrespective of their work and profession. Hence, where people are respected, the place is fully filled with values and ethics. These two are two major pillars for success of any profession or organization. He covered all the aspects, and as of my knowledge, these are sufficient to become success in profession or business..
Report
Share
Report
Share
Download to read offline
Recommended
In the class we extensively discussed a generic singly linked list i.pdf
In the class we extensively discussed a generic singly linked list implemented as a node class.
Implement a generic node class called DoublyNode in which each node contains an element of
type E and each node is linked not only forward to the next element in the list but also backward
to the previous element in the list. Your implementation should adapt and implement all the
methods of generic Node including the following methods:
Constructor for DoublyNode
addNodeAfter, removeNodeAfter
getData, setData
getForeLink, setForeLink
getBackLink, setBackLink
listCopy
listCopyWithTail
listLength
listPart
listPosition
listSearch
Solution
import java.util.ListIterator;
import java.util.NoSuchElementException;
import java.util.Random;
public class DoublyNode {
private Node head;
private Node tail;
private int size;
public DoublyNode() {
size = 0;
}
private class Node {
E element;
Node getForeNode;
Node getBackNode;
public Node(E element, Node next, Node prev) {
this.element = element;
this.getForeNode = next;
this.getBackNode = prev;
}
}
public int listLength() { return size; }
public boolean isEmpty() { return size == 0; }
public void addFirst(E element) {
Node tmp = new Node(element, head, null);
if(head != null ) {head.getBackNode = tmp;}
head = tmp;
if(tail == null) { tail = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
public void addNodeAfter(E element) {
Node tmp = new Node(element, null, tail);
if(tail != null) {tail.getForeNode = tmp;}
tail = tmp;
if(head == null) { head = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
public void addNodeAfterSpecifiedNode(E element, E tobeAddedAfter) {
Node prevTobeAddedAfter = listSearch(element);
Node afterNode = prevTobeAddedAfter.getForeNode;
Node tmpNode = new Node(element,prevTobeAddedAfter,afterNode);
tmpNode = prevTobeAddedAfter.getForeNode;
afterNode = tmpNode.getForeNode;
}
public void listCopy(){
System.out.println(\"iterating forward..\");
Node tmp = head;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.getForeNode;
}
}
public Node listSearch(E item){
System.out.println(\"Searching Item \"+item);
Node tmp = head;
while(tmp != null){
System.out.println(tmp.element);
if(tmp.element == item) {
System.out.println(\"Item found \"+item);
return tmp;
}
tmp = tmp.getForeNode;
}
return null;
}
public void iterateBackward(){
System.out.println(\"iterating backword..\");
Node tmp = tail;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.getBackNode;
}
}
public E removeFirst() {
if (size == 0) throw new NoSuchElementException();
Node tmp = head;
head = head.getForeNode;
head.getBackNode = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public E removeNodeAfter() {
if (size == 0) throw new NoSuchElementException();
Node tmp = tail;
tail = tail.getBackNode;
tail.getForeNode = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
}.
Write the Java source code necessary to build a solution for the pro.pdf
Write the Java source code necessary to build a solution for the problem below:
Create a MyLinkedList class. Create methods in the class to add an item to the head, tail, or
middle of a linked list; remove an item from the head, tail, or middle of a linked list; check the
size of the list; and search for an element in the list.
Create a test class to use the newly created MyLinkedList class. Add the following names in to
the list: James, John, Michael, Peter, Allison, Daniel, George, Simon, Jason, and Mark. Your
program should allow the user to enter a name from the console, and then search to see if the
name exists in the list.
Solution
Hi, Please find my implementation.
Please let me know in case of any issue.
public class MyLinkedList {
static class Node{
String data;
Node next;
Node(String d){
data = d;
next =null;
}
}
private Node head;
public MyLinkedList() {
head = null;
}
public void append(String data){
if(head == null)
head = new Node(data);
else{
Node temp = head;
while(temp.next != null)
temp = temp.next;
temp.next = new Node(data);
}
}
public void addFront(String data){
Node newNode = new Node(data);
newNode.next = head;
head = newNode;
}
public void removeFromLast(){
if(head == null || head.next == null)
head = null;
else{
Node temp = head;
while(temp.next.next != null)
temp = temp.next;
temp.next = null; // removing last element
}
}
public void removeFirst(){
if(head == null)
return;
else
head = head.next;
}
public boolean search(String data){
Node temp = head;
while(temp != null){
if(temp.data.equals(data))
return true;
temp = temp.next;
}
return false;
}
public void addAtMiddle(String data){
Node slow = head;
Node fast = head;
Node prev = null;
Node newNode = new Node(data);
if(head == null || head.next == null){
newNode.next = head;
head = newNode;
return;
}
while(fast != null && fast.next != null){
fast = fast.next.next;
prev = slow;
slow = slow.next;
}
if(prev != null)
prev.next =newNode;
newNode.next = slow;
}
public void removeAtMiddle(){
Node slow = head;
Node fast = head;
Node prev = null;
if(head == null || head.next == null){
head = null;
return;
}
while(fast != null && fast.next != null){
fast = fast.next.next;
prev = slow;
slow = slow.next;
}
prev.next = slow.next;
}
public void display(){
Node temp = head;
while(temp != null){
System.out.print(temp.data+\" \");
temp =temp.next;
}
System.out.println();
}
}
public class MyLinkedListTest {
public static void main(String[] args) {
MyLinkedList list = new MyLinkedList();
list.addAtMiddle(\"James\");
list.display();
list.addAtMiddle(\"John\");
list.display();
list.addAtMiddle(\"Michael\");
list.display();
list.addAtMiddle(\"Peter\");
list.display();
list.addAtMiddle(\"Allison\");
list.display();
list.addFront(\"Daniel\");
list.display();
list.append(\"George\");
list.display();
list.addFront(\"Simon\");
list.display();
list.append(\"Jason\");
list.display();
list.addAtMiddle(\"Mark\");
list.display();
list.removeAtMiddle();
list.display();
list.removeFirst();
list.displ.
I need help implementing a Stack with this java programming assignme.pdf
I need help implementing a Stack with this java programming assignment:
Given a doubly linked list (code provided below) implement a Stack. You must use the doubly
link list class and utilize it as an object in your implementation of the stack.
A Stack is a Last in First Out (LiFO) structure which translates to the processes of outputting the
last element which was inputted in the collection. The Stack is based on the process of putting
things on top of one another and taking the item on top (think of a stack of papers).
Operations to implement:
push (E): Add an element to the start of the sequence
pop: Remove an element from the start of the sequence
Peek: Return the first element of the sequence without removing it
atIndex(x): Return the element at the given index (x) Or throw an exception if it is out of bound
(if you can control the user input then do that instead)
Size: Return the size of the Stack
isEmpty: Boolean, returns true if the Stack is empty
Empty: Empty the Stack
Code Part 1:
public class DoublyLinkedList{
private DNode head;
private DNode tail;
private int size;
public DoublyLinkedList(){ // construct an empty list
this.tail = new DNode (null, null, this.head);
this.head = new DNode (null, this.tail, null);
this.size = 0;
}
public DoublyLinkedList(DNode next){ // constructs a list
// out of a single node
this.tail = new DNode (null, null, next);
this.head = new DNode (null, next, null);
next.changeNext(this.tail);
next.changePrev(this.head);
this.size = 1;
}
public DoublyLinkedList(Object [] objectArray){ // construct a list out of
// an array
this.tail = new DNode (null, null, this.head);
this.head = new DNode (null, this.tail, null);
DNode temp = this.head;
for (Object e : objectArray)
{
//Anonomus function
new DNode (e, temp.getNext(),temp).insertBetweenNodes(temp, temp.getNext());
temp = temp.getNext();
this.size += 1;
}
}
public void addToFrontofList(Object toAdd){ // Appends the begining
// of the list
DNode temp = new DNode (toAdd, this.head.getNext(), this.head);
this.head.getNext().changePrev(temp);
this.head.changeNext(temp);
this.size += 1;
}
public void addToendofList (Object toAdd) // appends the end of the list
// with a node
{
DNode temp = new DNode (toAdd, this.tail, this.tail.getPrev());
this.tail.getPrev().changeNext(temp);
this.tail.changePrev(temp);
this.size += 1;
}
public void insertAfterNode(DNode current, Object input)// Inserts a new
// a new node after
// current node
{
current.insertAfterNode(input);
this.size += 1;
}
public int getSize() // returns the size of the list
{
return this.size;
}
public String toString()
{
String result = \"\";
for (DNode temp = this.head.getNext();
temp.hasNext(); temp = temp.getNext())
{
result += temp.getValue();
result += \" -> \";
}
result += \"End of list\";
return result;
}
}
and code part2:
public class DNode{
private Object e; // place holder for the type of object the
//collection is storing
private DNode next; // reference to the next node in the sequence
// of.
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();
}
}.
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.
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.
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.
This is to test a balanced tree. I need help testing an unbalanced t.pdf
this is business analytics question. (using gurobi) The days-off scheduling problem must be
solved routinely by businesses that operate 6 or 7 days a week. Examples include hospitals,
airlines, municipal transportation companies, and the postal service. The most common example
is the (5,7)-cyclic staffing problem. The objective of it is to minimize the cost of assigning
workers to a 7-day cyclic schedule so that 1) Sufficient workers are available every day. 2) Each
person works 5 consecutive days and is idle to the remaining 2 days. Here is the table showing
the cost of having an employee for each day and the number of employees required for each day.
For example, the pattern that one works from Sunday to Thursday costs 90+604=330. Formulate
and solve an integer programming problem to represent this problem. How many employees
work Monday-Friday?.
Recommended
In the class we extensively discussed a generic singly linked list i.pdf
In the class we extensively discussed a generic singly linked list implemented as a node class.
Implement a generic node class called DoublyNode in which each node contains an element of
type E and each node is linked not only forward to the next element in the list but also backward
to the previous element in the list. Your implementation should adapt and implement all the
methods of generic Node including the following methods:
Constructor for DoublyNode
addNodeAfter, removeNodeAfter
getData, setData
getForeLink, setForeLink
getBackLink, setBackLink
listCopy
listCopyWithTail
listLength
listPart
listPosition
listSearch
Solution
import java.util.ListIterator;
import java.util.NoSuchElementException;
import java.util.Random;
public class DoublyNode {
private Node head;
private Node tail;
private int size;
public DoublyNode() {
size = 0;
}
private class Node {
E element;
Node getForeNode;
Node getBackNode;
public Node(E element, Node next, Node prev) {
this.element = element;
this.getForeNode = next;
this.getBackNode = prev;
}
}
public int listLength() { return size; }
public boolean isEmpty() { return size == 0; }
public void addFirst(E element) {
Node tmp = new Node(element, head, null);
if(head != null ) {head.getBackNode = tmp;}
head = tmp;
if(tail == null) { tail = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
public void addNodeAfter(E element) {
Node tmp = new Node(element, null, tail);
if(tail != null) {tail.getForeNode = tmp;}
tail = tmp;
if(head == null) { head = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
public void addNodeAfterSpecifiedNode(E element, E tobeAddedAfter) {
Node prevTobeAddedAfter = listSearch(element);
Node afterNode = prevTobeAddedAfter.getForeNode;
Node tmpNode = new Node(element,prevTobeAddedAfter,afterNode);
tmpNode = prevTobeAddedAfter.getForeNode;
afterNode = tmpNode.getForeNode;
}
public void listCopy(){
System.out.println(\"iterating forward..\");
Node tmp = head;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.getForeNode;
}
}
public Node listSearch(E item){
System.out.println(\"Searching Item \"+item);
Node tmp = head;
while(tmp != null){
System.out.println(tmp.element);
if(tmp.element == item) {
System.out.println(\"Item found \"+item);
return tmp;
}
tmp = tmp.getForeNode;
}
return null;
}
public void iterateBackward(){
System.out.println(\"iterating backword..\");
Node tmp = tail;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.getBackNode;
}
}
public E removeFirst() {
if (size == 0) throw new NoSuchElementException();
Node tmp = head;
head = head.getForeNode;
head.getBackNode = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public E removeNodeAfter() {
if (size == 0) throw new NoSuchElementException();
Node tmp = tail;
tail = tail.getBackNode;
tail.getForeNode = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
}.
Write the Java source code necessary to build a solution for the pro.pdf
Write the Java source code necessary to build a solution for the problem below:
Create a MyLinkedList class. Create methods in the class to add an item to the head, tail, or
middle of a linked list; remove an item from the head, tail, or middle of a linked list; check the
size of the list; and search for an element in the list.
Create a test class to use the newly created MyLinkedList class. Add the following names in to
the list: James, John, Michael, Peter, Allison, Daniel, George, Simon, Jason, and Mark. Your
program should allow the user to enter a name from the console, and then search to see if the
name exists in the list.
Solution
Hi, Please find my implementation.
Please let me know in case of any issue.
public class MyLinkedList {
static class Node{
String data;
Node next;
Node(String d){
data = d;
next =null;
}
}
private Node head;
public MyLinkedList() {
head = null;
}
public void append(String data){
if(head == null)
head = new Node(data);
else{
Node temp = head;
while(temp.next != null)
temp = temp.next;
temp.next = new Node(data);
}
}
public void addFront(String data){
Node newNode = new Node(data);
newNode.next = head;
head = newNode;
}
public void removeFromLast(){
if(head == null || head.next == null)
head = null;
else{
Node temp = head;
while(temp.next.next != null)
temp = temp.next;
temp.next = null; // removing last element
}
}
public void removeFirst(){
if(head == null)
return;
else
head = head.next;
}
public boolean search(String data){
Node temp = head;
while(temp != null){
if(temp.data.equals(data))
return true;
temp = temp.next;
}
return false;
}
public void addAtMiddle(String data){
Node slow = head;
Node fast = head;
Node prev = null;
Node newNode = new Node(data);
if(head == null || head.next == null){
newNode.next = head;
head = newNode;
return;
}
while(fast != null && fast.next != null){
fast = fast.next.next;
prev = slow;
slow = slow.next;
}
if(prev != null)
prev.next =newNode;
newNode.next = slow;
}
public void removeAtMiddle(){
Node slow = head;
Node fast = head;
Node prev = null;
if(head == null || head.next == null){
head = null;
return;
}
while(fast != null && fast.next != null){
fast = fast.next.next;
prev = slow;
slow = slow.next;
}
prev.next = slow.next;
}
public void display(){
Node temp = head;
while(temp != null){
System.out.print(temp.data+\" \");
temp =temp.next;
}
System.out.println();
}
}
public class MyLinkedListTest {
public static void main(String[] args) {
MyLinkedList list = new MyLinkedList();
list.addAtMiddle(\"James\");
list.display();
list.addAtMiddle(\"John\");
list.display();
list.addAtMiddle(\"Michael\");
list.display();
list.addAtMiddle(\"Peter\");
list.display();
list.addAtMiddle(\"Allison\");
list.display();
list.addFront(\"Daniel\");
list.display();
list.append(\"George\");
list.display();
list.addFront(\"Simon\");
list.display();
list.append(\"Jason\");
list.display();
list.addAtMiddle(\"Mark\");
list.display();
list.removeAtMiddle();
list.display();
list.removeFirst();
list.displ.
I need help implementing a Stack with this java programming assignme.pdf
I need help implementing a Stack with this java programming assignment:
Given a doubly linked list (code provided below) implement a Stack. You must use the doubly
link list class and utilize it as an object in your implementation of the stack.
A Stack is a Last in First Out (LiFO) structure which translates to the processes of outputting the
last element which was inputted in the collection. The Stack is based on the process of putting
things on top of one another and taking the item on top (think of a stack of papers).
Operations to implement:
push (E): Add an element to the start of the sequence
pop: Remove an element from the start of the sequence
Peek: Return the first element of the sequence without removing it
atIndex(x): Return the element at the given index (x) Or throw an exception if it is out of bound
(if you can control the user input then do that instead)
Size: Return the size of the Stack
isEmpty: Boolean, returns true if the Stack is empty
Empty: Empty the Stack
Code Part 1:
public class DoublyLinkedList{
private DNode head;
private DNode tail;
private int size;
public DoublyLinkedList(){ // construct an empty list
this.tail = new DNode (null, null, this.head);
this.head = new DNode (null, this.tail, null);
this.size = 0;
}
public DoublyLinkedList(DNode next){ // constructs a list
// out of a single node
this.tail = new DNode (null, null, next);
this.head = new DNode (null, next, null);
next.changeNext(this.tail);
next.changePrev(this.head);
this.size = 1;
}
public DoublyLinkedList(Object [] objectArray){ // construct a list out of
// an array
this.tail = new DNode (null, null, this.head);
this.head = new DNode (null, this.tail, null);
DNode temp = this.head;
for (Object e : objectArray)
{
//Anonomus function
new DNode (e, temp.getNext(),temp).insertBetweenNodes(temp, temp.getNext());
temp = temp.getNext();
this.size += 1;
}
}
public void addToFrontofList(Object toAdd){ // Appends the begining
// of the list
DNode temp = new DNode (toAdd, this.head.getNext(), this.head);
this.head.getNext().changePrev(temp);
this.head.changeNext(temp);
this.size += 1;
}
public void addToendofList (Object toAdd) // appends the end of the list
// with a node
{
DNode temp = new DNode (toAdd, this.tail, this.tail.getPrev());
this.tail.getPrev().changeNext(temp);
this.tail.changePrev(temp);
this.size += 1;
}
public void insertAfterNode(DNode current, Object input)// Inserts a new
// a new node after
// current node
{
current.insertAfterNode(input);
this.size += 1;
}
public int getSize() // returns the size of the list
{
return this.size;
}
public String toString()
{
String result = \"\";
for (DNode temp = this.head.getNext();
temp.hasNext(); temp = temp.getNext())
{
result += temp.getValue();
result += \" -> \";
}
result += \"End of list\";
return result;
}
}
and code part2:
public class DNode{
private Object e; // place holder for the type of object the
//collection is storing
private DNode next; // reference to the next node in the sequence
// of.
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();
}
}.
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.
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.
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.
This is to test a balanced tree. I need help testing an unbalanced t.pdf
this is business analytics question. (using gurobi) The days-off scheduling problem must be
solved routinely by businesses that operate 6 or 7 days a week. Examples include hospitals,
airlines, municipal transportation companies, and the postal service. The most common example
is the (5,7)-cyclic staffing problem. The objective of it is to minimize the cost of assigning
workers to a 7-day cyclic schedule so that 1) Sufficient workers are available every day. 2) Each
person works 5 consecutive days and is idle to the remaining 2 days. Here is the table showing
the cost of having an employee for each day and the number of employees required for each day.
For example, the pattern that one works from Sunday to Thursday costs 90+604=330. Formulate
and solve an integer programming problem to represent this problem. How many employees
work Monday-Friday?.
Sorted number list implementation with linked listsStep 1 Inspec.pdf
Sorted number list implementation with linked lists
Step 1: Inspect the Node.java file
Inspect the class declaration for a doubly-linked list node in Node.java. Access Node.java by
clicking on the orange arrow next to LabProgram.java at the top of the coding window. The
Node class has three fields:
a double data value,
a reference to the next node, and
a reference to the previous node.
Each field is protected. So code outside of the class must use the provided getter and setter
methods to get or set a field.
Node.java is read only, since no changes are required.
Step 2: Implement the insert() method
A class for a sorted, doubly-linked list is declared in SortedNumberList.java. Implement the
SortedNumberList class's insert() method. The method must create a new node with the
parameter value, then insert the node into the proper sorted position in the linked list. Ex:
Suppose a SortedNumberList's current list is 23 47.25 86, then insert(33.5) is called. A new
node with data value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's
sorted order and yielding: 23 35.5 47.25 86
Step 3: Test in develop mode
Code in main() takes a space-separated list of numbers and inserts each into a SortedNumberList.
The list is displayed after each insertion. Ex: If input is
then output is:
Try various program inputs, ensuring that each outputs a sorted list.
Step 4: Implement the remove() method
Implement the SortedNumberList class's remove() method. The method takes a parameter for the
number to be removed from the list. If the number does not exist in the list, the list is not
changed and false is returned. Otherwise, the first instance of the number is removed from the
list and true is returned.
Uncomment the commented-out part in main() that reads a second input line and removes
numbers from the list. Test in develop mode to ensure that insertion and removal both work
properly, then submit code for grading. Ex: If input is
then output is:
Given templates:
LabProgram.java
import java.util.Scanner;
import java.io.PrintWriter;
public class LabProgram {
// Prints the SortedNumberList's contents, in order from head to tail
public static void printList(SortedNumberList list) {
Node node = list.head;
while (null != node) {
System.out.print(node.getData() + " ");
node = node.getNext();
}
System.out.println();
}
public static void main(String[] args) {
Scanner scnr = new Scanner(System.in);
String inputLine;
// Read the line of input numbers
inputLine = scnr.nextLine();
// Split on space character
String[] terms = inputLine.split(" ");
// Insert each value and show the sorted list's contents after each insertion
SortedNumberList list = new SortedNumberList();
for (Object term : terms) {
double number = Double.parseDouble(term.toString());
System.out.println("List after inserting " + number + ": ");
list.insert(number);
printList(list);
}
/*
// Read the input line with numbers to remove
inputLine = scnr.nextLine();
terms = inputLine.split(" ".
Using visual studio 2022- a C# windows form application- and your Doub.pdf
Using visual studio 2022, a C# windows form application, and your DoubleLinkedClass and
DoubleLinkedNode classes from project 5, implement a DequeueClass, a StackClass, and a
QueueClass. Do not use any arrays, lists, dictionaries, or other built in data structures, only
instances of your linkedLists classes from project 5. The dequeue class needs to contain a
reference to an instance of your DoubleLinkedList class, with the QueueClass and StackClass
inheriting from the Dequeue class. Your Stack and Queue pop and push need to be one-line calls
to the Dequeue popLeft, pushLeft, popRight, pushRight. Do not copy the code from the dequeue
class to implement the Stack and Queue.
DoubleLinkedClasses From2263Project5
internal class DoubleLinkedList<T>
{
public DoubleLinkedListNode<T> firstNode = null;
public DoubleLinkedListNode<T> lastNode = null;
public DoubleLinkedListNode<T> currentNode = null;
public int nodeNumber = 0;
public DoubleLinkedList()
{
}
// creates first node in list with firstValue
public DoubleLinkedList(T firstValue)
{
firstNode = new DoubleLinkedListNode<T>(firstValue);
lastNode = firstNode;
currentNode = firstNode;
nodeNumber = 1;
}
public DoubleLinkedListNode<T> GetCurrentNode()
{
return currentNode;
}
public void InsertFirst(T value)
{
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
if (firstNode == null)
{
firstNode = newNode;
lastNode = firstNode;
currentNode = firstNode;
}
else
{
newNode.next = firstNode;
firstNode.previous = newNode;
firstNode = newNode;
currentNode = firstNode;
}
nodeNumber++;
}
public void InsertBeforeFirst(T value)
{
if (firstNode == null)
{
InsertFirst(value);
return;
}
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
newNode.next = firstNode;
firstNode.previous = newNode;
firstNode = newNode;
nodeNumber++;
}
public void InsertAfterLast(T value)
{
if (lastNode == null)
{
InsertFirst(value);
return;
}
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
lastNode.next = newNode;
newNode.previous = lastNode;
lastNode = newNode;
currentNode = lastNode;
nodeNumber++;
}
public void InsertAfterCurrent(T value)
{
if (currentNode == null)
{
InsertFirst(value);
return;
}
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
newNode.next = currentNode.next;
newNode.previous = currentNode;
if (currentNode.next != null)
{
currentNode.next.previous = newNode;
}
currentNode.next = newNode;
currentNode = newNode;
if (lastNode == currentNode.previous)
{
lastNode = currentNode;
}
nodeNumber++;
}
public int NumberOfNodesInList()
{
return nodeNumber;
}
public void DeleteFirst()
{
if (firstNode == null)
{
return;
}
if (firstNode.next == null)
{
firstNode = null;
lastNode = null;
currentNode = null;
}
else
{
firstNode = firstNode.next;
firstNode.previous = null;
currentNode = firstNode;
}
nodeNumber--;
}
public void DeleteLast()
{
if (lastNode == null)
{
return;
}
if (lastNode.previous == null)
{
firstNode = null;
lastNode = null;
currentNode = null.
JAVA OOP project; desperately need help asap im begging.Been stuck.pdf
JAVA OOP project; desperately need help asap im begging.
Been stuck on this for a week since my OOP skills are not good at all. Due in a couple hours so
im desperate. Codes needed will be provided at the end, thank you.
Codes:
DotChaser.java:
import java.util.*;
public class DotChaser {
public static Random rand = new Random(System.currentTimeMillis());
/**
* A "Thing" moves in a grid world. A TypeA Thing randomly
* decides to turn left or right (or not turn) every "round",
* and, afterward, takes a step forward. A TypeB Thing
* only considers making a random turn every 10th round.
*
* A STATIC CLASS? OH NO! GET IT OUT OF HERE!
*/
public static class Thing {
// dir: 0=North, 1=East, 2=South, 3=West.
// timeSinceLast: this is only important for "TypeB" Things.
public int row, col, dir, timeSinceLast;
public char lab = 'r';
public boolean isTypeB;
}
/**
* YOU'LL NEED TO PUT THIS SOMEWHERE ELSE
* HINT: WOULDN'T IT BE NICE TO HAVE A LIST OR QUEUE SO THAT
* WE DON'T HAVE TO USE NODES HERE?
* This class is for linked lists of Thing's
*/
public static class Node {
public Thing data;
public Node next;
}
// EEEEEK! STATIC METHODS!!! PLEASE FIND THEM A BETTER HOME.
public static void rightTurn(Thing t) {
t.dir = (t.dir + 1) % 4;
}
public static void leftTurn(Thing t) {
t.dir = (t.dir + 3) % 4;
}
public static void maybeTurn(Thing t) {
int i = rand.nextInt(3);
if (t.isTypeB) {
t.timeSinceLast++;
if (t.timeSinceLast == 10) {
t.timeSinceLast = 0;
if (i == 1) {
rightTurn(t);
}
if (i == 2) {
leftTurn(t);
}
}
} else {
if (i == 1) {
rightTurn(t);
}
if (i == 2) {
leftTurn(t);
}
}
}
public static void step(Thing t) {
final int[] dc = {
0, 1, 0, -1
}, dr = {
1, 0, -1, 0
};
t.row += dr[t.dir];
t.col += dc[t.dir];
}
/**
* This static method is ok :)
*/
public static void main(String[] args) {
int N = 200;
if( args.length != 0 )
N = Integer.parseInt(args[0]);
// INSTEAD OF A NODE, CREATE SOMETHING MORE USER-FRIENDLY.
Node L = null;
int count = 0;
while( true ) {
// Every N rounds, add another typeA and typeB Thing.
if( count % N == 0 ) {
// Add a typeA thing to the list.
// (GEE, THAT'S A LOT OF CODE FOR JUST CREATING ONE THING)
Thing tA = new Thing();
tA.row = 45;
tA.col = 50;
Node nA = new Node();
nA.data = tA;
nA.next = L;
L = nA;
// Add a typeB thing to the list
Thing tB = new Thing();
tB.row = 55;
tB.col = 50;
tB.lab = 'b';
tB.isTypeB = true;
Node nB = new Node();
nB.data = tB;
nB.next = L;
L = nB;
}
// Print out each thing.
// (SEEMS LIKE A NICE PRINTALL() METHOD CALL WOULD WORK HERE)
// (SEEMS LIKE A toString() METHOD IN THE CLASS WOULD ALSO BE NICE)
for( Node T = L; T != null; T = T.next )
System.out.println(T.data.row + " " + T.data.col + " " + T.data.lab);
System.out.println("done");
System.out.flush();
// Move each thing.
// (SEEMS LIKE A NICE MOVEALL() METHOD CALL WOULD WORK HERE)
for( Node T = L; T != null; T = T.next ) {
maybeTurn(T.data);
step(T.data);
}
count++;
}
}
}
Lab2_Tester.java
import org.junit.Test;
import static org.junit.Assert.assertEqual.
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 .
Having a problem figuring out where my errors are- The code is not run.pdf
Having a problem figuring out where my errors are. The code is not running how I need it to so I
added a few print statements to help me figure it out but to no avail. Any help would be greatly
appreciated.
import java.io.File;
import java.util.Scanner;
import java.io.FileWriter;
import java.io.IOException;
public class Main
{
public static void main(String[] args)
{
if(args.length != 1)
{
System.out.println("Usage: java Main <input_file>");
return;
}
String inputFileName = args[0];
PersonSet orderedSet = new PersonOrderedSet();
PersonSet imperialSet = new PersonImperialSet();
try(Scanner sc = new Scanner(new File(inputFileName)))
{
if(sc.hasNextLine() && sc.nextLine().startsWith("Name\tHeight (cm)\t\tWeight (kg)"))
{
while(sc.hasNextLine())
{
String line = sc.nextLine();
System.out.println("Line:" + line);
String[] parts = line.split("\t");
if(parts.length == 3)
{
String name = parts[0];
double height;
double weight;
try
{
height = Double.parseDouble(parts[1]);
weight = Double.parseDouble(parts[2]);
Person person = new Person(name, height, weight);
orderedSet.add(person);
imperialSet.add(person);
}
catch (NumberFormatException e)
{
// skip this line
}
}
}
}
}
catch (IOException e)
{
System.out.println("An error occurred while reading the file.");
e.printStackTrace();
return;
}
try(FileWriter writer = new FileWriter("hr_ordered_set_output.txt")) //write ordered set to file
{
writer.write("Name\tHeight (cm)\t\tHeight (kg)\n");
writer.write(orderedSet.toText());
}
catch(IOException e)
{
System.out.println("An error occured while writing the ordered set output file.");
e.printStackTrace();
return;
}
try(FileWriter writer = new FileWriter("hr_imperial_set_output.txt")) //write imperial set to file
{
writer.write("Name\tHeight (in)\t\tWeight (lb)\n");
writer.write(imperialSet.toText());
}
catch(IOException e)
{
System.out.println("An error occured while writing the imperial set output file.");
e.printStackTrace();
return;
}
// Output the ordered data and the imperial data to the screen/console, nicely formatted
System.out.println("Ordered data:");
System.out.println("Name Height (cm) Weight (kg)");
System.out.println("-------------------------------------------");
System.out.print(orderedSet.toString());
System.out.println("Imperial data:");
System.out.println("Name Height (in) Weight (lb)");
System.out.println("------------------------------------------");
System.out.print(imperialSet.toString());
}
}
import java.util.ArrayList;
public class Person implements Comparable<Person> //1
{
private String name;
private double height; //in centimeters
private double weight; // in kilagrams
public Person(String name, double height, double weight)//class that has constructors that
initialize name, height, and weight
{
this.name = name;
this.height = height;
this.weight = weight;
}
@Override
public String toString() //returns a string representation of the person's name, height, and weight
{
return String.format("%s\t%.1f\t\t%.1f", name, height, weight);
}
.
Intro to Java Programming 10th ed- Implement the inorder- preorder- po.docx
Intro to Java Programming 10th ed-
Implement the inorder, preorder , postorder method in BST using a stack. Write a test program that
prompts the user to enter 10 integers, stores them in a BST, and invokes the inorder method, preorder method, postorder method to display the elements.
inorder method to display the elements.
Solution
import static org.junit.Assert.assertEquals;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;
import org.junit.Test;
public class BST {
public TreeNode root = null;
public TreeNode get(int element){
if(root == null){
return null;
}
TreeNode runner = root;
while (true){
if(runner.data > element){
if(runner.leftNode == null){
return null;
}
runner = runner.leftNode;
} else if(runner.data < element) {
if(runner.rightNode == null){
return null;
}
runner = runner.rightNode;
} else {
return runner;
}
}
}
public void insert(int element){
if(root == null){
root = new TreeNode(element);
return;
}
TreeNode runner = root;
while (runner.data != element){
if(runner.data > element){
if(runner.leftNode == null){
runner.leftNode = new TreeNode(element);
return;
}
runner = runner.leftNode;
} else {
if(runner.rightNode == null){
runner.rightNode = new TreeNode(element);
return;
}
runner = runner.rightNode;
}
}
}
public static void postOrderTraversal(TreeNode root){
if(root == null){
return;
}
postOrderTraversal(root.leftNode);
postOrderTraversal(root.rightNode);
System.out.print(root.data + \" \");
}
public static void preOrderTraversal(TreeNode root){
if(root == null){
return;
}
System.out.print(root.data + \" \");
preOrderTraversal(root.leftNode);
preOrderTraversal(root.rightNode);
}
public static void inOrderTraversal(TreeNode root){
if(root == null){
return ;
}
inOrderTraversal(root.leftNode);
System.out.print(root.data + \" \");
inOrderTraversal(root.rightNode);
}
private class TreeNode {
public int data;
public TreeNode leftNode;
public TreeNode rightNode;
public boolean visited;
TreeNode(int data){
this.data = data;
}
}
public void basicTest(){
BST tree = new BST();
int[] data = {9, 5, 3, 1, 4, 8, 15, 11, 21, 20, 29};
for (int i : data){
tree.insert(i);
}
assertEquals(tree.get(3).data, 3);
}
}
.
Create your own Linked list from scratch (singly linked list).So.pdf
Consider four protons at rest at the corners of a square. The protons are bound together so they
cannot move. Then the bonds holding one of the protons break so that proton is free to move.
Determine that proton\'s acceleration (both direction and magnitude) at the instant after it is no
longer bound as well as its speed when it has moved far away. You know the proton\'s charge, its
mass, and the length of the sides of the square.
Solution
Here we need to note that the like charges repel each other, hence the proton will be pushed
away along the diagonal of the square.
We will assume that the mass of the proton is Mp and charge is q while the length of the side of
the square is a.
The net force due to the proton diagonally opposite would be along the diagonal, and also due to
the other two charges.
Hence the net force would be: 2kq22/a2 + kq2/2a2 = (kq2/a2)[22 + 1/2] along the diagonal.
The acceleration would be given as: Force / mass = (kq2/Mpa2)[22 + 1/2]
So as to determine the speed of the proton once it gets far away, we will use the prinicple of
conservation of energy. Hence the initial potential energy of the proton would be equal to its
final kinetic energy hence giving us the speed.
That is. 2kq2/a + kq2/a2 = (kq2/a)[2 + 1/2] = Mpv2/2
or, V = sqrt[(2kq2/Mpa)[2 + 1/2]] which is the required expression for the speed of the proton..
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.
Can someone help me to fix the code please package dlist i.pdf
Can someone help me to fix the code please?
package dlist;
import java.util.Iterator;
public class DList implements Iterable<String> {
private static class DListNode {
public String data;
public DListNode next;
public DListNode previous;
}
private DListNode nil;
private int size;
public DList() {
nil = new DListNode();
nil.previous = nil;
nil.next = nil;
nil.data = null;
size = 0;
}
public void addFirst(String elem) {
DListNode newNode = new DListNode();
newNode.data = elem;
newNode.next = nil.next;
newNode.previous = nil;
nil.next.previous = newNode;
nil.next = newNode;
size++;
}
public void addLast(String elem) {
DListNode newNode = new DListNode();
newNode.data = elem;
newNode.next = nil;
newNode.previous = nil.previous;
nil.previous.next = newNode;
nil.previous = newNode;
size++;
}
public String getFirst() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
return nil.next.data;
}
public String getLast() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
return nil.previous.data;
}
public String removeFirst() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
DListNode first = nil.next;
first.next.previous = nil;
nil.next = first.next;
size--;
return first.data;
}
public String removeLast() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
DListNode last = nil.previous;
last.previous.next = nil;
nil.previous = last.previous;
size--;
return last.data;
}
public String get(int index) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}
DListNode node = nil.next;
for (int i = 0; i < index; i++) {
node = node.next;
}
return node.data;
}
public String set(int index, String value) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}
DListNode node = nil.next;
for (int i = 0; i < index; i++) {
node = node.next;
}
String oldValue = node.data;
node.data = value;
return oldValue;
}
public boolean contains(Object obj) {
DListNode node = nil.next;
while (node != nil) {
if (node.data.equals(obj)) {
return true;
}
node = node.next;
}
return false;
}
public int size() {
return size;
}
public int indexOf(Object obj)
{
int index = 0;
DListNode node = nil.next;
while (node != nil)
{
if (node.data.equals(obj))
{
return index;
}
index++;
node = node.next;
}
return -1;
}
@Override
public Iterator<String> iterator()
{
return new DListIterator();
}
private class DListIterator implements Iterator<String>
{
private DListNode pointer;
public DListIterator()
{
if(nil.next==nil)
{
pointer = nil;
}
else
pointer=nil.next;
}
public boolean hasNext()
{
return pointer != nil;
}
}
}.
There are a couple of new methods that you will be writing for this pr.pdf
There are a couple of new methods that you will be writing for this project. Some are easy, some
are hard. I have provided code that tests most of the methods by calling them from the main
method in the file ListTest.java. The test file will only work when you have done all the
methods. In COMP182LinkedList.java I have provided the signature (definition and input
parameters) for these methods. At this point to make sure you can run the file
(COMP182LinkedList.java that you downloaded from Cavas) I have added template values as
return types of the methods. For example, if the method returns an int then I added return 0 as the
return value. Here are the methods are as follows: Anything getFixst () Anything getLast () void
add (Anything value) void addafter (1nt index, Anyehtng value) Anything set(int index,
Rnything aewvalue) void removeAl1 (Anything vaiue) lastIndex (Anything value)
COMP182IinkedIi ateAnything; elone boolean equala (object in) CoMP182IinkedList
KAnythang? gplat () boolean hascycle () Node reveraeliat () Node oddeventiat () Node
deleteDuplicates () boolean ispalindrome () "For the last two methods, you need to add proper
testing to ListTest Java Method Specifications Here are more details for implementing each of
these methods. You need to complete all the following methods in the COMP182LinkedList
class. You can write the methods in any order you wish, but I suggest you do them in the order
they are listed. In particular, make sure all your methods work for empty lists, lists of different
sizes, etc as you can see from the sample test cases provided in ListTest.java. While grading your
project, we will make changes to these values! Also, make sure that your solutions do not modify
the original lists (unless you are specifically instructed to do so). roid main(String[] args) You
can use this method in the ListTest class to create lists as needed and test each of the methods
listed above. I have provided a few test cases, but you may want to add more to some of the
method tests. Until you get add working, you will need to use addFirst to create lists to test your
other methods. Anything getFirsto This method returns the value stored in the first node an the
list. It should prit an error message and seturn null if the list is empty. Anything getLasto This
method returns the value stored in the last node in the list. It should print an error mesiage and
retuin noll if the list is emipty. void add(Anything value) Thus method adds a nade containing
new yalue to the end of the last. This method returns the value stored in the first node in the list.
It should print an error message and return null if the list is empty. Anything getLast0 This
method returns the value stored in the last node in the list. It should print an error message and
retum null if the list is empty: void add(Anything value) This method adds a node containing
new value to the end of the list. void addAfter(int index, Anything value) This method adds a
node contai.
I need help finishing this code in JavaYou will need to create t.pdf
I need help finishing this code in Java
You will need to create the preOrder and postOrder traversal methods, as these will be used to
determine if your insertion methods are correct.
protected class Node {
public int data;
public Node left, right, parent;
public Node(int _data) {
data = _data;
left = right = parent = null;
}
public Node(int _data, Node _parent) {
data = _data;
left = right = null;
parent = _parent;
}
}
protected Node root;
public BST() {
root = null;
}
public void insert(int data) {
if (root == null) {
root = new Node(data);
} else {
insert(data, root);
}
}
protected void insert(int data, Node n) {
// TODO: Insert Method
}
public ArrayList inOrderTraversal() {
return inOrderTraversal(root);
}
private ArrayList inOrderTraversal(Node n) {
if (n == null) {
return new ArrayList<>();
}
ArrayList traversal = new ArrayList<>();
traversal.addAll(inOrderTraversal(n.left));
traversal.add(n.data);
traversal.addAll(inOrderTraversal(n.right));
return traversal;
}
public ArrayList preOrderTraversal() {
return preOrderTraversal(root);
}
private ArrayList preOrderTraversal(Node n) {
// TODO: preOrderTraveral Method
return new ArrayList();
}
public ArrayList postOrderTraversal() {
return postOrderTraversal(root);
}
private ArrayList postOrderTraversal(Node n) {
// TODO: postOrderTraversal Method
return new ArrayList();
}
protected static int height(Node n) {
if (n == null) {
return -1;
}
int lheight = height(n.left);
int rheight = height(n.right);
if (lheight > rheight) {
return 1 + lheight;
}
return 1 + rheight;
}
public int height() {
return height(root);
}
} BST Insertion protected void insert(int data, Node n ) if data < n.data if n. left is null n.left =
new Node(data, n ) else insert(data, n.left) else if data > n.data if n.right is null n.right = new
Node(data, n) else insert(data, n.right)
BST Traversals You are responsible for implementing the and postOrderTraversal(Node n )
methods that generate the string representation of the tree using the specified traversal. The
inorderTraversal (Node n ) method has been implemented for you; use that to match the
formatting of the output strings (this is the most "output matching" you will have to do this
semester)..
NumberList.java (implements the linked list)public class NumberLis.pdf
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.
This is a homework assignment that has to be done in JAVA.Objectiv.pdf
This is a homework assignment that has to be done in JAVA.
Objective:
Write a class Called GenDoubleLinkedList which is a generic double linked list. This link list is
similar to the single linked list that was shown in class except that each node in addition to
having data and nextLink (which was originally called link) now has prevLink.
The class GenDoubleLinkedList needs to have the following:
-Internal class ListNode which has:
- Instance Variables:
- data of type T
- nextLink of type ListNode
- prevLink of type ListNode
- Constructors:
- Default
- Parameterized
Instance Variables:
- head of type ListNode which always points to the beginning of the linked list
- current of type ListNode which moves around pointing to one of the nodes
Constructor:
- A default constructor that initializes head to an empty ListNode and sets current to point at the
head.
Methods:
- goToNext – This moves the current node forward in the list by one node. It doesn’t move
forward if that node is null
- goToPrev – This moves the current node backwards in the list by one node. It doesn’t move
backwards if that node is null.
- getDataAtCurrent – returns the data at the current node as long as the current isn’t null
- setDataAtCurrent – takes in a parameter and sets the data at the current node to that value as
long as current is not null
- insertNodeAfterCurrent – creates a new node based on data that is passed in by a parameter and
puts that node after the current position
- deleteCurrentNode – removes the current node from the list by resetting the links
- showList – prints out the contents of the list line-by-line
- inList – returns a true or false value based on whether or not the data passed in via a parameter
is in the list
Insert Node After Current
Delete Current Node Head Current
Solution
Hi, Please find my implementation.
Please let me know in case of any issue.
public class GenDoubleLinkedList> {
private class ListNode{
T data;
ListNode nextLink;
ListNode prevLink;
public ListNode(T data) {
this.data = data;
nextLink = null;
prevLink = null;
}
}
// instance variables
private ListNode head;
private ListNode current;
public GenDoubleLinkedList() {
head = new ListNode(null);
current = head;
}
public void goToNext(){
if(current != null && (current == head && head.nextLink != null))
current = current.nextLink;
else if(current != null && current != head)
current = current.nextLink;
}
public void goToPrev(){
if(current != null && current != head)
current = current.prevLink;
}
public T getDataAtCurrent(){
if(current == null || current == head)
return null;
return current.data;
}
public void setDataAtCurrent(T data){
if(current != null && current != head){
current.data = data;
}
}
public void insertNodeAfterCurrent(T data){
if(current == null)
return;
ListNode newNode = new ListNode(data);
newNode.nextLink = current.nextLink;
if(current.nextLink != null)
current.nextLink.prevLink = newNode;
current.nextLink = newNode;
newNode.prevLink = current;
}
public void delet.
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.
JAVA A double-ended queue is a list that allows the addition and.pdf
**JAVA** A double-ended queue is a list that allows the addition and removal of items from
either end. One end is arbitrarily called the front and other the rear, but the two ends behave
identically. Specify, design and implement a class for a double-ended queue. Include operations
to check if it is empty and to return the number of items in the list. For each end, include
operations for adding and deleting items. Use doubly linked list for your implementation. Call
your class Deque (pronounced \"deck\").
Solution
//package com.java2novice.ds.queue;
public class DequeDblLinkedListImpl {
private LinkedNode front;
private LinkedNode rear;
public void insertFront(T item){
//add element at the beginning of the queue
System.out.println(\"adding at front: \"+item);
LinkedNode nd = new LinkedNode();
nd.setValue(item);
nd.setNext(front);
if(front != null) front.setPrev(nd);
if(front == null) rear = nd;
front = nd;
}
public void insertRear(T item){
//add element at the end of the queue
System.out.println(\"adding at rear: \"+item);
LinkedNode nd = new LinkedNode();
nd.setValue(item);
nd.setPrev(rear);
if(rear != null) rear.setNext(nd);
if(rear == null) front = nd;
rear = nd;
}
public void removeFront(){
if(front == null){
System.out.println(\"Deque underflow!! unable to remove.\");
return;
}
//remove an item from the beginning of the queue
LinkedNode tmpFront = front.getNext();
if(tmpFront != null) tmpFront.setPrev(null);
if(tmpFront == null) rear = null;
System.out.println(\"removed from front: \"+front.getValue());
front = tmpFront;
}
public int size(){
if(front == null && rear ==null){
return 0;
}
//remove an item from the beginning of the queue
LinkedNode tmpFront = front;
LinkedNode tmpRear = rear;
int i=0;
while(tmpFront != rear)
{
i++;
tmpFront=tmpFront.getNext();
}
i++;
return i;
}
public void removeRear(){
if(rear == null){
System.out.println(\"Deque underflow!! unable to remove.\");
return;
}
//remove an item from the beginning of the queue
LinkedNode tmpRear = rear.getPrev();
if(tmpRear != null) tmpRear.setNext(null);
if(tmpRear == null) front = null;
System.out.println(\"removed from rear: \"+rear.getValue());
rear = tmpRear;
}
public static void main(String a[]){
DequeDblLinkedListImpl deque = new DequeDblLinkedListImpl();
deque.insertFront(34);
deque.insertFront(67);
System.out.println(\"Size of the queue : \"+deque.size());
deque.insertFront(29);
deque.insertFront(765);
deque.removeFront();
deque.removeFront();
deque.removeFront();
deque.insertRear(43);
deque.insertRear(83);
deque.insertRear(84);
deque.insertRear(546);
deque.insertRear(356);
deque.removeRear();
deque.removeRear();
deque.removeRear();
deque.removeRear();
deque.removeFront();
deque.removeFront();
deque.removeFront();
}
}
class LinkedNode{
private LinkedNode prev;
private LinkedNode next;
private T value;
public LinkedNode getPrev() {
return prev;
}
public void setPrev(LinkedNode prev) {
this.prev = prev;
}
public LinkedNode getNext() {
return next;
}
public void setNext(L.
Need Help with this Java Assignment. Program should be done in JAVA .pdf
Need Help with this Java Assignment. Program should be done in JAVA please
Complete required scripts based on eclipse and troubleshoot the scripts until the tasks are done.
1. Implement a binary search tree (write the code for it), for a height of 2 or higher. Please show
the output if you can Thank you in advance!
Solution
I have compiled this code and checked for errors, worked fine.
Also after the code I have pasted the Output transcript to show what User Inputs I gave and what
all outputs I got.
// Java Program to Implement Binary Tree
import java.util.Scanner;
/* Define Class BinaryTreeNode */
class BinaryTreeNode
{
BinaryTreeNode left, right;
int data;
/* Constructor */
public BinaryTreeNode()
{
left = null;
right = null;
data = 0;
}
/* Constructor */
public BinaryTreeNode(int n)
{
left = null;
right = null;
data = n;
}
/* Function to set left node */
public void setLeft(BinaryTreeNode n)
{
left = n;
}
/* Function to set right node */
public void setRight(BinaryTreeNode n)
{
right = n;
}
/* Function to get left node */
public BinaryTreeNode getLeft()
{
return left;
}
/* Function to get right node */
public BinaryTreeNode getRight()
{
return right;
}
/* Function to set data to node */
public void setData(int d)
{
data = d;
}
/* Function to get data from node */
public int getData()
{
return data;
}
}
/* Define anothe Class Operations to perform required operationns on Binary Tree*/
class Operations
{
private BinaryTreeNode root;
/* Constructor */
public Operations()
{
root = null;
}
/* Function to check if tree is empty */
public boolean isEmpty()
{
return root == null;
}
/* Functions to insert data */
public void insert(int data)
{
root = insert(root, data);
}
/* Function to insert data recursively */
private BinaryTreeNode insert(BinaryTreeNode node, int data)
{
if (node == null)
node = new BinaryTreeNode(data);
else
{
if (node.getRight() == null)
node.right = insert(node.right, data);
else
node.left = insert(node.left, data);
}
return node;
}
/* Function to count number of nodes */
public int countNodes()
{
return countNodes(root);
}
/* Function to count number of nodes recursively */
private int countNodes(BinaryTreeNode r)
{
if (r == null)
return 0;
else
{
int l = 1;
l += countNodes(r.getLeft());
l += countNodes(r.getRight());
return l;
}
}
/* Function to search for an element */
public boolean search(int val)
{
return search(root, val);
}
/* Function to search for an element recursively */
private boolean search(BinaryTreeNode r, int val)
{
if (r.getData() == val)
return true;
if (r.getLeft() != null)
if (search(r.getLeft(), val))
return true;
if (r.getRight() != null)
if (search(r.getRight(), val))
return true;
return false;
}
/* Function for inorder traversal */
public void inorder()
{
inorder(root);
}
private void inorder(BinaryTreeNode r)
{
if (r != null)
{
inorder(r.getLeft());
System.out.print(r.getData() +\" \");
inorder(r.getRight());
}
}
/* Function for preorder traversal */
public void preorder()
{
preorder(root);
}
priva.
Help please!!(Include your modified DList.java source code file in.pdf
Help please!!
(Include your modified DList.java source code file in your homework solution zip archive)
Using
whatever Java IDE you prefer, create a project and add DList.java and DListTest.java to it (these
files are provided
in the Week 6 Source zip archive). Modify DList to implement a method that removes all
occurrences of a specific
integer from the list. Here is the pseudocode:
Method removeAll(In: Integer pData) Returns Nothing
Define index variable i and initialize i to 0
While i < the size of this Dlist Do
If get(i) equals pData Then
remove(i)
Else
Increment i
End If
End While
End Method removeAll
Next, modify DListTest() to add test case 21 which tests that removeAll() works correctly.
WHat more do i need to provide to get help on this???
Solution
/* DListNode.java */
/**
* A DListNode is a node in a DList (doubly-linked list).
*/
class DListNode {
/**
* item references the item stored in the current node.
* prev references the previous node in the DList.
* next references the next node in the DList.
*
* DO NOT CHANGE THE FOLLOWING FIELD DECLARATIONS.
*/
public Object item;
protected DListNode prev;
protected DListNode next;
/**
* DListNode() constructor.
* @param i the item to store in the node.
* @param p the node previous to this node.
* @param n the node following this node.
*/
DListNode(Object i, DListNode p, DListNode n) {
item = i;
prev = p;
next = n;
}
}
/* DList.java */
/**
* A DList is a mutable doubly-linked list ADT. Its implementation is
* circularly-linked and employs a sentinel (dummy) node at the head
* of the list.
*
* DO NOT CHANGE ANY METHOD PROTOTYPES IN THIS FILE.
*/
class DList {
/**
* head references the sentinel node.
* size is the number of items in the list. (The sentinel node does not
* store an item.)
*
* DO NOT CHANGE THE FOLLOWING FIELD DECLARATIONS.
*/
protected DListNode head;
protected int size;
/* DList invariants:
* 1) head != null.
* 2) For any DListNode x in a DList, x.next != null.
* 3) For any DListNode x in a DList, x.prev != null.
* 4) For any DListNode x in a DList, if x.next == y, then y.prev == x.
* 5) For any DListNode x in a DList, if x.prev == y, then y.next == x.
* 6) size is the number of DListNodes, NOT COUNTING the sentinel,
* that can be accessed from the sentinel (head) by a sequence of
* \"next\" references.
*/
/**
* newNode() calls the DListNode constructor. Use this class to allocate
* new DListNodes rather than calling the DListNode constructor directly.
* That way, only this method needs to be overridden if a subclass of DList
* wants to use a different kind of node.
* @param item the item to store in the node.
* @param prev the node previous to this node.
* @param next the node following this node.
*/
protected DListNode newNode(Object item, DListNode prev, DListNode next) {
return new DListNode(item, prev, next);
}
/**
* DList() constructor for an empty DList.
*/
public DList() {
// Your solution here.
head = newNode(null, head, head);
head.prev = head;
head.next = head;
si.
How do I fix it in LinkedList.javaLabProgram.javaLinkedList.jav.pdf
How do I fix it in LinkedList.java?
LabProgram.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 NoS.
Hi, I need help with a java programming project. specifically practi.pdf
Given 8 distinct integers from the set {1, 2, . . . , 16}, prove that there exists k such that ai aj = k
has at least 3 distinct solutions (ai , aj ) ?
Solution
For any k (unless the K is zero), at least 3 distinct solutions need not be existing.
Let\'s look at the next most favourable case
If k= 2;
We have to consider the case where the number of solutions of ai-aj=2 are minimum since we
have to show that at least 3 distinct solutions exist (which means even in the most unfavourable
case for a chosen k there will be 3 distinct solutions satisfying the equation ai-aj=2)
If k = 2; we start by taking numbers that are not at all 2 units apart from each other;
So we start with 1 and move 3 units successively ahead
1, 4, 7, 10,13, 16; Now we notice that these 6 numbers are of 3k+1 form; remaining numbers
can be any 2 ranomdly selected say 2 and 11; we get 4-2 = 2 and 13-11=2; Hence only 2 distinct
solutions are possible..
Find the sum of the infinite geometric series if it exists. (If an .pdf
Find the general solution to the following differential equation. d^2y/dx^2 - 2 dy/dx - 35 y = 1 +
13sin x - e^3x.
Solution
Ans-
A differential equation is a mathematical equation that relates some function with its derivatives.
In applications, the functions usually represent physical quantities, the derivatives represent their
rates of change, and the equation defines a relationship between the two. Because such relations
are extremely common, differential equations play a prominent role in many disciplines
including engineering, physics, economics, and biology.
In pure mathematics, differential equations are studied from several different perspectives,
mostly concerned with their solutions—the set of functions that satisfy the equation. Only the
simplest differential equations are solvable by explicit formulas; however, some properties of
solutions of a given differential equation may be determined without finding their exact form.
If a self-contained formula for the solution is not available, the solution may be numerically
approximated using computers. The theory of dynamical systems puts emphasis on qualitative
analysis of systems described by differential equations, while manynumerical methods have been
developed to determine solutions with a given degree of accuracy..
More Related Content
Similar to I am failing a few tests with my Double Linked List program. Can som.pdf
Sorted number list implementation with linked listsStep 1 Inspec.pdf
Sorted number list implementation with linked lists
Step 1: Inspect the Node.java file
Inspect the class declaration for a doubly-linked list node in Node.java. Access Node.java by
clicking on the orange arrow next to LabProgram.java at the top of the coding window. The
Node class has three fields:
a double data value,
a reference to the next node, and
a reference to the previous node.
Each field is protected. So code outside of the class must use the provided getter and setter
methods to get or set a field.
Node.java is read only, since no changes are required.
Step 2: Implement the insert() method
A class for a sorted, doubly-linked list is declared in SortedNumberList.java. Implement the
SortedNumberList class's insert() method. The method must create a new node with the
parameter value, then insert the node into the proper sorted position in the linked list. Ex:
Suppose a SortedNumberList's current list is 23 47.25 86, then insert(33.5) is called. A new
node with data value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's
sorted order and yielding: 23 35.5 47.25 86
Step 3: Test in develop mode
Code in main() takes a space-separated list of numbers and inserts each into a SortedNumberList.
The list is displayed after each insertion. Ex: If input is
then output is:
Try various program inputs, ensuring that each outputs a sorted list.
Step 4: Implement the remove() method
Implement the SortedNumberList class's remove() method. The method takes a parameter for the
number to be removed from the list. If the number does not exist in the list, the list is not
changed and false is returned. Otherwise, the first instance of the number is removed from the
list and true is returned.
Uncomment the commented-out part in main() that reads a second input line and removes
numbers from the list. Test in develop mode to ensure that insertion and removal both work
properly, then submit code for grading. Ex: If input is
then output is:
Given templates:
LabProgram.java
import java.util.Scanner;
import java.io.PrintWriter;
public class LabProgram {
// Prints the SortedNumberList's contents, in order from head to tail
public static void printList(SortedNumberList list) {
Node node = list.head;
while (null != node) {
System.out.print(node.getData() + " ");
node = node.getNext();
}
System.out.println();
}
public static void main(String[] args) {
Scanner scnr = new Scanner(System.in);
String inputLine;
// Read the line of input numbers
inputLine = scnr.nextLine();
// Split on space character
String[] terms = inputLine.split(" ");
// Insert each value and show the sorted list's contents after each insertion
SortedNumberList list = new SortedNumberList();
for (Object term : terms) {
double number = Double.parseDouble(term.toString());
System.out.println("List after inserting " + number + ": ");
list.insert(number);
printList(list);
}
/*
// Read the input line with numbers to remove
inputLine = scnr.nextLine();
terms = inputLine.split(" ".
Using visual studio 2022- a C# windows form application- and your Doub.pdf
Using visual studio 2022, a C# windows form application, and your DoubleLinkedClass and
DoubleLinkedNode classes from project 5, implement a DequeueClass, a StackClass, and a
QueueClass. Do not use any arrays, lists, dictionaries, or other built in data structures, only
instances of your linkedLists classes from project 5. The dequeue class needs to contain a
reference to an instance of your DoubleLinkedList class, with the QueueClass and StackClass
inheriting from the Dequeue class. Your Stack and Queue pop and push need to be one-line calls
to the Dequeue popLeft, pushLeft, popRight, pushRight. Do not copy the code from the dequeue
class to implement the Stack and Queue.
DoubleLinkedClasses From2263Project5
internal class DoubleLinkedList<T>
{
public DoubleLinkedListNode<T> firstNode = null;
public DoubleLinkedListNode<T> lastNode = null;
public DoubleLinkedListNode<T> currentNode = null;
public int nodeNumber = 0;
public DoubleLinkedList()
{
}
// creates first node in list with firstValue
public DoubleLinkedList(T firstValue)
{
firstNode = new DoubleLinkedListNode<T>(firstValue);
lastNode = firstNode;
currentNode = firstNode;
nodeNumber = 1;
}
public DoubleLinkedListNode<T> GetCurrentNode()
{
return currentNode;
}
public void InsertFirst(T value)
{
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
if (firstNode == null)
{
firstNode = newNode;
lastNode = firstNode;
currentNode = firstNode;
}
else
{
newNode.next = firstNode;
firstNode.previous = newNode;
firstNode = newNode;
currentNode = firstNode;
}
nodeNumber++;
}
public void InsertBeforeFirst(T value)
{
if (firstNode == null)
{
InsertFirst(value);
return;
}
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
newNode.next = firstNode;
firstNode.previous = newNode;
firstNode = newNode;
nodeNumber++;
}
public void InsertAfterLast(T value)
{
if (lastNode == null)
{
InsertFirst(value);
return;
}
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
lastNode.next = newNode;
newNode.previous = lastNode;
lastNode = newNode;
currentNode = lastNode;
nodeNumber++;
}
public void InsertAfterCurrent(T value)
{
if (currentNode == null)
{
InsertFirst(value);
return;
}
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
newNode.next = currentNode.next;
newNode.previous = currentNode;
if (currentNode.next != null)
{
currentNode.next.previous = newNode;
}
currentNode.next = newNode;
currentNode = newNode;
if (lastNode == currentNode.previous)
{
lastNode = currentNode;
}
nodeNumber++;
}
public int NumberOfNodesInList()
{
return nodeNumber;
}
public void DeleteFirst()
{
if (firstNode == null)
{
return;
}
if (firstNode.next == null)
{
firstNode = null;
lastNode = null;
currentNode = null;
}
else
{
firstNode = firstNode.next;
firstNode.previous = null;
currentNode = firstNode;
}
nodeNumber--;
}
public void DeleteLast()
{
if (lastNode == null)
{
return;
}
if (lastNode.previous == null)
{
firstNode = null;
lastNode = null;
currentNode = null.
JAVA OOP project; desperately need help asap im begging.Been stuck.pdf
JAVA OOP project; desperately need help asap im begging.
Been stuck on this for a week since my OOP skills are not good at all. Due in a couple hours so
im desperate. Codes needed will be provided at the end, thank you.
Codes:
DotChaser.java:
import java.util.*;
public class DotChaser {
public static Random rand = new Random(System.currentTimeMillis());
/**
* A "Thing" moves in a grid world. A TypeA Thing randomly
* decides to turn left or right (or not turn) every "round",
* and, afterward, takes a step forward. A TypeB Thing
* only considers making a random turn every 10th round.
*
* A STATIC CLASS? OH NO! GET IT OUT OF HERE!
*/
public static class Thing {
// dir: 0=North, 1=East, 2=South, 3=West.
// timeSinceLast: this is only important for "TypeB" Things.
public int row, col, dir, timeSinceLast;
public char lab = 'r';
public boolean isTypeB;
}
/**
* YOU'LL NEED TO PUT THIS SOMEWHERE ELSE
* HINT: WOULDN'T IT BE NICE TO HAVE A LIST OR QUEUE SO THAT
* WE DON'T HAVE TO USE NODES HERE?
* This class is for linked lists of Thing's
*/
public static class Node {
public Thing data;
public Node next;
}
// EEEEEK! STATIC METHODS!!! PLEASE FIND THEM A BETTER HOME.
public static void rightTurn(Thing t) {
t.dir = (t.dir + 1) % 4;
}
public static void leftTurn(Thing t) {
t.dir = (t.dir + 3) % 4;
}
public static void maybeTurn(Thing t) {
int i = rand.nextInt(3);
if (t.isTypeB) {
t.timeSinceLast++;
if (t.timeSinceLast == 10) {
t.timeSinceLast = 0;
if (i == 1) {
rightTurn(t);
}
if (i == 2) {
leftTurn(t);
}
}
} else {
if (i == 1) {
rightTurn(t);
}
if (i == 2) {
leftTurn(t);
}
}
}
public static void step(Thing t) {
final int[] dc = {
0, 1, 0, -1
}, dr = {
1, 0, -1, 0
};
t.row += dr[t.dir];
t.col += dc[t.dir];
}
/**
* This static method is ok :)
*/
public static void main(String[] args) {
int N = 200;
if( args.length != 0 )
N = Integer.parseInt(args[0]);
// INSTEAD OF A NODE, CREATE SOMETHING MORE USER-FRIENDLY.
Node L = null;
int count = 0;
while( true ) {
// Every N rounds, add another typeA and typeB Thing.
if( count % N == 0 ) {
// Add a typeA thing to the list.
// (GEE, THAT'S A LOT OF CODE FOR JUST CREATING ONE THING)
Thing tA = new Thing();
tA.row = 45;
tA.col = 50;
Node nA = new Node();
nA.data = tA;
nA.next = L;
L = nA;
// Add a typeB thing to the list
Thing tB = new Thing();
tB.row = 55;
tB.col = 50;
tB.lab = 'b';
tB.isTypeB = true;
Node nB = new Node();
nB.data = tB;
nB.next = L;
L = nB;
}
// Print out each thing.
// (SEEMS LIKE A NICE PRINTALL() METHOD CALL WOULD WORK HERE)
// (SEEMS LIKE A toString() METHOD IN THE CLASS WOULD ALSO BE NICE)
for( Node T = L; T != null; T = T.next )
System.out.println(T.data.row + " " + T.data.col + " " + T.data.lab);
System.out.println("done");
System.out.flush();
// Move each thing.
// (SEEMS LIKE A NICE MOVEALL() METHOD CALL WOULD WORK HERE)
for( Node T = L; T != null; T = T.next ) {
maybeTurn(T.data);
step(T.data);
}
count++;
}
}
}
Lab2_Tester.java
import org.junit.Test;
import static org.junit.Assert.assertEqual.
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 .
Having a problem figuring out where my errors are- The code is not run.pdf
Having a problem figuring out where my errors are. The code is not running how I need it to so I
added a few print statements to help me figure it out but to no avail. Any help would be greatly
appreciated.
import java.io.File;
import java.util.Scanner;
import java.io.FileWriter;
import java.io.IOException;
public class Main
{
public static void main(String[] args)
{
if(args.length != 1)
{
System.out.println("Usage: java Main <input_file>");
return;
}
String inputFileName = args[0];
PersonSet orderedSet = new PersonOrderedSet();
PersonSet imperialSet = new PersonImperialSet();
try(Scanner sc = new Scanner(new File(inputFileName)))
{
if(sc.hasNextLine() && sc.nextLine().startsWith("Name\tHeight (cm)\t\tWeight (kg)"))
{
while(sc.hasNextLine())
{
String line = sc.nextLine();
System.out.println("Line:" + line);
String[] parts = line.split("\t");
if(parts.length == 3)
{
String name = parts[0];
double height;
double weight;
try
{
height = Double.parseDouble(parts[1]);
weight = Double.parseDouble(parts[2]);
Person person = new Person(name, height, weight);
orderedSet.add(person);
imperialSet.add(person);
}
catch (NumberFormatException e)
{
// skip this line
}
}
}
}
}
catch (IOException e)
{
System.out.println("An error occurred while reading the file.");
e.printStackTrace();
return;
}
try(FileWriter writer = new FileWriter("hr_ordered_set_output.txt")) //write ordered set to file
{
writer.write("Name\tHeight (cm)\t\tHeight (kg)\n");
writer.write(orderedSet.toText());
}
catch(IOException e)
{
System.out.println("An error occured while writing the ordered set output file.");
e.printStackTrace();
return;
}
try(FileWriter writer = new FileWriter("hr_imperial_set_output.txt")) //write imperial set to file
{
writer.write("Name\tHeight (in)\t\tWeight (lb)\n");
writer.write(imperialSet.toText());
}
catch(IOException e)
{
System.out.println("An error occured while writing the imperial set output file.");
e.printStackTrace();
return;
}
// Output the ordered data and the imperial data to the screen/console, nicely formatted
System.out.println("Ordered data:");
System.out.println("Name Height (cm) Weight (kg)");
System.out.println("-------------------------------------------");
System.out.print(orderedSet.toString());
System.out.println("Imperial data:");
System.out.println("Name Height (in) Weight (lb)");
System.out.println("------------------------------------------");
System.out.print(imperialSet.toString());
}
}
import java.util.ArrayList;
public class Person implements Comparable<Person> //1
{
private String name;
private double height; //in centimeters
private double weight; // in kilagrams
public Person(String name, double height, double weight)//class that has constructors that
initialize name, height, and weight
{
this.name = name;
this.height = height;
this.weight = weight;
}
@Override
public String toString() //returns a string representation of the person's name, height, and weight
{
return String.format("%s\t%.1f\t\t%.1f", name, height, weight);
}
.
Intro to Java Programming 10th ed- Implement the inorder- preorder- po.docx
Intro to Java Programming 10th ed-
Implement the inorder, preorder , postorder method in BST using a stack. Write a test program that
prompts the user to enter 10 integers, stores them in a BST, and invokes the inorder method, preorder method, postorder method to display the elements.
inorder method to display the elements.
Solution
import static org.junit.Assert.assertEquals;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;
import org.junit.Test;
public class BST {
public TreeNode root = null;
public TreeNode get(int element){
if(root == null){
return null;
}
TreeNode runner = root;
while (true){
if(runner.data > element){
if(runner.leftNode == null){
return null;
}
runner = runner.leftNode;
} else if(runner.data < element) {
if(runner.rightNode == null){
return null;
}
runner = runner.rightNode;
} else {
return runner;
}
}
}
public void insert(int element){
if(root == null){
root = new TreeNode(element);
return;
}
TreeNode runner = root;
while (runner.data != element){
if(runner.data > element){
if(runner.leftNode == null){
runner.leftNode = new TreeNode(element);
return;
}
runner = runner.leftNode;
} else {
if(runner.rightNode == null){
runner.rightNode = new TreeNode(element);
return;
}
runner = runner.rightNode;
}
}
}
public static void postOrderTraversal(TreeNode root){
if(root == null){
return;
}
postOrderTraversal(root.leftNode);
postOrderTraversal(root.rightNode);
System.out.print(root.data + \" \");
}
public static void preOrderTraversal(TreeNode root){
if(root == null){
return;
}
System.out.print(root.data + \" \");
preOrderTraversal(root.leftNode);
preOrderTraversal(root.rightNode);
}
public static void inOrderTraversal(TreeNode root){
if(root == null){
return ;
}
inOrderTraversal(root.leftNode);
System.out.print(root.data + \" \");
inOrderTraversal(root.rightNode);
}
private class TreeNode {
public int data;
public TreeNode leftNode;
public TreeNode rightNode;
public boolean visited;
TreeNode(int data){
this.data = data;
}
}
public void basicTest(){
BST tree = new BST();
int[] data = {9, 5, 3, 1, 4, 8, 15, 11, 21, 20, 29};
for (int i : data){
tree.insert(i);
}
assertEquals(tree.get(3).data, 3);
}
}
.
Create your own Linked list from scratch (singly linked list).So.pdf
Consider four protons at rest at the corners of a square. The protons are bound together so they
cannot move. Then the bonds holding one of the protons break so that proton is free to move.
Determine that proton\'s acceleration (both direction and magnitude) at the instant after it is no
longer bound as well as its speed when it has moved far away. You know the proton\'s charge, its
mass, and the length of the sides of the square.
Solution
Here we need to note that the like charges repel each other, hence the proton will be pushed
away along the diagonal of the square.
We will assume that the mass of the proton is Mp and charge is q while the length of the side of
the square is a.
The net force due to the proton diagonally opposite would be along the diagonal, and also due to
the other two charges.
Hence the net force would be: 2kq22/a2 + kq2/2a2 = (kq2/a2)[22 + 1/2] along the diagonal.
The acceleration would be given as: Force / mass = (kq2/Mpa2)[22 + 1/2]
So as to determine the speed of the proton once it gets far away, we will use the prinicple of
conservation of energy. Hence the initial potential energy of the proton would be equal to its
final kinetic energy hence giving us the speed.
That is. 2kq2/a + kq2/a2 = (kq2/a)[2 + 1/2] = Mpv2/2
or, V = sqrt[(2kq2/Mpa)[2 + 1/2]] which is the required expression for the speed of the proton..
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.
Can someone help me to fix the code please package dlist i.pdf
Can someone help me to fix the code please?
package dlist;
import java.util.Iterator;
public class DList implements Iterable<String> {
private static class DListNode {
public String data;
public DListNode next;
public DListNode previous;
}
private DListNode nil;
private int size;
public DList() {
nil = new DListNode();
nil.previous = nil;
nil.next = nil;
nil.data = null;
size = 0;
}
public void addFirst(String elem) {
DListNode newNode = new DListNode();
newNode.data = elem;
newNode.next = nil.next;
newNode.previous = nil;
nil.next.previous = newNode;
nil.next = newNode;
size++;
}
public void addLast(String elem) {
DListNode newNode = new DListNode();
newNode.data = elem;
newNode.next = nil;
newNode.previous = nil.previous;
nil.previous.next = newNode;
nil.previous = newNode;
size++;
}
public String getFirst() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
return nil.next.data;
}
public String getLast() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
return nil.previous.data;
}
public String removeFirst() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
DListNode first = nil.next;
first.next.previous = nil;
nil.next = first.next;
size--;
return first.data;
}
public String removeLast() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
DListNode last = nil.previous;
last.previous.next = nil;
nil.previous = last.previous;
size--;
return last.data;
}
public String get(int index) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}
DListNode node = nil.next;
for (int i = 0; i < index; i++) {
node = node.next;
}
return node.data;
}
public String set(int index, String value) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}
DListNode node = nil.next;
for (int i = 0; i < index; i++) {
node = node.next;
}
String oldValue = node.data;
node.data = value;
return oldValue;
}
public boolean contains(Object obj) {
DListNode node = nil.next;
while (node != nil) {
if (node.data.equals(obj)) {
return true;
}
node = node.next;
}
return false;
}
public int size() {
return size;
}
public int indexOf(Object obj)
{
int index = 0;
DListNode node = nil.next;
while (node != nil)
{
if (node.data.equals(obj))
{
return index;
}
index++;
node = node.next;
}
return -1;
}
@Override
public Iterator<String> iterator()
{
return new DListIterator();
}
private class DListIterator implements Iterator<String>
{
private DListNode pointer;
public DListIterator()
{
if(nil.next==nil)
{
pointer = nil;
}
else
pointer=nil.next;
}
public boolean hasNext()
{
return pointer != nil;
}
}
}.
There are a couple of new methods that you will be writing for this pr.pdf
There are a couple of new methods that you will be writing for this project. Some are easy, some
are hard. I have provided code that tests most of the methods by calling them from the main
method in the file ListTest.java. The test file will only work when you have done all the
methods. In COMP182LinkedList.java I have provided the signature (definition and input
parameters) for these methods. At this point to make sure you can run the file
(COMP182LinkedList.java that you downloaded from Cavas) I have added template values as
return types of the methods. For example, if the method returns an int then I added return 0 as the
return value. Here are the methods are as follows: Anything getFixst () Anything getLast () void
add (Anything value) void addafter (1nt index, Anyehtng value) Anything set(int index,
Rnything aewvalue) void removeAl1 (Anything vaiue) lastIndex (Anything value)
COMP182IinkedIi ateAnything; elone boolean equala (object in) CoMP182IinkedList
KAnythang? gplat () boolean hascycle () Node reveraeliat () Node oddeventiat () Node
deleteDuplicates () boolean ispalindrome () "For the last two methods, you need to add proper
testing to ListTest Java Method Specifications Here are more details for implementing each of
these methods. You need to complete all the following methods in the COMP182LinkedList
class. You can write the methods in any order you wish, but I suggest you do them in the order
they are listed. In particular, make sure all your methods work for empty lists, lists of different
sizes, etc as you can see from the sample test cases provided in ListTest.java. While grading your
project, we will make changes to these values! Also, make sure that your solutions do not modify
the original lists (unless you are specifically instructed to do so). roid main(String[] args) You
can use this method in the ListTest class to create lists as needed and test each of the methods
listed above. I have provided a few test cases, but you may want to add more to some of the
method tests. Until you get add working, you will need to use addFirst to create lists to test your
other methods. Anything getFirsto This method returns the value stored in the first node an the
list. It should prit an error message and seturn null if the list is empty. Anything getLasto This
method returns the value stored in the last node in the list. It should print an error mesiage and
retuin noll if the list is emipty. void add(Anything value) Thus method adds a nade containing
new yalue to the end of the last. This method returns the value stored in the first node in the list.
It should print an error message and return null if the list is empty. Anything getLast0 This
method returns the value stored in the last node in the list. It should print an error message and
retum null if the list is empty: void add(Anything value) This method adds a node containing
new value to the end of the list. void addAfter(int index, Anything value) This method adds a
node contai.
I need help finishing this code in JavaYou will need to create t.pdf
I need help finishing this code in Java
You will need to create the preOrder and postOrder traversal methods, as these will be used to
determine if your insertion methods are correct.
protected class Node {
public int data;
public Node left, right, parent;
public Node(int _data) {
data = _data;
left = right = parent = null;
}
public Node(int _data, Node _parent) {
data = _data;
left = right = null;
parent = _parent;
}
}
protected Node root;
public BST() {
root = null;
}
public void insert(int data) {
if (root == null) {
root = new Node(data);
} else {
insert(data, root);
}
}
protected void insert(int data, Node n) {
// TODO: Insert Method
}
public ArrayList inOrderTraversal() {
return inOrderTraversal(root);
}
private ArrayList inOrderTraversal(Node n) {
if (n == null) {
return new ArrayList<>();
}
ArrayList traversal = new ArrayList<>();
traversal.addAll(inOrderTraversal(n.left));
traversal.add(n.data);
traversal.addAll(inOrderTraversal(n.right));
return traversal;
}
public ArrayList preOrderTraversal() {
return preOrderTraversal(root);
}
private ArrayList preOrderTraversal(Node n) {
// TODO: preOrderTraveral Method
return new ArrayList();
}
public ArrayList postOrderTraversal() {
return postOrderTraversal(root);
}
private ArrayList postOrderTraversal(Node n) {
// TODO: postOrderTraversal Method
return new ArrayList();
}
protected static int height(Node n) {
if (n == null) {
return -1;
}
int lheight = height(n.left);
int rheight = height(n.right);
if (lheight > rheight) {
return 1 + lheight;
}
return 1 + rheight;
}
public int height() {
return height(root);
}
} BST Insertion protected void insert(int data, Node n ) if data < n.data if n. left is null n.left =
new Node(data, n ) else insert(data, n.left) else if data > n.data if n.right is null n.right = new
Node(data, n) else insert(data, n.right)
BST Traversals You are responsible for implementing the and postOrderTraversal(Node n )
methods that generate the string representation of the tree using the specified traversal. The
inorderTraversal (Node n ) method has been implemented for you; use that to match the
formatting of the output strings (this is the most "output matching" you will have to do this
semester)..
NumberList.java (implements the linked list)public class NumberLis.pdf
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.
This is a homework assignment that has to be done in JAVA.Objectiv.pdf
This is a homework assignment that has to be done in JAVA.
Objective:
Write a class Called GenDoubleLinkedList which is a generic double linked list. This link list is
similar to the single linked list that was shown in class except that each node in addition to
having data and nextLink (which was originally called link) now has prevLink.
The class GenDoubleLinkedList needs to have the following:
-Internal class ListNode which has:
- Instance Variables:
- data of type T
- nextLink of type ListNode
- prevLink of type ListNode
- Constructors:
- Default
- Parameterized
Instance Variables:
- head of type ListNode which always points to the beginning of the linked list
- current of type ListNode which moves around pointing to one of the nodes
Constructor:
- A default constructor that initializes head to an empty ListNode and sets current to point at the
head.
Methods:
- goToNext – This moves the current node forward in the list by one node. It doesn’t move
forward if that node is null
- goToPrev – This moves the current node backwards in the list by one node. It doesn’t move
backwards if that node is null.
- getDataAtCurrent – returns the data at the current node as long as the current isn’t null
- setDataAtCurrent – takes in a parameter and sets the data at the current node to that value as
long as current is not null
- insertNodeAfterCurrent – creates a new node based on data that is passed in by a parameter and
puts that node after the current position
- deleteCurrentNode – removes the current node from the list by resetting the links
- showList – prints out the contents of the list line-by-line
- inList – returns a true or false value based on whether or not the data passed in via a parameter
is in the list
Insert Node After Current
Delete Current Node Head Current
Solution
Hi, Please find my implementation.
Please let me know in case of any issue.
public class GenDoubleLinkedList> {
private class ListNode{
T data;
ListNode nextLink;
ListNode prevLink;
public ListNode(T data) {
this.data = data;
nextLink = null;
prevLink = null;
}
}
// instance variables
private ListNode head;
private ListNode current;
public GenDoubleLinkedList() {
head = new ListNode(null);
current = head;
}
public void goToNext(){
if(current != null && (current == head && head.nextLink != null))
current = current.nextLink;
else if(current != null && current != head)
current = current.nextLink;
}
public void goToPrev(){
if(current != null && current != head)
current = current.prevLink;
}
public T getDataAtCurrent(){
if(current == null || current == head)
return null;
return current.data;
}
public void setDataAtCurrent(T data){
if(current != null && current != head){
current.data = data;
}
}
public void insertNodeAfterCurrent(T data){
if(current == null)
return;
ListNode newNode = new ListNode(data);
newNode.nextLink = current.nextLink;
if(current.nextLink != null)
current.nextLink.prevLink = newNode;
current.nextLink = newNode;
newNode.prevLink = current;
}
public void delet.
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.
JAVA A double-ended queue is a list that allows the addition and.pdf
**JAVA** A double-ended queue is a list that allows the addition and removal of items from
either end. One end is arbitrarily called the front and other the rear, but the two ends behave
identically. Specify, design and implement a class for a double-ended queue. Include operations
to check if it is empty and to return the number of items in the list. For each end, include
operations for adding and deleting items. Use doubly linked list for your implementation. Call
your class Deque (pronounced \"deck\").
Solution
//package com.java2novice.ds.queue;
public class DequeDblLinkedListImpl {
private LinkedNode front;
private LinkedNode rear;
public void insertFront(T item){
//add element at the beginning of the queue
System.out.println(\"adding at front: \"+item);
LinkedNode nd = new LinkedNode();
nd.setValue(item);
nd.setNext(front);
if(front != null) front.setPrev(nd);
if(front == null) rear = nd;
front = nd;
}
public void insertRear(T item){
//add element at the end of the queue
System.out.println(\"adding at rear: \"+item);
LinkedNode nd = new LinkedNode();
nd.setValue(item);
nd.setPrev(rear);
if(rear != null) rear.setNext(nd);
if(rear == null) front = nd;
rear = nd;
}
public void removeFront(){
if(front == null){
System.out.println(\"Deque underflow!! unable to remove.\");
return;
}
//remove an item from the beginning of the queue
LinkedNode tmpFront = front.getNext();
if(tmpFront != null) tmpFront.setPrev(null);
if(tmpFront == null) rear = null;
System.out.println(\"removed from front: \"+front.getValue());
front = tmpFront;
}
public int size(){
if(front == null && rear ==null){
return 0;
}
//remove an item from the beginning of the queue
LinkedNode tmpFront = front;
LinkedNode tmpRear = rear;
int i=0;
while(tmpFront != rear)
{
i++;
tmpFront=tmpFront.getNext();
}
i++;
return i;
}
public void removeRear(){
if(rear == null){
System.out.println(\"Deque underflow!! unable to remove.\");
return;
}
//remove an item from the beginning of the queue
LinkedNode tmpRear = rear.getPrev();
if(tmpRear != null) tmpRear.setNext(null);
if(tmpRear == null) front = null;
System.out.println(\"removed from rear: \"+rear.getValue());
rear = tmpRear;
}
public static void main(String a[]){
DequeDblLinkedListImpl deque = new DequeDblLinkedListImpl();
deque.insertFront(34);
deque.insertFront(67);
System.out.println(\"Size of the queue : \"+deque.size());
deque.insertFront(29);
deque.insertFront(765);
deque.removeFront();
deque.removeFront();
deque.removeFront();
deque.insertRear(43);
deque.insertRear(83);
deque.insertRear(84);
deque.insertRear(546);
deque.insertRear(356);
deque.removeRear();
deque.removeRear();
deque.removeRear();
deque.removeRear();
deque.removeFront();
deque.removeFront();
deque.removeFront();
}
}
class LinkedNode{
private LinkedNode prev;
private LinkedNode next;
private T value;
public LinkedNode getPrev() {
return prev;
}
public void setPrev(LinkedNode prev) {
this.prev = prev;
}
public LinkedNode getNext() {
return next;
}
public void setNext(L.
Need Help with this Java Assignment. Program should be done in JAVA .pdf
Need Help with this Java Assignment. Program should be done in JAVA please
Complete required scripts based on eclipse and troubleshoot the scripts until the tasks are done.
1. Implement a binary search tree (write the code for it), for a height of 2 or higher. Please show
the output if you can Thank you in advance!
Solution
I have compiled this code and checked for errors, worked fine.
Also after the code I have pasted the Output transcript to show what User Inputs I gave and what
all outputs I got.
// Java Program to Implement Binary Tree
import java.util.Scanner;
/* Define Class BinaryTreeNode */
class BinaryTreeNode
{
BinaryTreeNode left, right;
int data;
/* Constructor */
public BinaryTreeNode()
{
left = null;
right = null;
data = 0;
}
/* Constructor */
public BinaryTreeNode(int n)
{
left = null;
right = null;
data = n;
}
/* Function to set left node */
public void setLeft(BinaryTreeNode n)
{
left = n;
}
/* Function to set right node */
public void setRight(BinaryTreeNode n)
{
right = n;
}
/* Function to get left node */
public BinaryTreeNode getLeft()
{
return left;
}
/* Function to get right node */
public BinaryTreeNode getRight()
{
return right;
}
/* Function to set data to node */
public void setData(int d)
{
data = d;
}
/* Function to get data from node */
public int getData()
{
return data;
}
}
/* Define anothe Class Operations to perform required operationns on Binary Tree*/
class Operations
{
private BinaryTreeNode root;
/* Constructor */
public Operations()
{
root = null;
}
/* Function to check if tree is empty */
public boolean isEmpty()
{
return root == null;
}
/* Functions to insert data */
public void insert(int data)
{
root = insert(root, data);
}
/* Function to insert data recursively */
private BinaryTreeNode insert(BinaryTreeNode node, int data)
{
if (node == null)
node = new BinaryTreeNode(data);
else
{
if (node.getRight() == null)
node.right = insert(node.right, data);
else
node.left = insert(node.left, data);
}
return node;
}
/* Function to count number of nodes */
public int countNodes()
{
return countNodes(root);
}
/* Function to count number of nodes recursively */
private int countNodes(BinaryTreeNode r)
{
if (r == null)
return 0;
else
{
int l = 1;
l += countNodes(r.getLeft());
l += countNodes(r.getRight());
return l;
}
}
/* Function to search for an element */
public boolean search(int val)
{
return search(root, val);
}
/* Function to search for an element recursively */
private boolean search(BinaryTreeNode r, int val)
{
if (r.getData() == val)
return true;
if (r.getLeft() != null)
if (search(r.getLeft(), val))
return true;
if (r.getRight() != null)
if (search(r.getRight(), val))
return true;
return false;
}
/* Function for inorder traversal */
public void inorder()
{
inorder(root);
}
private void inorder(BinaryTreeNode r)
{
if (r != null)
{
inorder(r.getLeft());
System.out.print(r.getData() +\" \");
inorder(r.getRight());
}
}
/* Function for preorder traversal */
public void preorder()
{
preorder(root);
}
priva.
Help please!!(Include your modified DList.java source code file in.pdf
Help please!!
(Include your modified DList.java source code file in your homework solution zip archive)
Using
whatever Java IDE you prefer, create a project and add DList.java and DListTest.java to it (these
files are provided
in the Week 6 Source zip archive). Modify DList to implement a method that removes all
occurrences of a specific
integer from the list. Here is the pseudocode:
Method removeAll(In: Integer pData) Returns Nothing
Define index variable i and initialize i to 0
While i < the size of this Dlist Do
If get(i) equals pData Then
remove(i)
Else
Increment i
End If
End While
End Method removeAll
Next, modify DListTest() to add test case 21 which tests that removeAll() works correctly.
WHat more do i need to provide to get help on this???
Solution
/* DListNode.java */
/**
* A DListNode is a node in a DList (doubly-linked list).
*/
class DListNode {
/**
* item references the item stored in the current node.
* prev references the previous node in the DList.
* next references the next node in the DList.
*
* DO NOT CHANGE THE FOLLOWING FIELD DECLARATIONS.
*/
public Object item;
protected DListNode prev;
protected DListNode next;
/**
* DListNode() constructor.
* @param i the item to store in the node.
* @param p the node previous to this node.
* @param n the node following this node.
*/
DListNode(Object i, DListNode p, DListNode n) {
item = i;
prev = p;
next = n;
}
}
/* DList.java */
/**
* A DList is a mutable doubly-linked list ADT. Its implementation is
* circularly-linked and employs a sentinel (dummy) node at the head
* of the list.
*
* DO NOT CHANGE ANY METHOD PROTOTYPES IN THIS FILE.
*/
class DList {
/**
* head references the sentinel node.
* size is the number of items in the list. (The sentinel node does not
* store an item.)
*
* DO NOT CHANGE THE FOLLOWING FIELD DECLARATIONS.
*/
protected DListNode head;
protected int size;
/* DList invariants:
* 1) head != null.
* 2) For any DListNode x in a DList, x.next != null.
* 3) For any DListNode x in a DList, x.prev != null.
* 4) For any DListNode x in a DList, if x.next == y, then y.prev == x.
* 5) For any DListNode x in a DList, if x.prev == y, then y.next == x.
* 6) size is the number of DListNodes, NOT COUNTING the sentinel,
* that can be accessed from the sentinel (head) by a sequence of
* \"next\" references.
*/
/**
* newNode() calls the DListNode constructor. Use this class to allocate
* new DListNodes rather than calling the DListNode constructor directly.
* That way, only this method needs to be overridden if a subclass of DList
* wants to use a different kind of node.
* @param item the item to store in the node.
* @param prev the node previous to this node.
* @param next the node following this node.
*/
protected DListNode newNode(Object item, DListNode prev, DListNode next) {
return new DListNode(item, prev, next);
}
/**
* DList() constructor for an empty DList.
*/
public DList() {
// Your solution here.
head = newNode(null, head, head);
head.prev = head;
head.next = head;
si.
How do I fix it in LinkedList.javaLabProgram.javaLinkedList.jav.pdf
How do I fix it in LinkedList.java?
LabProgram.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 NoS.
Similar to I am failing a few tests with my Double Linked List program. Can som.pdf (20)
Sorted number list implementation with linked listsStep 1 Inspec.pdf
Sorted number list implementation with linked listsStep 1 Inspec.pdf
Using visual studio 2022- a C# windows form application- and your Doub.pdf
Using visual studio 2022- a C# windows form application- and your Doub.pdf
JAVA OOP project; desperately need help asap im begging.Been stuck.pdf
JAVA OOP project; desperately need help asap im begging.Been stuck.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 pro.pdf
Having a problem figuring out where my errors are- The code is not run.pdf
Having a problem figuring out where my errors are- The code is not run.pdf
Intro to Java Programming 10th ed- Implement the inorder- preorder- po.docx
Intro to Java Programming 10th ed- Implement the inorder- preorder- po.docx
Create your own Linked list from scratch (singly linked list).So.pdf
Create your own Linked list from scratch (singly linked list).So.pdf
Write a JAVA LinkedListRec class that has the following methods siz.pdf
Write a JAVA LinkedListRec class that has the following methods siz.pdf
Can someone help me to fix the code please package dlist i.pdf
Can someone help me to fix the code please package dlist i.pdf
There are a couple of new methods that you will be writing for this pr.pdf
There are a couple of new methods that you will be writing for this pr.pdf
I need help finishing this code in JavaYou will need to create t.pdf
I need help finishing this code in JavaYou will need to create t.pdf
NumberList.java (implements the linked list)public class NumberLis.pdf
NumberList.java (implements the linked list)public class NumberLis.pdf
This is a homework assignment that has to be done in JAVA.Objectiv.pdf
This is a homework assignment that has to be done in JAVA.Objectiv.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
JAVA A double-ended queue is a list that allows the addition and.pdf
JAVA A double-ended queue is a list that allows the addition and.pdf
Need Help with this Java Assignment. Program should be done in JAVA .pdf
Need Help with this Java Assignment. Program should be done in JAVA .pdf
Help please!!(Include your modified DList.java source code file in.pdf
Help please!!(Include your modified DList.java source code file in.pdf
How do I fix it in LinkedList.javaLabProgram.javaLinkedList.jav.pdf
How do I fix it in LinkedList.javaLabProgram.javaLinkedList.jav.pdf
More from PRATIKSINHA7304
Hi, I need help with a java programming project. specifically practi.pdf
Given 8 distinct integers from the set {1, 2, . . . , 16}, prove that there exists k such that ai aj = k
has at least 3 distinct solutions (ai , aj ) ?
Solution
For any k (unless the K is zero), at least 3 distinct solutions need not be existing.
Let\'s look at the next most favourable case
If k= 2;
We have to consider the case where the number of solutions of ai-aj=2 are minimum since we
have to show that at least 3 distinct solutions exist (which means even in the most unfavourable
case for a chosen k there will be 3 distinct solutions satisfying the equation ai-aj=2)
If k = 2; we start by taking numbers that are not at all 2 units apart from each other;
So we start with 1 and move 3 units successively ahead
1, 4, 7, 10,13, 16; Now we notice that these 6 numbers are of 3k+1 form; remaining numbers
can be any 2 ranomdly selected say 2 and 11; we get 4-2 = 2 and 13-11=2; Hence only 2 distinct
solutions are possible..
Find the sum of the infinite geometric series if it exists. (If an .pdf
Find the general solution to the following differential equation. d^2y/dx^2 - 2 dy/dx - 35 y = 1 +
13sin x - e^3x.
Solution
Ans-
A differential equation is a mathematical equation that relates some function with its derivatives.
In applications, the functions usually represent physical quantities, the derivatives represent their
rates of change, and the equation defines a relationship between the two. Because such relations
are extremely common, differential equations play a prominent role in many disciplines
including engineering, physics, economics, and biology.
In pure mathematics, differential equations are studied from several different perspectives,
mostly concerned with their solutions—the set of functions that satisfy the equation. Only the
simplest differential equations are solvable by explicit formulas; however, some properties of
solutions of a given differential equation may be determined without finding their exact form.
If a self-contained formula for the solution is not available, the solution may be numerically
approximated using computers. The theory of dynamical systems puts emphasis on qualitative
analysis of systems described by differential equations, while manynumerical methods have been
developed to determine solutions with a given degree of accuracy..
A new class will be added to the startup package to start up the eve.pdf
A new class will be added to the startup package to start up the event-driven application. This
should be a small class to create the main window (JFrame) and make it visible. The other new
classes are to be placed in a new package called ‘gui’.
When the project first starts, a window should appear and give the user six options. Five of the
options will be buttons to press, while the sixth will be a prompt and a text field. Each of these
options will be discussed.
The first button will be one to initiate the task of adding a flight to the system. When it is
pressed, a new window should appear. In this window, there should be prompts and fields for the
entry of the flight’s number, width and capacity. Provide a Submit button that will cause the data
to be collected from the fields and passed to the command to add the flight. If the command fails,
the error message should appear in the window, and the window remains visible for the user to
correct the information. If the command is successful, the window should disappear, so that the
user is returned to the main menu.
The second button is for the addition of a new passenger. Its affect will be very similar to the add
flight button: a new window will appear for the entry of the data for the new passenger. This
time, instead of a Submit button, the command to add a passenger should be created and
executed whenever the user presses the Enter key in either one of the fields. If the addition of a
passenger fails, the error message should appear in the window for the user to correct the data. If
the addition was successful, the window to add a passenger should remain visible (with the fields
blank) for the user to enter another passenger. The user can close the window via the X in the
upper right corner, or you can supply a close button (the close button is optional).
The third and fourth buttons are to display the all passengers in the system, and to display all the
flights in the system. In both cases, when the button is pressed, a new window should appear
with the information. It should have a 2-D field to display the information, and scroll bars should
be provided in case there is too much information for the field. This can be done by
and put myPane into a suitable JPanel, or directly into a JFrame. The preferred size of the scroll
pane may want to be set to a suitable size if it is placed in a JPanel. If a scroll pane is directly
added into a JFrame, it will take on the size of the available window. Don’t worry about
formatting the text in a fancy way.
The fifth button is to terminate the project. The project can also be terminated by the X in the
right hand corner of the main window. However, selecting the X in another window should just
close that window (the default action for that (built in) button).
The sixth option in the main window are a prompt and a text field to handle an existing flight.
When the user enters a number in the field (presumably the number of a flight) and presses the
En.
Are these statements regarding Rhizobacteria true Plant Growth P.pdf
Are these statements regarding Rhizobacteria true ?:
Plant Growth Promoting Rhizobacteria, known as PGPRs, are bacteria that colonize the roots of
plants through the formation of nodules. They are beneficial to the plant because they fix
Nitrogen, and stimulate the plant to grow.
There are many kinds of bacteria found in the root nodules of plants, but not all have the ability
to stimulate the formation of nodules or promote growth. In order to find out what kinds of
bacteria were found in the nodule of the Adzuki bean plant, we obtained an Adzuki bean plant
grown in soil from Temescal canyon, and isolated bacteria from the nodule.
Anything incorrect about what is said above?
Solution
Symbiosis: It is an ecological relationship between two different species organisms that live
together in direct intimate contact.
Ex: Legumes
Nitrogen fixation Formula: Bacteria reduce N2 (nitrogen) to NH3 (ammonia).
Legume Species: Legumes are the plants that forms a relationship with rhizbacteria (N fixing
bacteria). Ex: Beans, peanuts, etc...
Rhizobacteria:
The statements above give in the question is True.
Explanation:
It is a soil bacteria lives closely to the plant roots in the soil. It capable to form nodules and
inside the nodules rhizobacteria are present.
Rhizosphere activites:
It is Biological N2 fixation bacteria and also known as a PGPRs(Plant Growth Promoting
Rhizobacteria). PGPR\'s are the bacteria that colonize the roots of plants through the formation
of nodules. They are beneficial to the plant because they fix Nitrogen, and stimulate the plant to
grow.
This bacteria increasing plant nutrient availability of P, Mn, Fe, Z, Cu and controlling deleterious
microorganisms. It improves soil aggregation.
Adzuki bean plant:
The statements above give in the question is True.
Explanation:
Adzuki bean, Vigna angularis (Willd.) is an important legume crop, It is widely used as a diet
due to its highest protein and low fat content. In developing countries Europe and America it is
used highly. it is valued for its high protein
adzuki bean did not increase yield with inorganic N fertilization, indicating the priority of
symbiotic nitrogen fixation (SNF). In this plant symbiosis (N2 fixation) is taken placed with
some bacterial strains of the genera Bradyrhizobium, Rhizobium and Sinorhizobium. The native
rhizobial strains are generally poor efficient in N fixation in this plant..
1. Prices may be different between two countries whenA. Both count.pdf
1. Prices may be different between two countries when
A. Both countries have the same endowment but different preferences
B Both countries have the same preferences but different endowments
C There are differences in endowment and preference
D (a) or (b) may be true
E All of the above
Solution
Ans is E
As prices are determined by demand and supply where demand comes from preferences and
supply comes from endowment. Thus both prefernce and endowment determines price. And thus
difference in any one factor leads to different pricing in the market..
[10 points]Add the.pdf
Write an algebraic expression that is equivalent to sin (tan^-1 x/2). 2/Squarerootx ^2+4
x/Squarerootx ^2+4 Squareroot x^2+4/x Squareroot x^2+4/x
Solution
sin ( tan^-1 x / 2 )
let
( tan^-1 x / 2 ) = y
tan y = x/2
perpendicular = x
base = 2
hypotenuse = sqrt ( x^2 + 2^2 ) = sqrt ( x^2 + 4 )
sin y = x / sqrt ( x^2 + 4)
or
sin ( tan^-1 x / 2 ) = x / sqrt ( x^2 + 4)
option b is correct.
§ 7.3 7.6 Which member of the following pairs is likely to decompose .pdf
Write the converse, inverse, and contrapositive of the statement.
If you clean your room, then you can play outside.
Solution
Coverse statement : \"If you can play outside then you clean your room.\"
Contrapositive statement : \" If you can not clean your room, then you can not play outside.\"
Inverse statement : \" If you can not play outside, then you can not clean your room.\".
You are requested to write the SQL commands to perform the following.pdf
Write a function Noodles(), with int parameter minutes, and void return type. Print \"N minutes\"
for each minute in decreasing order, where N is the number of minutes, followed by
\"Done\".End with a newline. The number of minutes is generated from a random number
generator that selects between 1-3 minutes. The seed for the random number generator is input
by the user.
Example output for minutes = 2:
Solution
#include
#include
using namespace std;
void Noodles(int);
int main() {
int minutes = 0;
int seed;
cout<<\"enter random seed\"<<\"\ \";
cin >> seed; // reading seed
srand(seed);
minutes=rand()%3; // random number generation
cout<.
write a prgoram that displays four images or objects in a 2 x 2 grid.pdf
Which of the three types of activities reported on the statement of cash flows is the MOST
critical for a company\'s long-tetm OA. operating activities O B. investing activities O C.
financing activities O D. noncash investing and financing activities
Solution
A. Operating activities
This are the functions of business related to the provision of its offering. It is an activity that
directly affects an orgainzation\'s cash inflows and outflows, and determine its net income..
Wiater Company operates a small manufacturing facility. On January 1,.pdf
Which mechanism does not repair double strand breaks? recombination photolyase followed by
photoreactivation synthesis-dependent strand annealing (SDSA) non-homologous end joining
The fluctuation test, regarding the origin of mutations, shows that: Mutations occur randomly,
prior to selective pressure The mutation rate fluctuates greatly from organism to organism The
mutation rate fluctuates greatly from cell to cell The mutation rate is fairly even across
organisms The P element in Drosophila: is active in all cells during embryogenesis is a
functional transposon carrying the transposase gene is active when crossing a P female with any
male is a functional retrotransposon carrying the reverse transcriptase gene During bacterial
conjugation, the F element: is transferred as a double stranded molecule is transferred as a single
stranded molecule. 3\' end first enters the donor is transferred as a single stranded molecule. 5\'
end first enters the donor is transferred as a single stranded molecule, the leading end is random
Which of the following could result in a frameshift mutation? deletion of one nucleotide deletion
of three nucleotides deletion of six nucleotides incorporation of a base analog
Solution
1Repair of double strand DNA break is a very serious problem if not solved it may cause
mutation. So there is several repair mechanisms are present. in the above question all
mechanisms can repair DNA break.
recombination repair is of two types homologous recombination and NHEJ ( non homologous
end joining). in NHEJ no homologous template is used and break ends are linked directly.
photolyase is a enzyme activated by light it repairs the mutagenic effect caused by UV light.
such as formation of THYMINE dimer.
SDSA or synthesis dependent strand annealing is a repair mechanism seen in yeast. in this
process repair is initiated by resection of a double strand break to provide 3\' single stranded
DNA..
Which of the three types of activities reported on the statement of c.pdf
What led to the demise of ‘conventional Keynesian wisdom’ in the mid 1970s and why did the
theory of rational expectations make the ‘monetarist experiment’ in the early 1980s more
attractive to politicians?
Solution
theory has its origins in the study of business cycles and monetary theory.[1][2] In general, early
theorists believed monetary factors could not affect real factors such as real output. John
Maynard Keynes attacked some of these \"classical\" theories and produced a general theory that
described the whole economy in terms of aggregates rather than individual, microeconomic
parts. Attempting to explain unemployment and recessions, he noticed the tendency for people
and businesses to hoard cash and avoid investment during a recession. He argued that this
invalidated the assumptions of classical economists who thought that markets always clear,
leaving no surplus of goods and no willing labor left idle.[3]
The generation of economists that followed Keynes synthesized his theory with neoclassical
microeconomics to form the neoclassical synthesis. Although Keynesian theory originally
omitted an explanation of price levels and inflation, later Keynesians adopted the Phillips curve
to model price-level changes. Some Keynesians opposed the synthesis method of combining
Keynes\'s theory with an equilibrium system and advocated disequilibrium models instead.
Monetarists, led by Milton Friedman, adopted some Keynesian ideas, such as the importance of
the demand for money, but argued that Keynesians ignored the role of money supply in
inflation.[4] Robert Lucas and other new classical macroeconomists criticized Keynesian models
that did not work under rational expectations. Lucas also argued that Keynesian empirical
models would not be as stable as models based on microeconomic foundations..
111. Definition Explanation (15) 1. Job speciation SolutionIII.pdf
111. Definition Explanation (15%) 1. Job speciation
Solution
III.
1. Job specification refers to job description which includes the work that needs to be performed,
roles and responsibilities, and the minimum qualification required to perform the job effectively.
Job specification is one of the essential part of job analysis information.
Job analysis helps in determining job requirements and is comprehensive in nature. It focus on
developing the techniques of doing a job and helps in recruitment and selection, appraisal, job
evaluation, job designing, compensation, training and development and to assess the job worth..
What are the pros and cons of using exFAT and ReFS on a Windows 2012.pdf
Using C++,
Write a program segment that dynamically allocates an array large enough to hold a user defined
number of (double) test scores. Once all the scores are entered, the array should be passed to a
function that calculates and returns the average score. Use Pointer notation whenever possible.
double calculateAverage(function parameter goes here) //
int main()
{ int size;
double * ptrScores;
// complete rest of the main function following the directions above
}
double calculateAverage(function parameter goes here)
{
// complete the rest of this function following the directions above
}
Solution
Program:
#include
#include
using namespace std;
double calcAverage(double, int);
void bubbleSort(double scores[], int numScores);
int main()
{
double *scores, // To dynamically allocate an array
total = 0.0, // Accumulator
average; // To hold average scores
int numScores, // To hold the number of days of scores
count; // Counter variable
// Get the number of days of scores.
cout << \"How many days of test scores do you wish \";
cout << \"to process? \ \";
cin >> numScores;
// Dynamically allocate an array large enough to hold
// that many days of scores amounts.
scores = new double[numScores];
// Get the scores figures for each day.
cout << \"Enter the test scores below.\ \";
for (count = 0; count < numScores; count++)
{
cout << \"Day \" << (count + 1) << \": \";
cin >> scores[count];
}
// Calculate the total scores
for (count = 0; count < numScores; count++)
{
total += scores[count];
}
bubbleSort(scores,numScores);
average = calcAverage(total, numScores);
cout << endl;
for (count = 0; count < numScores; count++)
{
cout<<\"Day \"<<(count+1)<<\": \"<< *(scores + count) < array[count + 1])
{
temp = array[count];
array[count] = array[count + 1];
array[count + 1] = temp;
swap = true;
}
}
} while (swap);
}.
What led to the demise of ‘conventional Keynesian wisdom’ in the mid.pdf
What are the pros and cons of using exFAT and ReFS on a Windows 2012 server? How do they
compare to NTFS?
Solution
ReFS:
Pros: 1.unique in private cloud manipulations
2.also in age of big data
3.storage space assits the mirroring and striping.
cons: 1.it is unable to utilize for booting drives.
2.seen only in case of windows server 2012
3.unable to format the removable drives.
Hence due to all the above prons and cons the REFS are used and prefered in widows server
2012 .
...........................................................................................................................................................
...........
NFTS
pros: 1.File compression
2.Advanced auditing
cons: The NFTS are unable to manipulate on REFS disks though several features operate on
REFS like bitlocker..
What is the connection between relative frequency and probability.pdf
Waterways prepared the balance sheet and income statement for the irrigation installation
division for last year. Now the company needs to prepare a cash flow statement for the same
division. The comparative balance sheets for Waterways Corporation’s Irrigation Installation
Division for last year and the prior year and the income statement for last year are presented
below. (Note: Work in Process is a current asset and should be treated as any other current asset.)
Additional information:
1. Waterways sold a piece of company equipment for $30,000. The equipment had been used for
six years. It had cost $100,000 when purchases and had a 10-years life and a $10,000 salvage
value. Straight-line depreciation was used.
2. Waterways purchased new equipment costing $200,000.
3. The division paid $100,000 in dividends.
Waterways Corporation - Installation Division
Income Statement
For the Year Ending December 31, Last Year
Sales
$5,536,077
Less: Cost of goods sold
3,132,777
Gross Profit
2,403,300
Operating expenses:
Advertising
$52,000
Insurance
382,000
Salaries and wages
594,650
Depreciation
72,500
Other operating expenses
30,500
Total operating expenses
1,131,650
Income from operations
1,271,650
Other income
Loss on sale of equip
(16,000)
Other expenses
Interest expense
(12,200)
Net other income and expenses
(28,200)
Income before income tax
1,243,450
Income tax expenses
373,035
Net income
$870,415
Waterways Corporation - Installation Division
Balance Sheet
December 31
Assets
Last Year
Prior Year
Current assets
Cash
$792,306
$746,681
Accounts receivable
680,750
542,685
Work in process
680,450
0
Inventory
16,750
7,500
Prepaid expenses
71,500
42,590
Total current assets
2,241,756
1,339,456
Property, plant, and equipment
Furnishings
40,416
40,416
Equipment
900,200
800,200
Buildings
450,000
450,000
Land
300,000
300,000
Accumulated depreciation
(503,704)
(485,204)
Total property, plant, and
equipment
1,186,912
1,105,412
Total Assets
$3,428,668
$2,444,868
Liabilities and Stockholders\' Equity
Current liabilities
Accounts payable
$156,300
$128,360
Income taxes payable
100,344
79,989
Wages payable
600
1,984
Interest payable
1,200
0
Other current liabilities
14,520
15,246
Revolving bank loan payable
16,000
0
Total current liabilities
288,964
225,579
Long-term liabilities
Notes payable
150,000
0
Total liabilities
438,964
225,579
Stockholders\' equity
Common stock
1,250,000
1,250,000
Retained earnings
1,739,704
969,289
Total stockholders\' equity
2,989,704
2,219,289
Total liabilities and stockholders\' equity
$3,428,668
$2,444,868
Instructions:
For last year:
a. Prepare a statement of cash flow using the indirect method.
b. Determine free cash flow.
Waterways Corporation - Installation Division
Income Statement
For the Year Ending December 31, Last Year
Sales
$5,536,077
Less: Cost of goods sold
3,132,777
Gross Profit
2,403,300
Operating expenses:
Advertising
$52,000
Insurance
382,000
Salaries and wages
594,650
Depreciation
72,500
Other operating expenses
30,50.
What factors led President Truman to support the creation of Israel .pdf
var testScores = [];
testScores[0] = [80, 82, 90, 87, 85];
testScores[1] = [79, 80, 74, 82, 81];
testScores[2] = [93, 95, 89, 100, 85];
testScores[3] = [60, 72, 65, 71, 79];
This code creates a tabular structure that has
5 rows and 4 columns
4 rows and 5 columns
4 rows and 4 columns
5 rows and 5 columnsa.
5 rows and 4 columnsb.
4 rows and 5 columnsc.
4 rows and 4 columnsd.
5 rows and 5 columns
Solution
Here is the given structure:-
var testScores = [];
testScores[0] = [80, 82, 90, 87, 85];
testScores[1] = [79, 80, 74, 82, 81];
testScores[2] = [93, 95, 89, 100, 85];
testScores[3] = [60, 72, 65, 71, 79];
And this will create a tabular structure that has 4 rows and 5 columns.
unixlinux - kernelexplain yield in user spaceexplain yield in k.pdf
this is java. problem.
i already make employee class. but i can not make employeetester class. i want to know
Employeetester class.
EmployeeTester class:
Write a main method that produces a dialog like this:
-->Enter a name : dave
-->Enter hours worked (7 values separated by spaces): 5 2 1 0 0 3 3
Output: dave worked for 5 day(s) for a total of 14.0 hours.
-->Enter a day of the week (0-6): 2
Output: Hours worked on day 2 is 1.0
************and this is my employee class.**********************
public class Employee {
private double[] hours=new double[7];
private String name;
public Employee(String name){
this.name=name;
}
public double getHours(int day){
return hours[day];
}
public void setHours(int day,double hrs){
hours[day]=hrs;
}
public int numDaysWorked(){
int totalD=0;
for(int i=0;i<7;i++){
if(hours[i]==0.0){
}else{
totalD=totalD+1;
}
}
return totalD;
}
public double totalHours(){
double totalH=0;
for(int i=0;i<7;i++){
if(hours[i]==0.0){
}else{
totalH=totalH+hours[i];
}
}
return totalH;
}
public String toString(){
return name+\" Worked \" +numDaysWorked() + \" day(s) for a total of \"+totalHours() +
\"hours\ .\";
}
}
Solution
Note:
I have made some changes to the Employee class which have provided to meet the required
output.Thank You.
________________________
Employee.java
public class Employee {
//Creating an double type array of size 7
private double[] hours=new double[7];
//Declaring variable
private String name;
//Parameterized constructor
public Employee(double[] hours, String name) {
super();
this.hours = hours;
this.name = name;
}
//Setters and getters
public double[] getHours() {
return hours;
}
public void setHours(double[] hours) {
this.hours = hours;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
//This method will calculate the no of days worked by an employee
public int numDaysWorked(){
int totalD=0;
for(int i=0;i<7;i++){
if(hours[i]!=0.0){
totalD=totalD+1;
}
}
return totalD;
}
//This method will return the total no of hours worked by an employee
public double totalHours(){
double totalH=0;
for(int i=0;i<7;i++){
//Calculating the total hours worked
totalH=totalH+hours[i];
}
return totalH;
}
//this method will return the hours worked on particular day of an employee
public double hoursWorkedOnParticularday(int day)
{
return hours[day];
}
//this method will display the contents of an object inside it
public String toString(){
return name+\" Worked \" +numDaysWorked() + \" day(s) for a total of \"+totalHours() + \"
hours\ .\";
}
}
____________________
EmployeeTester.java
import java.util.Scanner;
public class EmployeeTester {
public static void main(String[] args) {
//Declaring variables
String name;
double tot_hours=0;
int no_of_days_worked=0;
int week_day=0;
//Scanner object is used to get the inputs entered by the user
Scanner sc=new Scanner(System.in);
//Creating an double type array of size 7
double hours[]=new double[7];
//getting the name of an employee entered by the us.
this is java. problem.i already make employee class. but i can not.pdf
The price p and the quantity x sold of a certain product obey the demand equation
x =- 8p + 80, 0 p l 10
(a) Express the revenue R as a function of x.
(b) What is the revenue if 24 units are sold?
(c) What quantity x maximizes revenue? What is the maximum revenue?
(d) What price should the company charge to maximize revenue?
Solution
A.
Revenue = Price*quantity
x = -8p + 80, and 0 <= P <= 10
8p = 80 - x
p = -x/8 + 10
R = p*x
R = x*(-x/8 + 10)
R = -x^2/8 + 10x
B.
x = 24
R = -x^2/8 + 10x
R = -24^2/8 + 10*24
R = 168
C.
In this parabolic equation
R = -x^2/8 + 10x
a = -1/8, b = 10
maximize x = -b/2a
x = -10/(2*(-1/8)) = 40
maximum revenue
R = -x^2/8 + 10x
R = -40^2/8 + 10*40 = 200
D.
p = -x/8 + 10
so for x = 40
p = -40/8 + 10 = 5
price = 5.
This fall Millie finally repaid her student loan. She originally bor.pdf
The preprocessor is part of vi checks for correct C++ syntax converts Unicode characters to
ASCII all of the above none of the above Which of the following is true in C++? A literal is an
expression A literal is an lvalue A literal is an rvalue all of the above none of the above
Solution
Answer:
Preprocessor is used in C++ to process the data before the compilation.
2) d) All of the above , Literal is written inside the code and is not been altered by the program ,
it remains as such . It can be any expression , lvalue , rvalue ..
The term refers to a. Global Analysis of the proteins produced in .pdf
The issues of inflation, unemployment, and business cycles are Multiple Choice major topics of
macroeconomics. not relevant to the U.S. economy the primary focus of microeconomics.
Solution
a) Major topics of macroeconomics.
Macroeconomics is that branch of economics which deals in economic relations and economic
problems at the level of economy as a whole. It includes inflation, national income, government
budget, unemployment, business cycle..
More from PRATIKSINHA7304 (20)
Hi, I need help with a java programming project. specifically practi.pdf
Hi, I need help with a java programming project. specifically practi.pdf
Find the sum of the infinite geometric series if it exists. (If an .pdf
Find the sum of the infinite geometric series if it exists. (If an .pdf
A new class will be added to the startup package to start up the eve.pdf
A new class will be added to the startup package to start up the eve.pdf
Are these statements regarding Rhizobacteria true Plant Growth P.pdf
Are these statements regarding Rhizobacteria true Plant Growth P.pdf
1. Prices may be different between two countries whenA. Both count.pdf
1. Prices may be different between two countries whenA. Both count.pdf
§ 7.3 7.6 Which member of the following pairs is likely to decompose .pdf
§ 7.3 7.6 Which member of the following pairs is likely to decompose .pdf
You are requested to write the SQL commands to perform the following.pdf
You are requested to write the SQL commands to perform the following.pdf
write a prgoram that displays four images or objects in a 2 x 2 grid.pdf
write a prgoram that displays four images or objects in a 2 x 2 grid.pdf
Wiater Company operates a small manufacturing facility. On January 1,.pdf
Wiater Company operates a small manufacturing facility. On January 1,.pdf
Which of the three types of activities reported on the statement of c.pdf
Which of the three types of activities reported on the statement of c.pdf
111. Definition Explanation (15) 1. Job speciation SolutionIII.pdf
111. Definition Explanation (15) 1. Job speciation SolutionIII.pdf
What are the pros and cons of using exFAT and ReFS on a Windows 2012.pdf
What are the pros and cons of using exFAT and ReFS on a Windows 2012.pdf
What led to the demise of ‘conventional Keynesian wisdom’ in the mid.pdf
What led to the demise of ‘conventional Keynesian wisdom’ in the mid.pdf
What is the connection between relative frequency and probability.pdf
What is the connection between relative frequency and probability.pdf
What factors led President Truman to support the creation of Israel .pdf
What factors led President Truman to support the creation of Israel .pdf
unixlinux - kernelexplain yield in user spaceexplain yield in k.pdf
unixlinux - kernelexplain yield in user spaceexplain yield in k.pdf
this is java. problem.i already make employee class. but i can not.pdf
this is java. problem.i already make employee class. but i can not.pdf
This fall Millie finally repaid her student loan. She originally bor.pdf
This fall Millie finally repaid her student loan. She originally bor.pdf
The term refers to a. Global Analysis of the proteins produced in .pdf
The term refers to a. Global Analysis of the proteins produced in .pdf
Recently uploaded
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.
GIÁO ÁN DẠY THÊM (KẾ HOẠCH BÀI BUỔI 2) - TIẾNG ANH 8 GLOBAL SUCCESS (2 CỘT) N...
GIÁO ÁN DẠY THÊM (KẾ HOẠCH BÀI BUỔI 2) - TIẾNG ANH 8 GLOBAL SUCCESS (2 CỘT) N...Nguyen Thanh Tu Collection
https://app.box.com/s/4hfk1xwgxnova7f4dm37birdzflj806wThesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
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!
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.
The French Revolution Class 9 Study Material pdf free download
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
How to Split Bills in the Odoo 17 POS Module
Bills have a main role in point of sale procedure. It will help to track sales, handling payments and giving receipts to customers. Bill splitting also has an important role in POS. For example, If some friends come together for dinner and if they want to divide the bill then it is possible by POS bill splitting. This slide will show how to split bills in odoo 17 POS.
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.
Unit 2- Research Aptitude (UGC NET Paper I).pdf
This slide describes the research aptitude of unit 2 in the UGC NET paper I.
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.
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
Ethnobotany and Ethnopharmacology ......
Ethnobotany and Ethnopharmacology:
Ethnobotany in herbal drug evaluation,
Impact of Ethnobotany in traditional medicine,
New development in herbals,
Bio-prospecting tools for drug discovery,
Role of Ethnopharmacology in drug evaluation,
Reverse Pharmacology.
2024.06.01 Introducing a competency framework for languag learning materials ...
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
ESC Beyond Borders _From EU to You_ InfoPack general.pdfFundacja Rozwoju Społeczeństwa Przedsiębiorczego
Wolontariat grupowyRecently uploaded (20)
Overview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with Mechanism
GIÁO ÁN DẠY THÊM (KẾ HOẠCH BÀI BUỔI 2) - TIẾNG ANH 8 GLOBAL SUCCESS (2 CỘT) N...
GIÁO ÁN DẠY THÊM (KẾ HOẠCH BÀI BUỔI 2) - TIẾNG ANH 8 GLOBAL SUCCESS (2 CỘT) N...
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
Basic phrases for greeting and assisting costumers
Basic phrases for greeting and assisting costumers
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
2024.06.01 Introducing a competency framework for languag learning materials ...
2024.06.01 Introducing a competency framework for languag learning materials ...
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
I am failing a few tests with my Double Linked List program. Can som.pdf
- 1. I am failing a few tests with my Double Linked List program. Can someone show me the following methods for doubly linked lists? (In Java) public void addAfter(Object element, Object target) public int indexOf(Object element) public void add(int index, Object element) public boolean contains(Object target) Thanks! Solution public class DoubleLinkedList { class Node{ Node next; Node prev; Object val; Node(){ next = null; prev = null; val = null; } } Node start = null; public DoubleLinkedList() { super(); this.start = null; } public void addAfter(Object element, Object target){ Node t = this.start;
- 2. while(!t.val.equals(target) && t != null){ t = t.next; } if(t == null) System.out.println("Target not found"); else{ Node temp = t; Node n = new Node(); n.val = element; n.prev = temp; n.next = temp.next; temp.next.prev = n; temp.next = n; } } public int indexOf(Object element){ int i = 0; Node t = start; while(t!=null){ i++; if(!t.val.equals(element)) t = t.next; else break; } if(t!=null) return i; else return -1; //return i; } public void add(int index, Object element){
- 3. //assume index starts from 1 Node t = start; int i = 0; if(index == 1) { Node n = new Node(); n.prev = null; n.val = element; n.next = start; start.prev = n; start = n; } else { while(i