Write a method expand that could be added to the LinkedlntList class .docx

•Download as DOCX, PDF•

0 likes•2 views

Write a method expand that could be added to the LinkedlntList class

$Write a method expand that could be added to the LinkedlntList class from lecture and section. The method accepts an integer fas a parameter and replaces every value/with f copies of the value (i/f). Suppose a LinkedlntList variable list stores the following values: [21, 8, 15, 0, -_3, 32] The call list.expand(3); would change the list to store the following elements: 7. 7. 7. 2. 2. 2. 5. 5. 5. 0. 0. 0. -1. -1. -1. 10. 10. 101 If an element of the original list is not evenly divisible by f, as with 8 and 32 above, the resulting list should truncate any fractional component (as is done naturally by integer division). If the parameter value passed is 1, the list is unchanged. If it is 0 or negative, the list should become empty. For full credit, your solution must run in O(N) time where N is the length of the list. You may not call any methods of the linked list class to solve this problem, and you may not use any auxiliary data structure to solve this problem (such as an array, ArrayList, Queue, String, etc). Assume that you are using the LinkedlntList and ListNode class as defined in lecture and section: public class LinkedlntList { private ListNode front; methods public class ListNode { public int data;//data stored in this node public ListNode next;//a link to the next node in the list public ListNode() {...} public ListNode(int data) {...} public ListNode(int data, ListNode next) {...} Solution //Function: public void expand(int f) {$

ListNode ptr = start;
ListNode prev;
while(ptr!=null)
{
prev=ptr.getLink();
//get the existing data
int i=ptr.getData();
// find quotient
int v=i/f;
//replace existing data with quotient
ptr.setData(v);
//f-1 times expanding the same node
for(int i=0;i<f-1;i++)
{
//create new node with quotient value
ListNode nptr = new ListNode(v, null);
// attach to list
ptr.setLink(nptr);
ptr=nptr.getLink();
}
ptr.setLink(prev);
// moving to the next node in the original list
ptr=prev;
}
}

Similar to Write a method expand that could be added to the LinkedlntList class .docx

Chap09

Terry Yoast

The MyLinkedList class used in Listing 24.6 is a one-way directional .docx

Komlin1

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

clearvisioneyecareno

2.(Sorted list: array implementation)This sorted list ADT discussed in class should be extended by the addition of two new methods: //Interface: ArrayListADT //works for int public interface ArrayListADT { public boolean isEmpty(); //Method to determine whether the list is empty. public boolean isFull(); //Method to determine whether the list is full. public int listSize(); //Method to return the number of elements in the list. public int maxListSize(); //Method to return the maximum size of the list. public void print(); //Method to output the elements of the list. public boolean isItemAtEqual(int location, int item); //Method to determine whether item is the same as the item in the list at location. public void insertAt(int location, int insertItem); //Method to insert insertItem in the list at the position public void insertEnd(int insertItem); //Method to insert insertItem at the end of the list. public void removeAt(int location); //Method to remove the item from the list at location. public int retrieveAt(int location); //Method to retrieve the element from the list at location. public void replaceAt(int location, int repItem); //Method to replace the element in the list at location with repItem. public void clearList(); //Method to remove all the elements from the list. public int search(int searchItem); //Method to determine whether searchItem is in the list. public void remove(int removeItem); //Method to remove an item from the list. } //Class: ArrayListClass implements //Interface: ArrayListADT public abstract class ArrayListClass implements ArrayListADT { protected int length; //to store the length of the list protected int maxSize; //to store the maximum size of the list protected int[] list; //array to hold the list elements //Default constructor public ArrayListClass() { maxSize = 100; length = 0; list = new int[maxSize]; } //Alternate Constructor public ArrayListClass(int size) { if(size <= 0) { System.err.println(\"The array size must be positive. Creating an array of size 100.\"); maxSize = 100; } else maxSize = size; length = 0; list = new int[maxSize]; } public boolean isEmpty() { return (length == 0); } public boolean isFull() { return (length == maxSize); } public int listSize() { return length; } public int maxListSize() { return maxSize; } public void print() { for (int i = 0; i < length; i++) System.out.print(list[i] + \" \"); System.out.println(); } public boolean isItemAtEqual(int location, int item) { if (location < 0 || location >= length) { System.err.println(\"The location of the item to be compared is out of range.\"); return false; } return list[location]== item; } public void clearList() { for (int i = 0; i < length; i++) list[i] = 0; length = 0; System.gc(); //invoke the Java garbage collector } public void removeAt(int location) { if (location < 0 || location >= length) System.err.println(\"The location of the item to be removed is out of range.\"); else { for(int i = location; i < length - 1; i++) list[i] .

2.(Sorted list array implementation)This sorted list ADT discussed .pdf

arshin9

This assignment and the next (#5) involve design and development of a sequential non contiguous and dynamic datastructure called LinkedList. A linked list object is a container consisting of connected ListNode objects. As before, we are not going to use pre-fabricated classes from the c++ library, but construct the LinkedList ADT from scratch. The first step is construction and testing of the ListNode class. A ListNode object contains a data field and a pointer to the next ListNode object (note the recursive definition). #This assignment requires you to 1. Read the Assignment 4 Notes 2. Watch the Assignment 4 Support video 3. Implement the following methods of the ListNode class -custom constructor -setters for next pointer and data 4. Implement the insert and remove method in the main program 5. Scan the given template to find the above //TODO and implement the code needed //TODO in ListNodecpp.h file public: ListNode(T idata, ListNode<T> * newNext); public: void setNext(ListNode<T> * newNext); public: void setData(T newData); // TODO in main program void remove(ListNode<int> * &front,int value) void insert(ListNode<int> * &front,int value) # The driver is given ListNodeMain.cpp is given to you that does the following tests 1. Declares a pointer called front to point to a ListNode of datatype integer 2. Constructs four ListNodes with data 1,2,4 and adds them to form a linked list. 3. Inserts ListNode with data 3 to the list 4. Removes node 1 and adds it back to test removing and adding the first element 5. Removes node 3 to test removing a middle node 6. Removes node 4 to test removing the last node 7. Attempt to remove a non existent node 8. Remove all existing nodes to empty the list 9. Insert node 4 and then node 1 to test if insertions preserve order 10.Print the list Main.cpp #include <iostream> #include "ListNodecpp.h" // REMEMBER each ListNode has two parts : a data field // and an address field. The address is either null or points to the next node //in the chain //Requires: integer value for searching, address of front //Effects: traverses the list node chain starting from front until the end comparing search value with listnode getData. Returns the original search value if found, if not adds +1 to indicate not found //Modifies: Nothing int search(ListNode<int> * front, int value); //Requires: integer value for inserting, address of front //Effects: creates a new ListNode with value and inserts in proper position (increasing order)in the chain. If chain is empty, adds to the beginning //Modifies: front, if node is added at the beginning. //Also changes the next pointer of the previous node to point to the //newly inserted list node. the next pointer of the newly inserted pointer //points to what was the next of the previous node. //This way both previous and current links are adjusted //******** NOTE the use of & in passing pointer to front as parameter - // Why do you think this is needed ?********** void insert(ListNode<int> * &fr.

This assignment and the next (#5) involve design and development of a.pdf

EricvtJFraserr

Consider the following definitions for linked lists for problems 6 through 9. typedef int elementType; class LinkedList { public: LinkedList(); //other member functions . . . private: struct node { elementType data; node * next; }; node * first; }; 9. Write the method of the LinkedList class to calculate and return the range of the data values stored in an unsorted singly linked list. (Note: range = largest value â€“ smallest value). Note: If list is empty return 0. int LinkedList::range() Solution //function to calculate range in linked list int LinkedList::range() { elementType smallest,largest,range; // point to the beginning of the list node* ptr=first; //if list empty, return 0 if(ptr==NULL) return 0; //list is not empty //assume element in the beginning of the list is smallest smallest==first->data; //start from second element in list ptr=ptr->next; //traverse the list till end while(ptr!=NULL) { //compare smallest with the items in the list if(ptr->data<smallest) { //if any element is less than smallest //replace the smallest with that element smallest=ptr->data; } //move to the next node ptr=ptr->next; } largest=first->data; ptr=first->next; while(ptr!=NULL) { if(ptr->data>largest) { largest=ptr->data; } ptr=ptr->next; } //find range and return it range=largest-smallest; return range; } .

Consider the following definitions for linked lists for problems 6 thr.docx

kaseya1

We would like to build a generic list in such a way that we can start either at the front, or at the back, and move through the list in either direction. Here is an example of such a list (shown here with Strings), drawn as an object diagram: Every Deque has a header that consists of the Sentine L node. Ihis header neld does not change, but the fields within the Sentinel node (that provide the links to the first and the last item in the Deque) can and will change. Each data Node has two links, one to the next item in the list and one to the previous item in the list. The Sentinel node is always present. It also has next and prev fields, which are consistently updated to link to the head of the list and to the tail of the list, respectively. The Sentinel and Node classes both inherit from a common superclass (shown below), because the next or prev item after any given node may be either a data-carrying Node or the Sentinel marking the end of the list. The list shown above has four data-carrying nodes and the lone sentinel. The empty list has just the Sentinel, and its links to the first and to the last item just reference the Sentinel node itself. So an empty list would have the following object diagram: The list shown above has four data-carrying nodes and the lone sentinel. The empty list has just the Sentinel, and its links to the first and to the last item just reference the Sentinel node itself. So an empty list would have the following object diagram: The class diagram for these classes is as follows: We have an abstract class ANode T, which can be either a Sentinel T> node or an actual Node T containing data. We use an abstract class here instead of an interface because we need to share the next and prev fields. Moreover, because all ANodes are contained and hidden within the Deque, no external code needs to know about it: they are implementation details rather than a publicly visibly datatype definition. 8.1 Data definitions and examples - Define the classes ANode T, Node T, Sentinel T, and Deque T. - For Sentinel, define a constructor that takes zero arguments, and initializes the next and prev fields of the Sentinel to the Sentinel itself. - For Node T, define two constructors: the first one takes just a value of type T, initializes the data field. The next and prev fields would be nutl. The second convenience constructor should take a value of type T and two ANode nodes, initialize the data field to the given value, initialize the next and prev fields to the given nodes, and also update the given nodes to refer back to this node. Throw an IllegalArgumentException in this constructor if either of the given nodes is null. (You can use if (theNode == null) {} to test for null-ness.) Note carefully the order of the arguments in this constructor! The order should match the class diagram above; getting the order wrong will result in oddly "backwards" lists. - For Deque T, define two constructors: one which takes zero arguments and initial.

We would like to build a generic list in such a way that we can start.pdf

yadavup216

Data Structure

HarshGupta663

UNITIII LDS.pdf

meenamadhuvandhi2

Implementation The starter code includes List.java. You should not change anything in List.java. Your task will be to create LinkedList.java, make LinkedList use generics and inherit from List, and complete several methods in LinkedList.java. Create LinkedList.java in IntelliJ. Add a main method to LinkedList.java containing the following code. Your program will not compile again. public static void main(String[] args) { LinkedList list = new LinkedList(); System.out.println(list.getHead()); System.out.println(list.getTail()); list.add("first"); list.add("middle"); list.add("last"); System.out.println(list.getHead().value); System.out.println(list.getTail().value); System.out.println(list); } The first issue is that your LinkedList class does not have a way of specifying what type of data it should store. You can fix this using Java Generics. Change the first line of your class to the following: LinkedList . Confirm that the first line in your main method no longer has an error. On the line that declares the LinkedList class, add extends List before the bracket that begins the class. The first line in your class will now have a compile error because LinkedList does not implement the methods required by the List abstract class. Press Ctrl-i to have IntelliJ insert stubs of these methods. Ensure that Copy JavaDoc is selected so you get JavaDoc comments which describe the method requirements, then click OK. Your code should now compile again. Next add fields for the head and tail. These will be of type Node. Create a getHead method which returns your head field, and a getTail method which returns your tail field. Run your main method now and you will see that there is a NullPointerException because the add method does not actually add anything to the list, so head and tail will always be null. Complete the method boolean add(T value) for which IntelliJ gave you a stub. You need to create a new node with value to add at the end of the list. This means you will need to connect it to the old tail and update tail to point to the node you created. Make sure that you handle the case where the list is empty and both head and tail should be set to the new node you've created. Note: For the full Map I assignment, add will need to prevent duplicate values being added to the list and should return true or false based on whether the value was added or not. For this lab, you can ignore this requirement and simply return true. Add a toString method to your LinkedList class. It should start at the head of your list and proceed through all the nodes in a loop, combining the values of each node with a comma between each and square brackets containing the whole thing. When you run your main method, the final thing printed should be: [first, middle, last] List.java: /** * Specification for a List ADT. * @author Shubham Chatterjee * @version 03/07/2019 * @param Type */ public abstract class List { /** * Appends the specified value to the end of this list. * * @para.

Implementation The starter code includes List.java. You should not c.pdf

Ch 1 intriductions

Data structure

linked list (c#)

General Data structures

Youssef Elsalhawy

Objective: The purpose of this exercise is to create a Linked List data structure that mimics the behavior of the Java Standard Library Version (Java API). The outcomes/results of using the library features should be identical with your own version (My API). However, the underlying implementation should follow with the descriptions listed below. Instructions : Create the following Linked List Data Structure with the given description below in your utils package and use "for loops" for your repetitive tasks. Where to find starter code in my-api package.class : utils.LinkedList package.class : tests.console.week04.LinkedListTest Where to find your JUNIT test in my-api package.class : tests.junit.LinkedListJUnitTest Nested Class that has to be added to LinkedList class package.class : utils.LinkedList.Node Task Check List ONLY "for" loops should be used within the data structure class. There is an automatic 30% deduction, if other loops are used. The names of identifiers MUST match the names listed in the description below. Deductions otherwise. Complete coding Assignment in your "my-api" GitHub Repository. You will not be graded otherwise and will receive a 0, if not uploaded there. Run JUNIT TEST and take a SNAPSHOT of results. Upload PDF of snapshot of your JUnitTest results to Canvas. Description The internal structure of the Linked List is a doubly linked Node data structure and should have at a minimum the following specifications: data fields: The data fields to declare are private and you will keep track of the size of the list with the variable size and the start of the list with the reference variable data. first is a reference variable for the first Node<E> in the list. last is a reference variable for the last Node<E> in the list. size keeps track of the number of nodes in the list of type int. This will allow you to know the current size of the list without having to traversing the list. constructors: The overloaded constructors will initialize the data fields size and data. A constructor that is a default constructor initializes the starting node location first and size to a zero equivalent, that is, constructs an empty list. methods: methods that manages the behavior of the linked nodes. Together, the methods below give the illusion of a index or countable location. Implement these methods within your generic Linked List class. Method Description Header public boolean add(E item) public void add(int index, E item) public void append( E item) private void checkIndex(int index) public boolean contains(E item) public void clear() private E detach(int index) public E get(int index) public int indexOf(E item) private void insertBefore(int index, E item) public boolean isEmpty() private Node<E> node(int index) public E remove(int index) public boolean remove(E item) public E set(int index, E item) public int size() public String toString() Node Data Structure The generic Linked List class includes a static Node class as a nested class, .

Objective The purpose of this exercise is to create a Linke.pdf

advancethchnologies

Objective The purpose of this exercise is to create a Linke.pdf

giriraj65

Linked List Objective: The purpose of this exercise is to create a Linked List data structure that mimics the behavior of the Java Standard Library Version (Java API). The outcomes/results of using the library features should be identical with your own version (My API). However, the underlying implementation should follow with the descriptions listed below. Instructions : Create the following Linked List Data Structure with the given description below in your utils package and use "for loops" for your repetitive tasks. Where to find starter code in my-api package.class : utils.LinkedList package.class : tests.console.week04.LinkedListTest Where to find your JUNIT test in my-api package.class : tests.junit.LinkedListJUnitTest Nested Class that has to be added to LinkedList class package.class : utils.LinkedList.Node Task Check List ONLY "for" loops should be used within the data structure class. There is an automatic 30% deduction, if other loops are used. The names of identifiers MUST match the names listed in the description below. Deductions otherwise. Complete coding Assignment in your "my-api" GitHub Repository. You will not be graded otherwise and will receive a 0, if not uploaded there. Run JUNIT TEST and take a SNAPSHOT of results. Upload PDF of snapshot of your JUnitTest results to Canvas. Description The internal structure of the Linked List is a doubly linked Node data structure and should have at a minimum the following specifications: data fields: The data fields to declare are private and you will keep track of the size of the list with the variable size and the start of the list with the reference variable data. first is a reference variable for the first Node<E> in the list. last is a reference variable for the last Node<E> in the list. size keeps track of the number of nodes in the list of type int. This will allow you to know the current size of the list without having to traversing the list. constructors: The overloaded constructors will initialize the data fields size and data. A constructor that is a default constructor initializes the starting node location first and size to a zero equivalent, that is, constructs an empty list. methods: methods that manages the behavior of the linked nodes. Together, the methods below give the illusion of a index or countable location. Implement these methods within your generic Linked List class. Method Description Header public boolean add(E item) public void add(int index, E item) public void append( E item) private void checkIndex(int index) public boolean contains(E item) public void clear() private E detach(int index) public E get(int index) public int indexOf(E item) private void insertBefore(int index, E item) public boolean isEmpty() private Node<E> node(int index) public E remove(int index) public boolean remove(E item) public E set(int index, E item) public int size() public String toString() Node Data Structure The generic Linked List class includes a static Node class as a ne.

Linked List Objective The purpose of this exercise is to cr.pdf

adityacomputers001

Datastructures and algorithms prepared by M.V.Brehmanada Reddy

Malikireddy Bramhananda Reddy

In java. Write a class called GenDoubleLinkedList which is a generic double linked list. This link list is similar to the single linked list that was shown in class except that each node in addition to having data and nextLink (which was originally called link) now has prevLink. The class GenDoubleLinkedList needs to have the following: Internal class ListNode which hasInstance Variables data of type T nextLink of type ListNode prevLink of type ListNode Constructors Default Parameterized Instance Variables head of type ListNode which always points to the beginning of the linked list current of type ListNode which moves around pointing to one of the nodes Constructor A default constructor that initializes head to an empty ListNode and sets current to point at the head. Methods goToNext – This moves the current node forward in the list by one node. It doesn’t move forward if that node is null goToPrev – This moves the current node backwards in the list by one node. It doesn’t move backwards if that node is null. getDataAtCurrent – returns the data at the current node as long as the current isn’t null setDataAtCurrent – takes in a parameter and sets the data at the current node to that value as long as current is not null insertNodeAfterCurrent – creates a new node based on data that is passed in by a parameter and puts that node after the current position deleteCurrentNode – removes the current node from the list by resetting the links showList – prints out the contents of the list line-by-line inList – returns a true or false value based on whether or not the data passed in via a parameter is in the list Solution package com.quad.generic; public class GenDoubleLinkedList { private ListNode head; private ListNode tail; private int size; public int getSize() { return size; } /** * */ public GenDoubleLinkedList() { this.head = null; this.size = 0; } @SuppressWarnings(\"hiding\") class ListNode{ private T data; private ListNode nextLink; private ListNode prevLink; /** * */ public ListNode() { nextLink=null; prevLink=null; data=null; } /** * @param data * @param nextLink * @param prevLink */ public ListNode(T data, ListNode nextLink, ListNode prevLink) { super(); this.data = data; this.nextLink = nextLink; this.prevLink = prevLink; } public T getData() { return data; } public void setData(T data) { this.data = data; } public ListNode getNextLink() { return nextLink; } public void setNextLink(ListNode nextLink) { this.nextLink = nextLink; } public ListNode getPrevLink() { return prevLink; } public void setPrevLink(ListNode prevLink) { this.prevLink = prevLink; } } public void goToNext(){ ListNode temp = head; while(temp != null){ temp = temp.getNextLink(); } } public void goToPrev() { ListNode temporary = tail; while(temporary != null){ temporary = temporary.getPrevLink(); } } public T getDataAtCurrent (int index) { if (index < 0 || index >= size) { throw new IndexOutOfBoundsException(); } else { ListNode current = head; for (int i = 0; i < index; i.

In java.Write a class called GenDoubleLinkedList which is a generi.pdf

SALES97

The Datatypes Concept in Core Python.pptx

Kavitha713564

Similar to Write a method expand that could be added to the LinkedlntList class .docx (20)

Chap09

The MyLinkedList class used in Listing 24.6 is a one-way directional .docx

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

2.(Sorted list array implementation)This sorted list ADT discussed .pdf

This assignment and the next (#5) involve design and development of a.pdf

Consider the following definitions for linked lists for problems 6 thr.docx

We would like to build a generic list in such a way that we can start.pdf

Data Structure

UNITIII LDS.pdf

Implementation The starter code includes List.java. You should not c.pdf

Ch 1 intriductions

Data structure

linked list (c#)

General Data structures

Objective The purpose of this exercise is to create a Linke.pdf

Linked List Objective The purpose of this exercise is to cr.pdf

Datastructures and algorithms prepared by M.V.Brehmanada Reddy

In java.Write a class called GenDoubleLinkedList which is a generi.pdf

The Datatypes Concept in Core Python.pptx

More from ajoy21

Please complete the assignment listed below. Define and explain, using at least five sentence or on-task bullet notes for each. Each answer earns up to five points. For each answer, please make five different substantive points, earning one point each. Transnational corporation Gentrification Renewable resources Desertification Photochemical smog Biodiversity Barriers to migration Hierarchical diffusion Militant fundamentalism Urbanization Eastern European cities Hazardous waste The Endangered Species Act Subsidence Water Quality Deforestation Wetlands Central place theory Soil degradation Hydraulic fracturing (fracking) Wind power Oil sands Models of urban form Hinterland Agglomeration economies .

Please complete the assignment listed below.Define and explain, us.docx

ajoy21

Please cite sources for each question. Do not use the same sources for each question. Minimum of 2 resources and 300 words. Briefly contrast the views of Locke and Rousseau on how children develop. a) What do ethologists, such as Lorenz, mean by imprinting on a parent-figure? b) What observations led Bowlby to suggest that imprinting occurs in human infants? That is, what parallels between human infants and other species did he point to? "For children to learn, we must praise their correct responses and correct their mistakes." Would Montessori agree? Explain. What did Werner mean by "microgenesis" and "microgenetic mobility?" Give examples. Discuss some valuable aspects of these concepts. Piaget's critics charge that he made development appear too slow. Discuss this criticism with respect to either: a) object permanence, b) conservation training, or c) Kamii's teaching methods. Then, describe the Piagetian approach. Compare conventional and postconventional morality in Kohlberg's theory. .

Please cite sources for each question. Do not use the same sources f.docx

ajoy21

Please choose one of the following questions to answer for this week's assignment. When you respond to your fellow classmates this week, please choose someone who answered a different question than your own. This will help you familiarize yourself with more of the material. Remember, you need to post at least three responses to receive full credit for this assignment. 1. The French revolutionaries claimed that they were inspired by the Enlightenment philosophes . Would the philosophes we studied back in Week 2 have approved of how the Revolution started? What about how it developed through the 1790s? 2. In his Reflections on the Revolutions in France, British member of Parliament Edmund Burke predicted the Terror. Was this a lucky guess on his part or were the seeds of of the Terror part of the Revolution from the beginning? Why? 3. The French Revolution had a profound impact on the world, not just within the borders of France. Why were some nations willing to accept its gains-at least, partially-while others resisted them? Which country do you think was the most unwilling to accept the new ideas of liberte, e galite, and fraternite ? Other than France, which was most willing to embrace the Revolutionary ideals? Why? 4. Although no historian doubts the importance of the reign of Napoleon in European (and even world) history, they do argue over the interpretation of these events. For example, they are torn on the role Napoleon played in the Revolution. Some argue that he continued the spirit of the Revolution, despite creating an Empire. Others believe he murdered it. Some include Napoleon's reign as a stage of the actual Revolution, while others consider it its own separate event. What do you think? Do you think Napoleon continued and spread the Revolution? Or do you think he destroyed its ideals when creating his empire? Do you think his reign should qualify as a separate historical event from the Revolution? Or was it simply another stage in a long process? .

Please choose one of the following questions to answer for this week.docx

ajoy21

Please check the attachment for my paper. Please add citations to all paragraphs. Also, please check the paper for plagiarism and please add two more pages on (Social Media & In person Communication) to make it fit the essay so far. And please use 5 more sources in the paper. (1 Article, 1 Book, 1 Encyclopedia, 1 Newspaper and 1 magazine). Finally, please correct all the grammar mistakes in the first 3 pages. And please get rid of the first person used. (I,we etc...) .

Please check the attachment for my paper.Please add citations to a.docx

ajoy21

Please answer to this discussion post. No less than 150 words. Reference and APA style needed. Please no plagiarism. Similarity is <20%. Thanks The most interesting thing about this chapter is that it helps people and scholars to develop skills to influence strategy in nowadays changing healthcare environment. The topic also contributes an extensive range of themes in strategies and politics, offering more complete contextual that can be in other policies textbook in the market (Mason, Leavitt, & Chaffee, 2013). The topics also entail up-to-date updates concerning conflict organization, health economics, politicization, use of media as well as working with societies for change. Reviewed copy take account of new supplement with coverage of advanced reasonably priced care act. According to this perceptions and strategies, every individual will be equipped and ready to play a leadership role under four spheres where nurses are governmentally efficient, the workstation, government, specialized organization as well as the community (American Nurses Association, 2010). The topic has helped me to know more of nursing and healthcare policies and politics. In thus, have understood that the concept of nursing policies influences can be defined as a nursing ability to have active, effective on decision making as well as affairs connected to health care by use of power, support, and strategy capability, and establishing or strengthening images. The nursing policy and politics within a healthcare connect to my clinical practices because as a nurse, I should view myself as a professional with the ability and being responsible for influencing recent and forthcoming health care conveyance system. But to attain this, there must be the presence of policies that define and assimilate suitable standards for healthcare delivery as well as addressing essential conditions for that care to happen. References American Nurses Association. (2010). Nursing's social policy statement: The essence of the profession . Nursesbooks. org. Mason, D. J., Leavitt, J. K., & Chaffee, M. W. (2013). Policy and Politics in Nursing and Healthcare-Revised Reprint . Elsevier Health Sciences. .

Please answer to this discussion post. No less than 150 words. Refer.docx

ajoy21

Please attach Non-nursing theorist summaries. Jigsaw/Executive Summary Grading Criteria Albert Bandura: Self-Efficacy Points Possible Your Points Summary Paper Introduction/Conclusion 2 History/Origins of Theory 3 Major Precepts of Theory Current Application(s) of Theory Mechanics Grammar/form/spelling/punctuation/ Logical flow/readability/APA format 3 Citations and references 2 Total Points 10 .

Please attach Non-nursing theorist summaries.JigsawExecutive .docx

ajoy21

Please answer the question .There is no work count. PLEASE NUMBER THE ANSWERS. 1-How does the value of individual freedom effect the ethics of our American society differently than the value of family and religious loyalty? What are some other values of contemporary American society? How are they in conflict with the values of the 1950's? Is one set of values superior to another? Why? 2-Islam means, at its root, surrender. How does Islamic belief and practice reflect the importance of surrendering to Allah? 3-What do you think about this focus on prayer? What is the standard of prayer in Judaism? What about in Christianity? What about in your own life? Are you humbled and challenged by the knowledge that Muslims stop 5 times to pray? 4-Do you think the call to prayer is a call to obedience or a reminder for devotion? 5-Please answer this question and discuss the implications, probe for assumptions, draw out evidence and clarify perspectives. What was the influence of Islam on the arts and sciences in its Golden Age, which is when Europe was experiencing the Medieval Period, sometimes called the Dark Ages? 6a- You mention the art form of mosaic (you called it "geometric pieces") and I want to draw the class' attention to the idea of unity in diversity within this art form. First, the main theological point of Islam is that Allah is one. As the Muslim scientists and artists searched to make discoveries in their given fields of study, they were constantly looking for the unity of Allah in the diversity of the creation. The artist brought out that unity in mosaic and in textiles. The mosaic is a pattern that is derived by putting thousands of small colored stones together to make one design. The individual pieces of stone lose their importance within the whole, but without each piece the whole would not be complete. So their concept of God came through in their art. 6b-How else did the Muslims bring out unity in diversity? 7a-Because they were prohibited from figures in art, the Muslims developed other art forms and calligraphy is one of those art forms. They believed that the words of the Qur'an were beautiful (to hear and for life) so they started to write them in a beautiful way and thus calligraphy developed. Art is one of those things that cannot be totally squelched. If you contain an artist in one area, their emotion will burst forth in another area. 7b What do you think about the Muslims' use of calligraphy? The Muslim religion started very rapidly. 8--Class, Based on the information about Muhammad and the early spread of Islam, what do you think was the most important factor in the amazing way that Islam grew so quickly? .

Please answer the question .There is no work count. PLEASE NUMBER .docx

ajoy21

Please answer the following questions. Please cite your references. According to Section I readings, Democracy: what it is and what it is not? (15 points) (See attached PDF) Is the U.S. a democratic country? Has your view/opinion changed or unchanged now comparing to your answer at the beginning of the class? (15 points) What does democracy mean to you personally? What will you do/participate/take action to ensure/protect your definition of democracy? (15 points) Has the United States been a positive or negative influence on global democracy? (15 points) Identify yourself as either a municipal, state or federal lawmaker, discuss your action/plan for democracy in the United States and her role as it pertains to the spread of democracy and democratic values throughout the world in the 21 st Century. (40 points) .

Please answer the following questions. Please cite your references..docx

ajoy21

Please answer the following questions.1. 1. Are you or.docx

ajoy21

Please answer the following question with 200-300 words.Q. Discu.docx

ajoy21

Please answer the following question Why do you think the US ha.docx

ajoy21

Please answer the following questions. Define tunneling in the VPN environment and explain the difference between voluntary and compulsory tunnels. How does the VPN technology provides security to a corporate network? You may also choose to compare two or more VPN technologies. Consider the VPN technologies studied in this session, including IPSec in the Tunnel mode, L2TP over IPsec, PPTP and SSL/TLS VPN. Which one would you choose for your company? Can you discuss its advantages and its weakness or drawbacks? Do you know some products that are based on that technology? Discuss the specific techniques for securing the remote client and the remote access server and the common concerns of each. .

Please answer the following questions. Define tunneling in the V.docx

ajoy21

Please answer the following questions: 1. How can you stimulate the brain development of an infant? 2. How do parents cope with the growing autonomy of toddlers and what should be done about temper tantrums? 3. How do children in these stages of development change the life style of their parents? Observation: Have a conversation with the parent of a toddler. What are the differences of dealing with an infant and a toddler? .

Please answer the following questions1. How can you stimulate the.docx

ajoy21

Please answer the following questions very deeply and presicely : "Ziff" !) As Ziff define artwork, what do you think would consider as an artwork, and who do you think is capable of deciding if the work is art or not? "Danto" 2) Why do you think Danto compares Socrates and Hamlet in the beginning? Do you feel as if it was an imitation of nature? How would you describe the word "art" with these two philosophers? * The answer should be (4-8 sentences) .

Please answer the following questions very deeply and presicely .docx

ajoy21

Please answer the following questions in an informal 1 ½ - 2-page essay: Describe Hubert’s characterization of white society in New York City during the Harlem Renaissance. What does this essay reveal about black culture in Harlem? Why does Hubert describe the Harlem Renaissance as “the golden age for Negro writers, artists, and musicians?” Black writer Alain Locke used the term “New Negro” to describe individuals such as Hubert. What did that mean? Please conclude your essay with at least one question for discussion. Choose a question that you think will both enlighten and enliven your discussion section. .

Please answer the following questions in an informal 1 ½ - 2-page es.docx

ajoy21

Please answer the following questions in a response of 150 to 200 words each, and submit your responses in a Word attachment no later than Sunday of this week at 11:59 p.m. EST. Discuss the reasons for the Iranian hostage crisis in 1979, and how that has impacted US-Iranian relations since. Examine the motives of both the United States and the Soviet Union during the Cold War. Provide at least two examples in which these motives led to potential conflict between the two superpowers and/or their proxies (smaller nations in their respective spheres of influence). Evaluate the assumption that the East European revolutions of 1989-90 that led to the breakup of the Warsaw Pact were a direct cause for the collapse of the Soviet Union. To what extent did these events influence the latter? Could the USSR have relinquished control of Eastern Europe yet remained intact? .

Please answer the following questions in a response of 150 to 200 wo.docx

ajoy21

Please answer these questions regarding the (TILA) Truth in Lending .docx

ajoy21

Please answer the following question pertaining to psychology. Include references/cites at least 175 words each question. 1. 12 Despite much effort, a definition of personality has been elusive. Why do you think this is the case? How does this influence the relationship between personality theory and personality assessment? 13 What are the differences in test construction between the Minnesota Multiphasic Personality Inventory (MMPI) and the NEO Personality Inventory? Which do you think is more valid? Explain your responses. 16 How are assessments used in the workplace? How can assessments be misused in the workplace? Analyze the relationship between the major theories of personality and assessments of personality. Evaluate the strengths and weaknesses of personality assessment methods. Describe the application of psychological assessments in the workplace. .

Please answer the following question pertaining to psychology. Inc.docx

ajoy21

Please answer the following questions in a response of 250 to 300 words each , and submit your responses in a Word attachment no later than Sunday of this week at 11:59 p.m. EST. Identify the causes, key battles, and outcome of World War II in both Europe and the Pacific. Identify the causes of the Cold War, and explain whether you think the Cold War was inevitable or not following World War II. How did the conflict between communist and non-communist powers manifest in China and Korea? Pollard, E., Rosenberg, C., & Tignor, R. (2015). Worlds Together Worlds Apart. From 1000 CE to the Present (1st ed., Vol. 2). New York, NY: W.W. Norton & Company. .

Please answer the following questions in a response of 250 to 300 .docx

ajoy21

Please answer the three questions completly. I have attached the questions in excel where they need to be answered. 1) XYZ Company had three defined benefit plans with the following information: 12 Points Plan 1 Plan 2 Plan 3 Expected Payment over next year 3,500,000 3,500,000 3,500,000 Fair Value of Plan Assets 5,000,000 6,000,000 3,000,000 Projected Benefit Obligation 7,000,000 5,500,000 4,500,000 Record the over/(under) funded status of each plan. Then determine the balance sheet presentation based on the over/(under) funded status. (Input an amount in each yellow cell. If zero, input zero.) Plan 1 Plan 2 Plan 3 Over/ (Under) Funded Status Noncurrent Asset Current Liability** Noncurrent Liability ** Think about the expected payment over the next year compared to the Plan Assets available. 2) XYZ Company received the following information from its actuary team for the 10 points year pertaining to one of its defined benefit plans: Service Cost 120,000 Interest on Projected Benefit Obligation 55,000 Expected Return on Plan Assets 30,000 Amortization of Prior Service Cost 15,000 Amortization of Actuarial Gain 10,000 Calculate the Pension Expense for the year (show all items included in the calculation): 3) At the end of year, XYZ Corporation had the following pension related information in addition to the above information: 12 points 12/31/X1 12/31/X2 Fair Value of Plan Assets 405,000 505,000 Projected Benefit Obligation 1,065,000 1,035,000 Funded Status (660,000) (530,000) Record the Necessary Journal Entries: Entry to record Service Cost, Interest Cost and Return on Plan Assets: Account Name: Debit Credit Amortization of Prior Service Cost and/or Actuarial Losses: Account Name: Debit Credit Amortization of Actuarial Gains: Account Name: Debit Credit 4) a) Identify a US Company that offers a Defined Benefit Plan and review the 10K information for 2016 of the identified company and provide a brief analysis based on footnotes related to the plan. 3 points b) Include screenshots to report the Funded Status and Pension Expense information for the selected plan. 1 Points c) Record the associated journal entries based on the screenshots for that company. 12 points Entry to record Service Cost, Interest Cost and Return on Plan Assets: Account Name: Debit Credit Amortization of Prior Serv.

Please answer the three questions completly. I have attached the que.docx

ajoy21

More from ajoy21 (20)