- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Akhil Sharma has Published 671 Articles
Akhil Sharma
109 Views
A doubly linked list could be an information structure where each node contains a reference to both its previous and following nodes. The program points to preserve the sorted arrangement of the linked list whereas inserting an unused node. In this article, we will learn to create a Golang program ... Read More
Akhil Sharma
77 Views
In Golang, the recovery mechanism provides a way to deal with panic and recover from it. Panic is an unexpected error that can cause the program to terminate. In this article, we are going to discuss what is recovered in golang. Here we are going to use two different methods: ... Read More
Akhil Sharma
663 Views
In Go, race conditions occur when goroutines simultaneously read and write to the same shared memory space without synchronization mechanisms. This can cause data corruption, inconsistent states, or crashes.In this article, we are going to discuss race conditions in golang. Here we are going to use two different methods: Synchronization ... Read More
Akhil Sharma
155 Views
In this article we are going to discuss an overview of Benchmark testing. Benchmark testing is a basic portion of program optimization to grade the execution and productivity of code. In Golang, benchmark testing is backed through the built-in testing bundle. Here we are going to use the Benchmark function ... Read More
Akhil Sharma
89 Views
The purpose of this interface is to provide a contract for implementing cache functionality in various data structures or systems. The Set method is responsible for storing a value in the cache with a specified key, while the Get method retrieves the value associated with a given key from the ... Read More
Akhil Sharma
59 Views
Radix sort is a non-comparative sorting algorithm that works by distributing elements into different buckets based on their significant digits. In this article, we will explore a Golang program that implements radix sort for sorting integers in descending order. Here we are going to use three different methods: Getmax, countsort, ... Read More
Akhil Sharma
271 Views
A binary heap is a specialized tree-based data structure that satisfies the heap property, where the key of each node is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) the keys of its children. In this program, we ... Read More
Akhil Sharma
85 Views
Red Black Tree is a self-balancing binary search tree with additional properties that ensure a balanced tree structure and efficient operations. The delete operation in a Red Black Tree involves rearranging the tree and maintaining the Red Black Tree properties after removing a node. Here we are going to use ... Read More
Akhil Sharma
68 Views
A string in Golang is a collection of characters. Since strings in Go are immutable, they cannot be modified after they have been produced. Concatenating or adding to an existing string, however, enables the creation of new strings. A built-in type in Go, the string type can be used in ... Read More
Akhil Sharma
39 Views
In the Go programming language, a module is a collection of packages and it helps to manage them and their dependencies. In this article, we will create a module with constant using two examples. In the first example, we will create a constant string that will be returned by the ... Read More