usingpackage util;import java.util.;This class implements.pdf

•

0 likes•3 views

using package util; import java.util.*; /* This class implements Binary Node for Binary Trees Methods: I) Two constructors II) Two toString methods III) height and size methods IV) preorder, postorder, and inorder traversals V) BFS and DFS traversal */ publicclass BinaryNode { public E element;//data public BinaryNode left;//left child public BinaryNode right;//right child //constructor for leaves public BinaryNode(E element){ this(element, null, null); } //constructor for internal nodes public BinaryNode(E element, BinaryNode left, BinaryNode right){ this.left = left; this.right = right; this.element = element; } @Override public String toString(){ if(left == null && right == null)//base case return element + ""; return element + "(" + left + ", " + right + ")"; } publicint height() { if(left == null && right == null) return 0; if(left == null) return 1 + right.height(); if(right == null) return 1 + left.height(); return 1 + Math.max(left.height(), right.height()); } publicint size(){ int size = 1;//counting root if(left != null)//counting left subtree nodes size += left.size(); if(right != null)//counting right subtree nodes size += right.size(); return size; } publicvoid printPreOrder(){ System.out.print(element + " "); if(left != null) left.printPreOrder(); if(right != null) right.printPreOrder(); } publicvoid printPostOrder(){ if(left != null) left.printPostOrder(); if(right != null) right.printPostOrder(); System.out.print(element + " "); } publicvoid printInOrder(){ if(left != null) left.printInOrder(); System.out.print(element + " "); if(right != null) right.printInOrder(); } publicvoid printBFS(){//breadth first search traversal - non-recursive method Queue q = new LinkedList<>(); q.add(this); while(!q.isEmpty()){ BinaryNode cur = q.remove(); System.out.print(cur.element + " "); if(cur.left != null) q.add(cur.left); if(cur.right != null) q.add(cur.right); } } publicvoid printDFS(){//depth first search traversal - equivalent to pre-order traversal Stack stack = new Stack<>(); stack.add(this); while(!stack.empty()){ BinaryNode cur = stack.pop(); System.out.print(cur.element + " "); if(cur.right != null) stack.push(cur.right); if(cur.left != null) stack.push(cur.left); } } public String toString2() { if(left == null && right == null && element == null) return ""; Queue list = new LinkedList<>(); String result = ""; list.add(this); list.add(null); int level = (int) Math.pow(2, height()); BinaryNode dummy = new BinaryNode(null); while(!list.isEmpty()) { boolean allDummies = true; for(BinaryNode b: list) if(b != dummy && b != null) { allDummies = false; break; } BinaryNode cur = list.remove(); if(cur == null || allDummies) break; for(int i = 0; i < level - 1;i++) result += '\t'; if(cur != dummy) result += cur.element; for(int i = 0; i < level + 1;i++) result += '\t'; if(cur.left != null) list.add(cur.left); else list.add(dummy); if(cur.right != null) list.add(cur.right); else list.add(dummy); if(list.peek() == null) { for(int i = 0; i < he.

Education

return 0;
if(left == null)
return 1 + right.height();
if(right == null)
return 1 + left.height();
return 1 + Math.max(left.height(), right.height());
}
publicint size(){
int size = 1;//counting root
if(left != null)//counting left subtree nodes
size += left.size();
if(right != null)//counting right subtree nodes
size += right.size();
return size;
}
publicvoid printPreOrder(){
System.out.print(element + " ");
if(left != null)
left.printPreOrder();
if(right != null)
right.printPreOrder();
}
publicvoid printPostOrder(){
if(left != null)
left.printPostOrder();
if(right != null)
right.printPostOrder();
System.out.print(element + " ");
}
publicvoid printInOrder(){
if(left != null)
left.printInOrder();
System.out.print(element + " ");
if(right != null)
right.printInOrder();
}

publicvoid printBFS(){//breadth first search traversal - non-recursive method
Queue q = new LinkedList<>();
q.add(this);
while(!q.isEmpty()){
BinaryNode cur = q.remove();
System.out.print(cur.element + " ");
if(cur.left != null)
q.add(cur.left);
if(cur.right != null)
q.add(cur.right);
}
}
publicvoid printDFS(){//depth first search traversal - equivalent to pre-order traversal
Stack stack = new Stack<>();
stack.add(this);
while(!stack.empty()){
BinaryNode cur = stack.pop();
System.out.print(cur.element + " ");
if(cur.right != null)
stack.push(cur.right);
if(cur.left != null)
stack.push(cur.left);
}
}
public String toString2() {
if(left == null && right == null && element == null)
return "";
Queue list = new LinkedList<>();
String result = "";
list.add(this);
list.add(null);
int level = (int) Math.pow(2, height());
BinaryNode dummy = new BinaryNode(null);
while(!list.isEmpty()) {
boolean allDummies = true;
for(BinaryNode b: list)

if(b != dummy && b != null) {
allDummies = false;
break;
}
BinaryNode cur = list.remove();
if(cur == null || allDummies)
break;
for(int i = 0; i < level - 1;i++)
result += 't';
if(cur != dummy)
result += cur.element;
for(int i = 0; i < level + 1;i++)
result += 't';
if(cur.left != null)
list.add(cur.left);
else
list.add(dummy);
if(cur.right != null)
list.add(cur.right);
else
list.add(dummy);
if(list.peek() == null) {
for(int i = 0; i < height();i++)
result += 'n';
list.remove();
list.add(null);
level/=2;
}
}
return result + "n";
}
}
2. Write a method with signature public staticboolean isSymmetric(BinaryNode root) which gets
a Binary Tree (not BST necessarily!) and returns a boolean specifying whether the tree is a
mirror of itself (Symmetric around the center).
3. Write a method with signature public staticBinaryNode removeLeaves(BinaryNode root)

which gets a Binary Tree and removes all its leaves and returns the root.

Similar to usingpackage util;import java.util.;This class implements.pdf

PLEASE MAKE SURE THE PROGRAM IS ASKING FOR INPUT FROM USER TO ADD OR REMOVE NAME. DO NOT HARD CODE NAME. AGAIN MAKE SURE THE PROGRAM IS ASKING FOR INPUT FROM USER TO ADD OR REMOVE NAME. PLEASE MAKE SURE THE CODE RUNS WITHOUT ANY ERRORS. Write a class that maintains the scores for a game application. Implement the addition and removal function to update the database. The gamescore.txt contains player’ name and score data record fields separated by comma. For Removal function, uses the name field to select record to remove the game score record. Use the List.java, LList.java, Dlink.java, GameEntry.java and gamescore.txt found below Read gamescore.txt to initialize the Linked list in sorted order by score. Ask the user to add or remove users to update the sorted linked list. Display “Name exist” when add an exist name to the list. Display “Name does not exist” when remove a name not on the list. List.java File: /** Source code example for \"A Practical Introduction to Data Structures and Algorithm Analysis, 3rd Edition (Java)\" by Clifford A. Shaffer Copyright 2008-2011 by Clifford A. Shaffer */ /** List ADT */ public interface List { /** * Remove all contents from the list, so it is once again empty. Client is * responsible for reclaiming storage used by the list elements. */ public void clear(); /** * Insert an element at the current location. The client must ensure that * the list\'s capacity is not exceeded. * * @param item * The element to be inserted. */ public void insert(E item); /** * Append an element at the end of the list. The client must ensure that * the list\'s capacity is not exceeded. * * @param item * The element to be appended. */ public void append(E item); /** * Remove and return the current element. * * @return The element that was removed. */ public E remove(); /** Set the current position to the start of the list */ public void moveToStart(); /** Set the current position to the end of the list */ public void moveToEnd(); /** * Move the current position one step left. No change if already at * beginning. */ public void prev(); /** * Move the current position one step right. No change if already at end. */ public void next(); /** @return The number of elements in the list. */ public int length(); /** @return The position of the current element. */ public int currPos(); /** * Set current position. * * @param pos * The position to make current. */ public void moveToPos(int pos); /** @return The current element. */ public E getValue(); } LList.java File: /** * Source code example for \"A Practical Introduction to Data Structures and * Algorithm Analysis, 3rd Edition (Java)\" by Clifford A. Shaffer Copyright * 2008-2011 by Clifford A. Shaffer */ // Doubly linked list implementation class LList implements List { private DLink head; // Pointer to list header private DLink tail; // Pointer to last element in list protected DLink curr; // Pointer ahead of current element int cnt; // Size of list // Constructors LList(int size) { th.

