This is the
talk page for discussing improvements to the
Data structure article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Find sources: Google ( books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
This
level-4 vital article is rated C-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Can someone who is a little more familiar with routing tables as data structures take the initiative to clarify this sentence?
The linked article does not really discuss routing tables as a data structure so much as it examines their role in the network ecosystem. "while routing tables enable networks of machines to function" describes their function better, it doesn't really say anything about routing tables as data structures. Perhaps another example altogether would be better?
-- gortsack 18:24, 18 April 2006 (UTC)
My categorization scheme for the links from this page is rather haphazard. If anyone has good ideas on how to organize it, be bold. --BlckKnght
It may be even more haphazard now. Just moved to this page the section on "data tables and functions" from the structure page. It was way too complex for that other page. I didn't attempt to merge it with the prior info on this page, but this is probably needed. -- Panchobook ( talk) 23:40, 23 June 2011 (UTC)
(omitted discussion of my dream of how a Desktop File Browser and integrated Web Browser should be designed) brettz9
Thanks for the suggestions...However, as far as I could tell, Meta-Wikipedia seemed just concerned about general things of concern to Wikipedia itself rather than its specific content.
I was also told that it was all right to put opinions and such in the discuss pages such as this.
I changed the line "This is an incomplete list of data structures:", because it is unprofessionial. —Noldoaran (Talk) 22:15, Feb 14, 2004 (UTC)
In line with standard practice here, the list of data structures should be a free-standing page, separate from this one.
Charles Matthews 09:52, 3 May 2004 (UTC)
The article on Node_(computer_science) contains little info. Ripper234 20:29, 2 April 2006 (UTC)
DEAR WIKIPEDIA PPL. perhaps you should tell me what the fuck a NODE IS instead of telling me that it links to other shit and does other shit. —The preceding
unsigned comment was added by
140.180.153.198 (
talk •
contribs) 04:24, 6 April 2006 (UTC).
DEAR UNINFORMED IDIOT. something that 'links to shit and does other shit' is exactly 'what the fuck' a node is. enjoy —The preceding unsigned comment was added by 81.132.20.207 ( talk • contribs) 13:28, 8 April 2006 (UTC).
I'm un-merging the node article. 140.180.153.198 has a point, that nodes themselves deserve an explanation. -- Snarius 23:33, 3 August 2006 (UTC)
SOMEONE removed this important link http://www.alnaja7.org/Programmer/215/ITCS_215.htm , is there any reason ?? Alhoori 19:01, 20 May 2006 (UTC)
If the content is good it should be there. I haven't checked it, though.
Please tell me what is wrong about the following link which is removed 3 times?
I am not promoting anything and I don't know the author either. This is just a useful link to some valuable academic content, and the author has put his work freely for people to use and learn. So what is undesirable for you about it that you remove it everytime?
If you're going to remove it again, please also give an answer here. Previous unsigned comment by Special:Contributions/69.108.125.234
data structure is a collection of d,f,a.means that D(Domain),F(Function),A(Axioms) D=this is the range of values that the data may have.this domain is also termed as data object. F=this is set of operation which may legally be applied to elements of data object.this implies that for a data structure we must specified the set of operations. A=this is the set of rules with which the different operation belongs to F actually can be implemented. —The preceding unsigned comment was added by 121.247.167.58 ( talk) 12:24, August 22, 2007 (UTC)
The following editorial tags were added to this article:
This article needs additional citations for
verification. (November 2009) |
This article may require cleanup to meet Wikipedia's quality standards. No cleanup reason has been specified. Please help improve this article if you can. |
Would the editor please be more specific? (Note that if a statement about XXX includes a wikilink to the XXX article, and that article makes the same statement with a reference, then the first statement is not "unreferenced".) Thanks, and all the best, -- Jorge Stolfi ( talk) 05:03, 28 January 2010 (UTC)
Someone tagged as {{dubious}} the assertion that "Assembly languages generally lack support for data structures", noting (in an invisible comment) that "IBM/360 didn't lack support 40 years ago". Perhaps the statement was ambiguous; what was meant is that A.L. do not generally provide special syntax for complex data structures such as arrays and lists. Obviously they do provide syntax for bulk storage allocation, indexing and address computation. Features that are implemented through macro libraries do not count as *language* features. (By comparison, the C language provides facilities for arrays and records, but not for linked lists or trees --- even though one can implement such data structures in C as library types and procedures.) Does this answer the comment? Should the sentence be reworded for clarity? All the best, -- Jorge Stolfi ( talk) 12:55, 1 February 2010 (UTC)
Can we include in the article a list of the more common data structures: array, linked list, hash table, B-tree, heap, graph represented as a matrix, graph represented as a list. Any others? We should make a table of their insertion and removal running times and overhead running space. - Pgan002 ( talk) 08:52, 3 March 2011 (UTC)
Stack, Queue Manihass CH ( talk) 02:46, 23 February 2023 (UTC)
The statement that values are not retrieved from sets is wrong. The HashSet class in Java for example is a concrete implementation of a set which returns values in it, as does the similarly named class in C#.
In the Overview, we currently have: "An object contains data fields, like a record, and also contains program code fragments for accessing or modifying those fields. Data structures not containing code, like those above, are called plain old data structures."
Would it be worth clarifying, that while this is a valid sentence, it really applies in the context of object-oriented programming (which is not the be-all and end-all of programming)? Something like, "In the context of [object-oriented programming], ..."
Chris Alexander UK ( talk) 19:49, 19 May 2014 (UTC)
This revision changed the wording of the 2nd paragraph from
to
It this true? I would say B-tree (or other types of binary tree) indexes are most commonly used. -- Jvs ( talk) 10:51, 24 December 2015 (UTC)
I'm not an expert in computer science, but here is just a remark about something I find confusing and might confuse other readers. In the beginning of the article it says Not to be confused with data type, but in my opinion the difference between the two is not explained, thus it should be pointed out where the difference between the two is. Also it says in the article Data structures serve as the basis for abstract data types, this makes it even more unclear. The wikipedia article on abstract data types contains a list of examples of abstract data types such as "Tree", but if one clicks at this link one gets to the page Tree (data structure). In contrast to that, for some data structures/types there are two separate articles. For instance, there is an article on "Array data type" and "Array data structure". I have the feeling that "data type" tends to be more related to programming language whereas "data structure" tends to be more about the concept itself, but if this is the case, then it should be clearly stated somewhere. Zaunlen ( talk) 17:17, 2 August 2019 (UTC)
Data Structure
The Logical or mathmatical model of particular organization of data is called as data structure.
data structure operation
→data appearing in our data structure is processed by means of certain operations. →1) traversing- accessing each record exactly once so that certain items in the record may be processed.(visiting the record). →2) Searching - Finding the location of the record with a given key value, or finding the location of all records which satisfy one or more condition.
I am surprised that the article defines data structures as efficient. Obviously different data structures may be optimized for different goals, but as far as I remember from CS class a data structure is still a data structure even if it's really inefficient. Do most RS really say that an inefficient data structure isn't? ( t · c) buidhe 06:24, 21 June 2022 (UTC)
In computer science, a data structure is a data organization, management, and storage format that when correctly chosen enables efficient access and modification.
This article was the subject of an educational assignment supported by Wikipedia Ambassadors through the India Education Program.
The above message was substituted from {{IEP assignment}}
by
PrimeBOT (
talk) on 19:52, 1 February 2023 (UTC)
This article was the subject of a Wiki Education Foundation-supported course assignment, between 7 September 2023 and 14 December 2023. Further details are available on the course page. Student editor(s): Artisticrush, Harrisondonnersbach ( article contribs).
— Assignment last updated by Harrisondonnersbach ( talk) 04:17, 12 November 2023 (UTC)
The redirect Active data structure has been listed at redirects for discussion to determine whether its use and function meets the redirect guidelines. Readers of this page are welcome to comment on this redirect at Wikipedia:Redirects for discussion/Log/2024 March 20 § Active data structure until a consensus is reached. Utopes ( talk / cont) 22:05, 20 March 2024 (UTC)
This is the
talk page for discussing improvements to the
Data structure article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Find sources: Google ( books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
This
level-4 vital article is rated C-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Can someone who is a little more familiar with routing tables as data structures take the initiative to clarify this sentence?
The linked article does not really discuss routing tables as a data structure so much as it examines their role in the network ecosystem. "while routing tables enable networks of machines to function" describes their function better, it doesn't really say anything about routing tables as data structures. Perhaps another example altogether would be better?
-- gortsack 18:24, 18 April 2006 (UTC)
My categorization scheme for the links from this page is rather haphazard. If anyone has good ideas on how to organize it, be bold. --BlckKnght
It may be even more haphazard now. Just moved to this page the section on "data tables and functions" from the structure page. It was way too complex for that other page. I didn't attempt to merge it with the prior info on this page, but this is probably needed. -- Panchobook ( talk) 23:40, 23 June 2011 (UTC)
(omitted discussion of my dream of how a Desktop File Browser and integrated Web Browser should be designed) brettz9
Thanks for the suggestions...However, as far as I could tell, Meta-Wikipedia seemed just concerned about general things of concern to Wikipedia itself rather than its specific content.
I was also told that it was all right to put opinions and such in the discuss pages such as this.
I changed the line "This is an incomplete list of data structures:", because it is unprofessionial. —Noldoaran (Talk) 22:15, Feb 14, 2004 (UTC)
In line with standard practice here, the list of data structures should be a free-standing page, separate from this one.
Charles Matthews 09:52, 3 May 2004 (UTC)
The article on Node_(computer_science) contains little info. Ripper234 20:29, 2 April 2006 (UTC)
DEAR WIKIPEDIA PPL. perhaps you should tell me what the fuck a NODE IS instead of telling me that it links to other shit and does other shit. —The preceding
unsigned comment was added by
140.180.153.198 (
talk •
contribs) 04:24, 6 April 2006 (UTC).
DEAR UNINFORMED IDIOT. something that 'links to shit and does other shit' is exactly 'what the fuck' a node is. enjoy —The preceding unsigned comment was added by 81.132.20.207 ( talk • contribs) 13:28, 8 April 2006 (UTC).
I'm un-merging the node article. 140.180.153.198 has a point, that nodes themselves deserve an explanation. -- Snarius 23:33, 3 August 2006 (UTC)
SOMEONE removed this important link http://www.alnaja7.org/Programmer/215/ITCS_215.htm , is there any reason ?? Alhoori 19:01, 20 May 2006 (UTC)
If the content is good it should be there. I haven't checked it, though.
Please tell me what is wrong about the following link which is removed 3 times?
I am not promoting anything and I don't know the author either. This is just a useful link to some valuable academic content, and the author has put his work freely for people to use and learn. So what is undesirable for you about it that you remove it everytime?
If you're going to remove it again, please also give an answer here. Previous unsigned comment by Special:Contributions/69.108.125.234
data structure is a collection of d,f,a.means that D(Domain),F(Function),A(Axioms) D=this is the range of values that the data may have.this domain is also termed as data object. F=this is set of operation which may legally be applied to elements of data object.this implies that for a data structure we must specified the set of operations. A=this is the set of rules with which the different operation belongs to F actually can be implemented. —The preceding unsigned comment was added by 121.247.167.58 ( talk) 12:24, August 22, 2007 (UTC)
The following editorial tags were added to this article:
This article needs additional citations for
verification. (November 2009) |
This article may require cleanup to meet Wikipedia's quality standards. No cleanup reason has been specified. Please help improve this article if you can. |
Would the editor please be more specific? (Note that if a statement about XXX includes a wikilink to the XXX article, and that article makes the same statement with a reference, then the first statement is not "unreferenced".) Thanks, and all the best, -- Jorge Stolfi ( talk) 05:03, 28 January 2010 (UTC)
Someone tagged as {{dubious}} the assertion that "Assembly languages generally lack support for data structures", noting (in an invisible comment) that "IBM/360 didn't lack support 40 years ago". Perhaps the statement was ambiguous; what was meant is that A.L. do not generally provide special syntax for complex data structures such as arrays and lists. Obviously they do provide syntax for bulk storage allocation, indexing and address computation. Features that are implemented through macro libraries do not count as *language* features. (By comparison, the C language provides facilities for arrays and records, but not for linked lists or trees --- even though one can implement such data structures in C as library types and procedures.) Does this answer the comment? Should the sentence be reworded for clarity? All the best, -- Jorge Stolfi ( talk) 12:55, 1 February 2010 (UTC)
Can we include in the article a list of the more common data structures: array, linked list, hash table, B-tree, heap, graph represented as a matrix, graph represented as a list. Any others? We should make a table of their insertion and removal running times and overhead running space. - Pgan002 ( talk) 08:52, 3 March 2011 (UTC)
Stack, Queue Manihass CH ( talk) 02:46, 23 February 2023 (UTC)
The statement that values are not retrieved from sets is wrong. The HashSet class in Java for example is a concrete implementation of a set which returns values in it, as does the similarly named class in C#.
In the Overview, we currently have: "An object contains data fields, like a record, and also contains program code fragments for accessing or modifying those fields. Data structures not containing code, like those above, are called plain old data structures."
Would it be worth clarifying, that while this is a valid sentence, it really applies in the context of object-oriented programming (which is not the be-all and end-all of programming)? Something like, "In the context of [object-oriented programming], ..."
Chris Alexander UK ( talk) 19:49, 19 May 2014 (UTC)
This revision changed the wording of the 2nd paragraph from
to
It this true? I would say B-tree (or other types of binary tree) indexes are most commonly used. -- Jvs ( talk) 10:51, 24 December 2015 (UTC)
I'm not an expert in computer science, but here is just a remark about something I find confusing and might confuse other readers. In the beginning of the article it says Not to be confused with data type, but in my opinion the difference between the two is not explained, thus it should be pointed out where the difference between the two is. Also it says in the article Data structures serve as the basis for abstract data types, this makes it even more unclear. The wikipedia article on abstract data types contains a list of examples of abstract data types such as "Tree", but if one clicks at this link one gets to the page Tree (data structure). In contrast to that, for some data structures/types there are two separate articles. For instance, there is an article on "Array data type" and "Array data structure". I have the feeling that "data type" tends to be more related to programming language whereas "data structure" tends to be more about the concept itself, but if this is the case, then it should be clearly stated somewhere. Zaunlen ( talk) 17:17, 2 August 2019 (UTC)
Data Structure
The Logical or mathmatical model of particular organization of data is called as data structure.
data structure operation
→data appearing in our data structure is processed by means of certain operations. →1) traversing- accessing each record exactly once so that certain items in the record may be processed.(visiting the record). →2) Searching - Finding the location of the record with a given key value, or finding the location of all records which satisfy one or more condition.
I am surprised that the article defines data structures as efficient. Obviously different data structures may be optimized for different goals, but as far as I remember from CS class a data structure is still a data structure even if it's really inefficient. Do most RS really say that an inefficient data structure isn't? ( t · c) buidhe 06:24, 21 June 2022 (UTC)
In computer science, a data structure is a data organization, management, and storage format that when correctly chosen enables efficient access and modification.
This article was the subject of an educational assignment supported by Wikipedia Ambassadors through the India Education Program.
The above message was substituted from {{IEP assignment}}
by
PrimeBOT (
talk) on 19:52, 1 February 2023 (UTC)
This article was the subject of a Wiki Education Foundation-supported course assignment, between 7 September 2023 and 14 December 2023. Further details are available on the course page. Student editor(s): Artisticrush, Harrisondonnersbach ( article contribs).
— Assignment last updated by Harrisondonnersbach ( talk) 04:17, 12 November 2023 (UTC)
The redirect Active data structure has been listed at redirects for discussion to determine whether its use and function meets the redirect guidelines. Readers of this page are welcome to comment on this redirect at Wikipedia:Redirects for discussion/Log/2024 March 20 § Active data structure until a consensus is reached. Utopes ( talk / cont) 22:05, 20 March 2024 (UTC)