two error come of (strcpy was not declare in this scope) would any one show me, hw to remove this error, ... plz Project Title: Student Record & Registration using Linked list Description: This project is a Linked List application. If you would like to refresh you knowledge about linked list, you may read this article: Linked List. The project considers an engineering university having three departments: Electrical, Mechanical and Comptuer System Engineering(CSE). The university considers Metric(O-level) , FSc(A-level) and entry test marks for registering a student and calculate an aggregate based on a specific criteria. The project finds in … +0 Tutorial Share my solution and code of some basic problems **Problems 1: Spiral matrix - Advanced** Source of the problem: [Here (not in English)](http://www.spoj.com/PTIT/problems/BCACM11B/) Spiral matrix is formed by filling number 1 in 1st row 1st column, after that, filling with increasing number by clockwise, example: 1 2 3 4 5 16 17 18 19 6 15 24 25 20 7 14 23 22 21 8 13 12 11 10 9 Write a program that inform the value of cell (x, y) of a square spiral matrix sized n x n. *Input:* First row record the number of tests, not greater than 100. Each test record in one row, include … +0 Hello, for a school assignment I was supposed to write an insertion sort algorithm for a doubly linked list. As the feedback system of this particular course is rather weak (actually non-existent) I would like to ask you for your honest opinion about how well this is implemented, what could be improved, made more efficient, etc? Thanks in advance, Marcel #include using namespace std; class elem{ public: int value; elem* prev; elem* next; elem(int e, elem* ptr1, elem* ptr2){ value = e; prev = ptr1; next = ptr2; }; }; class list{ private: elem* first; elem* last; int length; … +0 My Objective is to define a function, with a pointer to a list of elements of the structure I created as the first parameter, a C-character string (of type char * ) as the second parameter and one of the of the two values,num or name, from the above enumeration type as the third parameter. In the body of this function, all elements of the complete list in the first parameter are to be checked whether -by calling the function the bool function isPartof and create a new list with all the hits(matches) found. Finally Return the head of this … +0 I'm working on this code for class, I am not expecting anyone to do my homework but help would be appreciated. Nodes are confusing for me and my professor did not explain well. The errors I am getting are where I declare the functions, I dont know the nodeType(?) that goes in the arguments. Hopefully that makes sense.I think I may have also need to initialize the node? #include #include #include #include using namespace std; ///employeeType struct, node struct, typedef statement go here. struct employeeType { int idNum; string firstName; string lastName; char gender; double payrate; … +0 HI I donot understand where to start . I need ideas and help. void InsertList(c4735list *destinationList,c4735list *sourceList,node *startNode) { //=====================not implementd yet } this fn inserts source list into destination list.the nodes are inserted after the startnode in destination list.source list should be an empty list after this operation. the current pointer should be set to the head of the list. typedef struct _node { struct _node *prev, *next; void *data; } node; typedef struct _c4735list { node *head, *tail; node *current; void (*cleanupData ) (void *); // function that knows how to clean up data } c4735list; +0 Hello below is my code for a program that reads in integers rom keyboard input and creates two polynomials from that input and then does some maths functions on them. I've got the addition working, having trouble with the multiplication though. Any help would be appreciated. thanks import java.util.*; import java.io.File; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.text.*; import java.io.IOException; import java.util.Iterator; import java.util.LinkedList; import java.util.Scanner; public class Polynomial { private Monomial head; private int TOLERANCE = 0; /****************** the Monomial (inner) class ********************************/ private class Monomial { private DecimalFormat precision = new DecimalFormat("#.####"); private int deg; // degree of polynomial … +0 Reusable Code Snippet Linked Dropdowns (Select Fields) for Static-ish Data Hello All. Been playing around with some linked dropdowns. It seems to be a recurring theme here on DW, so I thought I'd offer this up as a possible solution or for discussion, to see how it could be improved. The premise for this set of linked dropdowns is that it is not dependent on php or Ajax following page load, that is to say, all the data is initially dumped into json format from the database and then everything is left to javascript. I've used jQuery to produce a plugin, but the same functionality is possible with just plain … +5 Say I have this definition: #define SIZE 2000 typedef enum { TRUE, FALSE }Boolean; typedef struct{ char jobTitle[30]; char jobDesc[255]; char jobLoc[255]; float salaryMin; float salaryMax; Boolean isAvailable; }jobInfo; typedef struct cursorNode{ jobInfo jobRec; int next; }HeapSpace[SIZE]; typedef struct hnode{ HeapSpace heap; int Avail; }*VHeap; typedef int List; typedef struct{ List availJob; List notAvailJob }dualList; Let's say my function data type would be this: dualList ConvertOld2NewList(VHeap *VH, List *L) { return L; /*not sure about this since I will be converting this single list to a dual list*/ } I was asked to write the code of function ConvertOld2NewList. Given … +0 Hey guyz, I've done with some coding, actually I've to submit it in the project form, what the question arises is that I dnt know where and what's the mistake in the coding. please help me out. but it's necesaary to do traversing through linklist. My topic is 'Departmental store', but this is just a simple traversing which is yet not actually clear.. so I'l do it on the required topic once it's all clear. I want yu guyz assistance. -1 Reusable Code Snippet Ajaxed Linked Dropdowns (Select Fields) for Volatile Data **// EDIT 2014-04-07 //** New version (1.0.3) posted at the [bottom](http://www.daniweb.com/web-development/php/code/476623/ajaxed-linked-dropdowns-select-fields-for-volatile-data#post2082327) Demo Page: http://demos.diafol.org/ajax-linked-dropdowns.php *********************************************** Hello All. Been playing around with more linked dropdowns (select form fields), following the code snippet posted for static-ish data [here](http://www.daniweb.com/web-development/php/code/475238/linked-dropdowns-select-fields-for-static-ish-data). The static-ish version is of limited use (or of no use!) if data in the DB is updated regularly. So, here goes... No data is loaded by PHP initially, everything is provided through an Ajax call, however, that could be easily modified if required. I've used jQuery once again, as my plain javascript skills just aren't up to the job, and have produced a … +3 Reusable Code Snippet Reversing a linked list - recursively. This code allows you to create a linked list and reverse it recursively. +0 I can't work around these errors. Can someone help me out? Error 2 error C4430: missing type specifier - int assumed. Note: C++ does not support default-int Error 3 error C2238: unexpected token(s) preceding ';' Error 1 error C2143: syntax error : missing ';' before '<' Code: #pragma once #ifndef RainfallList_H #define RainfallList_H #include "Rainfall.h" #include using namespace std; //********************************************* // LinkedList class * //********************************************* template class RainfallList:Rainfall { public: RainfallList() { head = NULL; // Establishes empty linked list } ~RainfallList(); // Linked list operations void appendNode(L); void insertNode(L); void deleteNode(L); void displayList() const; private: RainfallListNode … +0 1- implement a double linked list (node contains data and left pointer to the previous node and right pointer to the next node) +0 Hello, I have to write a program that will solve polynomials by user input, my program compiles, but gets an exception error. Here is my code: import java.io.*; import java.util.Scanner; import java.util.LinkedList; public class PolynomialList { private Node first = new Node(0, 0); private Node last = first; private static class Node { int co_eff; int expo; Node next; Node(int co_eff, int expo) { this.co_eff = co_eff; this.expo = expo; } } private PolynomialList() { } public PolynomialList(int co_eff, int expo) { last.next = new Node(co_eff, expo); last = last.next; } public PolynomialList plus(PolynomialList b) { PolynomialList a = this; … +0 I have following problem: I have 2 structures: Clients and items for example structure clients would have name and list of items from another structure asigned to this specific name I have to do this with singly linked lists. I simply have no idea how to do this would be great if somebody could explain to me how to do this and give example of how this should look aswell. +0 I'm having a small issue here with my linked list. I built a linked list with strings and it worked perfectly. Now since i'm using strtok() to separate the string I need help on storing the struct separately but keeping them connected. Hope i explained it well for now here's what i've got: #include #include #include typedef struct dict_word *word; typedef struct node *Node; typedef struct double_linked_list *DLL; struct dict_word { char words[100]; int year[10]; char eng_synonyms[100]; char heb_synonyms[100]; }; struct node { word data; Node *next; Node *previous; }; struct double_linked_list { Node *head; Node *last; … +0 there is a very frustrating problem with my queue linked list. the functions all work its just that after enqueue, dequeue or display the menu displays along with "Enter choice : Only one of the above can be your choice ". whats wrong? #include #include #include #include #define TRUE 1 #define FALSE 0 void enqueue (); void dequeue(); void list_node(); struct node { char item_name[30]; char item_code[30]; float item_price; struct node *ptrnext; }; struct node *front, *rear , *thisptr , *newptr; void main () { char ch; front=NULL; do { printf("\n\n [----------Queue Menu----------]"); printf("\nA - Enqueue … +0 so this piece of coding is having a problem. namely the search funtion. it will search but the result would only be the first element. the second will not be seached. like for example first element is lily and second element is john. search for the name lily will result in displaying the name lily but when search for john it displays name not found. whats wrong with the code? #include #include #include //function declarations struct node *initnode(char *, char *, char *); void add(struct node *); struct node *printnode(struct node *); struct node *searchname(struct node *, char *); struct … +0 Hey everyone, I posted recently an issue that was almost resolved but I have a similar question but have different variables. I'm really new to C and I'm a bit confused. Like I said on the other post I need to seperate a string using strtok() and store the seperated words on my list. I have my struct and if someone can help me with the strtok string seperation I would really appreciate it. #include #include typedef struct dict_word word; typedef struct node node; typedef struct double_linked_list DLL; struct dict_word { char words[100]; int years[10]; char eng_synonyms; // … +0 I'm new to C and I i have an assignment where I have to build a dictionary (Linked List). Basically the user inputs several words,year and their definitio likn this: Example: > love_#_2004_#_LOVING `trade_#_2001_#_INVEST` etc... Now what I need is to have a function that will scan the definition which is in UPPER CASE and give me back the word it relates to. Example: What word would you like to search? Input: INVEST Output: Found "INVEST" in the word "trade". I was kind of answered to that question. It helped understanding what was done but it's unfortunately not enough. The … +0 Hi there everyone, I'm a bit new to see and I need your help please. I'm stuck with a merge sort problem where it's support to sort my nodes in lexicographical order. Can you please have a look on my code because i've posted everywhere and i'm not getting the answers i'm looking I'm a newbie so sorry if i don't explain myself correctly. It's just not running my case 8 on my main. Any ideas how to fix that? // // main.c // Double Linked List // // Created by Yann Bohbot on 12/22/13. // Copyright (c) 2013 Yann … +0 Hi there, I made a linked list program to add, delete, add in the middle and delete from anywhere. I'm searching to make a function to sort the string data that I have in lexicographic order. Here's my struct: struct node { char data[100]; struct node *previous; // Points to the previous node struct node *next; // Points out to the next node }*head, *last; Any help? +0 Reusable Code Snippet A linked list with a twist This is an example of a singly linked list allowing you to enter a number of names and associated ages. The twist is that the names are inserted into the list in ascending order. When the list is displayed, it is already sorted by name. Note: This is not an exercise in safe data input. While precautions have been taken, any fool can stress the language easily. +1 Hi. I was wondering if someone could explain to me how to make some new node point to the first element in a list. +0 Good Afternoon, I have 2 senarios to which I need some clarification. I have an Access 2010 frontend with linked tables to mySQL using ODBC. Senario 1: I need to add a few fields to the main table and the software is used 24/7 if I add new fields will I cause problems to the users? Senario 2: I need to modify a View in MySQL but to do this I need to delete it then recreate adding some fields. Again what impact will this have on users? In both senarios I dont see us releasing the new access frontend … +0 How do you create a node with fullName and studentID in the "add" method and then put them into the correct positions which the name_first and name_second should move until the name in the name_first is larger than the new_Name and name_second is smaller than the new_Name? public class NodeDemo{ private String fullName; private int studentID; private NodeDemo fullNameLink; private NodeDemo studentIDLink; public NodeDemo(String newName, int newStudentID, NodeDemo newFullNameLink, NodeDemo newStudentIDLink){ fullName = newName; studentID = newStudentID; fullNameLink = newFullNameLink; studentIDLink = newStudentIDLink; } private static NodeDemo startPosition; public void add(String new_Name, int newStudentID){ NodeDemo name_First = startPosition.fullNameLink; NodeDemo name_Second … +0 I have to do a second assigment on doubly linked lists. Problem description: Create a class to implement a doubly linked list to store student records. Besides the basic operations, the class should include a sorting method that allow the user to sort the records in the list. Programming Requirements: 1. Create a doubly linked list in Java. Each element in the list contains a data which is an object of a Student class and two links, next and previous. 2. The Student class contains two class fields only: name - The first and last names are in one string … +0 I REALLY NEED HELP WITH THIS QUSTION AND I ONLY HAVE 48 HOURS TO COMPLETE IT.. I DONT EXPECT ANY OF YOU TO DO IT FOR ME.. BUT I REALLY NEED SOMEONE WHO WOULD TEACH ME.. EMAIL : nifhail_torres@yahoo.co.uk As everyone knows that Malaysia is going to have the 13th general elections on 5th of May 2013. Therefore, you as a software engineer are required to develop the application system called Smart Registration System (SRS) for the 13th general elections. The purpose of SRS system is developed for election officer to store votersâ€™ particular information in a sorted linked list … +0 I'm trying to make a dictionary program using linked lists. I need four classes, one that holds the word and the meaning. One that creates the node of information and its link field. Another class that creates and maintains a linked list of words and their meanings. And then a test class. so far I have public class WordMeaning { String theword; String def; WordMeaning(String t, String d) { theword = t; def = d; } String getword() { return theword; } String getdef() { return def; } } public class WordMeaningNode { WordMeaning word; WordMeaning next; WordMeaningNode(WordMeaning w) { … +0

The End.