answersLogoWhite

0


Best Answer

Data structures are a way of storing and organizing data on a computer so that it can be used in a way that is most efficient and uses least resources. Algorithms are step by step processes for calculations which are used for data structures.

User Avatar

Wiki User

10y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

13y ago

Top store a collection of data for a given subject in one place. Think in terms of the address book in an email program.

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What are data structures and algorithms used for?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Engineering

What Program that will display the even numbers in data structures and algorithms?

JAVA


Data Structures and Algorithms in Java?

Data structures has been implemented in Java language already, you just need to import it and start using it. Data Structures are located in Java.util packages.ArrayArraylistVectorHashMapHashTableLinkedListStackQueueCollection this are the few I know.Thanks,Anandkumar.R


What is the importance of data sturture in a programming language?

According to Wikipedia-"In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.Data structures are used in almost every program or software system. Data structures provide a means to manage huge amounts of data efficiently, such as large databases and internet indexing services. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design."


What do you mean by data structure and briefly explain any two data structures important for computing algorithm?

In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.[1][2] Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, B-trees are particularly well-suited for implementation of databases, while compiler implementations usually use hash tables to look up identifiers. Data structures are used in almost every program or software system. Specific data structures are essential ingredients of many efficient algorithms, and make possible the management of huge amounts of data, such as large databases and internet indexing services. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design


The main emphasis of procedure-oriented is on algorithms rather than on data?

the main emphasis of procedure oriented programming is on algorithms rather than on data

Related questions

Forests used in data structures and algorithms?

A Forest is a disjoint union of trees


What has the author Thomas A Standish written?

Thomas A. Standish has written: 'Data structures, algorithms, and software principles' -- subject(s): Computer algorithms, Data structures (Computer science), Software engineering 'Data structure techniques' -- subject(s): Data structures (Computer science)


What Program that will display the even numbers in data structures and algorithms?

JAVA


What has the author Robert E Tarjan written?

Robert E. Tarjan has written: 'Data structures and network algorithms' -- subject(s): Computer algorithms, Data structures (Computer science), Trees (Graph theory)


Data Structures and Algorithms in Java?

Data structures has been implemented in Java language already, you just need to import it and start using it. Data Structures are located in Java.util packages.ArrayArraylistVectorHashMapHashTableLinkedListStackQueueCollection this are the few I know.Thanks,Anandkumar.R


What has the author Gregory L Heileman written?

Gregory L. Heileman has written: 'Data structures, algorithms, and object-oriented programming' -- subject(s): Computer algorithms, Data structures (Computer science), Object-oriented programming (Computer science)


What are data structures and algorithms in C?

algorithm is a step by step procedure to solve a problem in c,


What has the author Zbigniew Michalewicz written?

Zbigniew Michalewicz has written: 'How to solve it' -- subject(s): Heuristic, Mathematical recreations, Problem solving 'Genetic algorithms + data structures = evolution programs' -- subject(s): Computer algorithms, Computer programs, Data structures (Computer science), Evolutionary programming (Computer science), Genetic algorithms


What has the author Sanjiv Kapoor written?

Sanjiv Kapoor has written: 'Topics in the design and analysis of combinatorial algorithms' -- subject(s): Combinatorial analysis, Computer algorithms, Data processing, Data structures (Computer science)


What has the author Prakash V Ramanan written?

Prakash V. Ramanan has written: 'Topics in combinatorial algorithms' -- subject(s): Combinatorial analysis, Computer algorithms, Data processing, Data structures (Computer science)


What is the importance of data sturture in a programming language?

According to Wikipedia-"In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.Data structures are used in almost every program or software system. Data structures provide a means to manage huge amounts of data efficiently, such as large databases and internet indexing services. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design."


What do you mean by data structure and briefly explain any two data structures important for computing algorithm?

In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.[1][2] Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, B-trees are particularly well-suited for implementation of databases, while compiler implementations usually use hash tables to look up identifiers. Data structures are used in almost every program or software system. Specific data structures are essential ingredients of many efficient algorithms, and make possible the management of huge amounts of data, such as large databases and internet indexing services. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design