Using Java programming language solve the followingSLL CLASS.pdf
•
0 likes•2 views
Using Java programming language solve the following: SLL CLASS: //************************** SLL.java ********************************* // a generic singly linked list class public class SLL { private class SLLNode { private T info; private SLLNode next; public SLLNode() { this(null,null); } public SLLNode(T el) { this(el,null); } public SLLNode(T el, SLLNode ptr) { info = el; next = ptr; } } protected SLLNode head, tail; public SLL() { head = tail = null; } public boolean isEmpty() { return head == null; } public void addToHead(T el) { head = new SLLNode(el,head); if (tail == null) tail = head; } public void addToTail(T el) { if (!isEmpty()) { tail.next = new SLLNode(el); tail = tail.next; } else head = tail = new SLLNode(el); } public T deleteFromHead() { // delete the head and return its info; if (isEmpty()) return null; T el = head.info; if (head == tail) // if only one node on the list; head = tail = null; else head = head.next; return el; } public T deleteFromTail() { // delete the tail and return its info; if (isEmpty()) return null; T el = tail.info; if (head == tail) // if only one node in the list; head = tail = null; else { // if more than one node in the list, SLLNode tmp; // find the predecessor of tail; for (tmp = head; tmp.next != tail; tmp = tmp.next); tail = tmp; // the predecessor of tail becomes tail; tail.next = null; } return el; } public void delete(T el) { // delete the node with an element el; if (!isEmpty()) if (head == tail && el.equals(head.info)) // if only one head = tail = null; // node on the list; else if (el.equals(head.info)) // if more than one node on the list; head = head.next; // and el is in the head node; else { // if more than one node in the list SLLNode pred, tmp;// and el is in a nonhead node; for (pred = head, tmp = head.next; tmp != null && !tmp.info.equals(el); pred = pred.next, tmp = tmp.next); if (tmp != null) { // if el was found; pred.next = tmp.next; if (tmp == tail) // if el is in the last node; tail = pred; } } } @Override public String toString() { if(head == null) return "[ ]"; String str = "[ "; SLLNode tmp = head; while(tmp != null){ str += tmp.info + " "; tmp = tmp.next; } return str+"]"; } public boolean contains(T el) { if(head == null) return false; SLLNode tmp = head; while(tmp != null){ if(tmp.info.equals(el)) return true; tmp = tmp.next; } return false; } public int size(){ if(head == null) return 0; int count = 0; SLLNode p = head; while(p != null) { count++; p = p.next; } return count; } } Part I: Programming Use the singly linked list class (Given below) to implement integers of unlimited size. Each node of the list should store one digit of the integer. You are required to implement the addition, subtraction and multiplication operations. In addition, provide a test class that will do the following: It will keep asking the user to enter two integers, choose one of the operations (addition, subtraction, multiplication) and then display the result. The program will stop upon e.
Report
Share
Report
Share
Download to read offline
Recommended
Solve using java and using this Singly linked list classpublic cl.pdf
Solve using java and using this Singly linked list class:
public class SLL {
private class SLLNode {
private T info;
private SLLNode next;
public SLLNode() {
this(null,null);
}
public SLLNode(T el) {
this(el,null);
}
public SLLNode(T el, SLLNode ptr) {
info = el; next = ptr;
}
}
protected SLLNode head, tail;
public SLL() {
head = tail = null;
}
public boolean isEmpty() {
return head == null;
}
public void addToHead(T el) {
head = new SLLNode(el,head);
if (tail == null)
tail = head;
}
public void addToTail(T el) {
if (!isEmpty()) {
tail.next = new SLLNode(el);
tail = tail.next;
}
else head = tail = new SLLNode(el);
}
public T deleteFromHead() { // delete the head and return its info;
if (isEmpty())
return null;
T el = head.info;
if (head == tail) // if only one node on the list;
head = tail = null;
else head = head.next;
return el;
}
public T deleteFromTail() { // delete the tail and return its info;
if (isEmpty())
return null;
T el = tail.info;
if (head == tail) // if only one node in the list;
head = tail = null;
else { // if more than one node in the list,
SLLNode tmp; // find the predecessor of tail;
for (tmp = head; tmp.next != tail; tmp = tmp.next);
tail = tmp; // the predecessor of tail becomes tail;
tail.next = null;
}
return el;
}
public void delete(T el) { // delete the node with an element el;
if (!isEmpty())
if (head == tail && el.equals(head.info)) // if only one
head = tail = null; // node on the list;
else if (el.equals(head.info)) // if more than one node on the list;
head = head.next; // and el is in the head node;
else { // if more than one node in the list
SLLNode pred, tmp;// and el is in a nonhead node;
for (pred = head, tmp = head.next;
tmp != null && !tmp.info.equals(el);
pred = pred.next, tmp = tmp.next);
if (tmp != null) { // if el was found;
pred.next = tmp.next;
if (tmp == tail) // if el is in the last node;
tail = pred;
}
}
}
@Override
public String toString() {
if(head == null)
return "[ ]";
String str = "[ ";
SLLNode tmp = head;
while(tmp != null){
str += tmp.info + " ";
tmp = tmp.next;
}
return str+"]";
}
public boolean contains(T el) {
if(head == null)
return false;
SLLNode tmp = head;
while(tmp != null){
if(tmp.info.equals(el))
return true;
tmp = tmp.next;
}
return false;
}
public int size(){
if(head == null)
return 0;
int count = 0;
SLLNode p = head;
while(p != null) {
count++;
p = p.next;
}
return count;
}
} The following Questions have to be Solved and Submitted: Part I: Programming ( 50 points)
Use the singly linked list class introduced in the lab to implement integers of unlimited size.
Each node of the list should store one digit of the integer. You are to implement the addition,
subtraction and multiplication operations. Please note that any additional data structure to be
used in solving this problem has to be taken from the ones introduced in the ICS 202 lab. In
addition, provide a test class that will do the following: It will keep asking the user to enter two
integers, choose one of the operations (.
Solve using Java programming language- ----------------------------.pdf
Solve using Java programming language.
//************************** SLL.java *********************************
// a generic singly linked list class
public class SLL<T> {
private class SLLNode<T> {
private T info;
private SLLNode<T> next;
public SLLNode() {
this(null,null);
}
public SLLNode(T el) {
this(el,null);
}
public SLLNode(T el, SLLNode<T> ptr) {
info = el; next = ptr;
}
}
protected SLLNode<T> head, tail;
public SLL() {
head = tail = null;
}
public boolean isEmpty() {
return head == null;
}
public void addToHead(T el) {
head = new SLLNode<T>(el,head);
if (tail == null)
tail = head;
}
public void addToTail(T el) {
if (!isEmpty()) {
tail.next = new SLLNode<T>(el);
tail = tail.next;
}
else head = tail = new SLLNode<T>(el);
}
public T deleteFromHead() { // delete the head and return its info;
if (isEmpty())
return null;
T el = head.info;
if (head == tail) // if only one node on the list;
head = tail = null;
else head = head.next;
return el;
}
public T deleteFromTail() { // delete the tail and return its info;
if (isEmpty())
return null;
T el = tail.info;
if (head == tail) // if only one node in the list;
head = tail = null;
else { // if more than one node in the list,
SLLNode<T> tmp; // find the predecessor of tail;
for (tmp = head; tmp.next != tail; tmp = tmp.next);
tail = tmp; // the predecessor of tail becomes tail;
tail.next = null;
}
return el;
}
public void delete(T el) { // delete the node with an element el;
if (!isEmpty())
if (head == tail && el.equals(head.info)) // if only one
head = tail = null; // node on the list;
else if (el.equals(head.info)) // if more than one node on the list;
head = head.next; // and el is in the head node;
else { // if more than one node in the list
SLLNode<T> pred, tmp;// and el is in a nonhead node;
for (pred = head, tmp = head.next;
tmp != null && !tmp.info.equals(el);
pred = pred.next, tmp = tmp.next);
if (tmp != null) { // if el was found;
pred.next = tmp.next;
if (tmp == tail) // if el is in the last node;
tail = pred;
}
}
}
@Override
public String toString() {
if(head == null)
return "[ ]";
String str = "[ ";
SLLNode<T> tmp = head;
while(tmp != null){
str += tmp.info + " ";
tmp = tmp.next;
}
return str+"]";
}
public boolean contains(T el) {
if(head == null)
return false;
SLLNode<T> tmp = head;
while(tmp != null){
if(tmp.info.equals(el))
return true;
tmp = tmp.next;
}
return false;
}
public int size(){
if(head == null)
return 0;
int count = 0;
SLLNode<T> p = head;
while(p != null) {
count++;
p = p.next;
}
return count;
}
}
Given the code above, solve the following tasks (please show the solution for every task
clearly):
For part (c) this is the code for the test program:
public class SLL_Driver {
public static void main(String[] args) {
SLL<String> myList = new SLL<String>();
String[] cityNames = {"Jubail", "Riyadh", "Abha", "Dammam", "Taif"};
for(int i = 0; i < cityNames.length; i++)
myList.addToHead(cityNames[i]);
System.out.println("The list is: " + myList);
System.out.println("It is " + myLis.
-JAVA-provide a test class that do the required -you may add met.pdf
-JAVA-
provide a test class that do the required
-you may add methods you need in the SLL-
//************************** SLL.java *********************************
// a generic singly linked list class
public class SLL{
private class SLLNode {
private T info;
private SLLNode next;
public SLLNode() {
this(null,null);
}
public SLLNode(T el) {
this(el,null);
}
public SLLNode(T el, SLLNode ptr) {
info = el; next = ptr;
}
}
protected SLLNode head, tail;
public SLL() {
head = tail = null;
}
public boolean isEmpty() {
return head == null;
}
public void addToHead(T el) {
head = new SLLNode(el,head);
if (tail == null)
tail = head;
}
public void addToTail(T el) {
if (!isEmpty()) {
tail.next = new SLLNode(el);
tail = tail.next;
}
else head = tail = new SLLNode(el);
}
public T deleteFromHead() { // delete the head and return its info;
if (isEmpty())
return null;
T el = head.info;
if (head == tail) // if only one node on the list;
head = tail = null;
else head = head.next;
return el;
}
public T deleteFromTail() { // delete the tail and return its info;
if (isEmpty())
return null;
T el = tail.info;
if (head == tail) // if only one node in the list;
head = tail = null;
else { // if more than one node in the list,
SLLNode tmp; // find the predecessor of tail;
for (tmp = head; tmp.next != tail; tmp = tmp.next);
tail = tmp; // the predecessor of tail becomes tail;
tail.next = null;
}
return el;
}
public void delete(T el) { // delete the node with an element el;
if (!isEmpty())
if (head == tail && el.equals(head.info)) // if only one
head = tail = null; // node on the list;
else if (el.equals(head.info)) // if more than one node on the list;
head = head.next; // and el is in the head node;
else { // if more than one node in the list
SLLNode pred, tmp;// and el is in a nonhead node;
for (pred = head, tmp = head.next;
tmp != null && !tmp.info.equals(el);
pred = pred.next, tmp = tmp.next);
if (tmp != null) { // if el was found;
pred.next = tmp.next;
if (tmp == tail) // if el is in the last node;
tail = pred;
}
}
}
@Override
public String toString() {
if(head == null)
return "[ ]";
String str = "[ ";
SLLNode tmp = head;
while(tmp != null){
str += tmp.info + " ";
tmp = tmp.next;
}
return str+"]";
}
public boolean contains(T el) {
if(head == null)
return false;
SLLNode tmp = head;
while(tmp != null){
if(tmp.info.equals(el))
return true;
tmp = tmp.next;
}
return false;
}
public int size(){
if(head == null)
return 0;
int count = 0;
SLLNode p = head;
while(p != null) {
count++;
p = p.next;
}
return count;
}
//
// Please write the methods of Task02 here:
//
public void insertBefore(int index, T newElem) throws Exception {
//throws exception if the list is empty
if(isEmpty()){
throw new Exception("list is empty");
}
//inserts
if(index < size()){
if (index == 0){
SLLNode newnode = new SLLNode<>(newElem, head);
head = newnode;
}
else{
SLLNode temp = head;
SLLNode newnode = new SLLNode<>(newElem, null);
for (int i = 0; i < index - 1; i++) {
temp = temp.next;
}
newnode.next = .
Submit1) Java Files2) Doc file with the following contents.pdf
Submit:
1) Java Files
2) Doc file with the following contents:
//************************** SLL.java *********************************
// a generic singly linked list class
public class SLL {
private class SLLNode {
private T info;
private SLLNode next;
public SLLNode() {
this(null,null);
}
public SLLNode(T el) {
this(el,null);
}
public SLLNode(T el, SLLNode ptr) {
info = el; next = ptr;
}
}
protected SLLNode head, tail;
public SLL() {
head = tail = null;
}
public boolean isEmpty() {
return head == null;
}
public void addToHead(T el) {
head = new SLLNode(el,head);
if (tail == null)
tail = head;
}
public void addToTail(T el) {
if (!isEmpty()) {
tail.next = new SLLNode(el);
tail = tail.next;
}
else head = tail = new SLLNode(el);
}
public T deleteFromHead() { // delete the head and return its info;
if (isEmpty())
return null;
T el = head.info;
if (head == tail) // if only one node on the list;
head = tail = null;
else head = head.next;
return el;
}
public T deleteFromTail() { // delete the tail and return its info;
if (isEmpty())
return null;
T el = tail.info;
if (head == tail) // if only one node in the list;
head = tail = null;
else { // if more than one node in the list,
SLLNode tmp; // find the predecessor of tail;
for (tmp = head; tmp.next != tail; tmp = tmp.next);
tail = tmp; // the predecessor of tail becomes tail;
tail.next = null;
}
return el;
}
public void delete(T el) { // delete the node with an element el;
if (!isEmpty())
if (head == tail && el.equals(head.info)) // if only one
head = tail = null; // node on the list;
else if (el.equals(head.info)) // if more than one node on the list;
head = head.next; // and el is in the head node;
else { // if more than one node in the list
SLLNode pred, tmp;// and el is in a nonhead node;
for (pred = head, tmp = head.next;
tmp != null && !tmp.info.equals(el);
pred = pred.next, tmp = tmp.next);
if (tmp != null) { // if el was found;
pred.next = tmp.next;
if (tmp == tail) // if el is in the last node;
tail = pred;
}
}
}
@Override
public String toString() {
if(head == null)
return "[ ]";
String str = "[ ";
SLLNode tmp = head;
while(tmp != null){
str += tmp.info + " ";
tmp = tmp.next;
}
return str+"]";
}
public boolean contains(T el) {
if(head == null)
return false;
SLLNode tmp = head;
while(tmp != null){
if(tmp.info.equals(el))
return true;
tmp = tmp.next;
}
return false;
}
public int size(){
if(head == null)
return 0;
int count = 0;
SLLNode p = head;
while(p != null) {
count++;
p = p.next;
}
return count;
}
}
public class SLL_Driver {
public static void main(String[] args) {
SLL myList = new SLL();
String[] cityNames = {"Jubail", "Riyadh", "Abha", "Dammam", "Taif"};
for(int i = 0; i < cityNames.length; i++)
myList.addToHead(cityNames[i]);
System.out.println("The list is: " + myList);
System.out.println("It is " + myList.contains("Dammam") + " that the list contains
Dammam.");
System.out.println("It is " + myList.contains("Jeddah") + " that the list contains Jeddah.");
}
}
// Java program to implem.
Use the singly linked list class introduced in the lab to implement .pdf
Use the singly linked list class introduced in the lab to implement integers of unlimited size.
Each node of the list should store one digit of the integer. You are to implement the addition,
subtraction and multiplication operations. Please note that any additional data structure to be
used in solving this problem has to be taken from the ones introduced in the ICS 202 lab. In
addition, provide a test class that will do the following: It will keep asking the user to enter two
integers, choose one of the operations (addition, subtraction, multiplication) and then display the
result. The program will stop upon entering the # character (without the double quotes).
this singly linked list class:
public class SLL {
private class SLLNode {
private T info;
private SLLNode next;
int value;
public SLLNode() {
this(null, null);
}
public SLLNode(T el) {
this(el, null);
}
public SLLNode(T el, SLLNode ptr) {
info = el;
next = ptr;
}
}
protected SLLNode head, tail;
public SLL() {
head = tail = null;
}
public boolean isEmpty() {
return head == null;
}
public void addToHead(T el) {
head = new SLLNode(el, head);
if (tail == null)
tail = head;
}
public void addToTail(T el) {
if (!isEmpty()) {
tail.next = new SLLNode(el);
tail = tail.next;
} else
head = tail = new SLLNode(el);
}
public T deleteFromHead() { // delete the head and return its info;
if (isEmpty())
return null;
T el = head.info;
if (head == tail) // if only one node on the list;
head = tail = null;
else
head = head.next;
return el;
}
public T deleteFromTail() { // delete the tail and return its info;
if (isEmpty())
return null;
T el = tail.info;
if (head == tail) // if only one node in the list;
head = tail = null;
else { // if more than one node in the list,
SLLNode tmp; // find the predecessor of tail;
for (tmp = head; tmp.next != tail; tmp = tmp.next)
;
tail = tmp; // the predecessor of tail becomes tail;
tail.next = null;
}
return el;
}
public void delete(T el) { // delete the node with an element el;
if (!isEmpty())
if (head == tail && el.equals(head.info)) // if only one
head = tail = null; // node on the list;
else if (el.equals(head.info)) // if more than one node on the list;
head = head.next; // and el is in the head node;
else { // if more than one node in the list
SLLNode pred, tmp;// and el is in a nonhead node;
for (pred = head, tmp = head.next; tmp != null
&& !tmp.info.equals(el); pred = pred.next, tmp = tmp.next)
;
if (tmp != null) { // if el was found;
pred.next = tmp.next;
if (tmp == tail) // if el is in the last node;
tail = pred;
}
}
}
@Override
public String toString() {
if (head == null)
return "[ ]";
String str = "[ ";
SLLNode tmp = head;
while (tmp != null) {
str += tmp.info + " ";
tmp = tmp.next;
}
return str + "]";
}
public boolean contains(T el) {
if (head == null)
return false;
SLLNode tmp = head;
while (tmp != null) {
if (tmp.info.equals(el))
return true;
tmp = tmp.next;
}
return false;
}
public int size() {
if (head == null)
return 0;
int count = 0;
SLLNode p = head;
w.
public class SLLT { protected SLLNodeT head, tail; pub.pdf
public class SLL { protected SLLNode head, tail; public SLL() { head = tail = null;
} public void addToTail(T e){ SLLNode newNode = new SLLNode(e); if(head ==
null) head = tail = newNode; else{ tail.next = newNode; tail =
tail.next; } } public void addToHead(T e) { SLLNode newNode = new
SLLNode(e, head); if(head == null) tail = newNode; head = newNode; }
public String toString(){ if (head == null) return "[]"; String out = "[";
SLLNode p = head; while (p.next != null){ out += p.info + " "; p = p.next;
} out += p.info + "]"; return out; } }
public class SLLNode { protected T info; protected SLLNode next; public SLLNode() {
this(null, null); } public SLLNode(T e) { this(e, null); } public SLLNode(T
e, SLLNode ptr) { info = e; next = ptr; } }
public class SortedSLL> extends SLL{ public void insert(T e){ } public void
merge(SortedSLL list){ } }
public class SortedSLL T extends Comparable T extends SLLT{ public void insert (T e) \{ \}
public void merge(SortedSLL T list) \{ \} public class SortedSLL T extends Comparable T
extends SLLT{ public void insert ( T e) \{ \} public void merge(SortedSLL T list) \{ \} \}
ublic class SLLT{ protected SLLNodeT head, tail; public SLL() \{ head = tail = null; \} public
void addToTail( T e) \{ SLLNode newNode = new SLLNodeT(e); if ( head == null) head = tail
= newNode; else\{ tail. next = newNode; tail = tail. next; \} \} public void addToHead( T e) \{
SLLNode T newNode = new SLLNodeT(e, head ); if (head == null) tail = newNode; head =
newNode; \} public string tostring()\{ if (head == null) return "[]"; String out = "["; SLLNode
Tp= head; while (p.next != null) \{ out +=p.info +" "; p=p next; \} out += p.info + "]"; return out;
\}
ublic class SLLNode T{ protected T info; protected SLLNode T next; public SLLNode() \{
this(null, null); \} public SLLNode( T e) \{ this (e, null); \} public SLLNode( T e, SLLNode T
ptr ){ info =e; next =ptr; \}
Write a subclass of SLL named SortedSLL that represents a sorted SinglyLinkedList (sorted in
nondecending order). The class should contain the following methods: 1- [40 Points] void insert
( T e) that inserts an SLLNode in its correct position so that the resulting list remains sorted.
Make sure to consider special cases such as: - The list is empty. - The list has one element. - The
inserted element is smaller than the head, or larger than the tail.. 2- [60 Points] void
merge(SortedSLL T list) that merges the calling list with the argument list. Note that this can be
done by calling the insert method for each element in list, but this is highly ineffiecient, answer
the following question: Q2.1: What is the complexity of this approach? Explain. [10 Points]
Instead, you should come up with a solution that traverse both lists just one time. Furthermore,
the argument list should be empty after the merge is completed. Q2.2: What is the complexity of
this approach? Explain. [10 Points] Hint: Make sure the class SortedSLL accepts types T that is
comparable. You can do this by writing .
Help explain the code with line comments public class CompletedLis.pdf
Help explain the code with line comments
public class CompletedList implements ListADT, Iterable
{
//Three instance variables
protected int count;
protected int modChange;
protected DoubleLinearNode head, tail;
//head and tail set to empty count set to zero
public CompletedList() {
head = tail = null;
count = 0;
}
//Override for head and tail, remove first number of list
@Override
public T removeFirst() throws NoSuchElementException
{
//if head is empty return error
if(isEmpty())
throw new NoSuchElementException("The collection is empty");
//Temp for each number set to head item
T temp = head.getItem();
//if first number equals last they are null
if(head == tail)
{
head = tail = null;
}
//else the ne
else if(head.getNext() == tail)
{
head.remove();
head = tail;
}
else
{
head = head.getNext();
head.getPrev().remove();
}
count--;
modChange++;
return temp;
}
@Override
public T removeLast() throws NoSuchElementException
{
if(isEmpty())
throw new NoSuchElementException("The collection is empty");
T temp = tail.getItem();
if(head == tail)
{
head = tail = null;
}
else if(head.getNext() == tail){
tail.remove();
tail = head;
}
else
{
tail = tail.getPrev();
tail.getNext().remove();
}
count--;
modChange++;
return temp;
}
@Override
public T remove( T element )
{
if(isEmpty())
throw new NoSuchElementException("The target is not in the collection");
if(tail.getItem().equals(element))
{
return removeLast();
}
for (DoubleLinearNode current = head; current != null; current = current.getNext())
{
if(current.getItem().equals(element))
{
if(current == head)
{
return removeFirst();
}
else
{
count--;
modChange++;
return current.remove();
}
}
}
throw new NoSuchElementException("The target is not in the collection");
}
@Override
public T first()
{
if (isEmpty())
throw new NoSuchElementException("The collection is empty");
return head.getItem();
}
@Override
public T last()
{
if (isEmpty())
throw new NoSuchElementException("The collection is empty");
return tail.getItem();
}
@Override
public boolean contains( T target )
{
if(isEmpty())
return false;
if(tail.getItem().equals(target))
{
return true;
}
for (DoubleLinearNode current = head; current != null; current = current.getNext())
{
if(current.getItem().equals(target))
{
return true;
}
}
return false;
}
@Override
public boolean isEmpty()
{
return count == 0;
}
@Override
public int size()
{
return count;
}
@Override
public Iterator iterator()
{
return new ListIterator(head);
}
@Override
public String toString()
{
StringBuilder sb = new StringBuilder();
for (DoubleLinearNode current = head; current != null; current = current.getNext())
{
sb.append(current.getItem()).append(' ');
}
return sb.toString();
}
private class ListIterator implements Iterator
{
private DoubleLinearNode current;
private int modNum;
public ListIterator( DoubleLinearNode node)
{
this.modNum = modChange;
this.current = node;
}
@Override
public boolean hasNext()
{
if(this.modNum != modChange)
throw new ConcurrentModificationException("The collection.
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..
Recommended
Solve using java and using this Singly linked list classpublic cl.pdf
Solve using java and using this Singly linked list class:
public class SLL {
private class SLLNode {
private T info;
private SLLNode next;
public SLLNode() {
this(null,null);
}
public SLLNode(T el) {
this(el,null);
}
public SLLNode(T el, SLLNode ptr) {
info = el; next = ptr;
}
}
protected SLLNode head, tail;
public SLL() {
head = tail = null;
}
public boolean isEmpty() {
return head == null;
}
public void addToHead(T el) {
head = new SLLNode(el,head);
if (tail == null)
tail = head;
}
public void addToTail(T el) {
if (!isEmpty()) {
tail.next = new SLLNode(el);
tail = tail.next;
}
else head = tail = new SLLNode(el);
}
public T deleteFromHead() { // delete the head and return its info;
if (isEmpty())
return null;
T el = head.info;
if (head == tail) // if only one node on the list;
head = tail = null;
else head = head.next;
return el;
}
public T deleteFromTail() { // delete the tail and return its info;
if (isEmpty())
return null;
T el = tail.info;
if (head == tail) // if only one node in the list;
head = tail = null;
else { // if more than one node in the list,
SLLNode tmp; // find the predecessor of tail;
for (tmp = head; tmp.next != tail; tmp = tmp.next);
tail = tmp; // the predecessor of tail becomes tail;
tail.next = null;
}
return el;
}
public void delete(T el) { // delete the node with an element el;
if (!isEmpty())
if (head == tail && el.equals(head.info)) // if only one
head = tail = null; // node on the list;
else if (el.equals(head.info)) // if more than one node on the list;
head = head.next; // and el is in the head node;
else { // if more than one node in the list
SLLNode pred, tmp;// and el is in a nonhead node;
for (pred = head, tmp = head.next;
tmp != null && !tmp.info.equals(el);
pred = pred.next, tmp = tmp.next);
if (tmp != null) { // if el was found;
pred.next = tmp.next;
if (tmp == tail) // if el is in the last node;
tail = pred;
}
}
}
@Override
public String toString() {
if(head == null)
return "[ ]";
String str = "[ ";
SLLNode tmp = head;
while(tmp != null){
str += tmp.info + " ";
tmp = tmp.next;
}
return str+"]";
}
public boolean contains(T el) {
if(head == null)
return false;
SLLNode tmp = head;
while(tmp != null){
if(tmp.info.equals(el))
return true;
tmp = tmp.next;
}
return false;
}
public int size(){
if(head == null)
return 0;
int count = 0;
SLLNode p = head;
while(p != null) {
count++;
p = p.next;
}
return count;
}
} The following Questions have to be Solved and Submitted: Part I: Programming ( 50 points)
Use the singly linked list class introduced in the lab to implement integers of unlimited size.
Each node of the list should store one digit of the integer. You are to implement the addition,
subtraction and multiplication operations. Please note that any additional data structure to be
used in solving this problem has to be taken from the ones introduced in the ICS 202 lab. In
addition, provide a test class that will do the following: It will keep asking the user to enter two
integers, choose one of the operations (.
Solve using Java programming language- ----------------------------.pdf
Solve using Java programming language.
//************************** SLL.java *********************************
// a generic singly linked list class
public class SLL<T> {
private class SLLNode<T> {
private T info;
private SLLNode<T> next;
public SLLNode() {
this(null,null);
}
public SLLNode(T el) {
this(el,null);
}
public SLLNode(T el, SLLNode<T> ptr) {
info = el; next = ptr;
}
}
protected SLLNode<T> head, tail;
public SLL() {
head = tail = null;
}
public boolean isEmpty() {
return head == null;
}
public void addToHead(T el) {
head = new SLLNode<T>(el,head);
if (tail == null)
tail = head;
}
public void addToTail(T el) {
if (!isEmpty()) {
tail.next = new SLLNode<T>(el);
tail = tail.next;
}
else head = tail = new SLLNode<T>(el);
}
public T deleteFromHead() { // delete the head and return its info;
if (isEmpty())
return null;
T el = head.info;
if (head == tail) // if only one node on the list;
head = tail = null;
else head = head.next;
return el;
}
public T deleteFromTail() { // delete the tail and return its info;
if (isEmpty())
return null;
T el = tail.info;
if (head == tail) // if only one node in the list;
head = tail = null;
else { // if more than one node in the list,
SLLNode<T> tmp; // find the predecessor of tail;
for (tmp = head; tmp.next != tail; tmp = tmp.next);
tail = tmp; // the predecessor of tail becomes tail;
tail.next = null;
}
return el;
}
public void delete(T el) { // delete the node with an element el;
if (!isEmpty())
if (head == tail && el.equals(head.info)) // if only one
head = tail = null; // node on the list;
else if (el.equals(head.info)) // if more than one node on the list;
head = head.next; // and el is in the head node;
else { // if more than one node in the list
SLLNode<T> pred, tmp;// and el is in a nonhead node;
for (pred = head, tmp = head.next;
tmp != null && !tmp.info.equals(el);
pred = pred.next, tmp = tmp.next);
if (tmp != null) { // if el was found;
pred.next = tmp.next;
if (tmp == tail) // if el is in the last node;
tail = pred;
}
}
}
@Override
public String toString() {
if(head == null)
return "[ ]";
String str = "[ ";
SLLNode<T> tmp = head;
while(tmp != null){
str += tmp.info + " ";
tmp = tmp.next;
}
return str+"]";
}
public boolean contains(T el) {
if(head == null)
return false;
SLLNode<T> tmp = head;
while(tmp != null){
if(tmp.info.equals(el))
return true;
tmp = tmp.next;
}
return false;
}
public int size(){
if(head == null)
return 0;
int count = 0;
SLLNode<T> p = head;
while(p != null) {
count++;
p = p.next;
}
return count;
}
}
Given the code above, solve the following tasks (please show the solution for every task
clearly):
For part (c) this is the code for the test program:
public class SLL_Driver {
public static void main(String[] args) {
SLL<String> myList = new SLL<String>();
String[] cityNames = {"Jubail", "Riyadh", "Abha", "Dammam", "Taif"};
for(int i = 0; i < cityNames.length; i++)
myList.addToHead(cityNames[i]);
System.out.println("The list is: " + myList);
System.out.println("It is " + myLis.
-JAVA-provide a test class that do the required -you may add met.pdf
-JAVA-
provide a test class that do the required
-you may add methods you need in the SLL-
//************************** SLL.java *********************************
// a generic singly linked list class
public class SLL{
private class SLLNode {
private T info;
private SLLNode next;
public SLLNode() {
this(null,null);
}
public SLLNode(T el) {
this(el,null);
}
public SLLNode(T el, SLLNode ptr) {
info = el; next = ptr;
}
}
protected SLLNode head, tail;
public SLL() {
head = tail = null;
}
public boolean isEmpty() {
return head == null;
}
public void addToHead(T el) {
head = new SLLNode(el,head);
if (tail == null)
tail = head;
}
public void addToTail(T el) {
if (!isEmpty()) {
tail.next = new SLLNode(el);
tail = tail.next;
}
else head = tail = new SLLNode(el);
}
public T deleteFromHead() { // delete the head and return its info;
if (isEmpty())
return null;
T el = head.info;
if (head == tail) // if only one node on the list;
head = tail = null;
else head = head.next;
return el;
}
public T deleteFromTail() { // delete the tail and return its info;
if (isEmpty())
return null;
T el = tail.info;
if (head == tail) // if only one node in the list;
head = tail = null;
else { // if more than one node in the list,
SLLNode tmp; // find the predecessor of tail;
for (tmp = head; tmp.next != tail; tmp = tmp.next);
tail = tmp; // the predecessor of tail becomes tail;
tail.next = null;
}
return el;
}
public void delete(T el) { // delete the node with an element el;
if (!isEmpty())
if (head == tail && el.equals(head.info)) // if only one
head = tail = null; // node on the list;
else if (el.equals(head.info)) // if more than one node on the list;
head = head.next; // and el is in the head node;
else { // if more than one node in the list
SLLNode pred, tmp;// and el is in a nonhead node;
for (pred = head, tmp = head.next;
tmp != null && !tmp.info.equals(el);
pred = pred.next, tmp = tmp.next);
if (tmp != null) { // if el was found;
pred.next = tmp.next;
if (tmp == tail) // if el is in the last node;
tail = pred;
}
}
}
@Override
public String toString() {
if(head == null)
return "[ ]";
String str = "[ ";
SLLNode tmp = head;
while(tmp != null){
str += tmp.info + " ";
tmp = tmp.next;
}
return str+"]";
}
public boolean contains(T el) {
if(head == null)
return false;
SLLNode tmp = head;
while(tmp != null){
if(tmp.info.equals(el))
return true;
tmp = tmp.next;
}
return false;
}
public int size(){
if(head == null)
return 0;
int count = 0;
SLLNode p = head;
while(p != null) {
count++;
p = p.next;
}
return count;
}
//
// Please write the methods of Task02 here:
//
public void insertBefore(int index, T newElem) throws Exception {
//throws exception if the list is empty
if(isEmpty()){
throw new Exception("list is empty");
}
//inserts
if(index < size()){
if (index == 0){
SLLNode newnode = new SLLNode<>(newElem, head);
head = newnode;
}
else{
SLLNode temp = head;
SLLNode newnode = new SLLNode<>(newElem, null);
for (int i = 0; i < index - 1; i++) {
temp = temp.next;
}
newnode.next = .
Submit1) Java Files2) Doc file with the following contents.pdf
Submit:
1) Java Files
2) Doc file with the following contents:
//************************** SLL.java *********************************
// a generic singly linked list class
public class SLL {
private class SLLNode {
private T info;
private SLLNode next;
public SLLNode() {
this(null,null);
}
public SLLNode(T el) {
this(el,null);
}
public SLLNode(T el, SLLNode ptr) {
info = el; next = ptr;
}
}
protected SLLNode head, tail;
public SLL() {
head = tail = null;
}
public boolean isEmpty() {
return head == null;
}
public void addToHead(T el) {
head = new SLLNode(el,head);
if (tail == null)
tail = head;
}
public void addToTail(T el) {
if (!isEmpty()) {
tail.next = new SLLNode(el);
tail = tail.next;
}
else head = tail = new SLLNode(el);
}
public T deleteFromHead() { // delete the head and return its info;
if (isEmpty())
return null;
T el = head.info;
if (head == tail) // if only one node on the list;
head = tail = null;
else head = head.next;
return el;
}
public T deleteFromTail() { // delete the tail and return its info;
if (isEmpty())
return null;
T el = tail.info;
if (head == tail) // if only one node in the list;
head = tail = null;
else { // if more than one node in the list,
SLLNode tmp; // find the predecessor of tail;
for (tmp = head; tmp.next != tail; tmp = tmp.next);
tail = tmp; // the predecessor of tail becomes tail;
tail.next = null;
}
return el;
}
public void delete(T el) { // delete the node with an element el;
if (!isEmpty())
if (head == tail && el.equals(head.info)) // if only one
head = tail = null; // node on the list;
else if (el.equals(head.info)) // if more than one node on the list;
head = head.next; // and el is in the head node;
else { // if more than one node in the list
SLLNode pred, tmp;// and el is in a nonhead node;
for (pred = head, tmp = head.next;
tmp != null && !tmp.info.equals(el);
pred = pred.next, tmp = tmp.next);
if (tmp != null) { // if el was found;
pred.next = tmp.next;
if (tmp == tail) // if el is in the last node;
tail = pred;
}
}
}
@Override
public String toString() {
if(head == null)
return "[ ]";
String str = "[ ";
SLLNode tmp = head;
while(tmp != null){
str += tmp.info + " ";
tmp = tmp.next;
}
return str+"]";
}
public boolean contains(T el) {
if(head == null)
return false;
SLLNode tmp = head;
while(tmp != null){
if(tmp.info.equals(el))
return true;
tmp = tmp.next;
}
return false;
}
public int size(){
if(head == null)
return 0;
int count = 0;
SLLNode p = head;
while(p != null) {
count++;
p = p.next;
}
return count;
}
}
public class SLL_Driver {
public static void main(String[] args) {
SLL myList = new SLL();
String[] cityNames = {"Jubail", "Riyadh", "Abha", "Dammam", "Taif"};
for(int i = 0; i < cityNames.length; i++)
myList.addToHead(cityNames[i]);
System.out.println("The list is: " + myList);
System.out.println("It is " + myList.contains("Dammam") + " that the list contains
Dammam.");
System.out.println("It is " + myList.contains("Jeddah") + " that the list contains Jeddah.");
}
}
// Java program to implem.
Use the singly linked list class introduced in the lab to implement .pdf
Use the singly linked list class introduced in the lab to implement integers of unlimited size.
Each node of the list should store one digit of the integer. You are to implement the addition,
subtraction and multiplication operations. Please note that any additional data structure to be
used in solving this problem has to be taken from the ones introduced in the ICS 202 lab. In
addition, provide a test class that will do the following: It will keep asking the user to enter two
integers, choose one of the operations (addition, subtraction, multiplication) and then display the
result. The program will stop upon entering the # character (without the double quotes).
this singly linked list class:
public class SLL {
private class SLLNode {
private T info;
private SLLNode next;
int value;
public SLLNode() {
this(null, null);
}
public SLLNode(T el) {
this(el, null);
}
public SLLNode(T el, SLLNode ptr) {
info = el;
next = ptr;
}
}
protected SLLNode head, tail;
public SLL() {
head = tail = null;
}
public boolean isEmpty() {
return head == null;
}
public void addToHead(T el) {
head = new SLLNode(el, head);
if (tail == null)
tail = head;
}
public void addToTail(T el) {
if (!isEmpty()) {
tail.next = new SLLNode(el);
tail = tail.next;
} else
head = tail = new SLLNode(el);
}
public T deleteFromHead() { // delete the head and return its info;
if (isEmpty())
return null;
T el = head.info;
if (head == tail) // if only one node on the list;
head = tail = null;
else
head = head.next;
return el;
}
public T deleteFromTail() { // delete the tail and return its info;
if (isEmpty())
return null;
T el = tail.info;
if (head == tail) // if only one node in the list;
head = tail = null;
else { // if more than one node in the list,
SLLNode tmp; // find the predecessor of tail;
for (tmp = head; tmp.next != tail; tmp = tmp.next)
;
tail = tmp; // the predecessor of tail becomes tail;
tail.next = null;
}
return el;
}
public void delete(T el) { // delete the node with an element el;
if (!isEmpty())
if (head == tail && el.equals(head.info)) // if only one
head = tail = null; // node on the list;
else if (el.equals(head.info)) // if more than one node on the list;
head = head.next; // and el is in the head node;
else { // if more than one node in the list
SLLNode pred, tmp;// and el is in a nonhead node;
for (pred = head, tmp = head.next; tmp != null
&& !tmp.info.equals(el); pred = pred.next, tmp = tmp.next)
;
if (tmp != null) { // if el was found;
pred.next = tmp.next;
if (tmp == tail) // if el is in the last node;
tail = pred;
}
}
}
@Override
public String toString() {
if (head == null)
return "[ ]";
String str = "[ ";
SLLNode tmp = head;
while (tmp != null) {
str += tmp.info + " ";
tmp = tmp.next;
}
return str + "]";
}
public boolean contains(T el) {
if (head == null)
return false;
SLLNode tmp = head;
while (tmp != null) {
if (tmp.info.equals(el))
return true;
tmp = tmp.next;
}
return false;
}
public int size() {
if (head == null)
return 0;
int count = 0;
SLLNode p = head;
w.
public class SLLT { protected SLLNodeT head, tail; pub.pdf
public class SLL { protected SLLNode head, tail; public SLL() { head = tail = null;
} public void addToTail(T e){ SLLNode newNode = new SLLNode(e); if(head ==
null) head = tail = newNode; else{ tail.next = newNode; tail =
tail.next; } } public void addToHead(T e) { SLLNode newNode = new
SLLNode(e, head); if(head == null) tail = newNode; head = newNode; }
public String toString(){ if (head == null) return "[]"; String out = "[";
SLLNode p = head; while (p.next != null){ out += p.info + " "; p = p.next;
} out += p.info + "]"; return out; } }
public class SLLNode { protected T info; protected SLLNode next; public SLLNode() {
this(null, null); } public SLLNode(T e) { this(e, null); } public SLLNode(T
e, SLLNode ptr) { info = e; next = ptr; } }
public class SortedSLL> extends SLL{ public void insert(T e){ } public void
merge(SortedSLL list){ } }
public class SortedSLL T extends Comparable T extends SLLT{ public void insert (T e) \{ \}
public void merge(SortedSLL T list) \{ \} public class SortedSLL T extends Comparable T
extends SLLT{ public void insert ( T e) \{ \} public void merge(SortedSLL T list) \{ \} \}
ublic class SLLT{ protected SLLNodeT head, tail; public SLL() \{ head = tail = null; \} public
void addToTail( T e) \{ SLLNode newNode = new SLLNodeT(e); if ( head == null) head = tail
= newNode; else\{ tail. next = newNode; tail = tail. next; \} \} public void addToHead( T e) \{
SLLNode T newNode = new SLLNodeT(e, head ); if (head == null) tail = newNode; head =
newNode; \} public string tostring()\{ if (head == null) return "[]"; String out = "["; SLLNode
Tp= head; while (p.next != null) \{ out +=p.info +" "; p=p next; \} out += p.info + "]"; return out;
\}
ublic class SLLNode T{ protected T info; protected SLLNode T next; public SLLNode() \{
this(null, null); \} public SLLNode( T e) \{ this (e, null); \} public SLLNode( T e, SLLNode T
ptr ){ info =e; next =ptr; \}
Write a subclass of SLL named SortedSLL that represents a sorted SinglyLinkedList (sorted in
nondecending order). The class should contain the following methods: 1- [40 Points] void insert
( T e) that inserts an SLLNode in its correct position so that the resulting list remains sorted.
Make sure to consider special cases such as: - The list is empty. - The list has one element. - The
inserted element is smaller than the head, or larger than the tail.. 2- [60 Points] void
merge(SortedSLL T list) that merges the calling list with the argument list. Note that this can be
done by calling the insert method for each element in list, but this is highly ineffiecient, answer
the following question: Q2.1: What is the complexity of this approach? Explain. [10 Points]
Instead, you should come up with a solution that traverse both lists just one time. Furthermore,
the argument list should be empty after the merge is completed. Q2.2: What is the complexity of
this approach? Explain. [10 Points] Hint: Make sure the class SortedSLL accepts types T that is
comparable. You can do this by writing .
Help explain the code with line comments public class CompletedLis.pdf
Help explain the code with line comments
public class CompletedList implements ListADT, Iterable
{
//Three instance variables
protected int count;
protected int modChange;
protected DoubleLinearNode head, tail;
//head and tail set to empty count set to zero
public CompletedList() {
head = tail = null;
count = 0;
}
//Override for head and tail, remove first number of list
@Override
public T removeFirst() throws NoSuchElementException
{
//if head is empty return error
if(isEmpty())
throw new NoSuchElementException("The collection is empty");
//Temp for each number set to head item
T temp = head.getItem();
//if first number equals last they are null
if(head == tail)
{
head = tail = null;
}
//else the ne
else if(head.getNext() == tail)
{
head.remove();
head = tail;
}
else
{
head = head.getNext();
head.getPrev().remove();
}
count--;
modChange++;
return temp;
}
@Override
public T removeLast() throws NoSuchElementException
{
if(isEmpty())
throw new NoSuchElementException("The collection is empty");
T temp = tail.getItem();
if(head == tail)
{
head = tail = null;
}
else if(head.getNext() == tail){
tail.remove();
tail = head;
}
else
{
tail = tail.getPrev();
tail.getNext().remove();
}
count--;
modChange++;
return temp;
}
@Override
public T remove( T element )
{
if(isEmpty())
throw new NoSuchElementException("The target is not in the collection");
if(tail.getItem().equals(element))
{
return removeLast();
}
for (DoubleLinearNode current = head; current != null; current = current.getNext())
{
if(current.getItem().equals(element))
{
if(current == head)
{
return removeFirst();
}
else
{
count--;
modChange++;
return current.remove();
}
}
}
throw new NoSuchElementException("The target is not in the collection");
}
@Override
public T first()
{
if (isEmpty())
throw new NoSuchElementException("The collection is empty");
return head.getItem();
}
@Override
public T last()
{
if (isEmpty())
throw new NoSuchElementException("The collection is empty");
return tail.getItem();
}
@Override
public boolean contains( T target )
{
if(isEmpty())
return false;
if(tail.getItem().equals(target))
{
return true;
}
for (DoubleLinearNode current = head; current != null; current = current.getNext())
{
if(current.getItem().equals(target))
{
return true;
}
}
return false;
}
@Override
public boolean isEmpty()
{
return count == 0;
}
@Override
public int size()
{
return count;
}
@Override
public Iterator iterator()
{
return new ListIterator(head);
}
@Override
public String toString()
{
StringBuilder sb = new StringBuilder();
for (DoubleLinearNode current = head; current != null; current = current.getNext())
{
sb.append(current.getItem()).append(' ');
}
return sb.toString();
}
private class ListIterator implements Iterator
{
private DoubleLinearNode current;
private int modNum;
public ListIterator( DoubleLinearNode node)
{
this.modNum = modChange;
this.current = node;
}
@Override
public boolean hasNext()
{
if(this.modNum != modChange)
throw new ConcurrentModificationException("The collection.
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..
Please finish the int LLInsert function.typedef struct STUDENT {.pdf
Please finish the int LLInsert function.
typedef struct STUDENT
{
char *Netid;
int Midterm;
int Final;
} STUDENT;
typedef char* LLKey;
typedef STUDENT LLValue;
typedef struct LLNode
{
LLKey Key;
LLValue Value;
struct LLNode *Next;
} LLNode;
typedef struct LL
{
LLNode *Head;
int Count;
} LL;
//
// LLCreate: dynamically creates and returns an empty linked-list:
//
LL *LLCreate()
{
LL *list;
list = (LL *) malloc(sizeof(LL));
list->Head = NULL;
list->Count = 0;
return list;
}
//
// LLCompareKeys: compares key1 and key2, returning
// value < 0 if key1 < key2
// 0 if key1 == key2
// value > 0 if key1 > key2
//
int LLCompareKeys(LLKey key1, LLKey key2)
{
// NOTE: with STUDENTs, keys are Netids, so use strcmp.
if (strcmp(key1, key2) < 0)
return -1;
else if (strcmp(key1, key2) == 0)
return 0;
else
return 1;
}
//
// LLInsert: inserts the given (key, value) pair into the linked-list such
// that the new key is in ascending order with respect to the other keys.
// Returns true (non-zero) if the insert was successful, returns false (0)
// if the given key is already in the list -- and the given (key, value)
// pair is not inserted.
//
int LLInsert(LL *list, LLKey key, LLValue value)
{
return 1; // insert was successful:
}
// inputs and discards the remainder of the current line for the
// given input stream, including the EOL character(s):
void skipRestOfInput(FILE *stream)
{
char restOfLine[256];
int rolLength = sizeof(restOfLine) / sizeof(restOfLine[0]);
fgets(restOfLine, rolLength, stream);
}
int main(int argc, char *argv[])
{
char netid[16];
int mid, fnl, added;
STUDENT s;
LL *list = LLCreate();
LLNode *cur = NULL;
memdebug_init(0); // 1 => interactive; switch to 0 inside zyLabs
scanf(\"%s %d %d\", netid, &mid, &fnl);
skipRestOfInput(stdin);
while (netid[0] != \'#\')
{
s.Netid = (char *)malloc((strlen(netid)+1) * sizeof(char));
strcpy(s.Netid, netid);
s.Midterm = mid;
s.Final = fnl;
// add to end of list:
LLNode *node;
node = (LLNode *) malloc(sizeof(LLNode));
node->Key = s.Netid;
node->Value = s;
node->Next = NULL;
if (cur == NULL) // first time:
{
list->Head = node;
cur = node;
}
else // new node follows current:
{
cur->Next = node;
cur = node;
}
list->Count++;
scanf(\"%s %d %d\", netid, &mid, &fnl);
skipRestOfInput(stdin);
}
//
// now call insert function to see if it works:
//
scanf(\"%s %d %d\", netid, &mid, &fnl);
skipRestOfInput(stdin);
s.Netid = (char *)malloc((strlen(netid) + 1) * sizeof(char));
strcpy(s.Netid, netid);
s.Midterm = mid;
s.Final = fnl;
added = LLInsert(list, s.Netid, s);
if (!added)
{
printf(\"**not inserted**\ \");
}
else
{
printf(\"**inserted**\ \");
}
// output contents of list:
printf(\">>Count=%d\ \", list->Count);
cur = list->Head;
while (cur != NULL)
{
printf(\">>%s: %d,%d\ \", cur->Value.Netid, cur->Value.Midterm, cur->Value.Final);
cur = cur->Next;
}
return 0;
}
Solution
PROGRAM CODE:
#include
#include
#include
typedef struct STUDENT
{
char *Netid;
int Midterm;
int Final;
} STUDENT;
typedef char* LLKey;
typedef STUDENT.
mainpublic class AssignmentThree { public static void ma.pdf
// main
public class AssignmentThree
{
public static void main(String[] args)
{
List myList = new List(15);
// Cause List Empty Message
myList.removeFront();
myList.removeRear();
myList.removeItem(\"a\");
// Cause Not found message
myList.addToFront(\"x\");
myList.removeItem(\"y\");
myList.removeItem(\"x\");
myList.addAfterItem(\"x\", \"z\");
myList.addBeforeItem(\"x\", \"z\");
// Normal behavior
myList.addToFront(\"not.\");
myList.addToFront(\"or\");
myList.addToRear(\"is\");
myList.addToRear(\"try.\");
myList.addAfterItem(\"is\", \"no\");
myList.addBeforeItem(\"is\", \"There\");
myList.addToFront(\"Do\");
myList.addAfterItem(\"or\", \"do\");
myList.print(\"Original list\");
myList.printSorted(\"Sorted Original List\");
sop(\"\ Front is \" + myList.getFront());
sop(\"Rear is \" + myList.getRear());
sop(\"Count is \" + myList.askCount());
sop(\"Is There present? \" + myList.isPresent(\"There\"));
sop(\"Is Dog present? \" + myList.isPresent(\"Dog\"));
myList.addToFront(\"junk\");
myList.addToRear(\"morejunk\");
myList.addAfterItem(\"or\", \"moremorejunk\");
myList.print(\"List with junk\");
sop(\"Count is \" + myList.askCount());
myList.removeFront();
myList.removeRear();
myList.removeItem(\"moremorejunk\");
myList.print(\"List with junk removed\");
sop(\"Count is \" + myList.askCount());
sop(\"\");
// Cause List Full message
for(int ii = 0; ii < 10; ++ii)
{
myList.addToFront(DUMMY);
}
myList.addToRear(DUMMY);
myList.addBeforeItem(\"no\", DUMMY);
myList.addAfterItem(\"There\", DUMMY);
myList.print(\"After filling List\");
sop(\"Count is \" + myList.askCount());
while(myList.isPresent(DUMMY)) myList.removeItem(DUMMY);
myList.print(\"After removing \" + DUMMY );
sop(\"Count is \" + myList.askCount());
}
private static void sop(String s)
{
System.out.println(s);
}
private static final String DUMMY = \"dummy\";
}
Solution
Following is MyList implementation for your output as:
Java Code:
import java.util.Comparator;
public class MyList {
private Node start;
private Node end;
private int size;
private int capacity;
public MyList(int capacity) {
start = null;
end = null;
size = 0;
this.capacity = capacity;
}
/* Function to check if list is empty */
public boolean isEmpty() {
return start == null;
}
public void removeFront() {
if (isEmpty()) {
System.out.println(\"List Empty\");
return;
} else {
start = start.next;
size--;
return;
}
}
public void removeRear() {
if (size == 0) {
System.out.println(\"List Empty\");
return;
}
if (start.next == null) {
start=null;
end=null;
size=0;
}
Node node = start.next;
while (node.next != null) {
node = node.next;
}
node.next = null;
end = node;
size--;
}
public void removeItem(String key) {
if (size == 0) {
System.out.println(\"List Empty\");
return;
}
if (start.next == null) {
if (start.key.equals(key)) {
start=null;
end=null;
size=0;
} else {
System.out.println(\"\");
}
return;
}
Node node = start;
Node nodeNext = node.next;
while (nodeNext.next != null) {
if (nodeNext.key.equals(key)) {
node.next=nodeNext.next;
}.
Table.java Huffman code frequency tableimport java.io.;im.docx
// Table.java: Huffman code frequency table
import java.io.*;
import java.util.TreeSet
class Table {
public final int MAXT = 100; // maximum number of different symbols
public int currTableSize; // current size as table is constructed
public Entry[] tab; // the table array, not allocated
private Reader in; // internal file name for input stream
String file = ""; // the whole input file as a String
private boolean fileOpen = false; // is the file open yet?
private String fileName; // name of input file, if present
private int totalChars = 0; // total number of chars read
char markerChar = '@'; // sentinal at end of file
// Table: constructor, input parameter: input file name or null
public Table(String f) {
fileName = f;
currTableSize = 0;
tab = new Entry[MAXT];
}
// dumpTable: debug dump of contents of Table
public void dumpTable() {
int i;
System.out.println("\nDump of Table ----->");
System.out.println(" Size: " + currTableSize);
for (i = 0; i < currTableSize; i++) {
System.out.println("Entry " + i + ". Symbol: " +
tab[i].symb + ", Weight: " + tab[i].weight +
", Representation: " + tab[i].rep);
}
System.out.println("----> End Dump of Table\n");
}
// getNextChar: fetches next char. Also opens input file
private char getNextChar() {
char ch = ' '; // = ' ' to keep compiler happy
if (!fileOpen) {
fileOpen = true;
if (fileName == null)
in = new InputStreamReader(System.in);
else {
try {
in = new FileReader(fileName);
} catch (IOException e) {
System.out.println("Exception opening " + fileName);
}
}
}
try {
ch = (char)in.read();
} catch (IOException e) {
System.out.println("Exception reading character");
}
return ch;
}
// buildFromFile: read file and build the map of the character frequencies
private void buildFromFile(File file) throws FileNotFoundException {
//
Map<String, Integer> freqMap = new BSTMap<String, Integer>();Scanner scanner = new Scanner(file);
scanner.useDelimiter("");
String character;
while (scanner.hasNext()){
character = scanner.next();
Integer count = freqMap.get(character);
if (count == null){
count = Integer.valueOf(0);
}
freqMap.put(character, count+1);
}
// for each key, make a tree and load it into the priority queue
PriorityQueue<BinaryTree<CountPair>> treeQueue = new PriorityQueue<BinaryTree<CountPair>>(freqMap.keySet().size(), new CountPairTreeComparator
BinaryTree<CountPair> tmpTree;
for (String key: freqMap.keySet()){
int frequency = freqMap.get(key);
tmpTree = new BinaryTree<CountPair>(null, new CountPair(key, frequency), null);
treeQueue.add(tmpTree);
}
Public interface Map<K extends Comparable<K>,V>
{
//This should load the value value into the map at the location //associated with the key, ...
C Programming Homework Help
I am Susan C. I am a C Homework Help Expert at programminghomeworkhelp.com. I hold a PhD. in Programming, Leeds University UK. I have been helping students with their homework for the past 12 years. I solve assignments related to C Programming.
Visit programminghomeworkhelp.com or email support@programminghomeworkhelp.com.You can also call on +1 678 648 4277 for any assistance with C Programming assignments.
Solutionclass IntNode { int data; public IntNode next,head;.pdf
Solution
:
class IntNode
{
int data;
public IntNode next,head;
public IntNode(int value)
{
data=value;
next=null;
}
public void setNext(IntNode n)
{
next=n;
}
public int getData()
{
return data;
}
public IntNode getNext()
{
return(next);
}
}
public class CircularLinkedList
{
public static void main(String[] args)
{
//test your code here
}
//private variables:
private IntNode head;
private IntNode tail;
//constructor
public CircularLinkedList(){
//empty linked list
head=null;
tail=null;
}
//add a node to the end of the list
public void add(int value){
//create new Node
IntNode newNode=new IntNode(value);
//if list is empty
if (isEmpty()){
//set new node as head
head=newNode;
//set next link to the head
newNode.setNext(head);
//set tail as the head
tail=head;
}else{
//set next link of the tail to the new node
tail.setNext(newNode);
//set next link of the new node to the head
newNode.setNext(head);
//update tail - new node is the new list tail
tail=newNode;
}
}
//check if linked list is empty
public boolean isEmpty(){
if (head ==null)
return true;
else return false;
}
//print the values in the linked list
public void print(){
//if list is empty
if(isEmpty()){
System.out.println(\"empty\ \");
return;
}
//if list has one node
if (head.getNext() == head)
{
System.out.println(head.getData());
return;
}
//start from the head node
IntNode currentNode=head;
while(currentNode.getNext() != head){
//print the value of the current node
System.out.print(currentNode.getData() +\"\\t\");
//go to the next node
currentNode=currentNode.getNext();
}
System.out.print(currentNode.getData());
System.out.println();
}
public IntNode delete()
{
if(head.next == null)
tail = null;
IntNode temp = head;
head = head.next;
return temp;
} // end delete
}.
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();
}
}.
Features of Kotlin I find exciting
This short talk covers a few awesome things in Kotlin which make the language a lot more enjoyable.
Scala vs Java 8 in a Java 8 World
Scala is becoming the language of choice for many development teams. This talk highlights how Scala excels in the world of multi-core processing and explores how it compares to Java 8.
Video Presentation: http://youtu.be/8vxTowBXJSg
how do i expand upon selectionSortType so that you are no longer bou.pdf
how do i expand upon selectionSortType so that you are no longer bound to a list of 1000
elements. Thus, you\'ll be using pointers to create dynamic arrays.
As you\'ll recall, when you use pointers in a class you need to do three things:
1) Define the Copy Constructor (So that you have a deep copy instead of a shallow copy)
2) Overload the Assignment Operator for Your Class.
2) Add a Deconstructor To Clean Up Your Pointers.
//////////////////////////////////////////////////////// HEADER FILE ///////////////////////////////////
Solution
#include
#include
struct prsn {
char name[25];
int age;
struct prsn *Next_Person;
};
struct lndlst {
struct prsn *head;
struct prsn *tail;
int nodeCount;
};
void inintlize (lndlst *ll);
void insrtFrnt (lndlst *ll);
void insrtRear (lndlst *ll);
void dlteRear (lndlst *ll);
void setData (prsn *p);
void PrintList (lndlst *ll);
void main ()
{
lndlst ll; //linked list created
inintlize(&ll); //linked list initialized
int choice = 0;
//list is empty, lets create prsn //dynamically
do
{
cout << \" 1: insert item in front\" << endl;
cout << \" 2: Insert item in rear\" << endl;
cout << \" 3: Delete item from front\" << endl;
cout << \" 4: Delete item from rear\" << endl;
cout << \" 5: Print List\" << endl;
cout << \" 8: Exit\" << endl;
cin >> choice;
if (choice == 1)
{ insrtFrnt(&ll); }
if (choice == 2)
{ insrtRear(&ll); }
if (choice == 3)
{// DeleteFront(&ll); }
if (choice == 4)
{ dlteRear(&ll); }
if (choice == 5)
{ PrintList(&ll); }
}while (choice != 8);
}
void inintlize(lndlst *ll)
{
ll->head = NULL;
ll->tail = NULL;
ll->nodeCount = 0;
}
void setData(prsn *p)
{
cin >> p->name ;
cin >> p->age ;
p->Next_Person = NULL; //just to inintlize
}
void insrtFrnt(lndlst *ll)
{
if (ll->head == NULL && ll->nodeCount == 0) //means empty list
{
prsn *p;
p = new prsn;
setData(p);
ll->head = p;
ll->tail = p;
ll->nodeCount++;
}
else
{
prsn *p;
p = new prsn;
setData(p);
p->Next_Person = ll->head ;
ll->head = p;
ll->nodeCount++; //increment counter
}
}
void insrtRear(lndlst *ll)
{
if (ll->head == NULL && ll->nodeCount == 0) //means empty list
{
prsn *p;
p = new prsn;
setData(p);
ll->head = p;
ll->tail = p;
ll->nodeCount++;
}
else
{
prsn *p;
p = new prsn;
setData(p);
ll->tail->Next_Person = p; //now point tail of second last element to last
ll->tail = p; //yes tail is now the new element inserted
ll->nodeCount++; //increment counter
}
}
void dlteRear(lndlst *ll)
{
prsn *tempLast;
prsn *temp2ndLast;
tempLast = ll->head ;
if (ll->nodeCount > 0 )
{ //we can use for loop with nodeCount or the following method
while (tempLast->Next_Person != NULL)
{
temp2ndLast = tempLast;
tempLast = tempLast->Next_Person ;
}
temp2ndLast->Next_Person = NULL;
delete tempLast;
ll->nodeCount --;
}
}
void PrintList(lndlst *ll)
{
int i = 0;
struct prsn *tempNode;
tempNode = ll->head ;
cout << \"The linked list is...\" << endl;
for (i = 0; i < ll->nodeCount ; i++)
{
cout << tempNode->name <<\"\\t\" <age << endl; ;
tempNode = tempNode->Next_Person ;
}
}.
#include sstream #include linkylist.h #include iostream.pdf
#include
#include \"linkylist.h\"
#include
#include
#include
#include
using namespace std;
int main(int argc, char *argv[])
{
//node* head = new node;
LinkedList list(1);
ifstream infile1 (argv[1]);
//make sure the file opens properly and read the contents of the file in to a list
if(!infile1)
{
cout<<\"Your Testfile could not be opened!\"<>users;
if (users.find(\"I\")!=string::npos)
{
//int spot = atoi((users[3]).c_str());
string pot = string(users.substr(2));
stringstream spot(pot);
string data;
cin>>data;
insertAfter(list.getNode(spot),data);
}
/*else if (users.find(\"D\")!=string::npos)
{
int spoty = atoi((users[3]).c_str());
deleteNode(spoty);
}*/
else if (users==\"L\")
{
list.traverse_and_print();
}
}
return 0;
#include
using namespace std;
class Node
{
friend class LinkedList;
private:
int value; /* data, can be any data type, but use integer for easiness */
Node *Next; /* pointer to the next node */
public:
/* Constructors with No Arguments */
Node(void)
: Next(NULL)
{ }
/* Constructors with a given value */
Node(int val)
: value(val), Next(NULL)
{ }
/* Constructors with a given value and a link of the next node */
Node(int val, Node* next)
: value(val), Next(next)
{}
/* Getters */
int getValue(void)
{ return value; }
Node* getNext(void)
{ return Next; }
};
/* definition of the linked list class */
class LinkedList
{
private:
/* pointer of head node */
Node *Head;
/* pointer of tail node */
Node *Tail;
public:
/* Constructors with a given value of a list node */
LinkedList(int val);
/* Destructor */
~LinkedList(void);
/* Function to append a node to the end of a linked list */
void tailAppend(string val);
/* Remove a node with a specific value if it exists */
void remove(int val);
void insertAfter(Node* afterMe, string val);
Node* getNode(int pos);
/* Traversing the list and printing the value of each node */
void traverse_and_print();
};
#include
#include \"linkylist.h\"
#include
using namespace std;
LinkedList::LinkedList(int val)
{
/* Create a new node, acting as both the head and tail node */
Head = new Node(val);
Tail = Head;
}
Node* LinkedList::getNode(int pos)
{
Node* p = Head;
/* Counter */
while (pos--) {
if (p != NULL)
p = p->Next;
else
return NULL;
}
return p;
}
void LinkedList::insertAfter(Node* afterMe, string val)
{
if(afterme != NULL)
{
afterMe->Next = new Node(val, afterMe->Next);
}
}
LinkedList::~LinkedList()
{
}
void LinkedList::tailAppend(string val)
{
/* The list is empty? */
if (Head == NULL) {
/* the same to create a new list with a given value */
Tail = Head = new Node(val);
}
else
{
/* Append the new node to the tail */
Tail->Next = new Node(val);
/* Update the tail pointer */
Tail = Tail->Next;
}
}
void LinkedList::remove(int val)
{
Node *pPre = NULL, *pDel = NULL;
/* Check whether it is the head node?
if it is, delete and update the head node */
if (Head->value == val) {
/* point to the node to be deleted */
pDel = Head;
/* update */
Head = pDel->Next;
delete pDel;
return;
}
pPre = Head;
pDel = Head->Next;
/*.
Rewrite this code so it can use a generic type instead of integers. .pdf
Rewrite this code so it can use a generic type instead of integers. This means we can use any data
type with it.
For example:
LinkedList = new LinkedLIst<>();
public class Main {
public static void main(String[] args) {
/*
* Expected output:
*
* The list: 8 -> 1 -> 5 -> 3 -> 6
* Size: 5
* Head: 8
* Tail: 6
* Removeing 1...
* The list: 8 -> 5 -> 3 -> 6
* Size: 4
* Head: 8
* Tail: 6
* Removeing head...
* The list: 5 -> 3 -> 6
* Size: 3
* Head: 5
* Tail: 6
* Removeing tail...
* The list: 5 -> 3
* Size: 2
* Head: 5
* Tail: 3
*/
LinkedList list = new LinkedList();
list.append(5);
list.append(3);
list.append(6);
list.prepend(1);
list.prepend(8);
printListDetails(list);
System.out.println("Removeing 1...");
list.removeByValue(1);
printListDetails(list);
System.out.println("Removeing head...");
list.removeHead();
printListDetails(list);
System.out.println("Removeing tail...");
list.removeTail();
printListDetails(list);
}
public static void printListDetails(LinkedList list) {
System.out.println("The list: " + list.toString());
System.out.println("Size: " + list.size());
System.out.println("Head: " + list.getHead());
System.out.println("Tail: " + list.getTail());
}
}
________________________________________
public class LinkedList {
private Node head;
private Node tail;
private int size;
public LinkedList() {
head = null;
tail = null;
size = 0;
}
public void append(int data) {
Node newNode = new Node(data);
if (head == null) {
head = newNode;
} else {
tail.next = newNode;
}
tail = newNode;
size++;
}
public void prepend(int data) {
Node newNode = new Node(data);
if (head == null) {
head = newNode;
tail = newNode;
} else {
newNode.next = head;
head = newNode;
}
size++;
}
public int getHead() {
return head.data;
}
public int getTail() {
return tail.data;
}
public int size() {
return size;
}
public void removeByValue(int data) {
Node current = head;
while (current.next != null && current.next.data != data) {
current = current.next;
}
if (current.next != null) {
current.next = current.next.next;
size--;
if (current.next == null) {
tail = current;
}
}
}
public int removeHead() {
int removedData = head.data;
head = head.next;
size--;
if (head == null) {
tail = null;
}
return removedData;
}
public int removeTail() {
int removedData = tail.data;
if (head == tail) {
head = null;
tail = null;
} else {
Node current = head;
while (current.next != tail) {
current = current.next;
}
tail = current;
tail.next = null;
}
size--;
return removedData;
}
@Override
public String toString() {
StringBuilder builder = new StringBuilder();
Node current = head;
while (current != null) {
builder.append(current.data);
if (current.next != null) {
builder.append(" -> ");
}
current = current.next;
}
return builder.toString();
}
private class Node {
public Node next;
public int data;
public Node(int data) {
this.data = data;
}
}
}.
tested on eclipseDoublyLinkedList class.pdf
//tested on eclipse
/*************DoublyLinkedList class*******************/
public class DoublyLinkedList {
/*Data member variable declaration*/
private Node head;
private int count;
/**default constructor*/
public DoublyLinkedList() {
/*Initializing variable*/
head=null;
count =0;
}
/*Insert at beginning in doubly linked list*/
public void insertBeginning(String name){
/*checking head is null then we will add node at head*/
if(head==null){
head=new Node(name, null, null);
count++;
}else{
/*else create temp node and setting next to head
* and then making temp to head*/
Node temp=new Node(name,null,null);
temp.setNext(head);
head.setPrev(temp);
head=temp;
count++;
}
}
public void printList(){
Node temp=head;
/*Printing element of doubly list*/
while(temp!=null){
System.out.println(temp.getData());
temp=temp.getNext();
}
}
/*Returning count from doubly linked list*/
public int count(){
return count;
}
/*deleting specific node from doubly linked list*/
public void delete(String name){
Node current=head,previous=head;
/*if it is head node to be deleted*/
if(head.getData().equals(name)){
current=head.getNext();
current.setPrev(null);
head=current;
previous=head;
}else{
/*If node in middle of list*/
while(current.getNext()!=null){
if(current.getData().equals(name)){
current.getNext().setPrev(previous);
previous.setNext(current.getNext());
count--;
break;
}
previous=current;
current=current.getNext();
}
/*If node is at last*/
if(current.getNext()==null){
if(current.getData().equals(name)){
previous.setNext(null);
count--;
}
}
}
}
/*deleting all nodes from list by assigning head to null
* and memory releasing take care by garbage collector*/
public void clear(){
head=null;
count=0;
}
/*Inserting element in alphabetic order*/
public void insertAlpha(String name){
Node current=head,previous=head;
/*creating new node*/
Node newNode=new Node(name,null,null);
/*if head node is null*/
if(head==null){
head=newNode;
count++;
}else{
/*please read about compareTo() method about returning value*/
if(head.getData().compareTo(name)>0){
newNode.setNext(head);
head=newNode;
count++;
}else{
/*condition for getting position of node to be inserted*/
while(current!=null&¤t.getData().compareTo(name)<=0){
previous=current;
current=current.getNext();
}
/*if node need to be inserted at last*/
if(current==null){
previous=newNode;
}else{
/*If node need to inserted in middle*/
newNode.setNext(current);
previous.setNext(newNode);
current.setPrev(newNode);
newNode.setPrev(previous);
}
count++;
}
}
}
/*Main method start*/
public static void main(String args[]){
/*creating object of doubly linked list*/
DoublyLinkedList doublyLinkedList=new DoublyLinkedList();
doublyLinkedList.insertBeginning(\"sunita\");
doublyLinkedList.insertBeginning(\"lalchand\");
/*calling alphabetic order method*/
doublyLinkedList.insertAlpha(\"ramsingh\");
doublyLinkedList.insertBeginning(\"Lokesh\");
doublyLinkedList.insertBeginning(\"Pritam\");
/*****printing list********/
doublyLinkedList.printL.
^^^ Discuss about Header Node And also write a program for unorder.pdf
^^^ Discuss about Header Node? And also write a program for unordered single linked list and
linked implementation of QUEUE?
Solution
Header node:
Sometimes it is desire to keep an extra node at the front of a List. Such a node doesn’t represent
an item in the List and is called a Header Node or a List Header. The Information field of such
Header node might be unused but the Next field maintains the first node address. More often the
information of such a node could be used to keep Global Information about the Entire List.
One of the applications of Header node is the information portion of the Header node contains
the number of nodes (not including Header) in the List. In this Structure the Header must be
adjusted the total number of nodes when we apply addition or deletion operation on the List. We
can directly obtained the total number of nodes without traversing the entire List.
By using this application, we can develop Data Structure Stack easily. Since Header node
information field maintains the number of elements that the Stack contains.
Another application is we can simply develop the Data Structure Queue. Until now, two external
pointers, Front & Rear, were necessary for a List to represent a Queue. However, now only a
single external pointer is sufficient to maintain a Queue that is Head node. Because the Header
node next field behave like a Front and information field of Header node maintains last node
address so that it is behave like a Rear .
Another possibility for the use of the information portion of a List Header is as a pointer
to a Curr node in the List during a traversal process. This would be eliminate the node for an
external pointer during traversal.
#include
#include
#include
#include
struct node
{
char info;
struct node *next;
};
typedef struct node sl;
void display(sl *);
sl * create(sl *root)
{
sl *curr,*new;
char val;
printf(\"\ Enter $ to STOP --- Otherwise Continue : \");
fflush(stdin);
scanf(\"%c\",&val);
while(val != \'$\')
{
new=(sl *) malloc(sizeof(sl));
new->info = val;
new->next = NULL;
if(root == NULL)
root = new;
else
{
curr = root;
while( curr->next != NULL )
curr = curr->next;
curr->next = new;
}
printf(\" Enter $ to STOP --- Otherwise Continue : \");
fflush(stdin);
scanf(\"%c\",&val);
}
printf(\"\ The Created Linked List Is \ \");
display(root);
return root;
}
sl * delete(sl *root,char val)
{
sl *temp,*curr,*rear;
curr = root;
rear = NULL;
while( curr != NULL && val != curr->info )
{
rear = curr;
curr = curr->next;
}
if(curr == NULL)
{
if( rear == NULL)
{
printf(\"\ Linked List is Empty\");
printf(\"\ Deletion is not Possible \");
}
else
{
printf(\"\ deleted Node does not exist in List\");
printf(\"\ Deletion is not Possible \");
}
}
else
{
if( rear == NULL)
{
temp = root;
root = root->next;
}
else
{
temp = curr;
rear->next = curr->next;
}
printf(\"\ Node is deleted \");
printf(\"\ Deleted Node information is %c\",temp->info);
free(temp);
}
display(root);
return root;
}
sl * insert(sl *root,char val)
{.
You can list anything, it doesnt matter. I just want to see code f.pdf
You can list anything, it doesn\'t matter. I just want to see code for this problem. Thank you
Solution
Include header files .......
Source code:
public class SinglyLinkedListImpl {
private Node head;
private Node tail;
public void add(T element){
Node nd = new Node();
nd.setValue(element);
System.out.println(\"Adding: \"+element);
if(head == null){
head = nd;
tail = nd;
} else {
tail.setNextRef(nd);
}
tail = nd;
}
}
public void addAfter(T element, T after){
Node tmp = head;
Node refNode = null;
System.out.println(\"Traversing to all nodes..\");
while(true){
if(tmp == null){
break;
}
if(tmp.compareTo(after) == 0){
refNode = tmp;
break;
}
tmp = tmp.getNextRef();
}
if(refNode != null){
Node nd = new Node();
nd.setValue(element);
nd.setNextRef(tmp.getNextRef());
if(tmp == tail){
tail = nd;
}
tmp.setNextRef(nd);
} else {
System.out.println(\"Unable to find the given element...\");
}
}
public void deleteFront(){
if(head == null){
System.out.println(\"Underflow...\");
}
Node tmp = head;
head = tmp.getNextRef();
if(head == null){
tail = null;
}
System.out.println(\"Deleted: \"+tmp.getValue());
}
public void deleteAfter(T after){
Node tmp = head;
Node refNode = null;
System.out.println(\"Traversing to all nodes..\");
while(true){
if(tmp == null){
break;
}
if(tmp.compareTo(after) == 0){
refNode = tmp;
break;
}
tmp = tmp.getNextRef();
}
if(refNode != null){
tmp = refNode.getNextRef();
refNode.setNextRef(tmp.getNextRef());
if(refNode.getNextRef() == null){
tail = refNode;
}
System.out.println(\"Deleted: \"+tmp.getValue());
} else {
System.out.println(\"Unable to find the given element...\");
}
}
public void traverse(){
Node tmp = head;
while(true){
if(tmp == null){
break;
}
System.out.println(tmp.getValue());
tmp = tmp.getNextRef();
}
}
public static void main(String a[]){
SinglyLinkedListImpl sl = new SinglyLinkedListImpl();
sl.add(3);
sl.add(32);
sl.add(54);
sl.add(89);
sl.addAfter(76, 54);
sl.deleteFront();
sl.deleteAfter(76);
sl.traverse();
}
}
class Node implements Comparable {
private T value;
private Node nextRef;
public T getValue() {
return value;
}
public void setValue(T value) {
this.value = value;
}
public Node getNextRef() {
return nextRef;
}
public void setNextRef(Node ref) {
this.nextRef = ref;
}
public int compareTo(T arg) {
if(arg == this.value){
return 0;
} else {
return 1;
}
}
}
This program implement the concept of single linked list..
Discuss about Header Node And also write a program for unordered si.pdf
Consider rectangle ABCD. If mADF=60°, then what is the mFDC?
a) 60°
b) 30°
c) 90°
d) 120°
e) 45°
f) None of the above
Solution
Given figure ABCD is a rectangle.
Looking into the properties of rectangle,
1) All the angles in a rectangle are right angles i.e. equal to 90 degrees.
2) Opposite sides are parallel and equal.
By the first property stated above,
m(D) = 90 degrees
Angle D can be written as given in the following
m(D) = m(ADF) + m(FDC) = 90
Given m(ADF) = 60
Therefore, 60 + m(FDC) = 90
m(FDC) = 30 degress.
Hence option B) 30 is the required answer..
So I have this code(StackInAllSocks) and I implemented the method but.pdf
So I have this code( StackInAllSocks ) and I implemented the method but I can't seem to figure
out why there isn't anything showing up on the console. It should pop,peek and push b using the
methods from the class called ArrayListTen . The ArrayListTen works fine and compiles the
tested code of Rigth# but for StackInAllSocks it doesn't complete at all. note that file
VodeDodeis not to be changed is just a Node storage area of the array list.
Did I implement the method on StackInAllSocks correctly? if so, should I not use the method
from the ArrayListTen .?
__________________________________________________________________________
: the code is : VodeDodeis
class VodeDode<T> {
private T data;
private VodeDode<T> next;
private VodeDode<T> prev;
public VodeDode(T data) {
this.data = data;
this.next = null;
this.prev = null;}
public T getData() {
return data;}
public void setData(T data) {
this.data = data;}
public VodeDode<T> getNext() {
return this.next;}
public void setNext(VodeDode<T> next) {
this.next = next;}
public VodeDode<T> getPrev() {
return this.prev;}
public void setPrev(VodeDode<T> prev) {
this.prev = prev;}
@Override
public String toString() {
return data.toString();}}
_________________________________________________________________________
CODE that works fine called ArrayListTen:
import java.util.Iterator;
public class ArrayListTen<T> implements Iterable<T> {
private VodeDode<T> head; //beginning of list
private VodeDode<T> tail; //end of list
private int size;
private VodeDode<T> new_item;
public ArrayListTen( ){
this.head = null;
this.tail = null;
this.size = 0;}
public int lenght() {
return size ;}
public T getBegin() {
if (this.head != null) {
return head.getData();}
else { return null;}}
public void addBegin(T value) {
VodeDode<T> newVodeDode =new VodeDode<T>(value);
if (this.head== null) {
head = newVodeDode;
tail =newVodeDode;}
else {VodeDode<T> temp = head;
head = newVodeDode;
head.setNext(temp);}
size++;}
public T removeBegin() {
if(this.head == null) {
return null;}
else {T current = head.getData();
if (tail == head) {
tail = null;
head = null;
} else {
head = head.getNext();
head.setPrev(null);}size--;
return current;}}
public T getEnd() {
if (tail != null) {
return tail.getData();
} else {
return null;}}
public void addEnd(T value) {
VodeDode<T> newVodeDode = new VodeDode<T>(value);
if (this.tail == null) {
head = newVodeDode;
tail = newVodeDode;
} else {
newVodeDode.setPrev(tail);
tail.setNext(newVodeDode);
tail = newVodeDode;}
size++;}
public T removeEnd() {
if(this.tail == null) {
return null;}
else {
T current = tail.getData();//was head.
if (head == tail) {
head = null;
tail = null;
} else {
tail = tail.getPrev();
tail.setNext(null);}
size--;
return current;}}
public T removeBN(T value) {
VodeDode<T> currVodeDode = head;
VodeDode<T> prevVodeDode = null;
while(currVodeDode != null){
if(currVodeDode.getData().equals(value)){
if(prevVodeDode != null){
prevVodeDode.setNext(currVodeDode.getNext());}
else{
head = curr.
Una mujer de 36 a�os que se someti� a un trasplante de ri��n hace 2 .pdf
Una mujer de 36 aos que se someti a un trasplante de rin hace 2 meses desarroll fiebre, malestar
general, mialgias y leucopenia. los medicamentos incluyen prednisona y ciclosporina. una
radiografa de trax muestra infiltrados pulmonares intersticiales bilaterales. durante los siguientes
2 das, su estado respiratorio se deteriora y es intubada y ventilada mecnicamente. Se muestra el
tejido obtenido en una biopsia del pulmn. El tratamiento ms adecuado incluye la administracin
de cul de los siguientes frmacos? y por qu
aciclovir
B.ganciclovir
C. interfern-gamma
D. lamivudina.
Una empresa tiene un ciclo operativo de 120 d�as, un per�odo promedi.pdf
Una empresa tiene un ciclo operativo de 120 das, un perodo promedio de cobro de 40 das y un
perodo promedio de pago de 30 das. La antigedad promedio del inventario de la empresa es
________ das.
80
70
90
50
80
70
90
50.
More Related Content
Similar to Using Java programming language solve the followingSLL CLASS.pdf
Please finish the int LLInsert function.typedef struct STUDENT {.pdf
Please finish the int LLInsert function.
typedef struct STUDENT
{
char *Netid;
int Midterm;
int Final;
} STUDENT;
typedef char* LLKey;
typedef STUDENT LLValue;
typedef struct LLNode
{
LLKey Key;
LLValue Value;
struct LLNode *Next;
} LLNode;
typedef struct LL
{
LLNode *Head;
int Count;
} LL;
//
// LLCreate: dynamically creates and returns an empty linked-list:
//
LL *LLCreate()
{
LL *list;
list = (LL *) malloc(sizeof(LL));
list->Head = NULL;
list->Count = 0;
return list;
}
//
// LLCompareKeys: compares key1 and key2, returning
// value < 0 if key1 < key2
// 0 if key1 == key2
// value > 0 if key1 > key2
//
int LLCompareKeys(LLKey key1, LLKey key2)
{
// NOTE: with STUDENTs, keys are Netids, so use strcmp.
if (strcmp(key1, key2) < 0)
return -1;
else if (strcmp(key1, key2) == 0)
return 0;
else
return 1;
}
//
// LLInsert: inserts the given (key, value) pair into the linked-list such
// that the new key is in ascending order with respect to the other keys.
// Returns true (non-zero) if the insert was successful, returns false (0)
// if the given key is already in the list -- and the given (key, value)
// pair is not inserted.
//
int LLInsert(LL *list, LLKey key, LLValue value)
{
return 1; // insert was successful:
}
// inputs and discards the remainder of the current line for the
// given input stream, including the EOL character(s):
void skipRestOfInput(FILE *stream)
{
char restOfLine[256];
int rolLength = sizeof(restOfLine) / sizeof(restOfLine[0]);
fgets(restOfLine, rolLength, stream);
}
int main(int argc, char *argv[])
{
char netid[16];
int mid, fnl, added;
STUDENT s;
LL *list = LLCreate();
LLNode *cur = NULL;
memdebug_init(0); // 1 => interactive; switch to 0 inside zyLabs
scanf(\"%s %d %d\", netid, &mid, &fnl);
skipRestOfInput(stdin);
while (netid[0] != \'#\')
{
s.Netid = (char *)malloc((strlen(netid)+1) * sizeof(char));
strcpy(s.Netid, netid);
s.Midterm = mid;
s.Final = fnl;
// add to end of list:
LLNode *node;
node = (LLNode *) malloc(sizeof(LLNode));
node->Key = s.Netid;
node->Value = s;
node->Next = NULL;
if (cur == NULL) // first time:
{
list->Head = node;
cur = node;
}
else // new node follows current:
{
cur->Next = node;
cur = node;
}
list->Count++;
scanf(\"%s %d %d\", netid, &mid, &fnl);
skipRestOfInput(stdin);
}
//
// now call insert function to see if it works:
//
scanf(\"%s %d %d\", netid, &mid, &fnl);
skipRestOfInput(stdin);
s.Netid = (char *)malloc((strlen(netid) + 1) * sizeof(char));
strcpy(s.Netid, netid);
s.Midterm = mid;
s.Final = fnl;
added = LLInsert(list, s.Netid, s);
if (!added)
{
printf(\"**not inserted**\ \");
}
else
{
printf(\"**inserted**\ \");
}
// output contents of list:
printf(\">>Count=%d\ \", list->Count);
cur = list->Head;
while (cur != NULL)
{
printf(\">>%s: %d,%d\ \", cur->Value.Netid, cur->Value.Midterm, cur->Value.Final);
cur = cur->Next;
}
return 0;
}
Solution
PROGRAM CODE:
#include
#include
#include
typedef struct STUDENT
{
char *Netid;
int Midterm;
int Final;
} STUDENT;
typedef char* LLKey;
typedef STUDENT.
mainpublic class AssignmentThree { public static void ma.pdf
// main
public class AssignmentThree
{
public static void main(String[] args)
{
List myList = new List(15);
// Cause List Empty Message
myList.removeFront();
myList.removeRear();
myList.removeItem(\"a\");
// Cause Not found message
myList.addToFront(\"x\");
myList.removeItem(\"y\");
myList.removeItem(\"x\");
myList.addAfterItem(\"x\", \"z\");
myList.addBeforeItem(\"x\", \"z\");
// Normal behavior
myList.addToFront(\"not.\");
myList.addToFront(\"or\");
myList.addToRear(\"is\");
myList.addToRear(\"try.\");
myList.addAfterItem(\"is\", \"no\");
myList.addBeforeItem(\"is\", \"There\");
myList.addToFront(\"Do\");
myList.addAfterItem(\"or\", \"do\");
myList.print(\"Original list\");
myList.printSorted(\"Sorted Original List\");
sop(\"\ Front is \" + myList.getFront());
sop(\"Rear is \" + myList.getRear());
sop(\"Count is \" + myList.askCount());
sop(\"Is There present? \" + myList.isPresent(\"There\"));
sop(\"Is Dog present? \" + myList.isPresent(\"Dog\"));
myList.addToFront(\"junk\");
myList.addToRear(\"morejunk\");
myList.addAfterItem(\"or\", \"moremorejunk\");
myList.print(\"List with junk\");
sop(\"Count is \" + myList.askCount());
myList.removeFront();
myList.removeRear();
myList.removeItem(\"moremorejunk\");
myList.print(\"List with junk removed\");
sop(\"Count is \" + myList.askCount());
sop(\"\");
// Cause List Full message
for(int ii = 0; ii < 10; ++ii)
{
myList.addToFront(DUMMY);
}
myList.addToRear(DUMMY);
myList.addBeforeItem(\"no\", DUMMY);
myList.addAfterItem(\"There\", DUMMY);
myList.print(\"After filling List\");
sop(\"Count is \" + myList.askCount());
while(myList.isPresent(DUMMY)) myList.removeItem(DUMMY);
myList.print(\"After removing \" + DUMMY );
sop(\"Count is \" + myList.askCount());
}
private static void sop(String s)
{
System.out.println(s);
}
private static final String DUMMY = \"dummy\";
}
Solution
Following is MyList implementation for your output as:
Java Code:
import java.util.Comparator;
public class MyList {
private Node start;
private Node end;
private int size;
private int capacity;
public MyList(int capacity) {
start = null;
end = null;
size = 0;
this.capacity = capacity;
}
/* Function to check if list is empty */
public boolean isEmpty() {
return start == null;
}
public void removeFront() {
if (isEmpty()) {
System.out.println(\"List Empty\");
return;
} else {
start = start.next;
size--;
return;
}
}
public void removeRear() {
if (size == 0) {
System.out.println(\"List Empty\");
return;
}
if (start.next == null) {
start=null;
end=null;
size=0;
}
Node node = start.next;
while (node.next != null) {
node = node.next;
}
node.next = null;
end = node;
size--;
}
public void removeItem(String key) {
if (size == 0) {
System.out.println(\"List Empty\");
return;
}
if (start.next == null) {
if (start.key.equals(key)) {
start=null;
end=null;
size=0;
} else {
System.out.println(\"\");
}
return;
}
Node node = start;
Node nodeNext = node.next;
while (nodeNext.next != null) {
if (nodeNext.key.equals(key)) {
node.next=nodeNext.next;
}.
Table.java Huffman code frequency tableimport java.io.;im.docx
// Table.java: Huffman code frequency table
import java.io.*;
import java.util.TreeSet
class Table {
public final int MAXT = 100; // maximum number of different symbols
public int currTableSize; // current size as table is constructed
public Entry[] tab; // the table array, not allocated
private Reader in; // internal file name for input stream
String file = ""; // the whole input file as a String
private boolean fileOpen = false; // is the file open yet?
private String fileName; // name of input file, if present
private int totalChars = 0; // total number of chars read
char markerChar = '@'; // sentinal at end of file
// Table: constructor, input parameter: input file name or null
public Table(String f) {
fileName = f;
currTableSize = 0;
tab = new Entry[MAXT];
}
// dumpTable: debug dump of contents of Table
public void dumpTable() {
int i;
System.out.println("\nDump of Table ----->");
System.out.println(" Size: " + currTableSize);
for (i = 0; i < currTableSize; i++) {
System.out.println("Entry " + i + ". Symbol: " +
tab[i].symb + ", Weight: " + tab[i].weight +
", Representation: " + tab[i].rep);
}
System.out.println("----> End Dump of Table\n");
}
// getNextChar: fetches next char. Also opens input file
private char getNextChar() {
char ch = ' '; // = ' ' to keep compiler happy
if (!fileOpen) {
fileOpen = true;
if (fileName == null)
in = new InputStreamReader(System.in);
else {
try {
in = new FileReader(fileName);
} catch (IOException e) {
System.out.println("Exception opening " + fileName);
}
}
}
try {
ch = (char)in.read();
} catch (IOException e) {
System.out.println("Exception reading character");
}
return ch;
}
// buildFromFile: read file and build the map of the character frequencies
private void buildFromFile(File file) throws FileNotFoundException {
//
Map<String, Integer> freqMap = new BSTMap<String, Integer>();Scanner scanner = new Scanner(file);
scanner.useDelimiter("");
String character;
while (scanner.hasNext()){
character = scanner.next();
Integer count = freqMap.get(character);
if (count == null){
count = Integer.valueOf(0);
}
freqMap.put(character, count+1);
}
// for each key, make a tree and load it into the priority queue
PriorityQueue<BinaryTree<CountPair>> treeQueue = new PriorityQueue<BinaryTree<CountPair>>(freqMap.keySet().size(), new CountPairTreeComparator
BinaryTree<CountPair> tmpTree;
for (String key: freqMap.keySet()){
int frequency = freqMap.get(key);
tmpTree = new BinaryTree<CountPair>(null, new CountPair(key, frequency), null);
treeQueue.add(tmpTree);
}
Public interface Map<K extends Comparable<K>,V>
{
//This should load the value value into the map at the location //associated with the key, ...
C Programming Homework Help
I am Susan C. I am a C Homework Help Expert at programminghomeworkhelp.com. I hold a PhD. in Programming, Leeds University UK. I have been helping students with their homework for the past 12 years. I solve assignments related to C Programming.
Visit programminghomeworkhelp.com or email support@programminghomeworkhelp.com.You can also call on +1 678 648 4277 for any assistance with C Programming assignments.
Solutionclass IntNode { int data; public IntNode next,head;.pdf
Solution
:
class IntNode
{
int data;
public IntNode next,head;
public IntNode(int value)
{
data=value;
next=null;
}
public void setNext(IntNode n)
{
next=n;
}
public int getData()
{
return data;
}
public IntNode getNext()
{
return(next);
}
}
public class CircularLinkedList
{
public static void main(String[] args)
{
//test your code here
}
//private variables:
private IntNode head;
private IntNode tail;
//constructor
public CircularLinkedList(){
//empty linked list
head=null;
tail=null;
}
//add a node to the end of the list
public void add(int value){
//create new Node
IntNode newNode=new IntNode(value);
//if list is empty
if (isEmpty()){
//set new node as head
head=newNode;
//set next link to the head
newNode.setNext(head);
//set tail as the head
tail=head;
}else{
//set next link of the tail to the new node
tail.setNext(newNode);
//set next link of the new node to the head
newNode.setNext(head);
//update tail - new node is the new list tail
tail=newNode;
}
}
//check if linked list is empty
public boolean isEmpty(){
if (head ==null)
return true;
else return false;
}
//print the values in the linked list
public void print(){
//if list is empty
if(isEmpty()){
System.out.println(\"empty\ \");
return;
}
//if list has one node
if (head.getNext() == head)
{
System.out.println(head.getData());
return;
}
//start from the head node
IntNode currentNode=head;
while(currentNode.getNext() != head){
//print the value of the current node
System.out.print(currentNode.getData() +\"\\t\");
//go to the next node
currentNode=currentNode.getNext();
}
System.out.print(currentNode.getData());
System.out.println();
}
public IntNode delete()
{
if(head.next == null)
tail = null;
IntNode temp = head;
head = head.next;
return temp;
} // end delete
}.
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();
}
}.
Features of Kotlin I find exciting
This short talk covers a few awesome things in Kotlin which make the language a lot more enjoyable.
Scala vs Java 8 in a Java 8 World
Scala is becoming the language of choice for many development teams. This talk highlights how Scala excels in the world of multi-core processing and explores how it compares to Java 8.
Video Presentation: http://youtu.be/8vxTowBXJSg
how do i expand upon selectionSortType so that you are no longer bou.pdf
how do i expand upon selectionSortType so that you are no longer bound to a list of 1000
elements. Thus, you\'ll be using pointers to create dynamic arrays.
As you\'ll recall, when you use pointers in a class you need to do three things:
1) Define the Copy Constructor (So that you have a deep copy instead of a shallow copy)
2) Overload the Assignment Operator for Your Class.
2) Add a Deconstructor To Clean Up Your Pointers.
//////////////////////////////////////////////////////// HEADER FILE ///////////////////////////////////
Solution
#include
#include
struct prsn {
char name[25];
int age;
struct prsn *Next_Person;
};
struct lndlst {
struct prsn *head;
struct prsn *tail;
int nodeCount;
};
void inintlize (lndlst *ll);
void insrtFrnt (lndlst *ll);
void insrtRear (lndlst *ll);
void dlteRear (lndlst *ll);
void setData (prsn *p);
void PrintList (lndlst *ll);
void main ()
{
lndlst ll; //linked list created
inintlize(&ll); //linked list initialized
int choice = 0;
//list is empty, lets create prsn //dynamically
do
{
cout << \" 1: insert item in front\" << endl;
cout << \" 2: Insert item in rear\" << endl;
cout << \" 3: Delete item from front\" << endl;
cout << \" 4: Delete item from rear\" << endl;
cout << \" 5: Print List\" << endl;
cout << \" 8: Exit\" << endl;
cin >> choice;
if (choice == 1)
{ insrtFrnt(&ll); }
if (choice == 2)
{ insrtRear(&ll); }
if (choice == 3)
{// DeleteFront(&ll); }
if (choice == 4)
{ dlteRear(&ll); }
if (choice == 5)
{ PrintList(&ll); }
}while (choice != 8);
}
void inintlize(lndlst *ll)
{
ll->head = NULL;
ll->tail = NULL;
ll->nodeCount = 0;
}
void setData(prsn *p)
{
cin >> p->name ;
cin >> p->age ;
p->Next_Person = NULL; //just to inintlize
}
void insrtFrnt(lndlst *ll)
{
if (ll->head == NULL && ll->nodeCount == 0) //means empty list
{
prsn *p;
p = new prsn;
setData(p);
ll->head = p;
ll->tail = p;
ll->nodeCount++;
}
else
{
prsn *p;
p = new prsn;
setData(p);
p->Next_Person = ll->head ;
ll->head = p;
ll->nodeCount++; //increment counter
}
}
void insrtRear(lndlst *ll)
{
if (ll->head == NULL && ll->nodeCount == 0) //means empty list
{
prsn *p;
p = new prsn;
setData(p);
ll->head = p;
ll->tail = p;
ll->nodeCount++;
}
else
{
prsn *p;
p = new prsn;
setData(p);
ll->tail->Next_Person = p; //now point tail of second last element to last
ll->tail = p; //yes tail is now the new element inserted
ll->nodeCount++; //increment counter
}
}
void dlteRear(lndlst *ll)
{
prsn *tempLast;
prsn *temp2ndLast;
tempLast = ll->head ;
if (ll->nodeCount > 0 )
{ //we can use for loop with nodeCount or the following method
while (tempLast->Next_Person != NULL)
{
temp2ndLast = tempLast;
tempLast = tempLast->Next_Person ;
}
temp2ndLast->Next_Person = NULL;
delete tempLast;
ll->nodeCount --;
}
}
void PrintList(lndlst *ll)
{
int i = 0;
struct prsn *tempNode;
tempNode = ll->head ;
cout << \"The linked list is...\" << endl;
for (i = 0; i < ll->nodeCount ; i++)
{
cout << tempNode->name <<\"\\t\" <age << endl; ;
tempNode = tempNode->Next_Person ;
}
}.
#include sstream #include linkylist.h #include iostream.pdf
#include
#include \"linkylist.h\"
#include
#include
#include
#include
using namespace std;
int main(int argc, char *argv[])
{
//node* head = new node;
LinkedList list(1);
ifstream infile1 (argv[1]);
//make sure the file opens properly and read the contents of the file in to a list
if(!infile1)
{
cout<<\"Your Testfile could not be opened!\"<>users;
if (users.find(\"I\")!=string::npos)
{
//int spot = atoi((users[3]).c_str());
string pot = string(users.substr(2));
stringstream spot(pot);
string data;
cin>>data;
insertAfter(list.getNode(spot),data);
}
/*else if (users.find(\"D\")!=string::npos)
{
int spoty = atoi((users[3]).c_str());
deleteNode(spoty);
}*/
else if (users==\"L\")
{
list.traverse_and_print();
}
}
return 0;
#include
using namespace std;
class Node
{
friend class LinkedList;
private:
int value; /* data, can be any data type, but use integer for easiness */
Node *Next; /* pointer to the next node */
public:
/* Constructors with No Arguments */
Node(void)
: Next(NULL)
{ }
/* Constructors with a given value */
Node(int val)
: value(val), Next(NULL)
{ }
/* Constructors with a given value and a link of the next node */
Node(int val, Node* next)
: value(val), Next(next)
{}
/* Getters */
int getValue(void)
{ return value; }
Node* getNext(void)
{ return Next; }
};
/* definition of the linked list class */
class LinkedList
{
private:
/* pointer of head node */
Node *Head;
/* pointer of tail node */
Node *Tail;
public:
/* Constructors with a given value of a list node */
LinkedList(int val);
/* Destructor */
~LinkedList(void);
/* Function to append a node to the end of a linked list */
void tailAppend(string val);
/* Remove a node with a specific value if it exists */
void remove(int val);
void insertAfter(Node* afterMe, string val);
Node* getNode(int pos);
/* Traversing the list and printing the value of each node */
void traverse_and_print();
};
#include
#include \"linkylist.h\"
#include
using namespace std;
LinkedList::LinkedList(int val)
{
/* Create a new node, acting as both the head and tail node */
Head = new Node(val);
Tail = Head;
}
Node* LinkedList::getNode(int pos)
{
Node* p = Head;
/* Counter */
while (pos--) {
if (p != NULL)
p = p->Next;
else
return NULL;
}
return p;
}
void LinkedList::insertAfter(Node* afterMe, string val)
{
if(afterme != NULL)
{
afterMe->Next = new Node(val, afterMe->Next);
}
}
LinkedList::~LinkedList()
{
}
void LinkedList::tailAppend(string val)
{
/* The list is empty? */
if (Head == NULL) {
/* the same to create a new list with a given value */
Tail = Head = new Node(val);
}
else
{
/* Append the new node to the tail */
Tail->Next = new Node(val);
/* Update the tail pointer */
Tail = Tail->Next;
}
}
void LinkedList::remove(int val)
{
Node *pPre = NULL, *pDel = NULL;
/* Check whether it is the head node?
if it is, delete and update the head node */
if (Head->value == val) {
/* point to the node to be deleted */
pDel = Head;
/* update */
Head = pDel->Next;
delete pDel;
return;
}
pPre = Head;
pDel = Head->Next;
/*.
Rewrite this code so it can use a generic type instead of integers. .pdf
Rewrite this code so it can use a generic type instead of integers. This means we can use any data
type with it.
For example:
LinkedList = new LinkedLIst<>();
public class Main {
public static void main(String[] args) {
/*
* Expected output:
*
* The list: 8 -> 1 -> 5 -> 3 -> 6
* Size: 5
* Head: 8
* Tail: 6
* Removeing 1...
* The list: 8 -> 5 -> 3 -> 6
* Size: 4
* Head: 8
* Tail: 6
* Removeing head...
* The list: 5 -> 3 -> 6
* Size: 3
* Head: 5
* Tail: 6
* Removeing tail...
* The list: 5 -> 3
* Size: 2
* Head: 5
* Tail: 3
*/
LinkedList list = new LinkedList();
list.append(5);
list.append(3);
list.append(6);
list.prepend(1);
list.prepend(8);
printListDetails(list);
System.out.println("Removeing 1...");
list.removeByValue(1);
printListDetails(list);
System.out.println("Removeing head...");
list.removeHead();
printListDetails(list);
System.out.println("Removeing tail...");
list.removeTail();
printListDetails(list);
}
public static void printListDetails(LinkedList list) {
System.out.println("The list: " + list.toString());
System.out.println("Size: " + list.size());
System.out.println("Head: " + list.getHead());
System.out.println("Tail: " + list.getTail());
}
}
________________________________________
public class LinkedList {
private Node head;
private Node tail;
private int size;
public LinkedList() {
head = null;
tail = null;
size = 0;
}
public void append(int data) {
Node newNode = new Node(data);
if (head == null) {
head = newNode;
} else {
tail.next = newNode;
}
tail = newNode;
size++;
}
public void prepend(int data) {
Node newNode = new Node(data);
if (head == null) {
head = newNode;
tail = newNode;
} else {
newNode.next = head;
head = newNode;
}
size++;
}
public int getHead() {
return head.data;
}
public int getTail() {
return tail.data;
}
public int size() {
return size;
}
public void removeByValue(int data) {
Node current = head;
while (current.next != null && current.next.data != data) {
current = current.next;
}
if (current.next != null) {
current.next = current.next.next;
size--;
if (current.next == null) {
tail = current;
}
}
}
public int removeHead() {
int removedData = head.data;
head = head.next;
size--;
if (head == null) {
tail = null;
}
return removedData;
}
public int removeTail() {
int removedData = tail.data;
if (head == tail) {
head = null;
tail = null;
} else {
Node current = head;
while (current.next != tail) {
current = current.next;
}
tail = current;
tail.next = null;
}
size--;
return removedData;
}
@Override
public String toString() {
StringBuilder builder = new StringBuilder();
Node current = head;
while (current != null) {
builder.append(current.data);
if (current.next != null) {
builder.append(" -> ");
}
current = current.next;
}
return builder.toString();
}
private class Node {
public Node next;
public int data;
public Node(int data) {
this.data = data;
}
}
}.
tested on eclipseDoublyLinkedList class.pdf
//tested on eclipse
/*************DoublyLinkedList class*******************/
public class DoublyLinkedList {
/*Data member variable declaration*/
private Node head;
private int count;
/**default constructor*/
public DoublyLinkedList() {
/*Initializing variable*/
head=null;
count =0;
}
/*Insert at beginning in doubly linked list*/
public void insertBeginning(String name){
/*checking head is null then we will add node at head*/
if(head==null){
head=new Node(name, null, null);
count++;
}else{
/*else create temp node and setting next to head
* and then making temp to head*/
Node temp=new Node(name,null,null);
temp.setNext(head);
head.setPrev(temp);
head=temp;
count++;
}
}
public void printList(){
Node temp=head;
/*Printing element of doubly list*/
while(temp!=null){
System.out.println(temp.getData());
temp=temp.getNext();
}
}
/*Returning count from doubly linked list*/
public int count(){
return count;
}
/*deleting specific node from doubly linked list*/
public void delete(String name){
Node current=head,previous=head;
/*if it is head node to be deleted*/
if(head.getData().equals(name)){
current=head.getNext();
current.setPrev(null);
head=current;
previous=head;
}else{
/*If node in middle of list*/
while(current.getNext()!=null){
if(current.getData().equals(name)){
current.getNext().setPrev(previous);
previous.setNext(current.getNext());
count--;
break;
}
previous=current;
current=current.getNext();
}
/*If node is at last*/
if(current.getNext()==null){
if(current.getData().equals(name)){
previous.setNext(null);
count--;
}
}
}
}
/*deleting all nodes from list by assigning head to null
* and memory releasing take care by garbage collector*/
public void clear(){
head=null;
count=0;
}
/*Inserting element in alphabetic order*/
public void insertAlpha(String name){
Node current=head,previous=head;
/*creating new node*/
Node newNode=new Node(name,null,null);
/*if head node is null*/
if(head==null){
head=newNode;
count++;
}else{
/*please read about compareTo() method about returning value*/
if(head.getData().compareTo(name)>0){
newNode.setNext(head);
head=newNode;
count++;
}else{
/*condition for getting position of node to be inserted*/
while(current!=null&¤t.getData().compareTo(name)<=0){
previous=current;
current=current.getNext();
}
/*if node need to be inserted at last*/
if(current==null){
previous=newNode;
}else{
/*If node need to inserted in middle*/
newNode.setNext(current);
previous.setNext(newNode);
current.setPrev(newNode);
newNode.setPrev(previous);
}
count++;
}
}
}
/*Main method start*/
public static void main(String args[]){
/*creating object of doubly linked list*/
DoublyLinkedList doublyLinkedList=new DoublyLinkedList();
doublyLinkedList.insertBeginning(\"sunita\");
doublyLinkedList.insertBeginning(\"lalchand\");
/*calling alphabetic order method*/
doublyLinkedList.insertAlpha(\"ramsingh\");
doublyLinkedList.insertBeginning(\"Lokesh\");
doublyLinkedList.insertBeginning(\"Pritam\");
/*****printing list********/
doublyLinkedList.printL.
^^^ Discuss about Header Node And also write a program for unorder.pdf
^^^ Discuss about Header Node? And also write a program for unordered single linked list and
linked implementation of QUEUE?
Solution
Header node:
Sometimes it is desire to keep an extra node at the front of a List. Such a node doesn’t represent
an item in the List and is called a Header Node or a List Header. The Information field of such
Header node might be unused but the Next field maintains the first node address. More often the
information of such a node could be used to keep Global Information about the Entire List.
One of the applications of Header node is the information portion of the Header node contains
the number of nodes (not including Header) in the List. In this Structure the Header must be
adjusted the total number of nodes when we apply addition or deletion operation on the List. We
can directly obtained the total number of nodes without traversing the entire List.
By using this application, we can develop Data Structure Stack easily. Since Header node
information field maintains the number of elements that the Stack contains.
Another application is we can simply develop the Data Structure Queue. Until now, two external
pointers, Front & Rear, were necessary for a List to represent a Queue. However, now only a
single external pointer is sufficient to maintain a Queue that is Head node. Because the Header
node next field behave like a Front and information field of Header node maintains last node
address so that it is behave like a Rear .
Another possibility for the use of the information portion of a List Header is as a pointer
to a Curr node in the List during a traversal process. This would be eliminate the node for an
external pointer during traversal.
#include
#include
#include
#include
struct node
{
char info;
struct node *next;
};
typedef struct node sl;
void display(sl *);
sl * create(sl *root)
{
sl *curr,*new;
char val;
printf(\"\ Enter $ to STOP --- Otherwise Continue : \");
fflush(stdin);
scanf(\"%c\",&val);
while(val != \'$\')
{
new=(sl *) malloc(sizeof(sl));
new->info = val;
new->next = NULL;
if(root == NULL)
root = new;
else
{
curr = root;
while( curr->next != NULL )
curr = curr->next;
curr->next = new;
}
printf(\" Enter $ to STOP --- Otherwise Continue : \");
fflush(stdin);
scanf(\"%c\",&val);
}
printf(\"\ The Created Linked List Is \ \");
display(root);
return root;
}
sl * delete(sl *root,char val)
{
sl *temp,*curr,*rear;
curr = root;
rear = NULL;
while( curr != NULL && val != curr->info )
{
rear = curr;
curr = curr->next;
}
if(curr == NULL)
{
if( rear == NULL)
{
printf(\"\ Linked List is Empty\");
printf(\"\ Deletion is not Possible \");
}
else
{
printf(\"\ deleted Node does not exist in List\");
printf(\"\ Deletion is not Possible \");
}
}
else
{
if( rear == NULL)
{
temp = root;
root = root->next;
}
else
{
temp = curr;
rear->next = curr->next;
}
printf(\"\ Node is deleted \");
printf(\"\ Deleted Node information is %c\",temp->info);
free(temp);
}
display(root);
return root;
}
sl * insert(sl *root,char val)
{.
You can list anything, it doesnt matter. I just want to see code f.pdf
You can list anything, it doesn\'t matter. I just want to see code for this problem. Thank you
Solution
Include header files .......
Source code:
public class SinglyLinkedListImpl {
private Node head;
private Node tail;
public void add(T element){
Node nd = new Node();
nd.setValue(element);
System.out.println(\"Adding: \"+element);
if(head == null){
head = nd;
tail = nd;
} else {
tail.setNextRef(nd);
}
tail = nd;
}
}
public void addAfter(T element, T after){
Node tmp = head;
Node refNode = null;
System.out.println(\"Traversing to all nodes..\");
while(true){
if(tmp == null){
break;
}
if(tmp.compareTo(after) == 0){
refNode = tmp;
break;
}
tmp = tmp.getNextRef();
}
if(refNode != null){
Node nd = new Node();
nd.setValue(element);
nd.setNextRef(tmp.getNextRef());
if(tmp == tail){
tail = nd;
}
tmp.setNextRef(nd);
} else {
System.out.println(\"Unable to find the given element...\");
}
}
public void deleteFront(){
if(head == null){
System.out.println(\"Underflow...\");
}
Node tmp = head;
head = tmp.getNextRef();
if(head == null){
tail = null;
}
System.out.println(\"Deleted: \"+tmp.getValue());
}
public void deleteAfter(T after){
Node tmp = head;
Node refNode = null;
System.out.println(\"Traversing to all nodes..\");
while(true){
if(tmp == null){
break;
}
if(tmp.compareTo(after) == 0){
refNode = tmp;
break;
}
tmp = tmp.getNextRef();
}
if(refNode != null){
tmp = refNode.getNextRef();
refNode.setNextRef(tmp.getNextRef());
if(refNode.getNextRef() == null){
tail = refNode;
}
System.out.println(\"Deleted: \"+tmp.getValue());
} else {
System.out.println(\"Unable to find the given element...\");
}
}
public void traverse(){
Node tmp = head;
while(true){
if(tmp == null){
break;
}
System.out.println(tmp.getValue());
tmp = tmp.getNextRef();
}
}
public static void main(String a[]){
SinglyLinkedListImpl sl = new SinglyLinkedListImpl();
sl.add(3);
sl.add(32);
sl.add(54);
sl.add(89);
sl.addAfter(76, 54);
sl.deleteFront();
sl.deleteAfter(76);
sl.traverse();
}
}
class Node implements Comparable {
private T value;
private Node nextRef;
public T getValue() {
return value;
}
public void setValue(T value) {
this.value = value;
}
public Node getNextRef() {
return nextRef;
}
public void setNextRef(Node ref) {
this.nextRef = ref;
}
public int compareTo(T arg) {
if(arg == this.value){
return 0;
} else {
return 1;
}
}
}
This program implement the concept of single linked list..
Discuss about Header Node And also write a program for unordered si.pdf
Consider rectangle ABCD. If mADF=60°, then what is the mFDC?
a) 60°
b) 30°
c) 90°
d) 120°
e) 45°
f) None of the above
Solution
Given figure ABCD is a rectangle.
Looking into the properties of rectangle,
1) All the angles in a rectangle are right angles i.e. equal to 90 degrees.
2) Opposite sides are parallel and equal.
By the first property stated above,
m(D) = 90 degrees
Angle D can be written as given in the following
m(D) = m(ADF) + m(FDC) = 90
Given m(ADF) = 60
Therefore, 60 + m(FDC) = 90
m(FDC) = 30 degress.
Hence option B) 30 is the required answer..
So I have this code(StackInAllSocks) and I implemented the method but.pdf
So I have this code( StackInAllSocks ) and I implemented the method but I can't seem to figure
out why there isn't anything showing up on the console. It should pop,peek and push b using the
methods from the class called ArrayListTen . The ArrayListTen works fine and compiles the
tested code of Rigth# but for StackInAllSocks it doesn't complete at all. note that file
VodeDodeis not to be changed is just a Node storage area of the array list.
Did I implement the method on StackInAllSocks correctly? if so, should I not use the method
from the ArrayListTen .?
__________________________________________________________________________
: the code is : VodeDodeis
class VodeDode<T> {
private T data;
private VodeDode<T> next;
private VodeDode<T> prev;
public VodeDode(T data) {
this.data = data;
this.next = null;
this.prev = null;}
public T getData() {
return data;}
public void setData(T data) {
this.data = data;}
public VodeDode<T> getNext() {
return this.next;}
public void setNext(VodeDode<T> next) {
this.next = next;}
public VodeDode<T> getPrev() {
return this.prev;}
public void setPrev(VodeDode<T> prev) {
this.prev = prev;}
@Override
public String toString() {
return data.toString();}}
_________________________________________________________________________
CODE that works fine called ArrayListTen:
import java.util.Iterator;
public class ArrayListTen<T> implements Iterable<T> {
private VodeDode<T> head; //beginning of list
private VodeDode<T> tail; //end of list
private int size;
private VodeDode<T> new_item;
public ArrayListTen( ){
this.head = null;
this.tail = null;
this.size = 0;}
public int lenght() {
return size ;}
public T getBegin() {
if (this.head != null) {
return head.getData();}
else { return null;}}
public void addBegin(T value) {
VodeDode<T> newVodeDode =new VodeDode<T>(value);
if (this.head== null) {
head = newVodeDode;
tail =newVodeDode;}
else {VodeDode<T> temp = head;
head = newVodeDode;
head.setNext(temp);}
size++;}
public T removeBegin() {
if(this.head == null) {
return null;}
else {T current = head.getData();
if (tail == head) {
tail = null;
head = null;
} else {
head = head.getNext();
head.setPrev(null);}size--;
return current;}}
public T getEnd() {
if (tail != null) {
return tail.getData();
} else {
return null;}}
public void addEnd(T value) {
VodeDode<T> newVodeDode = new VodeDode<T>(value);
if (this.tail == null) {
head = newVodeDode;
tail = newVodeDode;
} else {
newVodeDode.setPrev(tail);
tail.setNext(newVodeDode);
tail = newVodeDode;}
size++;}
public T removeEnd() {
if(this.tail == null) {
return null;}
else {
T current = tail.getData();//was head.
if (head == tail) {
head = null;
tail = null;
} else {
tail = tail.getPrev();
tail.setNext(null);}
size--;
return current;}}
public T removeBN(T value) {
VodeDode<T> currVodeDode = head;
VodeDode<T> prevVodeDode = null;
while(currVodeDode != null){
if(currVodeDode.getData().equals(value)){
if(prevVodeDode != null){
prevVodeDode.setNext(currVodeDode.getNext());}
else{
head = curr.
Similar to Using Java programming language solve the followingSLL CLASS.pdf (20)
Please finish the int LLInsert function.typedef struct STUDENT {.pdf
Please finish the int LLInsert function.typedef struct STUDENT {.pdf
mainpublic class AssignmentThree { public static void ma.pdf
mainpublic class AssignmentThree { public static void ma.pdf
Table.java Huffman code frequency tableimport java.io.;im.docx
Table.java Huffman code frequency tableimport java.io.;im.docx
Solutionclass IntNode { int data; public IntNode next,head;.pdf
Solutionclass IntNode { int data; public IntNode next,head;.pdf
fix the error - class Node{ int data- Node next-.pdf
fix the error - class Node{ int data- Node next-.pdf
how do i expand upon selectionSortType so that you are no longer bou.pdf
how do i expand upon selectionSortType so that you are no longer bou.pdf
#include sstream #include linkylist.h #include iostream.pdf
#include sstream #include linkylist.h #include iostream.pdf
Rewrite this code so it can use a generic type instead of integers. .pdf
Rewrite this code so it can use a generic type instead of integers. .pdf
^^^ Discuss about Header Node And also write a program for unorder.pdf
^^^ Discuss about Header Node And also write a program for unorder.pdf
You can list anything, it doesnt matter. I just want to see code f.pdf
You can list anything, it doesnt matter. I just want to see code f.pdf
Discuss about Header Node And also write a program for unordered si.pdf
Discuss about Header Node And also write a program for unordered si.pdf
So I have this code(StackInAllSocks) and I implemented the method but.pdf
So I have this code(StackInAllSocks) and I implemented the method but.pdf
More from adonisjpr
Una mujer de 36 a�os que se someti� a un trasplante de ri��n hace 2 .pdf
Una mujer de 36 aos que se someti a un trasplante de rin hace 2 meses desarroll fiebre, malestar
general, mialgias y leucopenia. los medicamentos incluyen prednisona y ciclosporina. una
radiografa de trax muestra infiltrados pulmonares intersticiales bilaterales. durante los siguientes
2 das, su estado respiratorio se deteriora y es intubada y ventilada mecnicamente. Se muestra el
tejido obtenido en una biopsia del pulmn. El tratamiento ms adecuado incluye la administracin
de cul de los siguientes frmacos? y por qu
aciclovir
B.ganciclovir
C. interfern-gamma
D. lamivudina.
Una empresa tiene un ciclo operativo de 120 d�as, un per�odo promedi.pdf
Una empresa tiene un ciclo operativo de 120 das, un perodo promedio de cobro de 40 das y un
perodo promedio de pago de 30 das. La antigedad promedio del inventario de la empresa es
________ das.
80
70
90
50
80
70
90
50.
Una empresa pag� por �ltima vez un dividendo de �3. Si el rendimient.pdf
Una empresa pag por ltima vez un dividendo de 3. Si el rendimiento esperado de su capital se
estima en 12% y sus acciones se cotizan actualmente en la Bolsa de Valores de Londres a 75, cul
debera ser la tasa de crecimiento de dividendos para asegurar que el precio sea consistente con el
precio de una perpetuidad creciente?.
Una cartera eficiente es una combinaci�n de activos que 0 1 pun.pdf
Una cartera eficiente es una combinacin de activos que:
0 / 1 punto
Logra la mayor covarianza posible entre sus activos.
Ofrece una tasa de rendimiento libre de riesgo al minimizar el riesgo de la cartera.
Logra el rendimiento ms alto para un riesgo dado.
Minimiza el riesgo al garantizar que solo permanezca el riesgo diversificable..
Un objetivo a corto plazo esOpci�n multiple A) una meta espec.pdf
Un objetivo a corto plazo es:
Opcin multiple
A) una meta especfica que los gerentes deben lograr en no ms de un ao para alcanzar sus metas a
largo plazo.
B) una accin especfica que usan los gerentes para alcanzar sus metas a largo plazo.
C) una tctica especfica implementada para apoyar el plan estratgico.
d) un componente especfico de la cuenta de resultados presupuestada..
Tyco International, una empresa de fabricaci�n, demand� a su ex dire.pdf
Tyco International, una empresa de fabricacin, demand a su ex director ejecutivo, Dennis
Kozlowski, por haber recibido bonificaciones no autorizadas de las ganancias de la empresa.
Entre sus otras fechoras, Kozlowski otorg bonos especiales no autorizados a s mismo y a ms de
40 empleados de Tyco. En suma, se apropi indebidamente de fondos de la empresa por ms de
$100 millones que no estaba autorizado a recibir. En esta apropiacin indebida se incluy el uso de
fondos de la empresa para gastos personales, como $18 millones para comprar y redecorar su
apartamento en la ciudad de Nueva York y $1 milln para la fiesta de cumpleaos nmero 40 de su
esposa, celebrada en la isla italiana de Cerdea. La extravagante fiesta cont con una escultura de
hielo de la estatua de David orinando vodka Stolichnaya. Con base en estos y otros delitos
corporativos en procedimientos penales relacionados, Kozlowski actualmente cumple entre 8,33
y 25 aos en el Centro Correccional del Estado Medio en Nueva York. Cmo cree que habra
actuado Kozlowski si hubiera considerado la prueba de divulgacin pblica antes de participar en
estas fechoras corporativas? Y si aplicara la prueba de universalizacin? [Tyco Intl, Ltd. contra
Kozlowski, 2005 DNH 68; 2005 Distribucin de EE. UU. LEXIS 6867 (21 de abril de 2005).].
Un informe de an�lisis de estados financieros no incluye A) una dec.pdf
Un informe de anlisis de estados financieros no incluye: A) una declaracin del auditor, B) una
descripcin general del anlisis, C) material probatorio, D) factores clave cualitativos y
cuantitativos, E) Inferencias tales como previsiones.
El anlisis vertical se utiliza para revelar patrones en los datos que cubren dos o ms perodos
sucesivos. Verdadero o falso?
El ndice de flujo de efectivo sobre activos totales en comparacin con el ndice de activos totales
se puede utilizar como indicador de la calidad de las ganancias. Verdadero o falso.
ubat 2015te Hazine 4 78lik 2044 alt aylk bileik vadeye kadar 2,8.pdf
ubat 2015'te Hazine 4 7/8'lik 2044 alt aylk bileik vadeye kadar %2,80 getiri teklif etti. Kuponlarn
alt ayda bir dendiini kabul ederek tahvilin fiyatn hesaplayn. Nominal deerin 1.000 $ olduunu
varsayalm. (Ara hesaplamalar yuvarlamayn. Cevabnz 2 ondalk basamaa yuvarlayn.)
tahvil fiyat.
Two categories of attackers include hacktivists and state actors. .pdf
Two categories of attackers include hacktivists and state actors.
What are the differences between hacktivists and state-sponsored attackers? Write a report
detailing what you were able to find..
Twitter, el popular sitio de microblogs, se ha enfrentado a graves c.pdf
Twitter, el popular sitio de microblogs, se ha enfrentado a graves cadas en el valor de sus
acciones. Esta cada en el valor de las acciones se ha producido a pesar de que la lnea superior de
la compaa creci un 74% y un 111% en los ltimos resultados trimestrales y anuales,
respectivamente. El servicio es gratuito para los usuarios, con ingresos generados principalmente
por la venta de anuncios. Por qu Twitter ha perdido el favor de los inversores? La base de
usuarios de Twitter de 302 millones de usuarios es mucho menor que la base de usuarios de
Facebook de 1.400 millones de usuarios. Instagram ha experimentado un rpido crecimiento,
acercando el tamao de su base de usuarios al de Twitter. Incluso Snapchat est ganando usuarios a
un ritmo mucho ms rpido que Twitter. La tasa de cambio est aumentando en el sentido de que
cada da se lanzan nuevas redes sociales. Por lo tanto, los inversores estn preocupados por las
presiones competitivas. En comparacin, mientras Twitter contina agregando nuevos usuarios, su
ritmo de crecimiento es lento. Esto se debe a la incapacidad de Twitter para hacer una propuesta
de valor clara a los nuevos usuarios. Aunque cientos de millones de usuarios ms se han
registrado en la plataforma de Twitter, una gran cantidad de ellos no se han convertido en
usuarios activos en la plataforma. Para combatir estos desafos, Twitter ha iniciado cambios en las
funciones de su plataforma y en su liderazgo corporativo. Twitter ha introducido nuevas
funciones para los usuarios, incluidas lneas de tiempo instantneas, pginas de inicio sin sesin y
funciones de mensajera mejoradas. Quizs an ms significativo es el cambio de liderazgo en la
parte superior de la organizacin. Jack Dorsey, cofundador y presidente de la junta, reemplazar a
Costolo como director ejecutivo, al menos hasta que se identifique un sucesor ms permanente.
La tabla enumera varias fuerzas que podran incitar a cambios en la organizacin de Twitter.
Para cada elemento, clasifique la fuerza como fuerza interna o externa.
Fuerza
Pronsticos pesimistas de los analistas de la industria
Regulaciones que afectan a la industria, como las reglas de neutralidad de la red
Innovacin que mejora la experiencia del usuario
Twitter experiment ___ cuando reemplaz a su CEO.
a. cambio de organizacion
b. innovacin
C. desarrollo organizativo
Cules de las siguientes son posibles razones por las que Twitter cambi los roles de su liderazgo
ejecutivo? Marque todo lo que corresponda.
Twitter debe lograr una mayor tasa de conversin de usuarios pasivos a activos.
Twitter se enfrenta a una mayor competencia de empresas como Facebook.
Twitter quera un proceso de toma de decisiones ms gil.
La junta directiva de Twitter exigi cambios en la estructura ejecutiva.
Cuando la junta directiva de Twitter decidi nombrar un nuevo director ejecutivo para restaurar la
confianza de los inversores, este cambio se debi principalmente a qu factor?
Una fuerza externa
Una fuerza interna
cambio organico
Mantenimiento.
Turner, Roth y Lowe son socios que comparten ingresos y p�rdidas en .pdf
Turner, Roth y Lowe son socios que comparten ingresos y prdidas en una proporcin de 2:3:5.
Despus de largos desacuerdos entre los socios y varios perodos improductivos, los socios
deciden liquidar la sociedad. Inmediatamente antes de la liquidacin, el balance de la sociedad
muestra activos totales, $164,400; pasivo total, $110,000; Turner, Capital, $5,700; Roth, Capital,
$15,600; y Lowe, Capital, $33,100. Los ingresos en efectivo de la venta de los activos fueron
suficientes para pagar a los acreedores todo menos $44,000. Requerido: a. Calcule la prdida por
la venta de los activos. b. Distribuya la prdida de la parte a a los socios. C. Determinar cunto, en
su caso, cada socio debe contribuir a la sociedad para cubrir cualquier deficiencia de capital
restante..
Uber - Bir Startupn K�kenleri ve lk G�nleriDava M�terileri ele.pdf
Uber - Bir Startup'n Kkenleri ve lk Gnleri
Dava:
Mterileri eletirmek. Ksa deien iiler. Saldrgan dzenleyiciler. Aldatc yetkililer. "Her ne pahasna
olursa olsun kazan" iyeri kltrnde kural ihlali ve acmaszln vurgulanmas. Sadece yedi ylda
balangtan 70 milyar dolarlk bir iletmeye gemek iin gereken bu mu? Yoksa bu nitelendirmeler,
kskan rakiplerin eletirileri yanl m? Uber ya da dnyann nde gelen ulam hizmetlerinden biri olan
Uber Technologies Inc. olarak bilinen dk maliyetli ara arma hizmetinin heyecanl yolculuuna
uzunca bir gz atalm.
Balarken
2008 ylnda Paris'te bir konferansa katlan teknoloji giriimcileri Garrett Camp ve Travis Kalanick,
karl bir gecede taksi bulmann zorluundan ikayet ediyorlard. Bu dei tokutan, bir dmeye
dokunarak talep zerine bir araba aracak yeni teknoloji yaratma fikri geldi. The Upstarts'ta yazar
Brad Stone, en azndan irketin resmi kken efsanesinin bu olduuna dikkat ekiyor. Aslnda bu fikri
ortaya atan Camp, bir sredir arkada Kalanick ile akll telefon tabanl bir ehir arabas (lks araba veya
siyah araba) paylam hizmeti kavramn tartyordu.
Camp, yelerin favori web sitelerini dier insanlarla paylamalarna olanak tanyan keif ve neri
arama motoru StumbleUpon'un kurucu ortayd. Kalanick ("cal-a-nick" olarak telaffuz edilir) ilk
iini 18 yanda kurdu, bu bir SAT-hazrlk zel ders hizmetiydi. Bir dosya paylam ve hizmet ii olan
Scour, onun ikinci i macerasyd, ancak Kalanick'in byk abasna ve srarna ramen baarsz oldu. Bir
sonraki giriimi, bir video ak giriimi olan Red Swoosh'du. 2007'de 23 milyon dolara satld. Mart
2009'da Camp, Calgary'den eski yksek lisans rencileri Oscar Salazar ve Conrad Whelan ile
birlikte Kalanick'in "mega danman" olarak grev yapt yeni ehir arabas fikrinin denenmesinde ba
ekti. . Bunlardan biri, ilk olarak Haziran 2007'de Apple tarafndan piyasaya srlen ve yalnzca akll
telefon endstrisinde devrim yaratmakla kalmayp ayn zamanda genellikle "paylam ekonomisi"
olarak adlandrlan modern ibirliki ekonomiyi yaratmasyla tannan iPhone iin bir mobil
uygulamann prototipiydi.
Mart 2009'da UberCab olarak kurulan irket, mobil uygulama konseptini ilk olarak New York'ta
test etti, ardndan 2011'de San Francisco'da kullanclarn siyah lks bir araba talep etmek iin
iPhone'larnda bir dmeye basmalarna veya bir metin gndermelerine olanak tanyan bir hizmet
olarak resmi olarak lanse edildi. (limuzin), geleneksel bir taksinin fiyatnn sadece 1,5 kat.
Ancak o zamanki taksi irketlerinden farkl olarak, UberCab'in ayrt edici zellii, bir ulam a irketi
olarak adlandrlmasyd; bu irkette yolcular, mobil uygulama veya web sitesi araclyla hizmet talep
edebilir ve srcnn konumunu (GPS araclyla) takip edebilirdi. telefonlarnda) ve arabann tam olarak
ne zaman geleceini biliyorlar.
Birka arabas olmasna ve ok az kiinin bunu bilmesine ramen, giriim byk bir hit oldu. 2011 ylnda,
ehir ve eyalet dzenleyicilerinin srar zerine, irket adn UberCab'den (nk bir ehir arabas veya taksi
firmasnn ruhsat gerekliliklerini karlamad iin) "sper" anlamna gelen Uber'e (Almanca ber
kelimesi.
Trilogy Enterprises Inc. de Austin, Texas, es una empresa de softwar.pdf
Trilogy Enterprises Inc. de Austin, Texas, es una empresa de software de rpido crecimiento y
proporciona soluciones de software a empresas globales gigantes para mejorar las ventas y el
rendimiento. Se enorgullece de su cultura nica y poco ortodoxa. Muchos de sus enfoques de la
prctica comercial son inusuales, pero en el entorno altamente competitivo y cambiante de
Trilogy, parecen funcionar. No existe un cdigo de vestimenta y los empleados establecen sus
propios horarios, a menudo muy extensos. Tienden a socializar juntos (la edad promedio es de 26
aos), tanto en la cocina bien surtida de la oficina como en eventos patrocinados por la empresa y
viajes a lugares como clubes de baile locales y retiros en Las Vegas y Hawi. Se ha desarrollado
una jerga interna y la historia compartida de la firma ha adquirido el estatus de leyenda. La
responsabilidad es pesada y llega temprano, con una actitud de "hazlo ahora" que prescinde de
largos aprendizajes. Los nuevos reclutas reciben unas pocas semanas de capacitacin intensiva,
conocida como "Universidad de Triloga" y los participantes la describen como "ms como un
campo de entrenamiento que una escuela de negocios".
La informacin se entrega como si fuera una manguera contra incendios y se espera que los
nuevos empleados comprometan su experiencia y vitalidad en todo lo que hacen. Jeff Daniel,
director de reclutamiento universitario, admite que la empresa intensa y poco convencional no es
el empleador para todos. Pero definitivamente es un entorno donde las personas apasionadas por
lo que hacen pueden prosperar. La empresa emplea a unas 700 personas tan apasionadas. Los
gerentes de Trilogy saben que el rpido crecimiento que buscan depende de tener un personal de
las mejores personas que puedan encontrar, capacitadas rpidamente y con amplia responsabilidad
y libertad lo antes posible. El CEO Joe Liemandt dice: En una empresa de software, las personas
lo son todo. No puedes construir la prxima gran empresa de software, que es lo que estamos
tratando de hacer aqu, a menos que ests totalmente comprometido con eso. Por supuesto, los
lderes de todas las empresas dicen: "La gente lo es todo". Pero no actan en consecuencia. Trilogy
hace que encontrar a las personas adecuadas (las llama "grandes personas") sea una misin de toda
la empresa. Los reclutadores buscan activamente a las personas ms frescas, si al menos con
experiencia, en el mercado laboral, buscando ferias de carreras universitarias y departamentos de
ciencias de la computacin para personas talentosas con ambicin e instinto empresarial.
Los altos directivos llevan a cabo las primeras rondas de entrevistas y les informan a los
prospectos que se vern presionados para lograr logros pero que sern bien recompensados. Los
empleados llevan a los reclutas y a sus seres queridos a la ciudad cuando vuelan a Austin para la
visita preliminar estndar de 3 das. Un da tpico puede comenzar con entrevistas agotadoras, pero
terminar con ciclismo de montaa, patinaje sob.
Transforming Data - Creating a Data Set Creating a JOIN between two .pdf
Transforming Data - Creating a Data Set Creating a JOIN between two tables is one of several
ways to consolidate data. Which of the following is NOT true about table JOINS in Tableau?
Select one. JOINs effectively create one physical table of combined data. All JOIN types
combine data in the same way. To JOIN two tables in Tableau, you must first double-click on the
primary table, to reveal the physical layer. After performing a JOIN, we should hide one of the
JOIN keys to ensure we do not have duplicate columns..
Using the location quotients(LQ) for year 2020 for 10 provinces anal.pdf
Using the location quotients(LQ) for year 2020 for 10 provinces analyze what province has the
most relational importance in the following sectors. (i)Agriculture (ii)Forestry, fishing, mining,
quarrying, oil, and gas (iii)Manufacturing In this answer can you please mention the names of
the provinces like Manitoba, Alberta and in the answer its mentions like province A and province
B which don't indicate the province clearly instead please provide the names for them..
Using the packet tracer simulator, create a network topology that in.pdf
Using the packet tracer simulator, create a network topology that includes at least one router, one
switch, and several PCs.
4. Assign IP addresses and subnet masks to the devices in the network, making sure to use
appropriate IP addressing scheme.
5. Connect the devices together using the appropriate cables or connections, including
configuring VLANs on the switch.
6. Configure basic router and switch security features such as ACLs, port security, and VLAN
access controls.
7. Save the network diagram as a reference for future use.
8. Describe the process of creating a network diagram that documents the necessary data,
including IP addresses, subnet masks, and connections between devices, as well as the security
configurations implemented.
9. Submit the network diagram along with a brief report that explains the purpose and role of
each device in the network, as well as the security measures implemented and their justification
10. Analyse a sample medium complex network segment and identify common areas for
improvement and potential risks. 3. Using the packet tracer simulator, create a network topology
that includes at least one router, one switch, and several PCs. 4. Assign IP addresses and subnet
masks to the devices in the network, making sure to use appropriate IP addressing scheme. 5.
Connect the devices together using the appropriate cables or connections, including configuring
VLANs on the switch. 6. Configure basic router and switch security features such as ACLs, port
security, and VLAN access controls. 7. Save the network diagram as a reference for future use.
8. Describe the process of creating a network diagram that documents the necessary data,
including IP addresses, subnet masks, and connections between devices, as well as the security
configurations implemented. 9. Submit the network diagram along with a brief report that
explains the purpose and role of each device in the network, as well as the security measures
implemented and their justification 10. Analyse a sample medium complex network segment and
identify common areas for improvement and potential risks..
using silde 2 to answer silde 1 and 3 Step 17 of 40 - Create T Accou.pdf
using silde 2 to answer silde 1 and 3 Step 17 of 40 - Create T Account Listing Students
A Allowance
Step 18 of 40 - General Journal Entries
1415161718YouRTURN:Createjournalentriestorecordtheincreaseordecreaseintheatlowancebased
upontheamounteyouenteredintheTaccount..
Using financial data and information from Yahoo Finance only, calcul.pdf
Using financial data and information from Yahoo Finance only, calculate the intrinsic value (or
calculated price) of Tesla, Inc.
Using the Free Cash Flow Method of Valu.
using IRAC method Joseph was a team manager of an excursion in the O.pdf
using IRAC method Joseph was a team manager of an excursion in the Okavango Delta. Two of
Joseph' s team were attacked by elephants and left, claiming that it has become too dangerous.
With that Joseph promised the other colleague who remained, Karabo, that if she stayed and all
of the excursion work was completed, Karabo would get monies of one of the colleagues who
left without completing work. Karabo went on and agreed, but after the excursion was done, to
Karabo's surprise Joseph refuses to pay the money to Karabo. in 250-350 words ,advice Karabo
whether she is entitled to the extra payment.
using IRAC method Mary is an explorer and is about to set off on a.pdf
using IRAC method
Mary is an explorer and is about to set off on a ground-breaking expedition at the Debswana
mines. Rose and John , who are Mary's friends are also professional explorers themselves, they
then entered into a written agreement with each other that they will each help Mary from the
start to the the end of her expedition. John breaks the agreement and does not help Mary to the
end of her expedition, and instead returns home early.
in 250-350 words advise Mary as to whether she can sue John for breach of contract.
More from adonisjpr (20)
Una mujer de 36 a�os que se someti� a un trasplante de ri��n hace 2 .pdf
Una mujer de 36 a�os que se someti� a un trasplante de ri��n hace 2 .pdf
Una empresa tiene un ciclo operativo de 120 d�as, un per�odo promedi.pdf
Una empresa tiene un ciclo operativo de 120 d�as, un per�odo promedi.pdf
Una empresa pag� por �ltima vez un dividendo de �3. Si el rendimient.pdf
Una empresa pag� por �ltima vez un dividendo de �3. Si el rendimient.pdf
Una cartera eficiente es una combinaci�n de activos que 0 1 pun.pdf
Una cartera eficiente es una combinaci�n de activos que 0 1 pun.pdf
Un objetivo a corto plazo esOpci�n multiple A) una meta espec.pdf
Un objetivo a corto plazo esOpci�n multiple A) una meta espec.pdf
Tyco International, una empresa de fabricaci�n, demand� a su ex dire.pdf
Tyco International, una empresa de fabricaci�n, demand� a su ex dire.pdf
Un informe de an�lisis de estados financieros no incluye A) una dec.pdf
Un informe de an�lisis de estados financieros no incluye A) una dec.pdf
ubat 2015te Hazine 4 78lik 2044 alt aylk bileik vadeye kadar 2,8.pdf
ubat 2015te Hazine 4 78lik 2044 alt aylk bileik vadeye kadar 2,8.pdf
Two categories of attackers include hacktivists and state actors. .pdf
Two categories of attackers include hacktivists and state actors. .pdf
Twitter, el popular sitio de microblogs, se ha enfrentado a graves c.pdf
Twitter, el popular sitio de microblogs, se ha enfrentado a graves c.pdf
Turner, Roth y Lowe son socios que comparten ingresos y p�rdidas en .pdf
Turner, Roth y Lowe son socios que comparten ingresos y p�rdidas en .pdf
Uber - Bir Startupn K�kenleri ve lk G�nleriDava M�terileri ele.pdf
Uber - Bir Startupn K�kenleri ve lk G�nleriDava M�terileri ele.pdf
Trilogy Enterprises Inc. de Austin, Texas, es una empresa de softwar.pdf
Trilogy Enterprises Inc. de Austin, Texas, es una empresa de softwar.pdf
Transforming Data - Creating a Data Set Creating a JOIN between two .pdf
Transforming Data - Creating a Data Set Creating a JOIN between two .pdf
Using the location quotients(LQ) for year 2020 for 10 provinces anal.pdf
Using the location quotients(LQ) for year 2020 for 10 provinces anal.pdf
Using the packet tracer simulator, create a network topology that in.pdf
Using the packet tracer simulator, create a network topology that in.pdf
using silde 2 to answer silde 1 and 3 Step 17 of 40 - Create T Accou.pdf
using silde 2 to answer silde 1 and 3 Step 17 of 40 - Create T Accou.pdf
Using financial data and information from Yahoo Finance only, calcul.pdf
Using financial data and information from Yahoo Finance only, calcul.pdf
using IRAC method Joseph was a team manager of an excursion in the O.pdf
using IRAC method Joseph was a team manager of an excursion in the O.pdf
using IRAC method Mary is an explorer and is about to set off on a.pdf
using IRAC method Mary is an explorer and is about to set off on a.pdf
Recently uploaded
Supporting (UKRI) OA monographs at Salford.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
Digital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Pavilions
NGV Architecture Commission Competition
MPavilion Commission Competition
Other Pavilion Designs
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
Embracing GenAI - A Strategic Imperative
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Synthetic Fiber Construction in lab .pptx
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
1.4 modern child centered education - mahatma gandhi-2.pptx
Child centred education is an educational approach that priorities the interest, needs and abilities of the child in the learning process.
Thesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
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.
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!
Honest Reviews of Tim Han LMA Course Program.pptx
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
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
A Strategic Approach: GenAI in Education
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is prepared for master's students (MIFB & MIBS) UUM. May it be useful to all.Biological Screening of Herbal Drugs in detailed.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
"Protectable subject matters, Protection in biotechnology, Protection of othe...
Protectable subject matters, Protection in biotechnology, Protection of other biological materials, Ownership and period of protection
Recently uploaded (20)
Digital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Investigating Pavilion Designs
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
Overview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with Mechanism
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptx
"Protectable subject matters, Protection in biotechnology, Protection of othe...
"Protectable subject matters, Protection in biotechnology, Protection of othe...
Using Java programming language solve the followingSLL CLASS.pdf
- 1. Using Java programming language solve the following: SLL CLASS: //************************** SLL.java ********************************* // a generic singly linked list class public class SLL { private class SLLNode { private T info; private SLLNode next; public SLLNode() { this(null,null); } public SLLNode(T el) { this(el,null); } public SLLNode(T el, SLLNode ptr) { info = el; next = ptr; } } protected SLLNode head, tail; public SLL() { head = tail = null; } public boolean isEmpty() { return head == null; } public void addToHead(T el) { head = new SLLNode(el,head); if (tail == null) tail = head;
- 2. } public void addToTail(T el) { if (!isEmpty()) { tail.next = new SLLNode(el); tail = tail.next; } else head = tail = new SLLNode(el); } public T deleteFromHead() { // delete the head and return its info; if (isEmpty()) return null; T el = head.info; if (head == tail) // if only one node on the list; head = tail = null; else head = head.next; return el; } public T deleteFromTail() { // delete the tail and return its info; if (isEmpty()) return null; T el = tail.info; if (head == tail) // if only one node in the list; head = tail = null; else { // if more than one node in the list, SLLNode tmp; // find the predecessor of tail; for (tmp = head; tmp.next != tail; tmp = tmp.next); tail = tmp; // the predecessor of tail becomes tail; tail.next = null; } return el; } public void delete(T el) { // delete the node with an element el; if (!isEmpty()) if (head == tail && el.equals(head.info)) // if only one head = tail = null; // node on the list; else if (el.equals(head.info)) // if more than one node on the list;
- 3. head = head.next; // and el is in the head node; else { // if more than one node in the list SLLNode pred, tmp;// and el is in a nonhead node; for (pred = head, tmp = head.next; tmp != null && !tmp.info.equals(el); pred = pred.next, tmp = tmp.next); if (tmp != null) { // if el was found; pred.next = tmp.next; if (tmp == tail) // if el is in the last node; tail = pred; } } } @Override public String toString() { if(head == null) return "[ ]"; String str = "[ "; SLLNode tmp = head; while(tmp != null){ str += tmp.info + " "; tmp = tmp.next; } return str+"]"; } public boolean contains(T el) { if(head == null) return false; SLLNode tmp = head; while(tmp != null){ if(tmp.info.equals(el)) return true;
- 4. tmp = tmp.next; } return false; } public int size(){ if(head == null) return 0; int count = 0; SLLNode p = head; while(p != null) { count++; p = p.next; } return count; } } Part I: Programming Use the singly linked list class (Given below) to implement integers of unlimited size. Each node of the list should store one digit of the integer. You are required to implement the addition, subtraction and multiplication operations. In addition, provide a test class that will do the following: It will keep asking the user to enter two integers, choose one of the operations (addition, subtraction, multiplication) and then display the result. The program will stop upon entering the "#" character (without the double quotes). Part II: Problem Solving With respect to the programming problem in Part I , What is the tightest asymptotic running time for each of your operations, expressed in terms of the number of digits for the two operands, m and n, of each operation? Clearly justify your answer.