Linked Lists with polynomials

Hello there, i have a problem with my project for this java class, it asks to store polynomials as linked lists of terms (it countains coefficient and power of x) i also need to multiply them, do u suggest that i make a Polynomial object that has coeff and power as parameters and then transmit them to the add method of the ListIterator interface? but the add function takes only an object?
for multiplying, how do i get, for exmaple the first 2 terms of 2 polynomials p and f? and then create another linked list to store the new plynomial?
i will be grateful for any help,
thanks

You're on the right track, from what I can figure. Your idea of creating an object, say PolyTerm to hold the coefficient and degree of the term will work wonderfully.
All you need now is to figure out how to multiply, right? Well, basically a polynomial multiplication is poly1term1 X poly2term1 + poly1term1 X poly2term2, etc, etc.
So, you need two iterators, one to loop through each polynomial, getting the PolyTerm object at the relevant index, perform you multiplication, and add it to a third list that you've initialized.

Similar Messages

Sorting singly linked list with minimum time complexity

Hi ...
anyone could tell me how can i sort singly linked list with minimum time complexity .... ????
Regards...

By MergeSort or QuickSort O(n log n). But then you
have to first extract the objects in the list,sort
them, then rebuild the list. But it will still bealot
faster than by keeping the list linked.Technically, I believe insertion sort is marginally
faster for small n ( <20 or so).Woohoo! So for 20 out of the possible 2147483648 array
sizes Insetion is faster!
Unfortunately, checking for that case probably wastes
all the time you get from using the faster sort...
That would depend on the actual distribution off array sizes. So it's an engineering decision.
Sylvia.

[svn:bz-trunk] 18926: bug fix BLZ-570 Double linked list with lot of objects result in BlazeDS Error deserializing error : StackOverflowError

Revision: 18926
Revision: 18926
Author:   [email protected]
Date:     2010-12-01 14:07:19 -0800 (Wed, 01 Dec 2010)
Log Message:
bug fix BLZ-570 Double linked list with lot of objects result in BlazeDS Error deserializing error : StackOverflowError
We put hard limit to the max object nest level to prevent StackOverFlowError. the default max object nest level is 1024 and it can be configured in the endpoint/serialziation section in service-config.xml.
This needs documentation.
Checkintests pass
Ticket Links:
    http://bugs.adobe.com/jira/browse/BLZ-570
Modified Paths:
    blazeds/trunk/modules/common/src/flex/messaging/errors.properties
    blazeds/trunk/modules/core/src/flex/messaging/endpoints/AbstractEndpoint.java
    blazeds/trunk/modules/core/src/flex/messaging/io/SerializationContext.java
    blazeds/trunk/modules/core/src/flex/messaging/io/amf/Amf0Input.java
    blazeds/trunk/modules/core/src/flex/messaging/io/amf/Amf3Input.java
    blazeds/trunk/modules/core/src/flex/messaging/io/amf/AmfIO.java

[svn:bz-4.0.0_fixes] 20451: backporting bug fix BLZ-570/ BLZ-620 Double linked list with lot of objects result in BlazeDS Error deserializing error : StackOverflowError We put hard limit to the max object nest level to prevent StackOverFlowError .

Revision: 20451
Revision: 20451
Author:   [email protected]
Date:     2011-02-24 08:33:31 -0800 (Thu, 24 Feb 2011)
Log Message:
backporting bug fix BLZ-570/BLZ-620 Double linked list with lot of objects result in BlazeDS Error deserializing error : StackOverflowError We put hard limit to the max object nest level to prevent StackOverFlowError. the default max object nest level is 1024 and it can be configured in the endpoint/serialziation section in service-config.xml. This needs documentation. Checkintests pass
Ticket Links:
    http://bugs.adobe.com/jira/browse/BLZ-570
    http://bugs.adobe.com/jira/browse/BLZ-620
