DS Through C Archive
Introduction to Data structures: Programming languages are C, C++, Java, .Net, Python… Programming languages are used to develop applications. We use applications in communication process. Applications store and process the information in communication. Note: We …
Abstract Data type(ADT): Abstraction is the concept of hiding un-necessary details and shows only essential features. Abstract type of function is called Prototype of function. The technical representation of functionality is called Abstract type. We …
Static v/s Dynamic memory: In C application, we can allocate the memory to store the information in 2 ways Static – fixed size Dynamic – size varies Static memory: All primitive data types having fixed …
Stack: Stack is a linear data structure. Stack is an ordered list of similar data type. Stack in which elements follow a specific order and operations will be performed. Note: We create Stack using arrays, …
We can create the Stack in 2 ways: Static type – Fixed size Stack using arrays Dynamic type – Stack using pointers Stack using Arrays: We can implement Stack using arrays. Initially we create array …
Stack Implementation using pointers: In this implementation we use dynamic functionality of arrays. Dynamic stack means, the Stack with specified initial capacity and the capacity shrinks and grows depends or insertion and deletion of elements. …
Queue: Queue is linear data structure It follows First in First out (FIFO) rule. Inserting elements from one end called “REAR”. Deletions from another end called “FRONT”. Note: Front is fixed in Queue Queue ADT: …
Static Queue: We can use simple array with fixed size. All operations need to perform using 2 variables Front and Rear. Front is always pointing to Front location that is 0 index. Declaration of Queue …
