Blog

Memory Allocation/Linked List Method’s Link        Introduction A linked list is also known as a ‘Self Referential Structure‘ because a member of the structure/node is declared as a pointer that points to the same (but another) structure/node in …

Click Here for Dynamic Memory Allocation/De-allocation Methods Click Here for Difference between Malloc() and Calloc() Introduction of Fundamental of Data Structure Data structures are used in almost every program/software system. It is a data storage format to store different types …

Array & Linked List Difference between in DS    Slno. Array Linked List 01. They are static, i.e. size of an array is fixed. They are dynamic, i.e. size of a list is not fixed. 02. Memory is allocated/formed in the …

The popular Reference Books in DS(Data Structure) are : Slno. Book Names Publications Author/Writer 1. C & Data Structures S. Chand Publications N.B. Venkateswarlu & E.V. Prasad 2. Data Structures using C Oxford Publications Reema Thareja 3. Data Structures in …

Topics wise Interview Questions in DS Introduction & Fundamentals of DS Ques. : What is Data Structure? Ques. : What is the use of Data Structure in computers? Ques. : What are the types of Data Structures? Ques. : What …

Miscellaneous Topics in DS or Data Structure Terminology Abstract Data Type(ADT) Abstract Data Types are a fundamental concept in computer science that allows developers to think about data structures at a high level, focusing on what they can do rather …

Sorting Introduction of Sorting It puts items in a list into a specific order for further use. Definition of Sorting Sorting is the process/technique of re-arrangement of data items (stored inside the memory) in some specific order(such as either in ascending …