• Home
  • University of the People
  • Data Structures (proctored course) CS 3303
  • Understanding Data Types and Structures

Understanding Data Types and Structures

· Type is a classification which identify one of various data types, the operations that can be done on values of that specific type, the meaning of the data held, and ways the value of that type can be stored. · Data Item is the smallest unit of data that can be manipulated in a computer program. It holds a single value, such as a number or string. · Data Type is a specific kind of data item, as defined by the values it can take, the programming language used, or the operations that can be performed on it. Examples of are decimal, string integers, floats, etc. . Abstract Data Type (ADT) is a high-level description of how data is viewed and the operations that can be performed on it. An abstract data type (ADT) is the realization of a data type as a software component (Shaffer, 2011). Abstracts give an implementation independent view. The process of hiding the details of an ADT's implementation is known as abstraction. · Data Structure is a way to organize and store data in a computer in order to be accessed and modified efficiently. · Class is a blueprint to create new objects providing initial values and implementations of its behavior such as member functions. . Member Function refers to the functions that belong to a class and they can be called using instances of that class. They are used to manipulate instance variables of the class. . Data Members are the variables declared within a class. They store the data associated with the objects of that class. Each of these terms is related to the others as they all contribute to the way data is defined, organized, and manipulated in a computer program. For example, a class in an object-oriented program might be designed to implement a specific abstract data type and data structure, using specific data types for its data members, and providing member functions to manipulate these data items. Reference: Shaffer, C. (2011). A Practical Introduction to Data Structures and Algorithm Analysis. Blacksburg: Virginia. Tech.