Gourab Dasgdcademy.hashnode.dev·Dec 20, 2024Comprehensive Guide to Priority Queue: Algorithms, Pseudo Code, Implementation, and Complexity Analysis1. Simple Queue (Linear Queue) Description: A simple queue follows the FIFO principle, where elements are added at the rear and removed from the front. It uses a fixed-size array to implement the queue, and once full, no new elements can be added. ...10 likesqueue
Gourab Dasgdcademy.hashnode.dev·Dec 19, 2024ADT QueueDefinition: A queue is an Abstract Data Type (ADT) that follows the FIFO principle (First In, First Out). This means elements are added from one end, called the rear, and removed from the other end, called the front. Characteristics of a Queue: Line...10 likes·42 readsqueue
Gourab Dasgdcademy.hashnode.dev·Dec 17, 2024Stack OperationsIntroduction to Stack A Stack is a linear data structure that follows the Last In, First Out (LIFO) principle.It supports the following operations: Push: Add an element to the top of the stack. Pop: Remove the top element from the stack. Peek/Top:...12 likes·62 readsDSA Navigator: Your Exam Companionmakaut
Kushal KarmakarforOCaml for beginnersocaml-for-beginners.hashnode.dev·Nov 16, 2024Beginner of Coding: A Journey from Zero to OCamlWelcome to this blog series dedicated to absolute beginners—people who have no idea what coding is or how to get started. Don’t worry, we’re going to break it all down step by step, and by the end of this, you’ll have the basic knowledge to write you...20 likesmakaut
