by Shahinur | May 18, 2019 | C, C++, Data Structure
A stack is a type of abstract data type. In a stack, data is stored in a sequential list format, and the primary operations, such as adding or deleting an element, occur at one end (top) of the stack. This is why it is referred to as Last In First Out (LIFO). The...
by Shahinur | May 18, 2019 | C, C++, Data Structure
A queue, like a stack, is a type of abstract data type. A queue is an ordered list where data is inserted at one end and deleted from the other end. The end where data is inserted is called the front, and the end where data is deleted is called the rear. A queue...
by Shahinur | May 14, 2019 | Algorithm, Data Structure, Miscellaneous
Suppose we want to add a large number of integers, how long will this operation take? The first question that comes to mind is the number of integers, let’s assume this number is n. Can we specify exactly how long this will take? Yes, we can for a specific...
by Shahinur | May 13, 2019 | C, C++, Data Structure
Structure and union are both user defined data types of C programming language. User defined data type is a data type that the user i.e. the programmer will decide what type it will be. Sometimes we need to do some complex programs when using basic data types is...
by Shahinur | Apr 17, 2019 | C, C++, Data Structure
Arrays and pointers are common in most programming languages. Most importantly, these two data structures are needed everywhere from any moderate to complex program. Here we will try to know details about these two data structures. Arrays and pointers are almost the...
Recent Comments