2,180 Topics
 | |
| | Hi , I am trying to find some solution about this i try on different tutorial but with no succes. I have no idea what the author want to told me. Here the tutorial [url]http://lib.daemon.am/Books/C/[/url] pick day15 go to Linked list ,and if you know other tutorial who write about …  |
| | Ok i'm trying to build a header file which then i can include it for programs that use singly linked lists but somthing is fishy here...: here's the code [CODE]#include <iostream.h> struct nod { int info; nod* next_adr;}; void add(nod* &v, nod* &sf, int val) { nod *c; if(v==0) //if … |
| | Hi All. I am using a GridView to List contacts linked to a logged in User. I can successfully bind the Gridview with a DataTable. And the values in the GridView are correctly displayed. I have a BoundField at Index 0 of the GridView which pulls a value from a … |
| | what is ment by merging a linked list do we need to sort the list after connecting the lists? please anybody help .....  |
| | Can anyone help me how to write the following codes in different ways. I used Linked List. template<class Item> ttt<Item>::ttt() { square=0; board=new node<Item>; for (Item i='9'; i>=1; i--) { list_head_insert(board,i); } } template<class Item> void ttt<Item>::clear() { list_clear(board); square=0; board=new node<Item>; for (Item i='9'; i !='0'; i--) { list_head_insert(board,i); … |
| | Hello, C question here (running on Linux, though there should be no platform specific code). After reading through a few examples, and following one in a book, for linked lists i thought i would try my own small program. The problem is, I seem to be having trouble with memory, …  |
| | Hi, A friend of mine was asked a question during a CS exam about finding and maintaining the minimal element in a linked list in constant time, as elements are randomly added to and deleted from the list. He could not answer it, and after he related this to me, … |
| | · The complete arithmetic expression will be read from a input file. An equation will not cover more than one line and may be assumed to be entirely valid. The input file will contain a single equation For example the file might contain the following: 56 – 12/3 + 1 … |
| | Hey, just wanna say thanks in advance with the help. [code] void backwards(struct node *headp){ int n=0; /* length */ int i,j; /* counters */ struct node *p=headp; /* find length */ while( p->next !=NULL ) { n++; p=p->next; } printf(“%d\n”, p->number); /* print TAIL */ for(i=n-1; i>=1; i--) { …  |
| | Create a modular program in C that generates and modifies a number of circular double linked lists. Each node in the circular double linked list should have two pointers which should “point” to the next and the previous node. And that the double linked list is in the form of … |
| | Hello i got this project that i have to do and im very bad C# and need help ASAP i have done a little bit but not much i will display the coursework outline and after that the code that i have done so far, i would appreciate it if … |
| | void Display(Productptr t) { Productptr g; g=t; if(t==NULL) cout<<"The list is empty."<<endl; else { cout<<"Code\tDescription\tPrice\n"; cout<<"====\t===========\t=====\n"; while(g!= NULL) { cout<<g->code<<"\t" <<g->description<<"\t\t" <<g->price<<endl; } cout<<"End of the list"<<endl; } system("pause"); } This code give me problem. When I show 1st time is ok. After 1st time I add something or delete … |
| | Hi, I have a linked list which I created in a function? I want to allow the user to enter a name for the linked list, and then after he/she can display the list by typing in the title. This is part of my code [code]struct llistt{ char str[100]; // … |
| | please help me with this problem: i have to linked list, i need to compare them, and do something with regards to there result.. |
| | I believe what I have written at the moment is a singly linked list, and I can't figure out how to delete whatever node the user specifies, I've toyed around with it but I'm stumped. Here's my specification file: [code] #include<string> using namespace std; class Node { Node *prev; Node … |
| | hi all. I have a question need your all help. 1.what is the problem for my delete function,I can't delete the list that i select(but no error in that case) 2.how to build the search function with that prototype? [code=cplusplus] #include <iostream> #include <string> #include <cstdlib> using namespace std; struct … |
| | I'm getting a whole bunch of null pointer exceptions when I run my program. Here's the info: My program takes a text file (myIn.txt), will keep individual totals of all the characters, then put them into an ordered linked list. Now I need to build a pseudo-Huffman binary tree, with … |
| | I need help on how to integrate elements linked to the rank list.i already have a list of seven figures to be that the elements that must be included in the right of such a position that the salary arrangement upward And the work of the Union and the intersection … |
| | I am having problem with my loping. I don't know if I have chosen the correct approach. GOAL: I need to insert into a table event types for a specific date range. The calendar the event type is displayed on is divided into 15 minutes time intervals A group consist … |
| | I have a doubly linked list and I know it gets created with the proper values. For some reason when I run through my print function it, only prints 1/2 of the list and then gives me this: the instruction at "0x7c93426d" referenced memory at "0x00000000". the memory could not … |
| | Hey everyone, I'm attempting to write a program that will contain multiple C-DLLs. I currently have 2 structs: [CODE] struct CDLL_Node { char value[30]; struct CDLL_Node *next; struct CDLL_Node *prev; }; typedef struct CDLL_Node node; struct listHolderRecord { char label[30]; struct listHolderRecord *next; node *headAddr; }; typedef struct listHolderRecord listHolder; … |
| | Hi I want to know about the use of linked list in C and also about its working and syntax. Please tell me about this. |
| | Can someone help me with my delete function? I am having trouble figuring out why my delete function is not reporting false when attempting to delete a bank id that does not exist. Thanks. [code=c++] bool Bank::RemoveBankNumber(int bankID) { Bank *temp, *back; if (head == NULL) return false;//(isEmpty()) return; // …  |
 | Home Work Problem. I understand what the program is suppose to do, but I do not understand how to implement it using Link List. Please help me to understand the problem. Write a program to perform ariththmetic with integers of unlimited size. You must read data from the input file, … |
| | hi for all pl, if any can do the folowing: " Write a cross-reference program which constructs a BST with all words included from a text file and records the line numbers on which these words were used. These line numbers should be stored on linked lists associated with the … |
| | Can we add two long number using linked list. If Yes then please write a simple code......  |
 | I have a person datafile of many entries. Persons will be stored in a linked list and each of the person amongst other things will have a linked list of items belonging to them. The object of the program is to use a quicksort algorithm to print out entries of … |
| | so, everything works through the first iteration (don't know if this is an appropriate term for linked lists, but we just learned arrays) but then it stops. I thought that telling it to continue until position.next != null and increasing the position after every iteration would work but I think … |
 | I got a list of items to program in Visual C++. I could write a linked list from scratch but I want to do something special and best. I am thinking about a hash table. What is best, linked lists or hash tables? I am not too experienced with the … |
| | Hello folks, I have a program that uses a linked list to implement a stack to convert a string from infix notation to postfix notation, and then to evaluate it. Well, the conversion part works just fine, but I have encountered a problem when trying to evaluate it. In my … |
 | i am making a menu driven program on linked lists. the program's display function is printing garbage values. i.e if n=3...i add three values and when the values are displayed the last entry is displayed and the rest two enteries are garbage values for eg. [QUOTE]MENU (Linked List) 1. CREATE … |
| | I have finished writing my Dynamic, Linked-List implementation of the ADT List, but I can't figure out what the book includes the "void retrieve" function for. Insertion, deletion, the constructors, deconstructors, etc. all have clear purposes, but what is the purpose of the retrieval operation? The header file (class declaration) … |
| | Ok, I need help getting started. I know the rules and such so I'm not asking for anyone to tell me answers or anything like that. I can do Dijkstra's algorithm no problem on paper with a graph, but when it comes to the java implementation I have a harder … |
| | Hello everybody :) I have a problem about sorting a linked list. The following is the code that I wrote in C, it works well at this moment; it just generates random numbers, it just prints the random numbers generated and the even numbers. But I need to sort these … |
| | I have an exercise like this: Design a simple text editor in console mode, not window form max character in a line is 80 user can move cursor up, down, to left and right, insert, delete character I don't know how to build it :( i should use linked list … |
| | I am trying to write a program that has to create a structure that has one variable called value and one pointer to the list(making it a linked list). It need to prompt the user for 5 values and store them into the linked list, then print out the list. … |
 | Hello, I am trying to call two functions: one that pulls data from a file and stores into a linked list, and one that displays this data to the screen. I pulled my code out of the functions and created a new file and included everything in the main function, … |
| | >>i have defined a stack class using single linked list and a template. as follow: template <class T> class genStack{ public: void push(T a){.....} T pop(){........} .... .... private: SLList<T>: lst; } i know when i want the stack to store int, i should declare a stack like this: genStack<int> … |
| | I am trying to add the integer elements of two Linked Lists. How do I add the contents of two elements of a linked list. For example: public void main { ........ LinkList newList = new LinkList(); ......... Link link1, link2, linkAns; ...... ...... link2 = newList.deleteFirst(); link1 = newList.deleteFirst(); … |
| | I have a template singly linked list function that has a node class: [code] template <class T> class Node { T Data; Node <T> *Next; public: Node(); Node (const T&); T getData() const; Node <T>* getNext() const; void setData(T); void setNext(Node<T>*); }; [/code] and SLL: [code] class SinglyLinkedList { Node …  |
| | Hey All I am having issues with my code and it has something to do with the way my double linked list is working. I cant figure out if its not setting the m_prev pointer if at all and what is going on with my m_next pointer. Any help would … |
 | [U]main.cpp:[/U] [CODE]#include <stdio.h> #include "VeryLongInt.h" int InitializeFromFile(char* fileName, VeryLongInt* &x, VeryLongInt* &y); //void ShowScreen(); int main(int argc, char* argv[]){ char* inputFile; char* outputFile; if (argc < 2){ printf("Usage: LongIntDataType.exe [InputFile] [OutputFile]\n"); printf("Using default configuration: LongIntDataType.exe input.txt output.txt\n\n"); inputFile = "input.txt"; outputFile = "output.txt"; // "output/output.txt" } else { inputFile = … |
| | Whne i using linked list, i must lay the empty box to take the each integer to itself, and it will connect to one bigger integer, and it seems to be a string, not to be a integer perfectly, how can i change it into a big integer, can you … |
| | I must do an assignment, so it's so hard for me to do. Now, the deadline is coming sooner and sooner, i can't finish and don't know how to do it. I need someone here can help me, i give the best regard first. Here is the assignment; please send … |
| | a) A large city has a number of colleges which offer a number of courses. A course may be offered by a number of colleges but the course fee varies between them. In order to help a user to make a decision, a program is needed to provide the following … |
| | >>>is there any limit/constraint on the maximum number of nodes that a linked list can have? >>>a linked list does not have to be implmented with a pointer. what else can be implementeation of linked lists? >>>how can a singly linked list be implemented so that insertion requires no test … |
| | In this experiment, people take turns playing and you can delete or add players, Seem to have a couple of issues left, not sure how to work out. One of the problems is the display, the other is a class interface. Need any help or suggestions I can get. Thank …  |
| | anybody here who could teach me how..or the function on printing an output file in linked list.. |
| | NEED help please. here's our code. We wanted to print its output file. what function will we use? how will we do it? .We wanted to add printing in the menu.thanks [code] #include<iostream.h> #include<stdlib.h> #include<conio.h> #include<stdio.h> struct node{ int x; char h[50]; //last name char fn[10]; struct node *next; }; … |
| | I'm trying to implement a Double-Linked List ADT in an array (contiguous memory only, no dynamic allocation at runtime). So far, all my code does is generate a seg fault whenever I try and add a new element. Here's the whole ADT, if anybody feels like looking over it. FILE: … |
The End.