Stacks in Data Structure

Hello  everyone!
The linear arrays discussed in the previous posts allows one to insert and delete at any position in the list – at the beginning, at the middle or at the end. There are certain frequent situations in computer science when one wants to restrict insertions and deletions so that they can take place only at the beginning or at the end of the list, not at the middle. Two of the data structures that are useful in such situations are queues and stacks. In this lesson, we are going to study more about stacks!

Searching in Data Structures

Hey Guys! How're you doing?
Today we would look at another data structure operation, performed on linear arrays; Searching. This operation can be imagined as a person trying to search for a record amongst a list of records. Naturally we would also try to perform our search in the fastest possible time. Hence let us study more about searching in data structure, along with the two different approaches we can follow to perform searching in data structures, namely Linear Search and Binary Search.

Traversal, Insertion & Deletion in Arrays

Hello people! How are you?
In this lesson we would be performing insertion, deletion and traversal in an array. These are pretty straight forward data structure operations which I do not think you guys would have much difficulty in understanding. Hence lets get started!

Algorithms, Complexity and Space-Time Tradeoff

Hey guys! How're you doing!
Today we will go through another conceptual topic of Algorithms and the related terminologies like Space-Time Tradeoff and Complexity of an algorithm. Hence lets get started!

Data Structures | Introduction and Types

Hello everyone! Today we are going to start with a new topic in general. Data Structures! Hence lets get started with an introduction!

Bresenham’s Circle Algorithm

Hey guys!
Today we will be learning another approach to drawing circles in Computer Graphics. Basically another approach to the same task we tackled in the previous post. Bresenham’s Circle Algorithm follows the footsteps of Midpoint Circle Algorithm, both working for the same purpose in slightly different ways. Let us see how.

Graphic Design | Midpoint Circle Algorithm

Hi guys! How're you doing?
If you've been following me, we have studied of two methods that help us in drawing a line; The DDA and Bresenham Line Algorithm. We would now want to hence extend our knowledge and draw different things, more complex than a line, isn't it? Here you have it, today we would learn about a method to draw circle. The Mid-Point Circle Algorithm!

Graphic Design | Bresenham's Line Algorithm

Hey guys! How are you doing?

In the last post here we learnt about the Digital Differential Analyzer Algorithm. It helps us to plot lines in a very easy way. However it is not the very best of the available approaches we have when it comes to plotting a line.
For example, we have another technique called the Bresenham's Line Algorithm which we are going to study today, which is a much better approach than the Digital Differential Analyzer Algorithm we studied earlier, here.

Article Inspirations, Sources and Acknowledgements

This article contains the possible sources referred to which subsequently helped in providing necessary motivation or the precise and lucid information, text or images that we try by all means to provide to our viewers, the ones we could not acknowledge elsewhere. This page can help anyone and everyone who wishes to check for acknowledgements, first and also second, those who wish to extend their knowledge on the topic by referring to these sources themselves, the ones we found absolutely awesome. The list will be updated as and when it needs to be. Here you have it:

Graphic Design | Digital Differential Analyzer (DDA) Algorithm

Heyo everyone! How're you doing?

Today we are going to understand a very basic algorithm in Computer Graphics, The DDA or Digital Differential Analyzer Algorithm.

Now before we get started, we should get an understanding about what DDA is and also rather what an algorithm is.

Now DDA is a line drawing algorithm. From all I can say right now, DDA is a basic algorithm used to print lines on your standard output ie. the monitor using, well, the starting point and the ending point of the lines, the starting and ending coordinate of the line that you are going to plot.