| THE SUPER PROGRAMMER |

| 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 Carefully analyze the problem and figure out the resource constraints.  Determine the basic operations and quantify the resource constraints for each operation.  Select the data structure that best meets the requirements. 

| Introduction | I will, in fact, claim that the difference between a bad programmer and a good one is whether he considers his code or his data structures more important. Bad programmers worry about the code. Good programmers worry about data structures and their relationships. - Linus Torvalds One might have learned all the fundamental concepts of a programming language and might be really experienced as well. But does that make that person an efficient programmer? Not necessarily. One must have a proper understanding of Data Structures and Algorithms to be an efficient programmer. Now, people might say why study data structures and algorithms, and why waste time making programs efficient when computers are getting faster every year? The reason is, hardware upgrade merely adds on to the efficiency as the problem complexity  increases(That appears to be some fancy jibberish, but hold on for now. You will learn more about it in Chapter 6). To operate on  any data we