Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
SIMM and DIMM are types of memory modules which are designed to eliminate the use of Dual Inline Package (DIP) chips because the installation of DIP chips is difficult. The basic difference between the two is that SIMM has only one side that is usable at a time because it has only one set of connector, whereas DIMM has different usable pins at each side. Read this article to learn more about SIMM and DIMM and how they are different from each other. What is SIMM? SIMM stands for Single In-Line Memory Module. SIMM is a type of memory module ... Read More
In Go programming language, a tree is a data structure in which each node has a value and zero to many nodes as children. The root node is the node without a parent, while the leaf node is the node without children. Trees can be employed for a variety of tasks, including data storage, sorting, and searching in hierarchical structures. We will use two methods to count no. of leaf nodes in a tree. In the first method TreeNode struct is used whereas queue is used in the second example to execute the program. Method 1: Using TreeNode Struct This ... Read More
In Go programming language, pre-order traversal is a tree traversal technique in which the root node is visited first, then the left subtree, and finally the right subtree. A recursive function is used that calls itself on the root node, the left child node, the right child node, and finally the left child node again. When the node is nil, the recursion's basic case, occurs. We will execute pre-order traversal in this program using two methods- the TreeNode struct and the stacks. Method 1: Using TreeNode struct This method builds a tree node structure With a Value field, a pointer ... Read More
In Golang data structures, a linked list is the one that contains nodes which contains two fields: a next pointer and the data of the list. We will use two methods to detect a loop in linked list. In the first method two-pointer approach will be used and in the second example maps are used to execute the program. Let’s go through those examples to understand the execution. Method 1: Using two-pointer approach In this method, the linked list is traversed using a low pointer and a high pointer. While the high pointer advances two steps at a time, the ... Read More
In golang data structures , a linked list has pointers connecting the items, and from the first node (head) to the last node, each node can be visited (tail) using next pointer. We will obtain the middle element of a linked list using two methods. The first approach depicts use of two-pointer approach and the second approach uses a counter variable to execute the program. Method 1: Using two-pointer approach In this method, the function navigates the linked list using two pointers, low and high. The high pointer takes two steps at a time, whereas the low pointer takes ... Read More
In Go programming language, a linked list is a linear data structure made up of a series of nodes which are linked to each other via next pointer, which points to the next address. We will implement linked list in this program using two methods. In the first method struct will be used and in the second example list struct will be used. Method 1: Using Struct In this method, there are three nodes in this linked list, and each one has a value of 1, 2, or 3. Each node's next pointer points to the node after it in ... Read More
In Golang, a dictionary is like a map which is a group of key-value pairs with a unique key for each value. The values can be of any type, and the keys can be of any type that is similar, such as strings or integers. We can build an empty map by using the built-in "make" function, and then add, retrieve, or update values. We will use two examples here to iterate through elements of a dictionary where in the first example loop will be used to iterate through the elements whereas in the next example slices will be used ... Read More
In Golang, a collection is a data structure that stores a number of elements, usually of the same type. The collection types in Go offers arrays, slices, maps, and channels. Slices are considered as dynamic arrays whose size can be changed whereas arrays have a fixed size. Channels give goroutines a method to communicate and synchronize their execution, whereas maps are used for key-value storage. Here, we will show execution of maps, slices and arrays using different ways as shown below in examples. Method 1: Using map, slice and array This method shows how to use arrays, slices, and maps ... Read More
Both SEO and SMO are the methods used for driving traffic to a website, but they are quite different from each other. SEO (Search Engine Optimization) is a technique to enhance traffic on a site on the search engine result pages, whereas SMO (Social Media Optimization) is a technique to make the social media content visible to more users. Read this article to learn more about SEO and SMO and how they are different from each other. What is SEO? SEO is a technique to increase the ranking of a website on the search engine result pages. SEO is basically ... Read More
SEO and SEM both are the techniques to increase the visibility and traffic on a website, however both are quite different from each other. The most basic difference between the two is that SEO focuses on enhancing the organic traffic on a website, while SEM uses different strategies to increase traffic like SEO, paid promotion, etc. Read this article to learn more about SEO and SEM and how they are different from each other. What is Search Engine Optimization (SEO)? Search Engine Optimization (SEO) is a way to increase the visibility of a website by nonpaid forms of advertising. It ... Read More