PLEASE MAKE SURE THE PROGRAM IS ASKING FOR INPUT FROM USER TO ADD OR.pdf

mallik3000

Note: Given Code modified as required and required methods added. Code: // class node class Node { // declare the required variable String data; Node next; // constructor Node(){} // constructor with arguments Node(String data) { this.data = data; next = null; } // method to get the data public String getData() { return data; } // method to set the data public void setData(String data) { this.data = data; } // method to get the next data public Node getNext() { return next; } // method to set the next data public void setNext(Node next) { this.next = next; } } // class for a linked list class MyLInkedList { Node head;alue into a list // method to add the v public void add(String num) { if (head == null) { head = new Node(num); } else{ Node temp = new Node(num); Node current = head; if (current != null) { while (current.getNext() != null) { current = current.getNext(); } current.setNext(temp); } } } // method to search a value from a list public void search(String num) { Node current = head; boolean flag=true; if (current != null) { while (current != null) { if(current.getData() == num) { System.out.println(\"Search value \"+ current.getData()+\" is available\"); flag=false; } current = current.getNext(); } if (flag==true) { System.out.println(\"Search value \"+ current.getData()+\" is not available\"); } } else { System.out.println(\"Linked list is empty\"); } } // method to delete a value from a list public void delete(String num) { //Node current = head; boolean flag=true; if (head == null) { System.out.println(\"Can\'t Delete, Linked list is empty\"); return; } if(head.getData() == num) { head=head.getNext(); return; } Node temp = new Node(num); Node cr = head; Node prev=null; while ((cr != null) && !(cr.getData() == num)) { prev=cr; cr = cr.getNext(); } prev.setNext(cr.getNext()); } // method to print the list public void print() { Node current = head; if (current != null) { while (current != null) { System.out.println(current.getData()); current = current.getNext(); } } } } // method to test the class public class MyLInkedListTester { // main method to perform the linked list operatrions public static void main(String args[]) { MyLInkedList llist = new MyLInkedList(); // insert the values into list llist.add(\"1\"); llist.add(\"2\"); llist.add(\"3\"); llist.add(\"4\"); // print the list values llist.print(); // sear the values in a list llist.search(\"1\"); llist.print(); // delete the value from a list llist.delete(\"4\"); System.out.println(\"List after deletion:\"); llist.print(); } } Result: 1 2 3 4 Search value 1 is available 1 2 3 4 List after deletion: 1 2 3 Solution Note: Given Code modified as required and required methods added. Code: // class node class Node { // declare the required variable String data; Node next; // constructor Node(){} // constructor with arguments Node(String data) { this.data = data; next = null; } // method to get the data public String getData() { return data; } // method to set the data public void se.

Note Given Code modified as required and required met.pdf

Ankitchhabra28

in this assignment you are asked to write a simple driver program and set of functions (maybein a library) that can be performed on a binary search tree. Your program should allow user to insert/delete integer values into the binary search tree along with several other operations on the binary search tree. You can use the code given in slides. But this time your key will be int! Specifically, your program will ask user to enter a command and related parameters (if any) in a loop, and then perform the given commands. Here is the list of commands that your program must implement: * insert *find\' *delete *list inorder *list preorder *list postorder *list levelorder * max * min * height *count * sum *quit As always, make sure you release (free) the dynamically allocated memories if you allocate any memory in your programs. So, before submitting your program, run it with valgrind to see if there is any memory leakage //my proggram in C struct tree_node { int data; struct tree_node *left, *right; } typedef struct nodeT { int key; struct nodeT *left, *right; } nodeT, *treeT; int main(){ while (TRUE) { printf(\"> \"); line = GetLine(); ch = toupper(line[0]); switch (ch) { case \'I\': insert(); break; case \'F\': find(); break; case \'D\': delete(); break; case \'LI\': listInorder; break; case \'LPR\': listPreorder(); break; case \'LPO\': listPostorder(); break; case \'MAX\': max(); break; case \'min\': min(); break; case \'H\': height(); break; case \'C\': count(); break; case \'S\': sum(); break; case \'Q\': exit(0); default:printf(\"Illegal command\ \"); break; } } } nodeT *FindNode(nodeT *t, int key){ while(t !=NULL) { if (key == t->key) return t; if (key < t->key) { t = t->left; } else { t = t->right; } return NULL; } void delete(nodeT **p){ nodeT *target; target=*p; if (target->left==NULL && target->right==NULL) { *p=NULL; } else if (target->left == NULL) { *p=target->right; } else if (target->right == NULL) { *p=target->left; } else { /* target has two children, see next slide */ } free(target); } void listInorder(nodeT *T){ if (t != NULL) { DisplayTree(t->left); printf(“%d “, t->key); DisplayTree(t->right); } } void listPreorder(nodeT *t) { if (t != NULL) { printf(“%d “, t->key); DisplayTree(t->left); DisplayTree(t->right); } } void listPostOrder(nodeT *t){ if (t != NULL) { DisplayTree(t->left); DisplayTree(t->right); printf(“%d “, t->key); } } void intsert(nodeT **tptr, int key){ nodeT*t, *tmp; t=*tptr; if (t == NULL) { tmp=New(nodeT*); tmp->key = key; tmp->left=tmp->right=NULL; *tptr=tmp; return; } if (key < t->key) { InsertNode (&t->left, key); } else { InsertNode(&t->right, key); } } int height(nodeT *t){ if (t == NULL) return 0; else return (1 + maximumof( height(t->left), height(t->right)) ); } int sum(struct tree_node *p){ if (p == NULL) return 0; else return (p->data + sum(p->left) + sum(p->right) ); } Solution 1. /* 2. * Java Program to Implement Binary Search Tree 3. */ 4. 5. import java.util.Scanner; 6. 7. /* Class BSTNode */ 8. cl.

in this assignment you are asked to write a simple driver program an.pdf

michardsonkhaicarr37

