Sahiqur Rahman Tipu's repositories
Problem-Solving-Using-CPP
Problems solved by C++ language.
Complete-Binary-Tree
A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible. A complete binary tree each parent's has maximum two child and minimum zero child.
Binary-Search-Tree-Algorithm
A Binary Search Tree (BST) is a tree in which all the nodes follow this properties. The value of the key of the left sub tree is less than or equal to the value of its parent (root) node's key. The value of the key of the right sub tree is greater than the value of its parent (root) node's key.
Deque
A deque, also known as a double-ended queue, is an ordered collection of items similar to the queue. It has two ends, a front and a rear, and the items remain positioned in the collection. In a sense, this hybrid linear structure provides all the capabilities of stacks and queues in a single data structure.
Circular-Queue
A circular queue is the extended version of a regular queue where the last element is connected to the first element. Thus forming a circle-like structure. The circular queue solves the major limitation of the normal queue. In a normal queue, after a bit of insertion and deletion, there will be non-usable empty space. It is also called 'Ring Buffer'. In a circular queue, the new element is always inserted at Rear position.
Queue
Queue is a special type of data structure that stores the elements in FIFO style (First In First Out) or LILO (Last In Last Out) exactly opposite of the Stack. It has Enqueue(),Dequeue(),Peek(),IsEmpty(),Clear(),Contains() methods and Count property.
Stack
Stack is a special type of data structure that stores elements in LIFO style (Last In First Out) or FILO (First In Last Out).It has Push(),Pop(),Peek(),Clear(),Contains() methods and Count property.
Singly-Linked-List
Linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next. In this project try to make Insertion , deletion and traversing a node using Singly Linked list.
Linear-Search-Algorithm
Linear search algorithm also known as sequential search algorithm. It sequentially check every element of list until found the desired or search element. So its complexity is higher than binary search algorithm.
Binary-Search-Algorithm
Binary search is a searching algorithm which uses divide and conquer approach. In searching, it is more efficient than linear search algorithm. where linear search worst and average case complexity is O(n) binary search complexity is O(log n) only.
Static-and-Instance-Member-Of-Class
Static member can not accessed by instance or object of a class. Only class can access it. On the other hand, instance member of a class can be accessed by class instance or object.
Generic-Collection-List
In C#, List<T> is the generic version of the ArrayList that comes under System.Collection.Generic namespace.List is type safe data collection.
Sorting-Algorithms
About all sorting algorithms solved by python language.
C-Sharp-Build-In-Stack
Generic and Non-Generic Stack.
Single-Inheritance
One base class and one derived class.
Ecommerce_Project
This is a simple e-commerce project. I developed this project from scratch by using Asp.Net Core Mvc.
URI-Problem-Solution
My problem solving journey starts with C language. I solved about 100+ problems in uri online judge some of them are here.