What is the difference between a data structure and a data type?

A data structure is a way of describing a certain way to organize peices of data so that operations and alogrithms can be more easily applied. For example tree type datastructures often allow for efficient searching algorithms.
A data type describes peices of data that all share a common property. For example an integer data type describes every integer that the computer can handle. Often when refering to data types in practice you will be referencing primitive data types which are the most basic data types of a programming language for example int, string or array. However in some languages like C you can define your own data types for example a data type of `person` could contain a string labled `name` and an integer called `age` which could be used to store the information for any person with an age and a name.

Answered by Tom B. Computing tutor

28583 Views

See similar Computing GCSE tutors

Related Computing GCSE answers

All answers ▸

how do you convert binary to a form in which you can perform subtraction?


What are the differences between a stack and a queue?


What is stepwise refinement in top down programming?


What is an operating system.


We're here to help

contact us iconContact usWhatsapp logoMessage us on Whatsapptelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2024

Terms & Conditions|Privacy Policy