Modified Paths:
    blazeds/branches/4.0.0_fixes/modules/common/src/flex/messaging/errors.properties
    blazeds/branches/4.0.0_fixes/modules/core/src/flex/messaging/endpoints/AbstractEndpoint.j ava
    blazeds/branches/4.0.0_fixes/modules/core/src/flex/messaging/io/SerializationContext.java
    blazeds/branches/4.0.0_fixes/modules/core/src/flex/messaging/io/amf/Amf0Input.java
    blazeds/branches/4.0.0_fixes/modules/core/src/flex/messaging/io/amf/Amf3Input.java
    blazeds/branches/4.0.0_fixes/modules/core/src/flex/messaging/io/amf/AmfIO.java

Dear Pallavi,
Very useful post!
I am looking for similar accelerators for
Software Inventory Accelerator
Hardware Inventory Accelerator
Interfaces Inventory
Customization Assessment Accelerator
Sizing Tool
Which helps us to come up with the relevant Bill of Matetials for every area mentioned above, and the ones which I dont know...
Request help on such accelerators... Any clues?
Any reply, help is highly appreciated.
Regards
Manish Madhav

[svn:bz-3.x] 20443: back porting bug fix BLZ-570/ BLZ-620 Double linked list with lot of objects result in BlazeDS Error deserializing error : StackOverflowError We put hard limit to the max object nest level to prevent StackOverFlowError .

Revision: 20443
Revision: 20443
Author:   [email protected]
Date:     2011-02-23 21:19:22 -0800 (Wed, 23 Feb 2011)
Log Message:
back porting bug fix BLZ-570/BLZ-620 Double linked list with lot of objects result in BlazeDS Error deserializing error : StackOverflowError We put hard limit to the max object nest level to prevent StackOverFlowError. the default max object nest level is 1024 and it can be configured in the endpoint/serialziation section in service-config.xml. This needs documentation. Checkintests pass
Ticket Links:
    http://bugs.adobe.com/jira/browse/BLZ-570
    http://bugs.adobe.com/jira/browse/BLZ-620
Modified Paths:
    blazeds/branches/3.x/modules/common/src/java/flex/messaging/errors.properties
    blazeds/branches/3.x/modules/core/src/java/flex/messaging/endpoints/AbstractEndpoint.java
    blazeds/branches/3.x/modules/core/src/java/flex/messaging/io/SerializationContext.java
    blazeds/branches/3.x/modules/core/src/java/flex/messaging/io/amf/Amf0Input.java
    blazeds/branches/3.x/modules/core/src/java/flex/messaging/io/amf/Amf3Input.java
    blazeds/branches/3.x/modules/core/src/java/flex/messaging/io/amf/AmfIO.java

Need help on creating a linked list with array...

I want to create a linked listed using array method. Any suggestion on how would I start it.
thanks

That means I want to implement linked list using an
array.I believe you mean you want to implement list using an array. Linked list is a very different implementation of a list, which can be combined with arrays for a niche implementation of list, but I don't think this is what you're talking about.
Do you mind if we ask why you don't want to use ArrayList? It does exactly what you specify, plus it will increase the size of the internal array as necessary to ensure it can store the required elements.
If you really want to make your own, have a look at the source for ArrayList (in src.jar in your JDK installation folder) - it will answer any questions you have. If you don't understand any of the code, feel free to post the relevant code here and ask for clarification.

Linked Lists with Arrays

I am setting up a linked list of the following very simplified class:
class LinkedList
     String Name=" ";
     double ID=0;
     static long next=0;
}the main class is as follows:
class Links
     public static void Display(LinkedList Link)
     /** A Display function that simply displays everything within the LinkedList class*/
     System.out.println("\nName: " + Link.Name +"\nID #: " + Link.ID + "\nNext ID: " + Link.next);
     public static void main(String[] args)
          int MAX_LINKS=10;
          LinkedList[] Link=new LinkedList[MAX_LINKS];
          for (int i=0;i<MAX_LINKS;i++)
               Link.ID=i;
               Link[i].next++;
               Display(Link[i]);
everything compiles fine, but at runtime I recieve a
Exception in thread "main" java.lang.NullPointerException
at Links.Display(Links.java:6)
at Links.main(Links.java:18)What am I doing wrong?
Thanks in advance.

