Difference between array and abstract data types, Data Structure & Algorithms

Difference between array and abstract data types

Arrays aren't abstract data types since their arrangement in the physical memory of a computer is an essential feature of their definition and abstract data types abstract from all details of implementation on a computer. However, we can discuss arrays in a "semi-abstract" fashion which abstracts some implementation details. Definition above abstracts away the details about how elements are stored in contiguous locations (which indeed does vary somewhat among languages). Additionally, arrays are typically types in procedural programming languages, so they are treated such as realizations of abstract data types even though they are really not.

 

Posted Date: 9/19/2013 5:35:30 AM | Location : United States







Related Discussions:- Difference between array and abstract data types, Assignment Help, Ask Question on Difference between array and abstract data types, Get Answer, Expert's Help, Difference between array and abstract data types Discussions

Write discussion on Difference between array and abstract data types
Your posts are moderated
Related Questions
This question is based on the requirements of a system to record band bookings at gigs. (A 'gig' is an event at which one or more bands are booked to play). You do not need to know

What is a linear array? An array is a way to reference a series of memory locations using the similar name. Every memory location is shown by an array element. An  array elemen

A telephone directory having n = 10 records and Name field as key. Let us assume that the names are stored in array 'm' i.e. m(0) to m(9) and the search has to be made for name "X"

(a) Describe the steps involved in the process of decision making under uncertainty. (b) Explain the following principles of decision making: (i) Laplace, (ii) Hurwicz. (c

Q.1 Write procedures/ Algorithm to insert and delete an element in to array. Q.2. Write an algorithm for binary search. What are the conditions under which sequential search of

Question 1 Write the different characteristics of an algorithm Question 2 Explain in brief the asymptotic notations Question 3 Write an algorithm of insertion sort and e

Memory Allocation Strategies If it is not desirable to move blocks of due storage from one area of memory to another, it must be possible to relocate memory blocks that have be

Linked lists are among the most common and easiest data structures. They may be used to implement various other common abstract data types, including queues, stacks, symbolic expre

I need a person who has a good background in using R. Studio? In adition, a person who is good in using algorithms.

Problem 1. Explain about the doubly linked list with neat diagram. Diagram Explaining doubly linked list 2. Explain what are the criteria to be used in evaluatin