Abstract Data Structures - Essay Example

DATA STRUCTURES By Table of Contents Introduction A data type is acknowledged as an data type when it is expressed in terms of processes on it, and its implementation is concealed (with the intention that it can be replaced with another application such as effectiveness purposes, as well as this will not change anything in the existing computer program). In fact, the majority of object-oriented programming languages encompass the characteristics of user defined abstract data types. For example in C++ this operation can be performed by using a class that has no protected/public data members (simply private), nor some techniques, nor friends that return references/pointers to some of the private fields (C2, 2008). This paper presents an overview of various abstract data structures that are used in computing. An Overview of Abstract Data Type The design of a computer program can be made much easier and simpler by making use of the abstract data structures. In this scenario, the program’ data and information can be arranged into abstract data structures (or simply ADS). For instance, we can use arrays (where an array is a set or sequence of consecutive memory locations that has the same name and same type) to form a table that has 3 columns and an undefined number of rows, in the scenario of an array with 2 dimensions: 1-a huge amount of rows, and 2three columns. In addition, a vital characteristic of contemporary computer programs is the capacity to operate abstract data structures with measures or techniques that are pre-defined by the software designer or programmer. However, for this purpose data structure should be used cautiously, with consideration, and in detail (Schmalz, 2007). Sometimes the term ‘abstract data structure’ is used in place of abstract data type. The basic idea here is that we are involved in the real structures to store data. In this scenario, the one most simple abstract data structure is the Linked List. Basically, a linked list is described through the techniques that are applied on it, which includes tail, head, cons and is-empty. In addition, a list based data structure is an ordered linear structure. In this scenario, its head is the initial element in line; list data structure tail is the list composed of all the elements besides the first. The cons of an element of a list is the list data structure whose head is that element, as well as whose tail is the unique list. Moreover, a list can be empty; in that scenario it could generate an error if someone attempts to access its tail or head; however an element can be considered to it to have a new list (Huntbach, 1999). What is Abstraction? The fundamental idea of abstraction is that a data type should be described simply in the form of processes that are applicable on objects of its kind, not in scenario of how the category is applied on a real computer (for example, an array or a stack). In this scenario, the objects of a specific category are built and checked simply through processes calls that raise the access functions for that particular type. In addition, it allows the programmers to change the data type without making any change outside the module of code in which that type is defined. Moreover, a common instance of an abstract data structure is a stack. In this case functions can be performed to generate an empty stack, to drive values onto a stack, as well as to pop values from a stack (BookRags, Inc., 2012). Main Features and importance for Computing From the perspective of abstract data structures, an abstract class is a class that does not encompass an application for one or more techniques. In fact, the abstract data structures do not have any direction of what to perform in response of a call to the process that is abstract. In addition, in order to generate an object for the abstract class we need to generate a real subclass and create an object for it to access it (GeekInterview, 2007; BookRags, Inc., 2012; C2, 2008). Additionally, an abstract class can encompass concrete techniques and fields. Actually, an abstract class can work fine without having some abstract techniques. In this scenario, the abstract modifier basically specifies that the class is not instantiated. In addition, we cannot generate an object for object class as it is believed to be utilized in inheritance hierarchy. In this scenario, the abstract class can hold abstract techniques that the inherited class should apply. As well, the abstract class cannot hold an abstract technique however can be defined abstract immediately in an attempt to stop instantiation. Moreover, in order to generate objects we need to make use of new keyword mentioning ultimately the size to deal out the memory. In view of the fact that we do not have knowledge of the size occupied by abstract techniques consequently we are not able to create object for abstract methods (GeekInterview, 2007; BookRags, Inc., 2012; C2, 2008). Furthermore, an abstract class is a partial class (it is a class that performs as Prototype Model for actual classes). In addition, an abstract class can have one or more pure virtual programming functions. Therefore, as being an instantiation of an object of similar class, the compiler is not capable to put the reference for all the member functions, therefore the formation of an object of simpler class (abstract class) can cause compiler error, as well as do not allow a programmer to create it (GeekInterview, 2007; BookRags, Inc., 2012; C2, 2008). Usefulness Abstract data types allow the programmers to create the instances with distinct and well-defined characteristics and operations. In addition, in object-oriented programming languages, abstract data types are known as classes. Consequently, a class is defined with the properties of objects that are the instances in an object-oriented paradigm. Basically, the abstract data types define operations by paying greater attention to the concerned data, their structure, operations and prerequisites. Thus, the object-oriented programming is basically the “programming with abstract data types” for the reason that it combines the functionality of a variety of ADTs to solve a problem. In this scenario, instances (objects) of ADTs (classes) are dynamically generated, destroyed and utilized (Mueller, 1997). Conclusion A data type is acknowledged as an abstract data type when it is expressed in terms of processes on it, and its implementation is concealed (with the intention that it can be replaced with another application such as effectiveness purposes, as well as this will not change anything in the existing computer program). In fact, the majority of object-oriented programming languages encompass the characteristics of user defined abstract data types. This paper has presented a detailed analysis of various “abstract data structures” used in computing. This paper has discussed the importance of abstract data types in object oriented programming languages. References BookRags, Inc., 2012. Abstract Data Types. [Online] Available at: http://www.bookrags.com/research/abstract-data-types-wcs/ [Accessed 28 March 2012]. C2, 2008. Abstract Data Type. [Online] Available at: http://c2.com/cgi/wiki?AbstractDataType [Accessed 25 March 2012]. GeekInterview, 2007. Why can't we create object for an abstract class? [Online] Available at: http://www.geekinterview.com/question_details/50704 [Accessed 28 March 2012]. Huntbach, M., 1999. The List Abstract Data Structure. [Online] Available at: http://www.eecs.qmul.ac.uk/~mmh/ItP/resources/lists.html [Accessed 26 March 2012]. Mueller, P., 1997. 3 Abstract Data Types. [Online] Available at: http://www.desy.de/gna/html/cc/Tutorial/node4.html [Accessed 26 March 2012]. Schmalz, M.S., 2007. PASCAL Programming: § 5: Abstract Data Structures and Files. [Online] Available at: http://www.cise.ufl.edu/~mssz/Pascal-CGS2462/ADS-files.html [Accessed 28 March 2012]. Read More