Here is the editable code: Solution import java.util.NoSuchElementException; public class DoublyLinkedListImpl { private Node head; private Node tail; private int size; public DoublyLinkedListImpl() { size = 0; } private class Node { E element; Node next; Node prev; public Node(E element, Node next, Node prev) { this.element = element; this.next = next; this.prev = prev; } } public int size() { return size; } public boolean isEmpty() { return size == 0; } public void addFirst(E element) { Node tmp = new Node(element, head, null); if(head != null ) {head.prev = tmp;} head = tmp; if(tail == null) { tail = tmp;} size++; System.out.println(\"adding: \"+element); } /** * adds element at the end of the linked list * @param element */ public void addLast(E element) { Node tmp = new Node(element, null, tail); if(tail != null) {tail.next = tmp;} tail = tmp; if(head == null) { head = tmp;} size++; System.out.println(\"adding: \"+element); } public void iterateForward(){ System.out.println(\"iterating forward..\"); Node tmp = head; while(tmp != null){ System.out.println(tmp.element); tmp = tmp.next; } } /** * this method walks backward through the linked list */ public void iterateBackward(){ System.out.println(\"iterating backword..\"); Node tmp = tail; while(tmp != null){ System.out.println(tmp.element); tmp = tmp.prev; } } public E removeFirst() { if (size == 0) throw new NoSuchElementException(); Node tmp = head; head = head.next; head.prev = null; size--; System.out.println(\"deleted: \"+tmp.element); return tmp.element; } public E removeLast() { if (size == 0) throw new NoSuchElementException(); Node tmp = tail; tail = tail.prev; tail.next = null; size--; System.out.println(\"deleted: \"+tmp.element); return tmp.element; } public static void main(String a[]){ DoublyLinkedListImpl dll = new DoublyLinkedListImpl(); dll.addFirst(10); dll.addFirst(34); dll.addLast(56); dll.addLast(364); dll.iterateForward(); dll.removeFirst(); dll.removeLast(); dll.iterateBackward(); } } import java.util.Scanner; /* Class Node */ class Node { protected int data; protected Node next, prev; /* Constructor */ public Node() { next = null; prev = null; data = 0; } /* Constructor */ public Node(int d, Node n, Node p) { data = d; next = n; prev = p; } /* Function to set link to next node */ public void setLinkNext(Node n) { next = n; } /* Function to set link to previous node */ public void setLinkPrev(Node p) { prev = p; } /* Funtion to get link to next node */ public Node getLinkNext() { return next; } /* Function to get link to previous node */ public Node getLinkPrev() { return prev; } /* Function to set data to node */ public void setData(int d) { data = d; } /* Function to get data from node */ public int getData() { return data; } } /* Class linkedList */ class linkedList { protected Node start; protected Node end ; public int size; /* Constructor */ public linkedList() { start = null; end = null; size = 0; } /* Function to check if list is empty */ public boolean isE.

Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf

arrowmobile

For the code below complete the preOrder() method so that it perform.pdf

xlynettalampleyxc

Please read the comment ins code ExpressionTree.java ---------------------------------- /** * This is the class for Expression Tree. * Used to create Expression Tree and Evaluate it */ /** * Following logic is used to construct a Tree * Here we use stack for Preparing Tree * Loop through given Expression String * If Character is Operand , Create node and push to stack * If Character is Operator then * 1)Create Node for Operator * 2)Pop 2 nodes from Stack and Made * OpretorNode--> left == first node pop * OpretorNode--> right == second node pop * At the end of creation of Expression Tree, Stack have only one node , which is root of Expression tree */ /** Class ExpressionTree **/ class ExpressionTree { /** class TreeNode * Stored Character ==> Digit(0..9) or a Operator +,-,*,/ * Left Node and Right Node * * **/ class TreeNode { char data; TreeNode left, right; /** constructor **/ public TreeNode(char data) { this.data = data; this.left = null; this.right = null; } } /** class StackNode **/ class StackNode { TreeNode treeNode; StackNode next; /** constructor **/ public StackNode(TreeNode treeNode) { this.treeNode = treeNode; next = null; } } private static StackNode top; /** constructor * Constructor takes input string like \"+-+7*935*82*625\" * Input should be in Prefix notation * **/ public ExpressionTree(String expression) { top = null; //Call Method for prepare expression tree buildTree(expression); } /** function to clear tree **/ public void clear() { top = null; } /** function to push a node **/ private void push(TreeNode ptr) { if (top == null) top = new StackNode(ptr); else { StackNode nptr = new StackNode(ptr); nptr.next = top; top = nptr; } } /** function to pop a node * When it find operator pop 2 elements from Stack * * **/ private TreeNode pop() { if (top == null) throw new RuntimeException(\"Underflow\"); else { TreeNode ptr = top.treeNode; top = top.next; return ptr; } } /** function to get top node **/ private TreeNode peek() { return top.treeNode; } /** function to insert character **/ private void insert(char val) { try { //If Operand , Create node and push to Stack if (isDigit(val)) { TreeNode nptr = new TreeNode(val); push(nptr); } //If Operator , Create node and popup 2 elements and make them its right and left else if (isOperator(val)) { TreeNode nptr = new TreeNode(val); nptr.left = pop(); nptr.right = pop(); push(nptr); } } catch (Exception e) { System.out.println(\"Invalid Expression\"); } } /** function to check if digit **/ private boolean isDigit(char ch) { return ch >= \'0\' && ch <= \'9\'; } /** function to check if operator **/ private boolean isOperator(char ch) { return ch == \'+\' || ch == \'-\' || ch == \'*\' || ch == \'/\'; } /** function to convert character to digit **/ private int toDigit(char ch) { return ch - \'0\'; } /** function to build tree from input */ public void buildTree(String eqn) { for (int i = eqn.length() - 1; i >= 0; i--) insert(eqn.charAt(i)); } /** function to evaluate tree */ public dou.

Please read the comment ins codeExpressionTree.java-------------.pdf

shanki7

hi i have to write a java program involving link lists. i have a problem with the nodes, as it is posting errors with the nodes. please help me with this problem. thank you. public class LinkLists { /* only need to store a single pointer to the node at the head * of the list. * The pointer is null if the list is empty. * Also record the size of the list. */ protected Node head; /* invariant: size is the number of nodes in the list pointed to by head */ protected int size; /* no-arguments default constructor creates an empty list */ public LinkLists() { head = null; // start with an empty list size = 0; } /* accessor method */ public int size() { return size; } /* value to add to the end of the list */ public void add(T value) { head = addAtEnd(head, value); size++; } /* node of the list to which the value should be added * value to add to the end of the list */ private Node addAtEnd(Node node, T value) { if (node == null) { // special case return new Node(value, null); } else if (node.getNext() == null) { // other special case node.setNext(new Node(value, null)); } else { addAtEnd(node.getNext(), value); } return node; } /* iterative implementation of the same method * value to add to the end of the list */ public void add2(T value) { if (head == null) { head = new Node(value, null); } else { Node node = head; // guaranteed not to be null initially while (node.getNext() != null) { node = node.getNext(); // guaranteed not to be null here } // now, node.getNext() is guaranteed to be null // similar to the second special case in addAtEnd node.setNext(new Node(value, null)); } size++; } public void remove(int position) throws BadItemCountException { if ((position < 1) || (position > size)) { throw new BadItemCountException(\"invalid position \" + position + \", only 1..\" + size + \" available\"); } if (position == 1) { head = head.getNext(); } else { Node node = head; for (int i = 2; i < position; i++) { node = node.getNext(); } node.setNext(node.getNext().getNext()); } size--; // one less item } public String toString() { return toString(head); } private String toString(Node node) { if (node == null) { return \"\"; } else { return node.getValue() + \"\ \" + toString(node.getNext()); } } public static void main(String[] args) { /* create two empty lists, make sure they print out correctly */ LinkLists list1 = new LinkLists(); LinkLists list2 = new LinkLists(); System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\"); System.out.println(\"list1.size() = \" + list1.size() + \", list2.size() = \" + list2.size()); /* insert some items, keep checking */ list1.add(\"hello\"); list1.add(\"world\"); list2.add(\"foo\"); list2.add(\"bar\"); list2.add(\"baz\"); System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\"); System.out.println(\"list1.size() = \" + list1.size() + \", list2.size() = \" + list2.size()); /* remove an item at an invalid position */ boolean caught = false; try { list2.remove(4); } catch .

hi i have to write a java program involving link lists. i have a pro.pdf

archgeetsenterprises

Link list part 2

Anaya Zafar

**JAVA** A double-ended queue is a list that allows the addition and removal of items from either end. One end is arbitrarily called the front and other the rear, but the two ends behave identically. Specify, design and implement a class for a double-ended queue. Include operations to check if it is empty and to return the number of items in the list. For each end, include operations for adding and deleting items. Use doubly linked list for your implementation. Call your class Deque (pronounced \"deck\"). Solution //package com.java2novice.ds.queue; public class DequeDblLinkedListImpl { private LinkedNode front; private LinkedNode rear; public void insertFront(T item){ //add element at the beginning of the queue System.out.println(\"adding at front: \"+item); LinkedNode nd = new LinkedNode(); nd.setValue(item); nd.setNext(front); if(front != null) front.setPrev(nd); if(front == null) rear = nd; front = nd; } public void insertRear(T item){ //add element at the end of the queue System.out.println(\"adding at rear: \"+item); LinkedNode nd = new LinkedNode(); nd.setValue(item); nd.setPrev(rear); if(rear != null) rear.setNext(nd); if(rear == null) front = nd; rear = nd; } public void removeFront(){ if(front == null){ System.out.println(\"Deque underflow!! unable to remove.\"); return; } //remove an item from the beginning of the queue LinkedNode tmpFront = front.getNext(); if(tmpFront != null) tmpFront.setPrev(null); if(tmpFront == null) rear = null; System.out.println(\"removed from front: \"+front.getValue()); front = tmpFront; } public int size(){ if(front == null && rear ==null){ return 0; } //remove an item from the beginning of the queue LinkedNode tmpFront = front; LinkedNode tmpRear = rear; int i=0; while(tmpFront != rear) { i++; tmpFront=tmpFront.getNext(); } i++; return i; } public void removeRear(){ if(rear == null){ System.out.println(\"Deque underflow!! unable to remove.\"); return; } //remove an item from the beginning of the queue LinkedNode tmpRear = rear.getPrev(); if(tmpRear != null) tmpRear.setNext(null); if(tmpRear == null) front = null; System.out.println(\"removed from rear: \"+rear.getValue()); rear = tmpRear; } public static void main(String a[]){ DequeDblLinkedListImpl deque = new DequeDblLinkedListImpl(); deque.insertFront(34); deque.insertFront(67); System.out.println(\"Size of the queue : \"+deque.size()); deque.insertFront(29); deque.insertFront(765); deque.removeFront(); deque.removeFront(); deque.removeFront(); deque.insertRear(43); deque.insertRear(83); deque.insertRear(84); deque.insertRear(546); deque.insertRear(356); deque.removeRear(); deque.removeRear(); deque.removeRear(); deque.removeRear(); deque.removeFront(); deque.removeFront(); deque.removeFront(); } } class LinkedNode{ private LinkedNode prev; private LinkedNode next; private T value; public LinkedNode getPrev() { return prev; } public void setPrev(LinkedNode prev) { this.prev = prev; } public LinkedNode getNext() { return next; } public void setNext(L.

JAVA A double-ended queue is a list that allows the addition and.pdf

amrishinda

/** The LinkedList1 class implements a Linked list. */ class LinkedList1 { /** The Node class stores a list element and a reference to the next node. */ private class Node { String value; Node next; /** Constructor. @param val The element to store in the node. @param n The reference to the successor node. */ Node(String val, Node n) { value = val; next = n; } /** Constructor. @param val The element to store in the node. */ Node(String val) { // Call the other (sister) constructor. this(val, null); } } private Node first; // list head private Node last; // last element in list /** Constructor. */ public LinkedList1() { first = null; last = null; } /** The isEmpty method checks to see if the list is empty. @return true if list is empty, false otherwise. */ public boolean isEmpty() { return first == null; } /** The size method returns the length of the list. @return The number of elements in the list. */ public int size() { int count = 0; Node p = first; while (p != null) { // There is an element at p count ++; p = p.next; } return count; } /** The add method adds an element to the end of the list. @param e The value to add to the end of the list. */ public void add(String e) { if (isEmpty()) { first = new Node(e); last = first; } else { // Add to end of existing list last.next = new Node(e); last = last.next; } } /** The add method adds an element at a position. @param e The element to add to the list. @param index The position at which to add the element. @exception IndexOutOfBoundsException When index is out of bounds. */ public void add(int index, String e) { if (index < 0 || index > size()) { String message = String.valueOf(index); throw new IndexOutOfBoundsException(message); } // Index is at least 0 if (index == 0) { // New element goes at beginning first = new Node(e, first); if (last == null) last = first; return; } // Set a reference pred to point to the node that // will be the predecessor of the new node Node pred = first; for (int k = 1; k <= index - 1; k++) { pred = pred.next; } // Splice in a node containing the new element pred.next = new Node(e, pred.next); // Is there a new last element ? if (pred.next.next == null) last = pred.next; } /** The toString method computes the string representation of the list. @return The string form of the list. */ public String toString() { StringBuilder strBuilder = new StringBuilder(); // Use p to walk down the linked list Node p = first; while (p != null) { strBuilder.append(p.value + \"\ \"); p = p.next; } return strBuilder.toString(); } /** The remove method removes the element at an index. @param index The index of the element to remove. @return The element removed. @exception IndexOutOfBoundsException When index is out of bounds. */ public String remove(int index) { if (index < 0 || index >= size()) { String message = String.valueOf(index); throw new IndexOutOfBoundsException(message); } String element; // The element to return if (index == 0) { // Removal of first item in the list element.

The LinkedList1 class implements a Linked list. class.pdf

malavshah9013

import java.util.Scanner; class BinaryNode { BinaryNode left, right; int data; public BinaryNode() { left = null; right = null; data = 0; } public BinaryNode(int n) { left = null; right = null; data = n; } public void setLeft(BinaryNode n) { left = n; } public void setRight(BinaryNode n) { right = n; } public BinaryNode getLeft() { return left; } public BinaryNode getRight() { return right; } public void setData(int d) { data = d; } public int getData() { return data; } } class Binary { private BinaryNode root; public Binary() { root = null; } public boolean isEmpty() { return root == null; } public void insert(int data) { root = insert(root, data); } private BinaryNode insert(BinaryNode node, int data) { if (node == null) node = new BinaryNode(data); else { if (data <= node.getData()) node.left = insert(node.left, data); else node.right = insert(node.right, data); } return node; } public void delete(int k) { if (isEmpty()) System.out.println(\"Tree Empty\"); else if (search(k) == false) System.out.println(\"Sorry \"+ k +\" is not present\"); else { root = delete(root, k); System.out.println(k+ \" deleted from the tree\"); } } private BinaryNode delete(BinaryNode root, int k) { BinaryNode p, p2, n; if (root.getData() == k) { BinaryNode lt, rt; lt = root.getLeft(); rt = root.getRight(); if (lt == null && rt == null) return null; else if (lt == null) { p = rt; return p; } else if (rt == null) { p = lt; return p; } else { p2 = rt; p = rt; while (p.getLeft() != null) p = p.getLeft(); p.setLeft(lt); return p2; } } if (k < root.getData()) { n = delete(root.getLeft(), k); root.setLeft(n); } else { n = delete(root.getRight(), k); root.setRight(n); } return root; } public boolean search(int val) { return search(root, val); } private boolean search(BinaryNode r, int val) { boolean found = false; while ((r != null) && !found) { int rval = r.getData(); if (val < rval) r = r.getLeft(); else if (val > rval) r = r.getRight(); else { found = true; break; } found = search(r, val); } return found; } public void inorder() { inorder(root); } private void inorder(BinaryNode r) { if (r != null) { inorder(r.getLeft()); System.out.print(r.getData() +\" \"); inorder(r.getRight()); } } public void preorder() { preorder(root); } private void preorder(BinaryNode r) { if (r != null) { System.out.print(r.getData() +\" \"); preorder(r.getLeft()); preorder(r.getRight()); } } public void postorder() { postorder(root); } private void postorder(BinaryNode r) { if (r != null) { postorder(r.getLeft()); postorder(r.getRight()); System.out.print(r.getData() +\" \"); } } } public class BinarySearchTree { public static void main(String[] args) { Scanner scan = new Scanner(System.in); Binary Binary = new Binary(); System.out.println(\"Binary Search Tree Test\ \"); char ch; do { System.out.println(\"\ Binary Search Tree Operations\ \"); System.out.println(\"1. insert \"); System.out.println(\"2. delete\"); System.out.println(\"3. search\"); System.out.println(\"4. check empty\"); int .

import java.util.Scanner;class BinaryNode{ BinaryNode left.pdf

shaktisinhgandhinaga

//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&&current.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.

tested on eclipseDoublyLinkedList class.pdf

shanki7

Once you have all the structures working as intended, it is time to compare the performances of the 2. Use runBenchmark() to start. a. First, generate an increasing number (N) of random integers (1000, 5000, 10000, 50000, 75000, 100000, 500000 or as far as your computing power will let you) i. Time and print how long it takes to insert the random integers into an initially empty BST. Do not print the tree. You can get a random list using the java class Random, located in java.util.Random. To test the speed of the insertion algorithm, you should use the System.currentTimeMillis() method, which returns a long that contains the current time (in milliseconds). Call System.currentTimeMillis() before and after the algorithm runs and subtract the two times. (Instant.now() is an alternative way of recording the time.) ii. Time and print how long it takes to insert the same random integers into an initially empty AVL tree. Do not print the tree. iii. If T(N) is the time function, how does the growth of TBST(N) compare with the growth of TAVL(N)? Plot a simple graph to of time against N for the two types of BSTs to visualize your results. b. Second, generate a list of k random integers. k is also some large value. i. Time how long it takes to search your various N-node BSTs for all k random integers. It does not matter whether the search succeeds. ii. Time how long it takes to search your N-node AVL trees for the same k random integers. iii. Compare the growth rates of these two search time-functions with a graph the same way you did in part a. public class BinarySearchTree<AnyType extends Comparable<? super AnyType>> { protected BinaryNode<AnyType> root; public BinarySearchTree() { root = null; } /** * Insert into the tree; duplicates are ignored. * * @param x the item to insert. * @param root * @return */ protected BinaryNode<AnyType> insert(AnyType x, BinaryNode<AnyType> root) { // If the root is null, we've reached an empty leaf node, so we create a new node // with the value x and return it if (root == null) { return new BinaryNode<>(x, null, null); } // Compare the value of x to the value stored in the root node int compareResult = x.compareTo(root.element); // If x is less than the value stored in the root node, we insert it into the left subtree if (compareResult < 0) { root.left = insert(x, root.left); } // If x is greater than the value stored in the root node, we insert it into the right subtree else if (compareResult > 0) { root.right = insert(x, root.right); } // If x is equal to the value stored in the root node, we ignore it since the tree does not allow duplicates return root; } /** * Counts the number of leaf nodes in this tree. * * @param t The root of the tree. * @return */ private int countLeafNodes(BinaryNode<AnyType> root) { // If the root is null, it means the tree is empty, so we return 0 if (root == null) { return 0; } // If the root has no children, it means it is a leaf node, so we return 1 if (root.left == .

Once you have all the structures working as intended- it is time to co.docx

farrahkur54

A perfect left-sided binary tree is a binary tree where every intern.pdf

michardsonkhaicarr37

Linked lists

George Scott IV

#include iostream using namespace std; const int nil = 0; cl.docx

ajoy21

Please refer this solution. This is working file for Integers Header file :- ----------------------------------- #ifndef LINKEDLIST_H #define LINKEDLIST_H struct node{ void * data; node * next; }; class LinkedList { private: node* head ; int size; public: LinkedList(); //method to create a node node * create(void* data); //method to append void append(node * item); //method to prepend void prepend(node * item); //insert in ascending order void insertAscend(node * item); //insert in ascending order void insertDescend(node * item); //display all nodes void display(); //free the list void freeUp(); }; #endif // LINKEDLIST_H Source file :- ---------------------------------- #include \"linkedlist.h\" #include #include #include LinkedList::LinkedList() { //head = (node *)malloc(sizeof(node)); size = 0; head = NULL; } //method to create a node node * LinkedList::create(void* data){ node * newNode = (node *)malloc(sizeof(node)); newNode->data = malloc(sizeof(data)); memcpy(newNode->data,data,sizeof(data)); newNode->next = NULL; return newNode; } //method to append void LinkedList::append(node * item){ if(head == NULL){ head = item; size++; return; } node* current; current = head; while (current->next!=NULL ) { current = current->next; } current->next = item ; size++; } //method to prepend void LinkedList::prepend(node * item){ if(head == NULL){ head = item; size++; return; } item->next = head; head = item; size++; } //insert in ascending order void LinkedList::insertAscend(node * item){ if(head == NULL){ head = item; size++; return; } node* current; current = head; node * prev = NULL; bool found = false; while (current !=NULL){ int *current_data = static_cast(current->data); int *item_data = static_cast(item->data); if(*item_data < *current_data){ if(prev == NULL){ item->next = current; if(current == head){ head = item; } } else{ prev->next = item; item->next = current; } found = true; break; } prev = current; current = current->next; } if(!found){ prev->next = item; } size++; } //insert in Descending order void LinkedList::insertDescend(node * item){ if(head == NULL){ head = item; size++; return; } node* current; current = head; node * prev = NULL; bool found = false; while (current !=NULL){ int *current_data = static_cast(current->data); int *item_data = static_cast(item->data); if(*item_data > *current_data){ if(prev == NULL){ item->next = current; if(current == head){ head = item; } } else{ prev->next = item; item->next = current; } found = true; break; } prev = current; current = current->next; } if(!found){ prev->next = item; } size++; } //display all nodes void LinkedList::display(){ int idx = 0; node* current; current = head; while (current != NULL ){ idx++; int *data = static_cast(current->data); printf(\"data for item ::%dis :: %d\ \",idx,*data); current = current->next; } } //free the list void LinkedList::freeUp(){ node* current; current = head; while (current->next!=NULL ){ head = current->next; delete current; current = head; } } Main f.

Please refer this solution. This is working file for IntegersHeade.pdf

sooryasalini

// 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; }.

mainpublic class AssignmentThree { public static void ma.pdf

fathimafancyjeweller

Write the following using java Given a class ‘Node’ and ‘NodeList’, that contains the below information diagram. -id: int -name: String -next: Node +Node(id: int, name: String) +setId(id: int): void +getId(): int +setName(name: String) : void +getName(): String +setNext(node: Node): void +getNext(): Node NodeList -size: int -root: Node +add(node: Node): void +size(): int +findNode(node: Node): boolean Implement add(Node), findNode(Node) and size methods in the NodeList class which is provided to you. The methods should work as: Using the following main method: public static void main(String[] args) { NodeList list = new NodeList(); Node node = new Node(1, \"Book\"); Node node2 = new Node(2, \"Lappy\"); list.add(node); list.add(node2); System.out.println(\"Length : \"+list.size()); Node node3 = new Node(3, \"Glass\"); Node node4 = new Node(4, \"Pen\"); list.add(node3); System.out.println(\"Length : \"+list.size()); if(list.findNode(node3)) System.out.println(\"Node found: \"+ node3.getName()); else System.out.println(\"Node not found: \"+ node3.getName()); if(list.findNode(node4)) System.out.println(\"Node found: \"+ node4.getName()); else System.out.println(\"Node not found: \"+ node4.getName()); } Then it should return the following output: Length : 2 Length : 3 Node found: Glass Node not found: Pen The given Node class is: public class Node { private int id = 0; private String name = \"\"; private Node next; public Node(int id, String name) { this.id = id; this.name = name; this.next = null; } public Node getNext() { return next; } public void setNext(Node node) { this.next = node } public int getId() { return id; { public void setId(int id) { this.id = id; } public String getName() { return name; } public void setName(String name) { this.name = name; } public String toString() { return \"ID : \"+this.id+\" Name : \"+this.name; } } The given NodeList class is: public class NodeList { private int size = 0; private Node root = null; /* * It has to take a new Node and add that to the next address of previous Node. * If the list is empty, assign it as the \"root\" * @Param - Node */ public void add(Node node) { // Implement this method!!! } /* * It has to return the size of the NodeList * * @return size */ public int size() { // Implement this method!!! } /* * It has to take a Node and checks if the node is in the list. * If it finds the node, it returns true, otherwise false * * @param - Node * @return boolean true/false */ public boolean findNode(Node node) { // Implement this method!!! } }Node -id: int -name: String -next: Node +Node(id: int, name: String) +setId(id: int): void +getId(): int +setName(name: String) : void +getName(): String +setNext(node: Node): void +getNext(): Node Solution Hi, Please find my implementation. Please let me know in case of any issue. ############ Node.java ############# public class Node { private int id = 0; private String name = \"\"; private Node next; public Node(int id, String name) { this.id = id; this..

Write the following using javaGiven a class ‘Node’ and ‘NodeList’,.pdf

fathimalinks

package singlylinkedlist; public class Node { public String value; public Node next; public Node(String value) { this.value = value; } @Override public String toString() { return value; } } SingleyLinkedList.java : package singlylinkedlist; import java.io.*; import java.util.*; /** * Defines the interface for a singly-linked list. * */ public interface SinglyLinkedList { /** * @return Reference to the first node. If the list is empty, this method * returns null. */ public Node getFirst(); /** * @return Reference to the last node . If the list is empty, this method * returns null. */ public Node getLast(); /** * @return Number of nodes in the list */ public int size(); /** * @return true if the list has no nodes; false otherwise */ public boolean isEmpty(); /** * Removes all nodes in the list. */ public void clear(); /** * Inserts a new node with the given value after cursor. * * @param cursor * The node to insert after. Set this to null to insert value as the * new first Node. * @param value * The value to insert * @return a reference to the newly inserted Node */ public Node insert(Node cursor, String value); /** * Inserts a new node with the given value at the "end" of the list. * * @param value * @return a reference to the newly inserted Node */ public Node append(String value); /** * Removes the node after the specified Node (cursor) from the list. * * @param cursor * A reference to the Node to remove. */ public void removeAfter(Node cursor); /** * Returns a reference to the first Node containing the key, starting from the * given Node. * * @param start * @param key * @return a reference to the first Node containing the key */ public Node find(Node start, String key); /** * Prints the values of all the items in a list */ public void printWholeList(); } SinglyLinkedTester.java: package sbccunittest; import static java.lang.Math.*; import static java.lang.System.*; import static org.apache.commons.lang3.StringUtils.*; import static org.junit.Assert.*; import static sbcc.Core.*; import java.io.*; import java.lang.reflect.*; import java.nio.file.*; import java.util.*; import java.util.stream.*; import org.apache.commons.lang3.*; import org.junit.*; import org.w3c.dom.ranges.*; import sbcc.*; import singlylinkedlist.*; /** * 09/16/2021 * * @author sstrenn * */ public class SinglyLinkedListTester { public static String newline = System.getProperty("line.separator"); public static int totalScore = 0; public static int extraCredit = 0; public static boolean isZeroScore = false; public static String scorePreamble = ""; @BeforeClass public static void beforeTesting() { totalScore = 0; extraCredit = 0; } @AfterClass public static void afterTesting() { if (isZeroScore) { totalScore = 0; extraCredit = 0; } println(scorePreamble + "Estimated score (w/o late penalties, etc.) is: " + totalScore + " out of 25."); // If the project follows the naming convention, save the results in a folder on // the desktop. (Alex Kohanim) try { String directory = substri.

package singlylinkedlist; public class Node { public String valu.pdf

amazing2001

Similar to usingpackage util;import java.util.;This class implements.pdf (20)

PLEASE MAKE SURE THE PROGRAM IS ASKING FOR INPUT FROM USER TO ADD OR.pdf

Note Given Code modified as required and required met.pdf

in this assignment you are asked to write a simple driver program an.pdf

Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf

For the code below complete the preOrder() method so that it perform.pdf

Please read the comment ins codeExpressionTree.java-------------.pdf

hi i have to write a java program involving link lists. i have a pro.pdf

Link list part 2

JAVA A double-ended queue is a list that allows the addition and.pdf

The LinkedList1 class implements a Linked list. class.pdf

import java.util.Scanner;class BinaryNode{ BinaryNode left.pdf

tested on eclipseDoublyLinkedList class.pdf

Once you have all the structures working as intended- it is time to co.docx

A perfect left-sided binary tree is a binary tree where every intern.pdf

Linked lists

#include iostream using namespace std; const int nil = 0; cl.docx

Please refer this solution. This is working file for IntegersHeade.pdf

mainpublic class AssignmentThree { public static void ma.pdf

Write the following using javaGiven a class ‘Node’ and ‘NodeList’,.pdf

package singlylinkedlist; public class Node { public String valu.pdf

More from info335653

Youve been hired by the local government to determine which employees are most essential in the Parks & Recreation department. You plan to conduct a social network analysis. You find that people (in bold below) list the following others as ones they work well with: Leslie: Andy, Ann, Donna Ron: April Ben: Ann April: Donna, Ron Andy: Chris, Tim, Leslie Donna: Leslie, April, Gerry Gerry: Donna Tom: Andy, Ann, Donna Ann: Ben, Leslie, Tim, Chris Chris: Andy, Ann - A. B. C. D. E. F. G. H. I. J. Who is the central connector?- A. B. C. D. E. F. G. H. I. J. Who is the broker?A.ChrisB.AnnC.GerryD.BenE.DonnaF.TomG.AprilH.AndyI.RonJ.Leslie.

You�ve been hired by the local government to determine which employe.pdf

info335653

you will implement some sorting algorithms for arrays and linked lists. Insertion Sort and Quicksort of an array Implement the insertion sort and quicksort for an integer array. The functions are defined in the "sorting.h" header file. /** * @brief Insertion sort algorithm * @param array Array to be sorted. The array is modified in place. * @param lowindex Lowest index of the array * @param highindex Highest index of the array * @param reversed If reversed = true, the array should be sorted in descending order, otherwise in ascending order */ void insertionSort(int array[], int lowindex, int highindex, bool reversed = false); and ** * @brief Quick sort algorithm * * @param array Array to be sorted. The array is modified in place. * @param lowindex Lowest index of the array * @param highindex Highest index of the array * @param reversed If reversed = true, the array should be sorted in descending order, otherwise in ascending order */ void quickSort(int array[], int lowindex, int highindex, bool reversed = false); The array should be sorted in place. Compared to the examples in the textbook, those functions have an additional parameter reversed. If reversed = true, the array should be sorted in descending order, otherwise in ascending order. You should complete the implementations of those two functions in the "sorting_basic.cpp" file. A better quicksort algorithm Quicksort is a very fast comparison sorting algorithm, especially wheb the array or list gets large. However, when the arrays/lists are small enough, quicksort may run slower than some of the (n^2) algorithms. This might not seem important until you note that when sorting a large array with quicksort, many small sublists must be sorted. While the savings on sorting one small list with a faster algorithm might be negligible, sorting hundreds of small lists with a faster algorithm can make a difference in the overall efficiency of the sort. For this part of the assignment, you will combine quicksort with another sorting algorithm to build a faster sorting algorithm. One option is to use quicksort until the array/list gets small enough, and then use insertion sort or another sort to sort the small arrays/lists What does "small enough" mean? You can try a percentage of the list (say, 5% or 10%), or an absolute number (5 elements, 8 elements, 10 elements, 15 elements, 100 elements, etc), or something else of your choosing. Based on your tests, choose the one that is the most efficient. You should also tests to ensure that your hybrid quicksort has reasonable performance on all lists -- most notably, it should be efficient on sorted and inverse sorted lists as well as random lists. The definition of the hybrid quicksort function is as the following: /** * @brief A hybrid of insertion sort and quick sort algorithm. The algorithm is based on the idea that if the array is short, it is better to use insertion sort. * It uses quicksort until the list gets small enough, and then uses insertion s.

you will implement some sorting algorithms for arrays and linked lis.pdf

info335653

You are the chief data scientist of the marketing company VisualZ. VisualZ is specialized in executive management consulting and has built a reputation for developing illustrations that are particularly easy to understand for the target audience. ProduceRs CEO has approached you two weeks ago and mentioned that she is particularly interested in a report on the social media KPIs. Together with ProduceR, you identified Social Media Reach as a key metric for ProduceR. Social Media Reach refers to the number of users who have come across specific content on a social platform. ProduceR has invested equal amounts in promoting their products on Facebook and Instagram and created public profiles for their firm to introduce their products and services. Your team proposes four different ways to compare ProduceRs Social Media Reach between Instagram and Facebook. Based on what you learned about choosing and interpreting visualizations in your business analytics class at The University of Queensland, please answer the following question.A.Use a bigger share of the total marketing budget for Instagram marketing.B.Use a bigger share of the total marketing budget for Twitter marketing.C.The data does not show differences in trends between platforms that would justify any changes to the budget allocation.D.The data does not allow you to make any meaningful assumptions about trends over time. Social Media Facebook Instagram 3.0M2.5M2.0M1.5M1.0M0.5M0.0M 2012 2014 2016 2018 2020.

You are the chief data scientist of the marketing company �VisualZ.�.pdf

info335653

Write a program that displays a table of the Celsius temperatures 0 through 20 and their Fahrenheit equivalents. The formula for converting a temperature from Celsius toFahrenheit is F=9 / 5 *C + 32 where F is the Fahrenheit temperature and C is the Celsius temperature. Your program must use a loop to display the table. Results will be similar: C F 0 32.0 1 33.8 2 35.6 20 68.0 USING THIS TEMPLATE : import java.text.DecimalFormat; /** This program demonstrates a solution to the Celsius to Fahrenheit Table programming challenge. */ public class CelsiusToFahrenheitTable { public static void main(String[] args) { double fahrenheit; // The Fahrenheit temperature double celsius; // The Celsius temperature // Create a DecimalFormat class to format output. DecimalFormat fmt = new DecimalFormat(" 0.0"); // Display the table headings. System.out.println("Celsius\t\tFahrenheit"); System.out.println("------------------------------"); // Display the table. } }.

Write a program that displays a table of the Celsius temperatures 0 .pdf

info335653

Why is the release of GDP statistics less interesting to investors than the release of other economic indicators? A. Because the formula for GDP includes not only private investment but also other irrelevant factors B. Because governments consistently alter their GDP measurement methods C. Because GDP statistics/are released well after other economic indicators Why is the release of GDP statistics less interesting to investors than the release of other economic indicators? Because the formula for GDP includes not only private investment but also other irrelevant factors Because governments consistently alter their GDP measurement methods Because GDP statistics/are released well after other economic indicators.

Why is the release of GDP statistics less interesting to investors t.pdf

info335653

Winds of Change in Klickitat County: The Harvest Wind Project M. Phillips, D. Watson, B. Barnes, and H. Feldman The following case describes a proposal by four Pacific Northwest utilities to build another wind farm in the Columbia River Gorge. The local county planning director is responsible for deciding on a permit for the project, but there are organizations and citizens both for and against approving the permit, including local farmers, environmental groups, county citizens worried about health and noise effects, and, of course, the local utilities who are proposing the project. If approved, and completed by the end of the year, the costs of the project could be reduced by almost a third through a grant by the U.S. Treasury Department. Introduction It was early April 2009, and Klickitat County planning director Curt Dreyer was weary but happy to be writing up his permitting decision. On a tight timeline, he had worked for months gathering information and vetting the Harvest Wind Project proposal that had been submitted by four Pacific Northwest consumer owned utilities: the Public Utility District (PUD) No. 1 of Cowlitz County, the Eugene Water and Electric Board. Lakeview Green Energy. Inc., and Peninsula Light Company. The pressure had been high: hanging in the balance was a $60.76 million US Treasury Department grant which represented 30 percent of eligible construction costs, made available through the American Recovery and Reinvestment Act of 2009 (ARRA). To qualify for the full amount, the wind project had to be completed within the year 2009. The proposed construction schedule was one of the most aggressive ever and in order to complete it on time approval had to come in April. Wind projects were complicated and required months of constructiontypically half a year or more. If Curt approved the project, construction could commence by early May, concluding by December 2009 at the latest to qualify for the $60.76 million grant. Approving the permit was not a forgone conclusion. Although Klickitat County was often called the capital of wind energy in the Pacific Northwest due to its 14 operating wind farms and its prime location in the Columbia River Gorge, concerns about wind power among stakeholdersincluding negative economic, environmental, and health effectswere increasingly being voiced in the region and nationally. With imperfect information on health effects and environmental effects, the true costs of wind were uncertain. And yet each new wind proposal had to be evaluated given leading edge knowledge at the time, and every affected party and viewpoint had to be taken into consideration before approving or turning down the projects permit application for the county. Given these concerns and the uncertainty, would the gains to project stakeholders justify signing off on the project? As he reflected on the past few months, Curt felt he had done his best to collect as much information as possible and to weigh the concerns and needs.

Winds of Change in Klickitat CountyThe Harvest Wind ProjectM..pdf

info335653

With reference to the case study, define social media marketing and critically discuss 2 ways (i.e., use of existing social media; or setting up their own), that marketers can use social media. Case Study with 3 Finalsite Schools Andrew Martin Social media has quickly become the go-to method for modern marketing and communications for independent schools and districts. It delivers your message directly to your targeted audience; its always readily available and easy- to-use for consumers; and its oftentimes free all things that schools love when marketing their culture, community, events, and more. Fortunately for schools, social media is also a place where prospective, current and former families spend a lot of their time. But despite the promise of social medias ability to reach your audience, earning their attention and engagement has gotten increasingly more difficult, as social media networks morph into pay-to-play platforms, forcing brands to invest in ads if they want their content to be seen. Whats more, social media has become a battleground where youre not just competing with other schools for attention; youre competing with yourself. Just think about the sheer amount of variety in content your school is likely to publish on any given day. Recruiting new applicants, engaging active alumni, distributing daily and weekly news, releasing event information, managing and maintaining the schools brand, and continuously building an active social media community. Your ever-growing catalogue of social media content looks amazing, but all that time and energy spent creating it is wasted if it ends up buried under a mountain of other posts, or goes unnoticed by the target audience. This phenomenon explains why social media advertising has become so useful and impactful, cutting through the ocean of content (including your own), and providing what is essentially a front-row ticket for everyone viewing your social media accounts. Ads can nearly guarantee that someone viewing your Facebook or Twitter feed is going to see the content that you need them to see, much more so than if published in a regular post amidst a daily stream of a dozen or more other posts. To help you decide how to approach social media advertising, weve selected three Finalsite schools that increased website traffic through social media advertising. Finalsites social media consulting team helped these schools develop their advertising campaign at a fraction of the cost of traditional advertising. School Year Abroad Up first is School Year Abroad (SYA), a high school study abroad program that helps juniors and seniors spend a year abroad in Italy, Spain, France, and China. SYA had three campaign goals to accomplish between December 2017 and August 2018: Build brand awareness and differentiation Increase awareness of study abroad opportunities and deadlines Increase interest of applying to School Year Abroad SYA developed their social media advertising plan with a monthly budg.

With reference to the case study, define social media marketing and cr.pdf

info335653

Will upvote Please fix the following code and post your inputs and o.pdf

info335653

Which of the following statements is CORRECT? a. The four most important financial statements provided in the annual report are the balance sheet, income statement, cash budget, and the statement of stockholders' equity. b. Assets other than cash are expected to produce cash over time, and the amounts of cash they eventually produce should be exactly the same as the amounts at which the assets are carried on the books. c. The primary reason the annual report is important in finance is that it is used by investors when they form expectations about the firm's future earnings and dividends and the riskiness of those cash flows. d. The annual report is an internal document prepared by a firm's managers solely.

Which of the following statements is CORRECT a. The four most importa.pdf

info335653

We will discuss 1. IT systems complexity IT systems have become unmanageably complex and expensive to maintain What has contributed to the complexity over the years... give examples What has contributed to the cost factor? 2. Explain why it is important to develop an effective data governance program What industries can you think of that might have strict data governance regulations in place? What are the advantages of good data governance? What are the characteristics of weak or non-existent data governance? 3. How can virtualization reduce IT costs while improving performance? 4. Discuss your own experiences with virtualization. Do you have any? 5. How does virtualization lead us to cloud computing? 6. Do you see Cloud as a form of.

We will discuss 1. IT systems� complexity IT systems have become unman.pdf

info335653

Using MISP VM ova file, import it on VirtualBox and respond to the questions below. NOTE: Internal interface and assign an IP address (edit the file /etc/network/interfaces), so that you can connect to the WebApp from a browser. 1. When clicking on Home, why there are no events? 2. List Feeds to check the list of default feeds. Go to Sync Actions. 3. Check how it looks like by Loading all default feed metadata. 4. Explain step by step. In Home there is still no events. What do you have to do to see, for instance, IPs blocked by Snort? 5. These events are available in Home. Prove it? 6. What kind of information is shown in the list at the bottom? What does this information represent? Click on the ID to populate information about this event. 7. Using ipgeolocation.io, locate one of the entries in the list. Choose it randomly. 8. Go back to the list of feeds and add all related to malware (use the search engine). If it takes a while, check in Administration Jobs the background tasks. Once done, prove again you got events from all of them. 9. URLhaus Show the details? 10. Show the information regarding malware stealer. In the Galaxies menu, you can search for topics. 11. For phishing URLs? What feed would you use 12. And for spam?.

Using MISP VM ova file, import it on VirtualBox and respond to the q.pdf

info335653

True or false? Public policy is not an important component of organizational sustainability because it affirms and institutionalizes specific activities by mandating them as a part of a government agencys core mission. Which of the following items would be considered indirect costs? Select all that apply. A. Equipment rental costs B. Personnel wages c. Support services, such as legal, IT, or administrative D. Costs for transportation and facility rentals True or false? A direct cost is a cost that can be identified specifically with a particular cost objective such as a grant, contract, project, function, or activity. True or false? As a rule, construction costs are not allowable in the grant proposal. A well-prepared budget should do which of the following? Select all that apply. A. Be reasonable and demonstrate that the funds being asked for will be used wisely B. List the items requested, as well as items not specifically requested in the grant application C. Estimate in-kind revenues and expenses D. Include a narrative that explains the numbers in the budget and how theyre calculated.

True or false Public policy is not an important component of organi.pdf

info335653

More from info335653 (12)