Articles

Divide and conquer strategy is as popular as the Taj Mahal is in India. It’s a very powerful strategy and is extensively used by elite people and political leaders to control masses in such a way that the common people don’t unite and rebel against them.

There is a lot more to structures and unions. I’ll go through what I’ve learned about them here. I’m assuming that you’re not a beginner in C language. To store or manipulate data in the computer’s memory we need to write a computer program that’ll instruct the compiler or the interpreter to allocate space for the data in the memory.

I watched one of his debates on YouTube. And that’s how I got to know about this amazing politician, orator, and writer. His Lok Sabha speech on demonetization of ₹500 and ₹1000 notes enthralled me.

Literature festivals are a concoction of various sessions that comprise book launch events, interactive discussions and spicy debates. Since 2012, Kolkata Literary Meet is being organised every year in January on the grounds of Victoria Memorial and some sessions are held in Calcutta Club too.

After seven long years, I went to Gorakhpur in Uttar Pradesh, a state in Northern India, along with my parents and some of my relatives from Kolkata. It is a city, located along the banks of the Rapti River and is near the India-Nepal border, wherein two of my uncles and one of my aunts live.

Queue is a linear data structure like stack and linked list. It follows FIFO (First-in, First-out) or LILO (Last-in, Last-out) policy. It has two main operations - enqueue (insert element; can only be inserted at the rear of a queue) and dequeue (remove element; can only be removed from the front of a queue).

What a teacher is, is more important than what she teaches. Karl Menninger

Linked List is a linear data structure like stack and array. Unlike arrays, linked list elements are not stored at contiguous locations in memory. Each element (say a node) in a linked list has two parts - one is the data part that stores the input data and the other is the next part which is basically a pointer variable that stores the memory address of the next element.

Stack is a linear data structure. It follows LIFO (Last-in, First-out) policy. It has two main operations - push (insert element onto stack) and pop (delete element from stack). Stack has two exceptions - underflows (if we attempt to pop an empty stack) and overflows (trying to push an element on a full stack).

I’m a sophomore now and have data structures and algorithms courses this semester. I’ll try to explain to you what they mean. I want to stress that you need to learn them by heart to be a better programmer.