ScaleFree

DATA STRUCTURES AND ALGORITHMS

By

| 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 need to follow three major steps :
  1. Receive the Input 
  2. Process the Input
  3. And Return the Output
The use of the term "any data", above, suggests that data is the common ground for every programming language since all programming languages in one way or the other are tools for manipulating data. So, we can conclude that program efficiency has very little to do with the programming language being used, what really matters is the organization of data aka Data Structure. So, no matter what programming language one uses and no matter how flexible the language is, it cannot be used as an excuse to not learn Data Structures and Algorithms.


That being said one shouldn't misinterpret program efficiency for clean coding because those are two completely different topics. Creating efficient programs is nothing like "Programming Tricks", but is the good organization of Data (Data Structure) and use of optimal methods(Algorithm) determined, by means of careful calculation, to solve a problem.
And throughout this course, you will be learning all the necessary concepts to master data structures and algorithms, so that you can code like a PRO!!!

CHAPTERS

  1. DATA STRUCTURES (CLICK HERE)
  2. PROBLEMS, ALGORITHMS & PROGRAMS (CLICK HERE)
  3. ALGORITHM EVALUATION (CLICK HERE)
  4. ASYMPTOTIC ANALYSIS (CLICK HERE)
  5. BEST, WORST & AVERAGE CASE OF AN ALGORITHM (CLICK HERE)
  6. FASTER COMPUTER OR FASTER ALGORITHM? (CLICK HERE)
  7. MEASURES OF ALGORITHM COMPLEXITY (CLICK HERE)
  8. EXAMPLES (CLICK HERE)
  9. ARRAY LISTS(CLICK HERE)
  10. POINTER LISTS(CLICK HERE)
  11. ARRAY LISTS v/s POINTER LISTS(CLICK HERE)
  12. STACKS - ARRAY BASED(CLICK HERE)
  13. STACKS - POINTER BASED(CLICK HERE)
  14. QUEUE(CLICK HERE)
    15. ( 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