×
Home Discussions Write at Opengenus IQ
×

Search anything:

  • DSA Cheatsheet
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • RANDOM
  • One Liner

OpenGenus IQ, an open-source Computer Science Publication House, is driven by 2500+ BSc/MSc/PhD holders globally, exploring Algorithms, Deep Learning, System Design, and more since 2017.

System Design

Apache HBase in System Design

In this article, we will learn when Apache HBase might be a good choice of database for your software. Since HBase is a NoSQL database, we begin by exploring the design choice between choosing SQL or NoSQL databases for your application.

Mayank Kamboj
Algorithms

Complete Binary Tree

In this article, we will learn about the what is the tree, Binary tree and complete binary tree also how it differs from a general Binary Tree in terms of different operations.

Reshma Patil
Data Communication and Computer Networks

Switching Modes in Computer Networks

In this article at OpenGenus, we will be discussing about the various switching modes in a Computer Network. But before we do that let us first understand what a switch is in detail.

Shubhanshu Tomar
Computer Architecture

SIMD & SSE Instruction Set

In this article, we will discuss scalar computing (and some of its drawbacks), the need for vector/parallel computing, the fundamental concepts behind single instruction, multiple data (or SIMD) architecture and SSE.

Agastya Gummaraju
Java

Introduction to Spring Boot

In this article, we explore one of the most popular Frameworks for Java Developers - Spring Boot and compare it with other popular frameworks like Spring, Spring MVC, Hibernate, and Spring Data.

Anna Burdanova
String Algorithms

Lexicographic next string

In this article, we are going to find the lexicographic next string for the given string.

Rahul Kumar Yadav
Algorithms

Preorder traversal in Binary Tree [Iterative + Recursive]

Preorder traversal is one of the traversal in binary tree in which the root node is visited first then the left subtree and then the right subtree. The order can be written as ROOT LEFT RIGHT.

Gifty Treesa Iju Gifty Treesa Iju
Data Communication and Computer Networks

Different types of Firewall

Before we learn about the different types of a firewall, we should first understand what is a firewall? Back in the day when the Internet was first created, we did not need anything like firewalls.

Shubhanshu Tomar
data science

AO* algorithm

AO* algorithm is a best first search algorithm. AO* algorithm uses the concept of AND-OR graphs to decompose any complex problem given into smaller set of problems which are further solved.

Anubhav Tewari
Natural Language Processing (NLP)

Types of NLP models

Natural Language Processing (NLP) refers to a branch of Artificial Intelligence (AI) in Computer Science that gives computers the ability to analyze and interpret human language.

Chun Yan Liu
Machine Learning (ML)

Contrastive Learning

Contrastive learning is a method for structuring the work of locating similarities and differences for an ML model. This method can be used to train a machine learning model to distinguish between similar and different photos.

Saroj Mali
hardware

AVX-512

In this article, we will discuss Intel's Advanced Vector Extensions 512 (AVX-512), which is an instruction set that was created to accelerate computational performance in areas such as artificial intelligence/deep learning.

Agastya Gummaraju
Time Complexity

Time and Space Complexity of Merge Sort on Linked List

In this article, we will learn about the space and time complexity of the Merge sort algorithm on Linked List using Mathematical analysis of various cases.

Suraj Kumar Suraj Kumar
Algorithms

Add digits of a number [Algorithm + Time Complexity]

In this article, we have explained the algorithm to add digits of a number N and presented the time and space complexity analysis. We have present an implementation in C Programming Language as well.

Ned Nedialkov Ned Nedialkov
Algorithms

First K maximum occurring words

In this article, we will understand the different approaches to return the first k maximum occurring words from a given array. It includes core Data Structures and Algorithm topics such as Arrays, HashMap, Sorting, Priority Queue and Heap, Trie, and Bucket sort.

Astha Jain Astha Jain
String Algorithms

Check if a string can be convert to another by swapping two characters

Having two strings s1 and s2 equal in length of size n, you must check if they are equal after you swap any of two different characters. If strings are different on more than just 2 characters it must return false.

Gabriel
System Design

Object-Oriented Database

This article aims to explain the object-oriented database and its principles, contrast the object-oriented database with the relational database and provide examples of object-oriented database management systems.

Yejoong (Paul) Kim
trie

Find word with maximum frequency using Trie

In this article, we will design an algorithm to Find word with maximum frequency using Trie Data Structure.

Pervez Nagi
data science

F Test

F-tests get their name from the F test statistic, which was named after Sir Ronald Fisher. The F-statistic is just a two-variance ratio. Variances are a metric for dispersion, or how far the data deviates from the mean. Greater dispersion is shown by higher values.

Saroj Mali
System Design

Who uses Apache Kafka and why?

In the last few years, Apache Kafka has become one of the most popular open-source streaming platforms. From startups to large enterprises, many organizations use Kafka for its high throughput and low latency capabilities.

Benjamin QoChuk, PhD Benjamin QoChuk, PhD
Machine Learning (ML)

Posenet Model in ML

In this article, we will learn about pre-trained model PoseNet in detail which will be consisting of need and working of posenet, operations possible on it, its application, and possible improvement over existing posenet model.

Sidhant Pandey
Machine Learning (ML)

Transposed Convolution

Transposed convolution is also known as upsampled convolution, which refers to the task it accomplishes, which is to upsample the input feature map.

Aiden Samuel
Algorithms

Bottom up traversal of Trie

In this article, we have explained the algorithmic approach for Bottom up traversal of Trie.

Purvak Baliyan
Algorithms

Hashing: Complete Guide

In hashing, we convert key to another value. It is a searching technique. In linear search the time complexity is O(n),in binary search it is O(log(n)) but in hashing it will be constant. We make use of a hash function and a hash table.

Gifty Treesa Iju Gifty Treesa Iju
Machine Learning (ML)

Grouped and Shuffled Grouped Convolution

In this article, we have explored the variant of Convolution named Grouped and Shuffled Grouped Convolution.

B E Pranav Kumaar B E Pranav Kumaar
OpenGenus IQ © 2025 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter