ScaleFree

DS & A (DATA STRUCUTRES)

By

| CHAPTER 1 |

What is Data Structures?

Data Structures are any data representations and it's associated operations. It is also defined as the implementation of ADT(Abstract Data Type, We will learn about Abstract Data Type later).

E.g. Integer: Summation
       String: Replace

Note: There are different types of data Structures and no particular data structure is better than the other in all cases, it all comes down to a number of factors depending on which a certain type of Data Structure is suitable for a certain problem. Resource Constraints such as Time consumption and space(memory) availability are the two major factors that determine the efficiency of a certain data structure.
Selecting Efficient Data Structure for a problem
  1. Carefully analyze the problem and figure out the resource constraints. 
  2. Determine the basic operations and quantify the resource constraints for each operation. 
  3. Select the data structure that best meets the requirements. 
Note: In the second point I used the term "quantify" which basically means we have to assign an equivalent or proportional value to the resource constraints which can present a clear image of the efficiency of each data structure. It will also make comparisons between different data structures easier.


Some Key Terms :

Type: A type is a collection of Data. E.g. Integer Type: Collection of integers (1,2,3,4...)

Data Type: A type and a collection of operations that manipulate the type is called Data Type. E.g. Integer Data Type: Integer type and binary operations.

Data Types can be further classified as Atomic Data Type(Integer - no subparts) and Structure Data Type(Array - made of data items).

Data Item: A piece of information of a record drawn from a data type is called Data Item. E.g. true or false: The information is drawn from Boolean Type

What are Abstract Data Types?

Abstract Data Type or ADT can be defined as a definition for a Data Type or a class of objects solely in terms of a set of values and a set of operations on that Data Type. 

So, In terms of ADT Data Structures can be defined as the Physical implementation of ADT.

ADT v/s Data Type...

ADT = Type + Operations and Data Type = Type + Operations. That raises the question, how is ADT different from Data Type? The main difference is :

ADT: An Abstract Data Type(ADT) is the specification of a Data Type within some programming language, independent of an implementation.

Data Type: Data Type is a type with a collection of operation that manipulates the type and is not just specification, unlike ADT.

Logical v/s Physical Form [of Data Items]

Data Items have both Physical and Logical Form.
  • Logical Form: Definition of a data item within ADT. 
  • Physical Form: Implementation of a data item within Data Structure. 
( If you like the content here, follow TSP on social media to get notified on future updates)




Comments

Post a Comment

Share on Social Media

Most Viewed Posts

DS & A (Algorithm Analysis - Best, Worst and Average Case)

By
Image
|  CHAPTER 5  | Note: If it's your first time visiting this website I strongly recommend you to read the previous chapter before reading this chapter. Till now we learned about what Data Structures and Algorithms are, some basic terminologies and a few  concepts  of Algorithm analysis.   And continuing our ongoing journey of Data Structures and Algorithms, today we will discuss the Best Case, Average Case and Worst Case of an algorithm. Algorithm Case Analysis In the last chapter, we learned that every algorithm has running time[T(n)] and a growth rate. But that's not the end of it, an algorithm's running time and growth rate are not the only factors that we should consider while designing an algorithm. For some algorithms, different inputs result in different running time. And that brings forth the necessity of the concept of Best, Average, and Worst Case of algorithms. Example Consider we have four boxes tagged 1,2,3 & 4, and the boxes con
Read more

SPACE & DRAGONS

By
Image
Space and Dragons is a top-down endless space shooter where the player takes on the role of a brave space warrior. In the game, the player has to fight against fierce Space Dragons while making the way through other obstacles such as space debris and much more. FEATURES: SPACE DRAGONS MOVING DEBRIS POWER-UPS HEALTH BOOST SHIELD AND much more SCREENSHOTS...... APPLICATIONS USED : QT Creator (A C++ based framework) GIMP (An Image Manipulation Software) AUDACITY (An Audio Manipulation Software) NOTE: The game resources have been collected from the OpenGameArt website and various other online sources. The used game assets are not my property. GAME DOWNLOAD LINK: DOWNLOAD GAME GAME REQUIREMENTS OS : WINDOWS RAM : 1 GB HARD DRIVE : 150 MB CONTROLS: LEFT, RIGHT keys for movements and SPACE to Shoot SPACE SHOOTER IN ACTION UPDATE << Click here to download the source code >> Zip Password: TheSuperProgrammer NOTE: The game
Read more

DS & A(Queue)

By
Image
|  CHAPTER 14  | In this chapter, our topic of discussion will be the "Queue" Data Structure. But, before we get started, I would recommend you to read the previous chapters on Data Structures & Algorithms  (especially the chapters on Array List , Linked List , Array Stack , and Linked Stack ), that is in case it's your first time visiting my blog. Queue: Just like Stacks, Queues also are a restricted version of List but with a few minor differences compared to Stack. The following are some of the notable characteristics of a Queue: Data can only be inserted from the rear/back. Data insertion is referred to as  ENQUEUE . Data can only be deleted from the front. Data deletion is referred to as  DEQUEUE . Alternatively,  ENQUEUE  and  DEQUEUE  should always be executed on the opposite ends of the Queue. A Queue follows the  FIFO (First In First Out)   principle. The first and the last elements are referred to as FRONT and REAR respectively.
Read more