public static void main(String[] args){
   int MAX_LINKS=10;
// this tells the compiler that the Link array will hold
//LinkedList objects, but doesn't actually create those objects...
   LinkedList[] Link=new LinkedList[MAX_LINKS];
   for (int i=0;i<MAX_LINKS;i++){
//NEED TO ADD THIS LINE to create the objects:
      Link[ i ] = new LinkedList();
      Link[ i ].ID=i;
      Link[ i ].next++;
      Display(Link[ i ]);

Help with Stacked linked lists with nodes.

I have 5 elements, { object1, object2, object3, object4, object5}; and I add then to the stack from object1 to object5 (from left to right). So the head node > object 5 > object 4 > object3> object2 > object1. (> represents points to.) So i made a method to get the nth element of the list in the order I input it to the list. The method is called ElementsAt(int i). But some reason, it always returns the last object in the list. I included my entire code because there may be something wrong somewhere else that maybe causing it.
Note: There is also a list interface.
public class MyList implements List {
     * The head node.
     private Node head;
     * The node it is currently reading
     private Node curr;
     * The previous node it has read.
     private Node prev;
     * A blank Node
     private Node blank;
     * The number of elements in the list
     private int numItems;
     * Default constructor
     public MyList() {
          numItems = 0;
          head = null;
     * Add an element in front of the list.
     * @param o The object to be added.
     public void addFront(Object o){
          if(head == null) {
               head = new Node (o, null);
          else{
               blank = new Node(o,null);
               curr = head;
               while (curr != null){
                    prev = curr;
                    curr = curr.getNext();
               blank.setNext(curr);
               prev.setNext(blank);
          numItems +=1;
     * Add an element in the back of the list.
     * @param o The object to be added.
     public void addBack(Object o){
          curr = head;
          if (head == null){
               head = new Node(o ,null);
          else {
               head = new Node(o, curr);
          numItems +=1;
     * Determine whether the list contains a certain object.
     * @param o The object it searches through the list to
     * see if it is present.
     * @ returns a boolean that describes whether object is
     * in the list.
     public boolean contains(Object o){
          boolean present = false;
          curr = head;
          while ((curr != null) && (present != true)){
               present = (o.equals(curr.getElement()));
               curr.setNext(curr.getNext());
          return present;
     /** Remove an object in the list if it is in the list.
     * @param o The object it wants to remove.
     public void remove(Object o){
          if(head ==null){
               return ;
          if(head.getElement().equals(o)){
               head = head.getNext();
               numItems -=1;
          else{
               prev = head;
               curr = head.getNext();
               while ((curr!=null) && (curr.getElement() !=o)){
                    prev = curr;
                    curr = curr.getNext();
               if (curr!=null){
                    blank = curr.getNext();
                    prev.setNext(blank);
                    numItems-=1;
     /** Determine what object is at the nth place of the list.
     * @param i the nth place of the list
     * if the number is higher than the list, it is invalid.
     * @returns The element of the nth position of the list.
     public Object elementAt(int i){
          curr = head;
          Object blank = "";
          if ( i > numItems){
               return null;
          else{
               i = numItems - i;
               for (int j=1; j<=i; j++){
                    if(curr!=null){
                         blank = curr.getElement();
                         curr = curr.getNext();
               return blank;
     /** Determine the size of the list.
     * @returns The size of the list
     public int size() {
          return numItems ;
     /** Makes the list empty
     public void makeEmpty() {
          head = new Node(null,null);
          numItems = 0;
     /** Returns The list as a string.
     * @returns String containing all elemnts of the list.
     public String toString(){
          String sum = "";
          curr = head.getNext();
          blank = head;
          prev = head;
          if(curr==null){
               prev.setNext(null);
               curr=prev;
          while(curr != null)
               if(curr.getNext() ==null){
                    sum += "\n" + curr.getElement();
                    curr.setNext(null);
               if(curr.getNext()==null)
                    prev.setNext(null);
                    prev = blank;
                    curr = prev.getNext();
               else{
                    curr = curr.getNext();
                    prev= prev.getNext();
          if (head.getElement() !=null)
          sum +="\n" + head.getElement();
          return sum;
}this is the program i use to test it.
public class MyListTester {
     public static void main (String [] args)
          List list = new MyList();
          String one = "Object One";
          String two = "Object Two";
          String three = "Object Three";
          int five = 5;
          list.addFront(one);
          list.addFront(two);
          list.addFront(three);
          list.addFront(five);
          System.out.println(list);
          System.out.println();
          System.out.println(list.size());
          System.out.println(list.elementAt(2));
                //this should print out object Two, but doesn't
          System.out.println(list.elementAt(3));
                //this should print out object Three, but doesn't
}

chuang7 wrote:
So i made a method to get the nth element of the list in the order I input it to the list.
* The node it is currently reading
private Node curr;
* The previous node it has read.
These ('curr' and 'prev') should be local variables in the methods that need them, not instance variables.
public void addFront(Object o)
while (curr != null){
     prev = curr;
     curr = curr.getNext();
blank.setNext(curr);At this point 'curr' is always null so this line is redundant.
public void addBack(Object o)You can reduce this method to two lines of code.
public boolean contains(Object o)
curr.setNext(curr.getNext());You are modifying the list inside the contains method?
               for (int j=1; j<=i; j++){Rethink this loop.
public String toString()
     prev.setNext(null);
if(curr.getNext() ==null)
     sum += "\n" + curr.getElement()+"->"+curr.getNext();
     curr.setNext(null);
if(curr.getNext()==null)
     prev.setNext(null);
     prev = blank;
     curr = prev.getNext();You are modifying the list in the toString() method?

Need help with linked lists.

I have a school assignment to make a linked list with a linked list.
The first basic is to make a list of people, and link them together in a linked list. So far, so good.
The problem comes when I'm going to make linked lists in each of these objects that include the relationships between the people in it.
So If I have 10 peolpe in a list, person 1 might know person 3, 4 and 8. They will all know person 1 back of course. My problem is that it isn't just one group of friends, person 3 might not know person 4 and 8, but maybe he knows person 10. So all need "their own" list.
Therefor I can't see how I'm supposed to use linked lists for them, as I can't just link them togeter with e.g. "Person nextFriend;" The text says specifically to use linked lists. Well, I'm stuck.
Edited by: Skruf on Jan 27, 2009 3:22 PM

Skruf wrote:
I know it doesn't matter what the objects represent, I just needed a way to explain.
But a linked list is basically just a redirect to the next in the list, right?No, a linked list is a particular implementation of a list.
Then I can't see how it's possible to make individual friend lists.No clue what problem you're having.
People with links
null - 1 - 2 - 3 - 4 - 5 - 6 - 7 - 8 - 9 - 10 - nullThat means nothing.
I can't see how that can be used to make independent links. Do they mean that I'm support to stort it in arrays or something then?
The person list, is (as you can see in my "illustration") only a "next" and "previous" person, so I can't use that way to link the friends together. nextFriend and lastFriend obviously doesn't work.
That's my problemLike I said: A Person object contains a linked list. In that linked list you put references to that Person's friends.

Errors executing bulk query when updating a Sharepoint Linked List from Access

Hi all,
I have a Sharepoint list that is a Linked List with MS Access. It has just under 5,000 items (4,864), thus meaning it avoids the reduction in functionality lists of greater than 5,000 items have.
Among the list are five calculated columns. These take the information from another column (different employee numbers), and by using a formula produce a clickable link to my company's Directory page, where that particular employee's info is displayed. I'm
not sure if these five columns are relevant to my query, but I'm mentioning them in case.
My problem is this: Frequently when I run any query on the list that updates the list, I get this error: "There were errors executing the bulk query or sending the data to the server. Reconnect the tables to resolve the
conflicts or discard the pending changes".
When I review the errors, it says they conflict with errors a previous user made (with that previous user being me). It frequently highlights several columns, despite the info in them being identical, and the calculated columns (with the original showing
the value they contained and the new showing #VALUE! (as Access can't display the formulas).
However, if I click Retry All Changes, all the update stick and everything seems fine. Why is this happening? It's proving very annoying and is really stopping the automation of my large number of queries. A list of 5000 items isn't particular big (and they've
got roughly 100 columns, although I didn't think that was too large either, given Excel's 200+ column limit).
Is this due to poor query design and SQL? Is this due to connectivity issues (which I doubt, as my line seems perfect)? Is this due to Access tripping over itself and not executing the update on each row in the table, but rather executing them concurrently
and locking itself up? I'm at wit's end about it and really need to get this sorted.
Thanks in advance for any suggestions.

Hi amartin903,
According to your description, my understanding is that you got an error when you used a linked list from Access.
The table that you are updating is a linked table that does not have a primary key or a unique index. Or, the query or the form is based on a linked table that does not have a primary key or a unique index. Please add the primary key or a unique index.
Here is a similar post, please take a look at:
http://social.technet.microsoft.com/Forums/en-US/545601e9-a703-4a02-8ed9-199f1ce9dac8/updating-sharepoint-list-from-access?forum=sharepointdevelopmentlegacy
I hope this helps.
Thanks,
Wendy
Wendy Li
TechNet Community Support

Alphabetizing a linked list, HELP!

To all:
Firstly, I'm not looking for someone to do my assignment for me. I just need a push in the right direction...
I need to create a linked list that contains nodes of a single string (a first name), but that list needs to be alphabetized and that's where I am stuck.
I can use an iterator method that will display a plain-old "make a new node the head" linked list with no problem. But I'm under the impression that an iterator method is also the way to go in alphabetizing this list (that is using an iterative method to determine the correct place to place a new node in the linked list). And I am having zero luck doing that.
The iterator method looks something like this:
// ---- MyList: DisplayList method ----
void DisplayList()
ListNode p;
for (ResetIterator(); (p = Iterate()) != null; )
p.DisplayNode();
// ---- MyList: ResetIterator method ----
void ResetIterator()
current = head;
// ---- MyList: Iterate method ----
ListNode Iterate()
if (current != null)
current = current.next;
return current;
Can I use the same iterator method to both display the final linked list AND alphabetize my linked list or do I need to create a whole new iterator method, one for each?
Please, someone give me a hint where to go with this. I've spent something like 15 hours so far trying to figure this thing out and I'm just stuck.
Thanks so much,
John
[email protected]

I'll try and point you in the right direction without being too explicit as you request.
Is your "linked list" an instance of the Java class java.util.LinkedList or a class of your own?
If it is the Java class, then check out some of the other types of Collections that provide built-in sorting. You should be able to easily convert from your List to another type of Collection and back again to implement the sorting. (hint: you can do this in two lines of code).
If this is your own class and you want to code the sort yourself, implement something simple such as a bubble sort (should be easy to research on the web).
Converting to an array, sorting that and converting back is another option.
Good Luck.

N^2 log(n) for Collections.sort() on a linked list in place?

So, I was looking over the Java API regarding Collections.sort() on linked lists, and it says it dumps linked lists into an array so that it can call merge sort. Because, otherwise, sorting a linked list in place would lead to a complexity of O(n^2 log n) ... can someone explain how this happens?

corlettk wrote:
uj,
... there are other sorting methods for linked lists with an O(N*N) complexity.Please, what are those algorithms? I'm guesing they're variants off insertion sort, coz an insertion is O(1) in a linked list [and expensive in array]... Am I warm?You don't have to change the structure of a linked list to sort it. You can use an ordinary Bubblesort. (The list is repeatedly scanned. In each scan adjacent elements are compared and if they're in wrong order they're swapped. When one scan of the list passes without any swaps the list is sorted). This is an O(N*N) algoritm.
What I mean is it's possible to sort a list with O(N*N) complexity. It doesn't have to be O(N*N*logN) as the Java documentation kind of suggests. In fact I wouldn't be surprised if there were special O(N*logN) algoritms available also for lists but I don't know really. In any case Java uses none of them.

Help on Linked List

Hey people, i need a small help on my linked list.
Ok, what i'm trying to do is have a search function with a linked list using strings. First i will have a string, i will then compute the ASCII value for that and take MOD 71 lets say. For example, a string has an ASCII value of 216, MOD 71 of this gives me 3. I will then have an array of 71, and each array will point to a linked list. There will be as many linked list as there are of arrays (71). I will then store this string at index [3] in the linked list in which the array points to.
My problem for now is, how do i for example create 71 linked list? So far i can create only 1. To create another is easy, but if i have 71 the code will be too much. Is there an iterator i could use that easily creates 71? Sorry about this, i'm not really good with linked list with Java. Anyway, here is what i have now :).
public class MyLinkedListElement {
        String string;
        MyLinkedListElement next;
        public MyLinkedListElement(String s) {
            string = s;
            next = null;
        public MyLinkedListElement getNext() {
            return next;
        public String getValue() {
            return string;
public class MyLinkedList {
    public static MyLinkedListElement head;
    public MyLinkedList() {
        head = null;
   public static void addToHead(String s) {
        MyLinkedListElement a = new MyLinkedListElement(s);
        if (head == null) {
            head = a;
        } else {
            a.next = head;
            head = a;
    public static void main(String[] args) {
          String[] arr = {"Bubble", "Angie", "Bob", "Bubble", "Adam"};
          for (int i = 0; i < arr.length; i++) {
                      addToHead(arr);
MyLinkedListElement current = head;
while (current != null) {
System.out.println(current.getValue());
current = current.next;
}I can have an array of strings and easily add them to a linked list.

I am very confused now, i just need to store a string value inside an array of linked list. But i can't somehow do it. I am very close, i can store the value in a linked list but the array of linked list, this is what i have.
public class MyLinkedListElement {
        String string;
        MyLinkedListElement next;
        public MyLinkedListElement(String s) {
            string = s;
            next = null;
        public MyLinkedListElement getNext() {
            return next;
        public String getValue() {
            return string;
public class MyLinkedList {
    public MyLinkedListElement head;
    public MyLinkedList() {
          head = null;
    public void addToHead(String s) {
         MyLinkedListElement a = new MyLinkedListElement(s);
         MyLinkedList[] arrayOfLinkedLists = new MyLinkedList[71];
         for(int i = 0; i < arrayOfLinkedLists.length; i++) {
             arrayOfLinkedLists[i] = new MyLinkedList();
         if (head == null) {
             head = a;
         } else {
             a.next = head;
             head = a;
    public void print(MyLinkedListElement current) {
          while (current != null) {
                System.out.println(current.getValue());
                current = current.next;
    public static void main(String[] args) {
          String[] arr = {"Bubble", "Angie", "Bob", "Bubble", "Adam"};
          MyLinkedList listInstance = new MyLinkedList();
          for (int i = 0; i < arr.length; i++) {
                listInstance.addToHead(arr);
MyLinkedListElement current = listInstance.head;
listInstance.print(current);

Linked Lists

I am trying to create a linked list with an object called ClassID But I am confused on the constructor. Could someone point me in teh right direction. this is what i got:
import java.io.*
public class Link
     public ClassID id;
     public Link next;
public Link(ClassID id)
     id = new ClassID(id);


Sorry, after rereading your initial post a third time, I see there is more to what you are asking and displaying than is easily discernable.
I am assuming you mant the linked list wis of type ClassId, if ClassId was actually meant to be the data objects stored in the list then you must give your Linked List a new name, so say ClassLl. If this is the case replace ClassId with ClassLl in my example below.
First, when you are using a constructor you don't really want to pass in "id"s and you definitely don't need "next". This is because the purpose of the constructor is to build a new linked list, and id and next should never be used in making a new linked list. The ClassId object if you have to create your own linked list without using the collections libraries should have a id and next field, but they should not be necessary for the constructor. The id, next, and ClassId if it is meant to be the data stored all should only come into play in methods manipulating the linked list.
At most, you may have an already cronstructed linked list that you plan to pass to the linked list, but there is never a reason to pass id or next to a constructor.
so
public class List
     public ClassID id = new ClassId(); //or = new LinkedList() if allowed
        public List() //there is no preexisting linkedlist being passed in
     public List(ClassID inID) //inId is a linkedlist
          id = inID;
}In short, worry about setting up your linked list before you start trying to fill it with stuff.

Long Linked List

is it possible to create a Linked List with a long as it's counter?

Sure, just write the code yourself. But why? Do you intend to have more than 2 billion elements in a linked list?

Linked Lists with polynomials

Similar Messages

Maybe you are looking for