Classification or Data Structure Assignment Help

Assignment Help: >> An introduction to data structures >> Classification or Data Structure

Classification or data structure

Data structures are normally divided into two broad categories.

1 Primitive data structures

2 Non- primitive data structures/composites structures

Primitive Data Structure

These are basic structures and are directly operated upon by the machine instructions. These in general have different representations on different computers. Integer floating- point numbers character constants string constants pointers etc. fall in this category. You have already under-stood the way these are represented in computer memory.

Non-Primitive Data Structures

               These are more sophisticated data structures. These are derived from the primitive data structures. The non-primitive data structures emphasize on structuring of a group of homogeneous (same type) or heterogeneous (different type) data items. Arrays, lists and files are examples.

               The design of an efficient data structure must take operations to be performed on the data structure into account. For example, consider a data structure consisting of a set of data items. The data structure is to be manipulated in a number of major program functions. After evaluating the operations to be performed on the data structure an abstract data type is defined to use it in subsequent programs.

               The most commonly used operations on data structure are broadly categorized into four types.

1 CREATE

2 DESTROY OR DELETE

3 SELECTIONS

4 UPDATION

               The CREATE operation results in reserving memory for the program elements. This can be done by declaration statement. The creation of data structure may take place either during compile-time or during run-time. On the other hand, DESTROY operation destroys the memory space allocated for the specified data structure. Malloc and free function of C language are used for these two operations respectively (as far as dynamic memory allocation and deal location is concerned)

               The SELECTION operation deals with accessing a particular data within a data structure. And the last operation UPDATE as the name implies, it updates or modifies the data in the data structures. Probably new data may be entered or previously stored data may be deleted.

Other operations performed on data structure include:

Searching

Sorting

Merging

Data Structure & Algorithms Assignment Help, Live Experts 

Struggling with data structure problems? Data structure subject is quite tough to learn? Need quick assistance in data structure questions? ExpertsMind.com is right place for you where your search ends, We at ExpertsMind offer online data structure assignment help, data structure homework help and data structure and algorithms question's answers by best online support by qualified tutors.

ExpertsMind.com - Classification or Data Structure Assignment Help, Classification or Data Structure Homework Help, Classification or Data Structure Assignment Tutors, Classification or Data Structure Solutions, Classification or Data Structure Answers, An introduction to data structures Assignment Tutors

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd