ex777777 I Suppose ArrayListlist - new ArrayList()- Which of the follo.docx

•Download as DOCX, PDF•

0 likes•2 views

The document discusses Java concepts related to generics and collections. It asks 4 multiple choice questions: 1. Which statements about adding elements to an ArrayList are correct. 2. Which wildcard can replace YYYYYYYY in a generic method adding elements from one stack to another. 3. Which statement about using the Comparable interface is correct. 4. Which wildcard can replace YYYYYYYY in a generic method with a bounded type parameter.

Education

ex777777
I Suppose ArrayListlist = new ArrayList(). Which of the following statements are correct? A,
double d = list.get(1); // Automatically converted to double B. list.add(3.0); // 3.0 is
automatically converted to new Double(3.0) C. Double doubleObject - list.get(0); // No casting is
needed D. list.add(5.5); // 5.5 is automatically converted to new Double(5.5) 2 Which of the
following can be used to replace YYYYYYYY in the following code? public class
WildCardDemo3{ public static void main(String[] args) { GenericStack stack! = new
GenericStackString>(); GenericStack stack2 = new GenericStack(); stack2.push("Java");
stack2.push(2); stackl push("Sun"); add(stackl, stack2); WildCardDemo2.print(stack2); public
static T> void add(GenericStackT> stack 1, GenericStack stack2){ while (!stackl.isEmpty))
stack2.push(stack1.pop)); A. ? extends T B. ? extends Object C. ? super T D. ? super Object 3
Which of the following statements is correct? A. ComparableString> c-"abc"; B.
ComparableString c = new String("abc"); C. Comparable c = new Date(); D.
ComparableString> c new Date(); 4 Which of the following can be used to replace
YYYYYYYY in the following code? public class WildCardDemo3 public static void
main(String[] args) f
Solution
Ans. Statemnts A,B,C,D are correct
Ans. Option C.
Ans. Option A & B
Ans. Option A & C
Ans. Option D
Ans.Option A
Ans. Option D
Ans.Option A

Similar to ex777777 I Suppose ArrayListlist - new ArrayList()- Which of the follo.docx

Java Generics

jeslie

Complete skeletonimport java.util.ArrayList; public class My.pdf

arhamnighty

Creat Shape classes from scratch DETAILS You will create 3 shape classes (Circle, Rectangle, Triangle) that all inherit from a single abstract class called AbstractShape which implements Shape (also created by you). You are also responsible for creating the driver class \"Assignment7.java\" (program that tests your classes and described on page 3) which does the following reads input data from a file instantiates various objects of the three shapes based on the input data stores each in a LinkedList outputs this list to an output file sorts a \"copy\" of this LinkedList of objects outputs the sorted version of the list to the output file outputs the original list to the output file This driver program also needs to \"ignore errors in the input file that breach the specified input format as described in the Assianment7,java details (see page 3 1. Shape.java This is an interface that has 2 abstract methods, and passes the responsibility of implementing the compareTo method to the class that implements Shape (you may note, nomally Comparable is \"implemented\" by a class. However, an interface cannot implement because interfaces can only contain abstract methods. That said, an interface can only extend other interfaces and the responsibility of actually \"implementing\" the abstract method(s) of the super class interface is passed on to the sub-classes) public interface Shape extends Comparable public double calculateAreal) Il This abstract method is implemented at the concrete level public Shape copyShape); Il also implemented at the concrete level 2. AbstractShape.java public abstract class AbstractShape implements Shape This class should contain an instance field to store the name of each obiect. The constructor which sets this field should receive the name and a number to be concatenated to the name and then stored in the name field Recall, when the super class has a parameterized constructor, the sub-classes will need to call it AND the sub- classes will need to also provide a constructor without parameters This abstract class will implement the compareTo method passed on from the Shape interface and will pass on the responsibility of implementing calculateArea to the extending sub-classes (compare To will use the calculateArea method when comparing 2 Shape objects). Along with compare To, one more concrete method should be included. The following will be used by the sub-classes\' toString method: public String getName) II Simply returns the name field data Solution in7.txt 4.4 2.5 3 8.1 3.0 5.0 2.5 3 4 2.5 tuesday -7 1.0 3 three 3 -9 3 5 1.0 Assignment7.java import java.io.*; import java.util.*; public class Assignment7 { /** * This is the test driver class that will include main. * This program MUST read a file named in7.txt and * generate an output file named out7.txt. The in7.txt * file must be created by you based on formatting * described shortly. * * @param theArgs */ public static void main(String[] theArgs) { List myList = new Arra.

Creat Shape classes from scratch DETAILS You will create 3 shape cla.pdf

aromanets

Create a class BinarySearchTree. A class that implements the ADT binary search tree by extending BinaryTree. Recursive version. public class BinarySearchTree<T extends Comparable<? super T>> extends BinaryTree<T> implements SearchTreeInterface<T> { public BinarySearchTree () { super(); } // end default constructor public BinarySearchTree (T rootEntry) { super(); setRootNode(new BinaryNode<>(rootEntry)); } // end constructor public void setTree (T rootData) // Disable setTree (see Segment 25.6) { throw new UnsupportedOperationException(); } // end setTree public void setTree (T rootData, BinaryTreeInterface<T> leftTree, BinaryTreeInterface<T> rightTree) { throw new UnsupportedOperationException(); } // end setTree //... public T remove (T entry) { ReturnObject oldEntry = new ReturnObject(null); BinaryNode<T> newRoot = removeEntry(getRootNode(), entry, oldEntry); setRootNode(newRoot); return oldEntry.get(); } // end remove //... private class ReturnObject { private T item; private ReturnObject(T entry) { item = entry; } // end constructor public T get() { return item; } // end get public void set(T entry) { item = entry; } // end set } // end ReturnObject } // end BinarySearchTree HERE IS BinaryTree.java import java.util.Iterator; import java.util.NoSuchElementException; public class BinaryTree<T> implements BinaryTreeInterface<T> { private BinaryNode<T> root; public BinaryTree() { root = null; } public BinaryTree(T rootData) { root = new BinaryNode<>(rootData); } public BinaryTree(T rootData, BinaryTree<T> leftTree, BinaryTree<T> rightTree) { privateSetTree(rootData, leftTree, rightTree); } private void privateSetTree(T rootData, BinaryTree<T> leftTree, BinaryTree<T> rightTree) { root = new BinaryNode<>(rootData); if (leftTree != null && !leftTree.isEmpty()) { root.setLeftChild(leftTree.root); } if (rightTree != null && !rightTree.isEmpty()) { if (rightTree != leftTree) { root.setRightChild(rightTree.root); } else { root.setRightChild(rightTree.root.copy()); } } if (leftTree != null && leftTree != this) { leftTree.clear(); } if (rightTree != null && rightTree != this) { rightTree.clear(); } } @Override public T getRootData() { if (isEmpty()) { throw new EmptyTreeException("The tree is empty."); } return root.getData(); } @Override public int getHeight() { return root.getHeight(); } @Override public int getNumberOfNodes() { return root.getNumberOfNodes(); } @Override public boolean isEmpty() { return root == null; } @Override public void clear() { root = null; } @Override public Iterator<T> getPreorderIterator() { return new PreorderIterator(); } @Override public Iterator<T> getInorderIterator() { return new InorderIterator(); } @Override public Iterator<T> getPostorderIterator() { return new PostorderIterator(); } private class PreorderIterator implements Iterator<T> { private StackInterface<BinaryNode<T>> nodeStack; public PreorderIterator() { nodeStack = new LinkedStack<>(); if (root != null) { nodeStack.push(root); } } public boolean hasNex.

Create a class BinarySearchTree- A class that implements the ADT binar.pdf

shyamsunder1211

Modify HuffmanTree.java and HuffmanNode.java to allow the user to select the value of n 9 to construct an n ary Huffman Tree. Once finished, verify the accuracy of your tree by running it for the English Alphabet for n = 3, 4, 5, 6, 7, 8, 9. For each value of n, compute the average codeword length. Write these in a table (n vs. ACW L(Cn)). / HuffmanTree.java import java.io.FileNotFoundException; import java.io.FileReader; import java.util.ArrayList; import java.util.Scanner; public class HuffmanTree { public static void main(String[] args){ Scanner in = new Scanner(System.in); System.out.print(\"Enter the file name: \"); String fileName = in.nextLine(); ArrayList nodes = new ArrayList<>(); ArrayList temp = new ArrayList<>(); try { Scanner fin = new Scanner(new FileReader(fileName)); String symbol; double prob; while(fin.hasNext()){ symbol = fin.next(); prob = fin.nextDouble(); nodes.add(findInsertIndex(nodes, prob), new HuffmanNode(symbol, prob)); } fin.close(); temp.addAll(nodes); HuffmanNode root = createHuffmanTree(temp); setCodeWords(root); double avg = 0; for (HuffmanNode node : nodes) { System.out.println(node.getS() + \": \" + node.getC() + \": \" + node.getL()); avg += node.getL(); } if(avg != 0) avg /= nodes.size(); System.out.println(\"Average code length is: \" + avg); } catch (FileNotFoundException e) { e.printStackTrace(); } } private static HuffmanNode createHuffmanTree(ArrayList nodes){ HuffmanNode root = null; if(nodes.size() > 0) { HuffmanNode node0, node1, node; while (nodes.size() > 1) { node0 = nodes.get(0); node1 = nodes.get(1); node = new HuffmanNode(null, node0.getP() + node1.getP()); node.setLeft(node0); node.setRight(node1); nodes.remove(0); nodes.remove(0); nodes.add(findInsertIndex(nodes, node.getP()), node); } root = nodes.get(0); } return root; } private static void setCodeWords(HuffmanNode root){ if(root != null){ setCodeWords(root, \"\"); } } private static void setCodeWords(HuffmanNode root, String codeWord){ if(root.getS() != null){ root.setC(codeWord); root.setL(codeWord.length()); } else{ setCodeWords(root.getLeft(), codeWord + \"0\"); setCodeWords(root.getRight(), codeWord + \"1\"); } } private static int findInsertIndex(ArrayList nodes, double prob){ for(int i = 0; i < nodes.size(); ++i){ if(prob < nodes.get(i).getP()){ return i; } } return nodes.size(); } } // HuffmanNode.java public class HuffmanNode { private String S; private double P; private String C; private int L; private HuffmanNode left, right; public HuffmanNode(String s, double p) { S = s; P = p; } public String getS() { return S; } public void setS(String s) { S = s; } public double getP() { return P; } public void setP(double p) { P = p; } public String getC() { return C; } public void setC(String c) { C = c; } public int getL() { return L; } public void setL(int l) { L = l; } public HuffmanNode getLeft() { return left; } public void setLeft(HuffmanNode left) { this.left = left; } public HuffmanNode getRight() { return right; } public void se.

Modify HuffmanTree.java and HuffmanNode.java to allow the user to se.pdf

arjuncorner565

coding in C; Create a function called reverseList that takes the head of a linked list, reverses the order of all the nodes. For example, if the list contained 1, 2, 3, 4 in its nodes, the list will now contain 4, 3, 2, 1. please add a main test. Solution Please find the required program below: #include<stdio.h> #include<stdlib.h> struct node { int data; struct node* next; }; void push(struct node** head, int new_element) { struct node* new_node = (struct node*) malloc(sizeof(struct node)); new_node->data = new_element; new_node->next = (*head); (*head) = new_node; } void printList(struct node *head) { struct node *temp = head; while(temp != NULL) { printf(\"%d \", temp->data); temp = temp->next; } } void reverseList(struct node** head) { struct node* prev = NULL; struct node* current = *head; struct node* next; while (current != NULL) { next = current->next; current->next = prev; prev = current; current = next; } *head = prev; } int main() { struct node* head = NULL; push(&head, 12); push(&head, 14); push(&head, 5); push(&head, 8); printf(\"\ Linked list Before Reversing :\ \"); printList(head); reverseList(&head); printf(\"\ Linked list After Reversing :\ \"); printList(head); } -------------------------------------------------------------------------------- OUTPUT: Linked list Before Reversing : 8Â Â 5Â Â 14Â Â 12 Linked list After Reversing : 12Â Â 14Â Â 5Â Â 8 .

coding in C- Create a function called reverseList that takes the head.docx

tienlivick

This code currently works. Run it and get a screen shot of its ou.docx

Komlin1

Array list

vishal choudhary

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.

Help explain the code with line comments public class CompletedLis.pdf

almonardfans

Please help write BinaryTree.java Thank you! Create a class BinaryTree. A class that implements the ADT binary tree. import java.util.Iterator; import java.util.NoSuchElementException; import StackAndQueuePackage.*; public class BinaryTree <T> implements BinaryTreeInterface<T> { private BinaryNode<T> root; public BinaryTree() { root = null; } // end default constructor public BinaryTree(T rootData) { root = new BinaryNode<>(rootData); } // end constructor public BinaryTree(T rootData, BinaryTree<T> leftTree, BinaryTree<T> rightTree) { privateSetTree(rootData, leftTree, rightTree); } // end constructor public void setTree(T rootData) { root = new BinaryNode<>(rootData); } // end setTree public void setTree(T rootData, BinaryTreeInterface<T> leftTree, BinaryTreeInterface<T> rightTree) { privateSetTree(rootData, (BinaryTree<T>)leftTree, (BinaryTree<T>)rightTree); } // end setTree private void privateSetTree(T rootData, BinaryTree<T> leftTree, BinaryTree<T> rightTree) { root = new BinaryNode<>(rootData); if ((leftTree != null) && !leftTree.isEmpty()) root.setLeftChild(leftTree.root); if ((rightTree != null) && !rightTree.isEmpty()) { if (rightTree != leftTree) root.setRightChild(rightTree.root); else root.setRightChild(rightTree.root.copy()); } // end if if ((leftTree != null) && (leftTree != this)) leftTree.clear(); if ((rightTree != null) && (rightTree != this)) rightTree.clear(); } // end privateSetTree //... private class PreorderIterator implements Iterator<T> { private StackInterface<BinaryNode<T>> nodeStack; public PreorderIterator() { nodeStack = new LinkedStack<>(); if (root != null) nodeStack.push(root); } // end default constructor public boolean hasNext() { return !nodeStack.isEmpty(); } // end hasNext public T next() { BinaryNode<T> nextNode; if (hasNext()) { nextNode = nodeStack.pop(); BinaryNode<T> leftChild = nextNode.getLeftChild(); BinaryNode<T> rightChild = nextNode.getRightChild(); // Push into stack in reverse order of recursive calls if (rightChild != null) nodeStack.push(rightChild); if (leftChild != null) nodeStack.push(leftChild); } else { throw new NoSuchElementException(); } return nextNode.getData(); } // end next public void remove() { throw new UnsupportedOperationException(); } // end remove } // end PreorderIterator public void iterativePreorderTraverse () { StackInterface<BinaryNode<T>> nodeStack = new LinkedStack<>(); if (root != null) nodeStack.push(root); BinaryNode<T> nextNode; while (!nodeStack.isEmpty()) { nextNode = nodeStack.pop(); BinaryNode<T> leftChild = nextNode.getLeftChild(); BinaryNode<T> rightChild = nextNode.getRightChild(); // Push into stack in reverse order of recursive calls if (rightChild != null) nodeStack.push(rightChild); if (leftChild != null) nodeStack.push(leftChild); System.out.print(nextNode.getData() + " "); } // end while } // end iterativePreorderTraverse private class InorderIterator implements Iterator<T> { private StackInterface<BinaryNode<T>> nodeStack; private BinaryNode<T> cu.

Please help write BinaryTree-java Thank you! Create a class BinaryTr.pdf

info750646

Implement the ADT stack by using an array stack to contain its entries. Expand the array dynamically, as necessary. Maintain the stack’s bottom entry in stack[stack.length – 1]. Your Stack class must implement StackInterface (provided). You may use ArrayStack.java (provided) as the starting point for your implementation. You must implement a comprehensive set of unit tests using the main() method (and private utility methods) in ArrayStack.java. ArrayStack.java public class ArrayStack implements StackInterface { private T[] stack; // Array of stack entries private int topIndex; // Index of top entry private boolean initialized = false; private static final int DEFAULT_CAPACITY = 50; private static final int MAX_CAPACITY = 10000; public ArrayStack() { this(DEFAULT_CAPACITY); } // end default constructor public ArrayStack(int initialCapacity) { checkCapacity(initialCapacity); // The cast is safe because the new array contains null entries @SuppressWarnings(\"unchecked\") T[] tempStack = (T[])new Object[initialCapacity]; stack = tempStack; topIndex = -1; initialized = true; } // end constructor // < Implementations of the stack operations go here. > // < Implementations of the private methods go here; checkCapacity and // checkInitialization are analogous to those in Chapter 2. > // . . . } // end ArrayStack StackInterface.java public interface StackInterface { /** Adds a new entry to the top of this stack. @param newEntry An object to be added to the stack. */ public void push(T newEntry); /** Removes and returns this stack\'s top entry. @return The object at the top of the stack. @throws EmptyStackException if the stack is empty before the operation. */ public T pop(); /** Retrieves this stack\'s top entry. @return The object at the top of the stack. @throws EmptyStackException if the stack is empty. */ public T peek(); /** Detects whether this stack is empty. @return True if the stack is empty. */ public boolean isEmpty(); /** Removes all entries from this stack. */ public void clear(); } // end StackInterface Solution StackTester.java public class StackTester { public static void main(String[] args) { ArrayStack aS = new ArrayStack(); aS.push(3); aS.push(5); aS.push(10); aS.push(11); System.out.println(\"\"+ aS.peek() + \", \" + aS.pop() + \", \" + aS.peek2()); aS.remove(1); } } ArrayStack.java import java.util.Arrays; public class ArrayStack implements StackInterface { private T[] stack; private int topIndex; private boolean initialized = false; private static final int DEFAULT_CAPACITY = 50; private static final int MAX_CAPACITY = 10000; public ArrayStack() { this(DEFAULT_CAPACITY); } public ArrayStack(int initialCapacity) { checkCapacity(initialCapacity); @SuppressWarnings(\"unchecked\") T[] tempStack = (T[])new Object[initialCapacity]; stack = tempStack; topIndex = -1; initialized = true; } public boolean isEmpty() { return topIndex < 0; } private void ensureCapacity() { if(topIndex == stack.length - 1) { int newLength = 2*stack.length; .

Implement the ADT stack by using an array stack to contain its entri.pdf

SIGMATAX1

Implement a queue using a linkedlist (java)SolutionLinkedQueue.pdf

kostikjaylonshaewe47

5 Rmi Print

varadasuren

C++ programs

Mukund Gandrakota

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

pleaase I want manual solution for Data Structures and Algorithm Analysis in C++, Third Edition By Clifford A. Shaffer because my question from this book.page270 ,question 7.4 The implementation for Mergesort given in Section 7.4 takes an array as input and sorts that array. At the beginning of Section 7.4 there is a simple pseudocode implementation for sorting a linked list using Mergesort. Implement both a linked list-based version of Mergesort and the array-based version of Mergesort, and compare and analyze their running times. Solution Linked list: #include #include struct node { int data; struct node* next; }; struct node* SortedMerge(struct node* a, struct node* b); void FrontBackSplit(struct node* source, struct node** frontRef, struct node** backRef); void MergeSort(struct node** headRef) { struct node* head = *headRef; struct node* a; struct node* b; if ((head == NULL) || (head->next == NULL)) { return; } FrontBackSplit(head, &a, &b); MergeSort(&a); MergeSort(&b); *headRef = SortedMerge(a, b); } struct node* SortedMerge(struct node* a, struct node* b) { struct node* result = NULL; if (a == NULL) return(b); else if (b==NULL) return(a); if (a->data <= b->data) { result = a; result->next = SortedMerge(a->next, b); } else { result = b; result->next = SortedMerge(a, b->next); } return(result); } void FrontBackSplit(struct node* source, struct node** frontRef, struct node** backRef) { struct node* fast; struct node* slow; if (source==NULL || source->next==NULL) { *frontRef = source; *backRef = NULL; } else { slow = source; fast = source->next; while (fast != NULL) { fast = fast->next; if (fast != NULL) { slow = slow->next; fast = fast->next; } } *frontRef = source; *backRef = slow->next; slow->next = NULL; } } void printList(struct node *node) { while(node!=NULL) { printf(\"%d \", node->data); node = node->next; } } void push(struct node** head_ref, int new_data) { struct node* new_node = (struct node*) malloc(sizeof(struct node)); new_node->data = new_data; new_node->next = (*head_ref); (*head_ref) = new_node; } int main() { struct node* res = NULL; struct node* a = NULL; push(&a, 15); push(&a, 10); push(&a, 5); push(&a, 20); push(&a, 3); push(&a, 2); MergeSort(&a); printf(\"\ Sorted Linked List is: \ \"); printList(a); getchar(); return 0; } Time complexity:o(nlogn) Array : #include #include void merge(int arr[], int l, int m, int r) { int i, j, k; int n1 = m - l + 1; int n2 = r - m; int L[n1], R[n2]; for (i = 0; i < n1; i++) L[i] = arr[l + i]; for (j = 0; j < n2; j++) R[j] = arr[m + 1+ j]; i = 0; // Initial index of first subarray j = 0; k = l; while (i < n1 && j < n2) { if (L[i] <= R[j]) { arr[k] = L[i]; i++; } else { arr[k] = R[j]; j++; } k++; } while (i < n1) { arr[k] = L[i]; i++; k++; } while (j < n2) { arr[k] = R[j]; j++; k++; } } void mergeSort(int arr[], int l, int r) { if (l < r) { int m = l+(r-l)/2; // Sort first and second halves mergeSort(arr, l, m); mergeSort(arr, m+1, r); merge(arr, l, m, r); } } void printArray(int A[], i.

pleaase I want manual solution forData Structures and Algorithm An.pdf

wasemanivytreenrco51

1z0 804 exam-java se 7 programmer ii

Isabella789

Why following sort does not work? (It does not sort last 2 - 3 numbers) //Sort order class SortNumbListener implements ActionListener { @Override public void actionPerformed(ActionEvent e) { Collections.sort(list); for(int i = 0; i < list.size(); i++) { textfield2.setText(list.toString()); } System.out.print(list + \"\ \"); } } Solution import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import java.util.ArrayList; import java.util.Collections; import java.util.List; import javax.swing.JTextField; public class SorAction { public JTextField textfield2; public List list; public SorAction() { // TODO Auto-generated constructor stub textfield2 = new JTextField(); list = new ArrayList(); list.add(20); list.add(12); list.add(32); list.add(3); new SortNumbListener().actionPerformed(new ActionEvent(\"\", 0, null)); } public static void main(String[] args) { try { new SorAction(); } catch (Exception e) { // TODO: handle exception e.printStackTrace(); } } class SortNumbListener implements ActionListener { @Override public void actionPerformed(ActionEvent e) { Collections.sort(list); textfield2.setText(list.toString()); System.out.print(list + \"\ \"); } } } OUTPUT: [3, 12, 20, 32] NOTE: please check the above example, sorting fine, but what is the need of loop, if you want to add the text to textbox use setText() method of textfield.

Why following sort does not work (It does not sort last 2 - 3 numbe.pdf

gopalk44

Please create the appropriate JUnit test cases to thoroughly unit test the following program: IntegerSet.java import java.util.*; public class IntegerSet{ private ArrayList<Integer> list= new ArrayList<>(); public IntegerSet(ArrayList list) { this.list=list; } // clears the all representation of class public void clear() { list.clear(); } // returns the length of set public int length() { return list.size(); } // return true if 2 lists are equal public boolean equals(IntegerSet b) { ArrayList<Integer> list2=b.list; if(list.size()!=list2.size()) { return false; } ArrayList<Integer> temp1=list; ArrayList<Integer> temp2=list2; Collections.sort(temp1); Collections.sort(temp2); for(int i=0;i<temp1.size();i++) { if(temp1.get(i)!=temp2.get(i)) { return false; } } return true; } // returns a largest item and throw exception if list is empty public int largest() throws IntegerSetException { if(list.size()==0) { IntegerSetException e= new IntegerSetException(); throw e; } int max=0; for(int i=0;i<list.size();i++) { if(list.get(i)>max) { max=list.get(i); } } return max; } // returns a largest item and throw exception if list is empty public int smallest() throws IntegerSetException { if(list.size()==0) { IntegerSetException e= new IntegerSetException(); throw e; } int min=Integer.MAX_VALUE; for(int i=0;i<list.size();i++) { if(list.get(i)<min) { min=list.get(i); } } return min; } // add item if already not exist in list public void addItem(int item ) { boolean exist=false; for(int i=0;i<list.size();i++) { if(list.get(i)==item) { exist=true; } } if(exist==false) { list.add(item); } } // remove item if already not exist in list public void removeItem(int item ) { for(int i=0;i<list.size();i++) { if(list.get(i)==item) { list.remove(i); } } } // return union of of 2 sets public IntegerSet union(IntegerSet list2) { ArrayList<Integer> temp=list2.getlist(); Set<Integer> set = new HashSet<>(); set.addAll(list); set.addAll(temp); ArrayList<Integer> list3= new ArrayList<>(set); IntegerSet list4= new IntegerSet(list3); return list4; } // return intersection of of 2 sets public IntegerSet intersection(IntegerSet list2) { ArrayList<Integer> temp=list2.getlist(); list.retainAll(temp); IntegerSet list4= new IntegerSet(list); return list4; } // returns difference of 2 sets public IntegerSet difference (IntegerSet list2) { ArrayList<Integer> temp=list2.getlist(); // Remove all elements in list2 from list list.removeAll(temp); IntegerSet list4= new IntegerSet(list); return list4; } public ArrayList<Integer> getlist(){ return list; } } IntegerSetException.java class IntegerSetException extends Exception { Driver.java import java.util.*; public class Driver { public static void main(String[] args) throws IntegerSetException { ArrayList<Integer> list1= new ArrayList<>(); ArrayList<Integer> list2= new ArrayList<>(); // make 2 instance of integerset class for implementation IntegerSet set1= new IntegerSet(list1); IntegerSet set2= new IntegerSet(list2); set1.addItem(1); set1.ad.

Please create the appropriate JUnit test cases to thoroughly.pdf

kitty811

ReversePoem.java :- --------------------------------- public class ReversePoem { /*This programs has you display a pessimistic poem from a list of phrases*/ // and then reverse the phrases to find another more optimistic poem. public static void main(String[] args) throws Exception { //Queue object MyQueue queue = new MyQueue<>(); //Stack object MyStack stack = new MyStack<>(); //String buffer to apppend all Strings StringBuffer sb = new StringBuffer(); // Create a single String object from the 16 Strings below String set1 = \"I am part of a lost generation#and I refuse to believe that#\"; sb.append(set1); String set2 = \"I can change the world#I realize this may be a shock but#\"; sb.append(set2); String set3 = \"\'Happiness comes from within\'#is a lie, and#\"; sb.append(set3); String set4 = \"\'Money will make me happy\'#So in 30 years I will tell my children#\"; sb.append(set4); String set5 = \"they are not the most important thing in my life#\"; sb.append(set5); String set6 = \"My employer will know that#I have my priorities straight because#\"; sb.append(set6); String set7 = \"work#is more important than#family#I tell you this#\"; sb.append(set7); String set8 = \"Once upon a time#Families stayed together#\"; sb.append(set8); String set9 = \"but this will not be true in my era#\"; sb.append(set9); String set10 = \"This is a quick fix society#Experts tell me#\"; sb.append(set10); String set11 = \"30 years from now, I will be celebrating the 10th anniversary of my divorce#\"; sb.append(set11); String set12 = \"I do not concede that#I will live in a country of my own making#\"; sb.append(set12); String set13 = \"In the future#Environmental destruction will be the norm#\"; sb.append(set13); String set14 = \"No longer can it be said that#My peers and I care about this earth#\"; sb.append(set14); String set15 = \"It will be evident that#My generation is apathetic and lethargic#\"; sb.append(set15); String set16 = \"It is foolish to presume that#There is hope#\"; sb.append(set16); String finalString = sb.toString(); String itmes[] = finalString.split(\"#\"); System.out.println(\"========== Original Phrase ==============\"); for(int i = 0 ; i < itmes.length;i++){ queue.enqueue(itmes[i]); System.out.println(itmes[i]); } for(int i = 0 ; i < itmes.length;i++){ stack.push(queue.dequeue()); } System.out.println(\"========== Reverse Phrase ==============\"); for(int i = 0 ; i < itmes.length;i++){ System.out.println(stack.pop()); } /* You are given a list of phrases in Strings; the phrases are separated by pound signs: \'#\': 1. Create a single String object from this list. 2. Then, split the String of phrases into an array of phrases using the String split method. 3. Display a poem by walking through the array and displaying each phrase one per line. 4. And, at the same time, place each phrase on a MyQueue object using only the enqueue method. 5. After all the phrases have been placed on the queue, transfer the phrases from the MyQueue object to a MyS.

ReversePoem.java ---------------------------------- public cl.pdf

ravikapoorindia

Similar to ex777777 I Suppose ArrayListlist - new ArrayList()- Which of the follo.docx (20)

Java Generics

Complete skeletonimport java.util.ArrayList; public class My.pdf

Creat Shape classes from scratch DETAILS You will create 3 shape cla.pdf

Create a class BinarySearchTree- A class that implements the ADT binar.pdf

Modify HuffmanTree.java and HuffmanNode.java to allow the user to se.pdf

coding in C- Create a function called reverseList that takes the head.docx

This code currently works. Run it and get a screen shot of its ou.docx

Array list

Help explain the code with line comments public class CompletedLis.pdf

Please help write BinaryTree-java Thank you! Create a class BinaryTr.pdf

Implement the ADT stack by using an array stack to contain its entri.pdf

Implement a queue using a linkedlist (java)SolutionLinkedQueue.pdf

5 Rmi Print

C++ programs

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

pleaase I want manual solution forData Structures and Algorithm An.pdf

1z0 804 exam-java se 7 programmer ii

Why following sort does not work (It does not sort last 2 - 3 numbe.pdf

Please create the appropriate JUnit test cases to thoroughly.pdf

ReversePoem.java ---------------------------------- public cl.pdf

More from vtuan3

Arrange the following elements from greatest to least tendency to accept an electron. Mg, Si, Na, S, Cl Solution The ability to accept one or more electrons is known as electron affinity. The halogens( Group 7A) have the highest electron affinity values because by accepting an electron makes a stable noble gas configuration. Hence, Cl has greatest tendency to accept an electron. The valence electron configuration of the Mg metal is 3s2. The extra electron must enter the 3p subshell, which is effectively shielded by two 3s electrons ( Because ns electrons are more penetrating than np electrons) and the inner electrons. Consequently, Mg metal has little tendency to pick up an extra electron. Hence, Mg has least tendency to accept an electron. The valence electron configuration of the Na metal is 3s1. The extra electron must enter the 3s subshell, which is stable as it fulfills the s orbital. Hence, Na has greatest tendency to accept an electron than Mg. From left to right electron affinity increases. Hence, S > Si Therefore, the order of accepting an electron from greatest to least is as follows: Cl (349 kJ/mol) > S (200 kJ/mol) > Si (134 kJ/mol) > Na (53 kJ) > Mg (<(=) 0). .

Arrange the following elements from greatest to least tendency to acce.docx

vtuan3

Arrange the elution sequence of the following compounds by using reversed phase liquid chromatography (1st , 2nd ,3rd) Glucose, Cholesterol, Lauric aicd Solution Reversed Phase Liquid Chromatography is a chromatographic technique in which the mobile phase used is more POLAR than the NON-POLAR stationary phase. Thus hydrophilic molecules will be eluted first followed by hydrophophobic compounds. The molecules that we are considering are Glucose, Cholesterol and Lauric acid 1. Glucose: it is considered a polar molecule. The presence of oxygen atoms around the molecule in the form of -OH group will ensure the hydrophilic nature of compound. 2. Cholesterol: it is a 27-Carbon organic compound that belongs to the category of steroids. The only polar component present in the molecule is the single -OH group attached to the ring. it is counted among the group of non-polar molecule 3. Lauric acid: Lauric acid is a 12-carbon fatty acid which contains a long chin of hydrophobic group attached to the terminal polar -COOH group. It is considered to be more polar than cholesterol but it is altogether a non-polar compound due to long hydrophobic chain. As per the nature of the compounds, the sequence in which the compounds will be eluted in the reversed phase liquid chromatographic column is 1. Glucose 2. Lauric acid 3. Cholesterol .

Arrange the elution sequence of the following compounds by using rever.docx

vtuan3

Are you surprised by the variety and range of issues addressed by the World Bank - projects that meet basic needs such as fresh water and programs to provide Internet services? What are your thoughts on this variety? Solution Soln: It is indeed surprising by the variety and range of issues addressed by the World Bank. There are concerns about the types of development projects funded. Many infrastructure projects financed by the World Bank Group have social and environmental implications for the populations in the affected areas and criticism has centred on the ethical issues of funding such projects. For example, World Bank-funded construction of dams for irrigation, drinking water and electricity generation in various countries has resulted in the displacement of indigenous peoples of the area. World Bank working in partnership with the private sector may undermine the role of the state as the primary provider of essential goods and services, such as Internet service, drinking water, healthcare and education, resulting in the shortfall of such services in countries badly in need of them. Therefore , world bank should focus more on providing funding to alleviate proverty and to take up projects which empower people to come out of poverty and world bank should not impose any conditionalities on governments who borrow money from them. .

Are you surprised by the variety and range of issues addressed by the.docx

vtuan3

Are there ethical considerations we should consider during the the entire innovation process? If so, what are they? Do they occur at every step of the process? Can an innovation be morally neutral, yet be unethical or socially irresponsible when carried out or applied? Solution The words innovative and innovation are bantered about in the media, in business, and in our everyday lives. The words evoke a feeling of progress with technology moving us upward and forward while simultaneously pushing aside existing, soon-to-be-outdated, technology. How does business handle this disruption? How can we think about the responsibility for the innovation and the associated wake of changed beliefs, behaviors, and relationships? The goal of innovations is to upset current beliefs, behavior, relationships, and technologies for a given community. The automobile disrupted the horse and buggy system. The telegraph disrupted the Pony Express By viewing the innovative process as bringing together technology and communities, the innovation and its consequences become a shared responsibility. The community has a responsibility to use the technology within a given range of permissible behaviors and to incorporate rules and norms to support the technology. The innovating firm, however, has a responsibility to understand the community into which the innovation is being introduced. As Evans notes in his book on innovators in the United States, .

Are there ethical considerations we should consider during the the ent.docx

vtuan3

AP Chemistry Review Questions Integrating Content, Inquiry and Reasoning 1. Calculate the value of % T for an absorbance value A-15. Using this result, explain why absorbance may not be accurate. measurements > 1 2. Spectrophotometric studies can be conducted on any colored compound. The transition metal group of the periodic table exhibits a wide array of different colored compounds. The complex ion tetraamminecopper(II) contains four ammonia molecules covalently bonded to a copper(II) ion. In aqueous solutions, Cu2+ ions will bond to four water molecules in a square planar geometry. The solution is a light blue color. The water molecules can be displaced by ammonia molecules, which form more stable complex bases than water. The appearance of the intense dark blue-violet color of the [Cu(NH )J2 ion is often used as a positive test to verity the presence of Cu? ions d chemical equation for the reaction of copper(II) sulfate and concentrated ammonia to produce tetraamminecopper(I) sulfate. tion has occurred and that the product formed is in fact tetraaminecopper(II) sulfate? Would you expect the wavelength of maximun absorbance for CuNH2 to be greater than or less than for Cu(H,0 Explain. b. [Cu(NH2 solutions exhibit a deep blue-violet color. How can you use spectrophotometry to confirm that this reac- 3. The electron transitions responsible for the colors of transition metal ions involved>d transitions. Why are zinc ions colorless in aqueous solution? Solution Formula: Transmittence= 10^(-Absorbance) T=10^(-A) T=10^-1.5 T=0.031623 %T=3.1623% This means that 96.8377% light has been absorbed and only 3.1623% has been transmitted. Detection of such low value of transmitted by the detector will increase the chances of error. Also, because transmittence decreases logarithmically, linearity is lost at high concentration of sample. .

AP Chemistry Review Questions Integrating Content- Inquiry and Reasoni.docx

vtuan3

answers? 22. H lysine? You do not have to write them all out. ow many tetra peptides can be formed by combining alanine, serine, glycine and How does glyphosate inhibit weed growth, explain in simple terms involving essential amino acids and simple enzyme catalysis? 23. 24. What is the cause of cyele cell anemia? 25. Zidovudne (aka AZT) was the first drug approved to treat HIV. How does it work the molecular level? ?? 9 Solution Answer 24.) Sickle cell anemia is an inherited form of anemia in which there aren\'t enough healthy red blood cells to carry adequate oxygen throughout your body. Sickle cell anemia is caused by a mutation in the gene that tells the body to make the red, iron-rich compound that gives blood its red color (hemoglobin). Hemoglobin allows red blood cells to carry oxygen from your lungs to all parts of your body. In sickle cell anemia, the abnormal hemoglobin causes red blood cells to become rigid, sticky and misshapen. After the hemoglobin molecules give up their oxygen, some of them may cluster together and form long, rod-like structures that become stiff and assume a sickle shape. The sickle cell gene is passed from generation to generation in a pattern of inheritance called autosomal recessive inheritance. Two genes for the sickle hemoglobin must be inherited from one\'s parents in order to have the disease. A person who receives a gene for sickle cell disease from one parent and a normal gene from the other has a condition called \"sickle cell trait.\" Sickle cell trait produces no symptoms or problems for most people. Sickle cell disease can neither be contracted nor passed on to another person. .

answers- 22- H lysine- You do not have to write them all out- ow many.docx

vtuan3

Answer was D) but I need detailed help with steps as to how : On January 1, 2010, Cale Corp. paid $1,020,000 to acquire Kaltop Co. Kaltop maintained separate incorporation. Cale used the equity method to account for the investment. The following information is available for Kaltop\'s assets, liabilities, and stockholders\' equity accounts: Current assets : Book Value : $120,000 Fair Value : $120,000 Land : Book Value : $72,000 Fair Value : $192,000 Building (20 year life ) : Book Value : $240,000 Fair Value : $268,000 Equipment : (10 year life) : Book Value : $540,000 Fair Value : $516,000 Current Liabilities : Book Value : $24,000 Fair Value : $24,000 Long Term Liabilities : Book Value : $120,000 Fair Value : $120,000 Common Stock : Book Value : $228,000 Additional Paid In Capital : Book Value : $384,000 Retained Earnings : Book Value : $216,000 Kaltop earned net income for 2010 of $126,000 and paid dividends of $48,000 during the year Question : The total 2010 amortization of allocations is calculated to be : A) 4,000 B) 6,400 C) 2,400 D) (1,000) E) 3,800 Solution Answer: The total 2010 amortization of allocations is calculated to be : Amortization value of Building = (268000-240000)/20 year life= 1400 Amortization value of Equipment = (516000-540000)/10 year life= (2400) Total amortization expense =(2400)+1400=(1000) .

Answer was D) but I need detailed help with steps as to how - On Janua.docx

vtuan3

Answer the below in your own words: What were the reasons for the decolonization movement after WWII? Solution The Second World war greatly weakened European colonial rule, forcing the allies to abandon many of their colonial possessions in the face of invasion. When the European powers tried to return to rule again they found that the local nationalists had encouraged the population to reject European rule in favor of self-determination. A good example of this was Indonesia where the Dutch had ruled for over 150 years. In 1948, Indonesia declared Independence, and Netherlands found themselves without any support. Another reason was that when the war ended, one of the themes of the United Nations was encouraging self-determination and ending colonial rule, which was one of the main causes of the First World War. But i think that the most important factor is that the world, particularly the United States, refused to help or support European powers re-establish colonial rule. One of the reasons for this was that the U.S saw European colonial rule as deterimental towards its own global economic aspirations. A good example of this was the U.S attitude towards Britain, which had used the Imperial system to exclude the U.S from favourable trade with Australia, Canada, and New Zealand. The U.S was also reluctant to use money and manpower to fight guerilla wars to support European rule. The U.S was more than aware that the world would also reject any war fought to uphold colonial rule. When the nationalists in Vietnam tried to overthrow French rule, the French had no allies and lacked general support. Another reason was that with the spread of communism in Europe and SE Asia, the U.S was more than aware that European colonial rule provided fertile ground for anti-European sentiment, which invited communist sympathies. .

Answer the below in your own words- What were the reasons for the deco.docx

vtuan3

Answer in your own words: Would you agree with Karl Marx in saying that the Industrial Revolution and its capitalistic foundations negatively affected the working classes? Solution The Industrial Revolution advance capitalism to its final stage, which Marx saw as an ultimate evil. Before the industrial revolution feudalism existed which is a society run by land owners when the aristocracy gives land to the peasants and those landowners scrape and consume the profit the peasants make by taxation and taking of food using the knights as the collectors. Financial capitalism was a growing idea taken from the Greeks and Romans who believed that most individuals had a right to sell things to gain profit and to run businesses. This idea was reintroduced to Europe during the Renaissance, but it was still applied using feudal methods. The American and French revolution helped strengthen capitalism and the end of the great French war made England one of the richest nations in the world. Advances in technology and new inventions brought about the Industrial Revolution. The Idustrial Revolution created factories and housing for the peasants and it created a better market and made intelligent men big business men who exploited hundreds making themselves very wealthy. Because of the system lots of money could be made buying labour to make products that could be sold to other workers. Marx saw this new capitalism as unfair where the intelligent ruled the poor and created a new aristocracy who made workers got to work doing a job that was degrading, unfulfilling and where you were not paid a fair wage to make a living. So he came up with the idea of communism where capitalism is destroyed as is any other type of inequality and where the state and all institution disappear. so the Industrial Revolution not only gave birth to progress, wealth and democracy it also gave birth to communism. .

Answer in your own words- Would you agree with Karl Marx in saying tha.docx

vtuan3

Analyze the role of credit rationing in both a developed country and a less-developed country. How does the role of credit rationing influence economic growth and employment in these two countries? Solution Credit rationing is an action taken by lending institutions to limit or deny credit based on a borrowers\' creditworthiness and an overload of loan demands. Interest rates trending either up or down lead to credit rationing. An example of credit rationing is increasing interest rates about current market rates. Credit rationing IS a pervasive phenomenon. There are two different forms of quantity constraints: micro credit rationing, this places credit limits on borrowers, and macro credit rationing, this randomly denies access to any credit to a fraction of borrowers. The second form has asymmetric treatment of otherwise identical agents. Both forms of rationing can coexist, and play complementary yet distinct roles. It becomes clear that the second form of rationing gains in importance when the information flow within the lending community is poor (thus defaulters have a fair chance for escaping detection). One lesson that comes from both debt overhang and enforcement theories is that the distribution of bargaining power among lenders and borrowers has strong implications for the degree of credit rationing, effort levels as well as efficiency. The effect is similar in both cases .

Analyze the role of credit rationing in both a developed country and a.docx

vtuan3

Annual worth calculations require equal life alternatives? T or F ? Annual worth consists of: capital recovery minus annual operating cost. T or F ? AW equivalent of a long term project (indefinite, very long, or infinite life) requires software due the high number of calculations that need to be performed to simulate an infinite number of years. T or F ? Annual Worth (AW) may also be called: Question 4 options: Equivalent Annual Cost (EAC) Annual Equivalent (AE) Equivalent Uniform Annual Cost (EUAC) All of the above None of the above Solution 1. False 2. True 3. False 4. Equivalent Annual Cost (EAC) .

Annual worth calculations require equal life alternatives- T or F - An.docx

vtuan3

Annual editions of journal What will social media look like in the future Information presented: list at least 5 points made by the author Solution A lot of changes in social media in recent years wonâ€™t be revolutionary they will be a Continuation and acceleration of what we have seen today , any revolutionary change will be so different that that to even try to guess at what it will look like is near impossible .this after all what Makes it revolutionary change Social at work We are going to find social tools connecting us more than ever in the work space TEXTING Texting is more personal and faster than most other forms of social media. And with all the New texting platforms, most of the old technical requirements are a thing of past MOBILE AND ENTERTAINMENT WILL MORPH Marketing programs will reintegrate In the future the vast majority of all content thatâ€™s produced and shared will be visual This will further blur the lines between whatâ€™s real life and whatâ€™s online PERFECT DISTRIBUTION OF RELEVENT CONTENT The next big trend we have seen and re currently experiencing is the perfect distribution of releventcontent in real time .

Annual editions of journal What will social media look like in the fu.docx

vtuan3

An unknown mixture of ions was treated with hydrochloric acid resulting in a white precipitate and a colorless solution. The precipitate did not change after addition of hot water but did disappear after addition of ammonium hydroxide. After acidification with nitric acid, the white precipitate reappeared. The colorless solution was treated with thioacetamide and hydrochloric acid resulting in the formation of a dark precipitate. The precipitate was treated with nitric acid resulting in a black precipitate and blue solution. The blue solution was treated with sulfuric acid and ammonium hydroxide without changing. After addition of sodium thiosulfate, a reddish-brown precipitate appeared. Determine which ions were present in the unknown mixture. Select all which apply. An unknown mixture of ions was treated with hydrochloric acid resulting in a white precipitate and a colorless solution. The precipitate did not change after addition of hot water but did disappear after addition of ammonium hydroxide. After acidification with nitric acid, the white precipitate reappeared. The colorless solution was treated with thioacetamide and hydrochloric acid resulting in the formation of a dark precipitate. The precipitate was treated with nitric acid resulting in a black precipitate and blue solution. The blue solution was treated with sulfuric acid and ammonium hydroxide without changing. After addition of sodium thiosulfate, a reddish-brown precipitate appeared. Determine which ions were present in the unknown mixture. Select all which apply Ag HgHE22 Bi3+ Cu2+ Cd2 Solution Pb 2+ ion is reacts with Hcl gives Pbcl 2 which is white colour precipitate.Pbcl 2 is insoluble in water.PbCl2 is insoluble in hot water .but addition of NH4OH in the solution ti get sollubalized. After acidifying this solution the PbNO3 COMPLEX is formed which is black in colour. .

An unknown mixture of ions was treated with hydrochloric acid resultin.docx

vtuan3

Analyze the role cryptographic algorithms play and explain how these algorithms could be utilized in a way that would strengthen an organizationâ€™s existing plan. Solution Cryptographyâ€™s Role in the Enterprise Encrypting every piece of data in your organization keeps data protected from unauthorized access. Every organization has confidential data. It has to be protected such a way that only an authorized person could access it. Cryptographic algorithms strengthen an organizationâ€™s existing plan by providing below benefits. Confidentiality Encryption technique can guard the information and communication from unauthorized revelation and access of information. Authentication The cryptographic techniques such as MAC and digital signatures can protect information against spoofing and forgeries. Data Integrity The cryptographic hash functions are playing vital role in assuring the users about the data integrity. Non-repudiation The digital signature provides the non-repudiation service to guard against the dispute that may arise due to denial of passing message by the sender. .

Analyze the role cryptographic algorithms play and explain how these a.docx

vtuan3

Analyze and determine which sector, public or private, has greater insight on the potential of cyberattacks. Solution Private Sectors has a greater insight on the potential of cyberattacks The threat of hacking varies from one sector to another sector and it is difficult to measure it because intrusions often go undetected. Risk awareness is growing and reducing the risk is difficult because threats evolves constantly. Business possessing great quantities of personal data have a higher insight of potential risk Regulated and large corporations tends to be more douced on risks assocated with cyberattacks. However the extext of cyberattacks on private sector will always depends on the maturity of an organization, the cybersecurity implemented by organization and the holistic sexurity safegaurds .

Analyze and determine which sector- public or private- has greater ins.docx

vtuan3

an102 Tollowing infrared spectra? Some examples of functional groups are sp eroups (use peaks between 4000 and 1500 cm) are present in the \' C-H, sp C-H, Ced, nitrile, alkyne, aldehyde C-H, carbonyl, ketone carbonyl, ester carbonyl, a carbonyl, OH, carboxylic acid OH, NH NICOLET Solution In image one (top one), C=C, C=O (ketone) and C-H (sp 3 and sp 2 ) stretching frequency of these functional groups are present. In image two, C=C, nitrile, C-H (sp 3 and sp 2 ) stretching frequency of these functional groups are present. in image three, amide carbonyl, NH, and C-H (sp 3 ) stretching frequency of these functional groups are present. In image 4, OH, keto and C-H (sp 3 ) stretching frequency of these functional groups are present. in Image 5 (down one) carbonyl carboxylic acid and aldehyde, OH carboxylic acid, CH aldehyde and C-H (sp 3 ) stretching frequency of these functional groups are present. .

an102 Tollowing infrared spectra- Some examples of functional groups a.docx

vtuan3

An unknown compound is one of the four compounds shown below. It is an amphipathic lipid, it immediately decolorizes bromine solution, and readily reacts with aqueous solution of sodium hydroxide. The pain and swelling caused by arthritis and related illnesses results from the production of this compound in the affected tissues. Based upon the information provided, answer the tolowing questions (A- E) (5 points) 6. Ho-CH--ck CH-N-C-R A) All the compounds pictured are amphipathic molecules. Describe the term amphipathic Give an example of a non-amphipathic lipid. Solution a) An amphipathic molecule is the one which comprises of two parts : All the lipids molecules found are amphipathic in a cell membrane. b) Out of all the four compounds given in the question the one responsible for controling the development of sex organs and secondary sexual characteristic is the compound C. The name associated with this type of compound is ANDROGENS. Yes androgens will react with NaBH 4 and reduces 1-carbonyl group of 3-deoxy androgens to form aromatase inhibitors having a 19-hydroxy group. c) The compound A can be identified as local hormone. The name of the compound is ALPROSTADIL. These molecules are called local molecule these are produced by cells and to either neighboring cells(i.e. local to their neghbourhood ) or the same tupe of cells that are responsible for their production. These hormones are very quickly inactivated.These are large group of signalling molecules and are released during phisical activity like exercise and running. These hormones donot circulate within the blood thus are local to their production area. d) Compound B is a major component of biological membrane. Yes these compounds are hydrolysable due to the fact that they contain ester group. These compounds are hydrolusable because tehy contain funtional group ester. .

An unknown compound is one of the four compounds shown below- It is an.docx

vtuan3

Analyze the types of informal and formal communication in organizations. Solution Formal Communication: A communication that is made in the proper channel and which is properly authorized is defined as a formal communication. In formal commication, the message that is conveyed will be recorded for future reference. The various types of formal communication in an organization as as follows: 1.Circulars 2. Notices put up on notice boards 3. Important annoucements 4. Formal E-Mail 5. Notifications from Immediate senior Informal Communication: Any communication that does not have an origin or an end is called as an informal communication. In other words a communication in which the sender and receiver are not definite is called as an informal communication. The various types of informal communication in an organization are as follows: 1. Gossips 2. Rumours 3. Organization secrets that gets communicated informally. 4. Information that is passed between departments without following the hierarchy of authorization .

Analyze the types of informal and formal communication in organization.docx

vtuan3

Encapsulation process. Explain this process giving specific detail at each layer of the OSI Model. Be sure to explain the different PDUs at each stage and include the most significant fields for each pdu. (20 marks) Solution Its dvided into seven layers. Encapsulation happens seperately at different levels. Starting frm Application layer, application running on source device creates some kind of data.Then next comes Presentation layer where encryption gets added to the data. Then the session layer where session id is applied.Upto this point information is still one block of data. Next layer is transport layer where bock of data gets break down into segments and gets a port number. This segment is then passed to Network layer where source and destination IP address are appended and now the segment becomes packet.This packet is then passed to next level called Data link layer where destination MAC address and CRC is added.Now the resulting thing is Frame. The Frame then is sent to the physical device where it is translated into some kind of a signal, whether itâ€™s electrical, radio wave, light or other signal. This Frame then becomes some kind of a signal that represents a series of zeros and ones. This is why at the Physical layer we often call it Bits .

Encapsulation process- Explain this process giving specific detail at.docx

vtuan3

Elijah Murphy studied voice, opera, and Jewish liturgical music at the Southern Baptist Theological Seminary. After he graduated, he applied for a job as a cantor (i.e., professional singer who leads prayer services) at the Nashville Downtown Synagogue. The synagogue responded that he was not qualified for the position and refused to consider him for the job because he is not Jewish. A. Elijah has a prima facie case of disparate treatment discrimination against the synagogue and the synagogue has no defense. B. Elijah has a prima facie case of discrimination against the synagogue and the synagogue can successfully assert the ministerial exception to Title VII. C. Elijah does not have a prima facie case of discrimination, so it doesn\'t matter whether the synagogue can assert a defense. D. Elijah has a prima facie case of discrimination against the synagogue and the synagogue can successfully assert the business necessity defense. Solution B. Elijah has a prima facie case of discrimination against the synagogue and the synagogue can successfully assert the ministerial exception to Title VII. As Elijah was refused to consider for the job because he is not Jewish, therefore Elijah has a prima facie case of discrimination against the synagogue as he had studied voice, opera, and Jewish liturgical music at the Southern Baptist Theological Seminary and have skill level. Synagogue can successfully assert the ministerial exception to Title VII, as he responded that he was not qualified for the position and refused to consider him for the job because he is not Jewish. .

Elijah Murphy studied voice- opera- and Jewish liturgical music at the.docx

vtuan3

More from vtuan3 (20)