Series

CS fundamentals

[CS fundamentals] Linked List Creation & Insertion explained in C.
Introduction In this article, we will look at fundamentals of linked lists. Linked list is a really powerful data structure especially when you deal with insertion and deletion. Imagine an array with
May 18, 20268 min read
[CS Fundamentals] Pointers in C
Introduction In this article, I will be talking about pointers in C. Pointers might be a bit hard concept for beginners, but they are essential to understand what your programs are doing. Moreover, th
Mar 25, 20265 min read6
[CS Fundamentals] Binary Search
Idea Binary Search is a powerful algorithm to search for a certain value. If you were to find 3 in an array = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], how are you going to come up with the index of 3? The first method that pops up in your head would be lookin...
May 19, 20253 min read5
[CS Fundamentals] Sorting Algorithms
Selection Sort Selection sort is the simplest way to sort an array. Pretend that index 0 is the smallest, and we look at each element. We select the smallest element from other index and swap the two elements. array = [5, 7, 9, 0, 3, 1, 6, 2, 4, 8] ...
May 12, 20254 min read2
[CS Fundamentals] DFS and BFS
In this article, I will introduce the basic concept of Depth-First Search(DFS) and Breadth-First Search(BFS). Both focuses searching, but the difference is the way of doing it. DFS To understand DFS, you need to know stack and recursive function. I ...
May 11, 20253 min read6
[CS Fundamentals] Thread Synchronization: Semaphore, Mutex, and Lock
Semaphore vs Mutex Semaphore In a multi-threaded environment, your program might run into a problem if more than one threads are trying to acquire a shared resource at the same time. Semaphore is a synchronization tool used in programming to manage a...
Jan 23, 20253 min read13

Command Palette