×
Home Discussions Write at Opengenus IQ
×
  • RANDOM
  • Join our Internship 🎓
  • 100+ Graph Algorithms
  • 100+ DP Problems
  • 50+ Linked List Problems
  • 50+ Array Problems
  • One Liner
  • 50+ Binary Tree problems
  • #7daysOfCode
  • Linux 💽
  • 🔊 Data Structures
  • Graph Algorithms
  • Dynamic Programming 💑
  • Home
OpenGenus Foundation

OpenGenus Foundation

The official account of OpenGenus IQ backed by GitHub, DigitalOcean and Discourse

Tokyo, Japan •
2492 posts •
Java

CRUD operation using hibernate in MySQL database

In this article, we are going to learn how to develop an application that performs the CRUD operations in MySQL database using hibernate. Here we will develop a command line application but the same procedure can be used to develop any other type of application like GUI, webapp etc.

Gaurav Kumar
Java

Linked Hash Set in Java

In this article, we will understand the LinkedHashSet Class which has been included in java.util since version 1.4.

Sam Frank
Time Complexity

Asymptotic Analysis

In this article, we will be discussing about the idea of Asymptotic Analysis of Algorithms, 3 asymptotic notations used to represent the time complexity of an algorithm along with examples and much more.

Gifty Treesa Iju Gifty Treesa Iju
divide and conquer

Skyline Problem

In this article, we have explained an efficient approach to solve the Skyline Problem using a Divide and Conquer algorithm.

Gifty Treesa Iju Gifty Treesa Iju
Machine Learning (ML)

Token Classification in Python with HuggingFace

In this article, we will learn about token classification, its applications, and how it can be implemented in Python using the HuggingFace library.

Reyansh Bahl
Machine Learning (ML)

Different Hyperparameter optimization techniques

In this article, we will explore various techniques used for optimizing hyperparameters of the machine learning model such as Grid Search, Bayesian Optimization, Halving randomized search and much more.

Sanjana Babu Sanjana Babu
Decrease & Conquer

Fake Coin Problem

Fake coin problem is an interesting problem in which we have to find a fake coin out of a number of coins, which is assumed to be lighter than the real coins using just a balance scale, which can be used to compare the weights of two piles of coins.

Rahul Kumar Yadav
JavaScript

How to use GraphQL with Gatsby.js

Gatsby.js is a full-stack front-end framework that is based on React and GraphQL. Gatsby.js comes natively packaged with GraphQL, alongside some additions to it. GraphQL might be suitable for your workflow.

Roland Van Duine Roland Van Duine
Java

Mappings in Hibernate

This article explains and shows examples of mapping of relations between entity classes in application to relationships between database tables, including standard to SQL databases one-to-many, many-to-one, one-to-one, and many-to-many relationships in Hibernate.

Anna Burdanova
clustering algorithm

Spectral Clustering

Spectral clustering is an interesting Unsupervised clustering algorithm that is capable of correctly clustering Non-convex data by the use of clever Linear algebra.

B E Pranav Kumaar
Machine Learning (ML)

Conditional Generative Adversarial Nets

In this article, we have explained the concept of Conditional Generative Adversarial Nets in depth.

Saroj Mali
Deep Learning

What is Neural Network and Deep Learning?

Deep Learning has become quite a buzzword in recent years. It has taken over in all applications from tasks like image recognition, chatbots like Alexa and Google Assistant to defeating world champions in a complex games like Go and Dota 2.

Souvik Ghosh
Algorithms

Binary Heap

Binary heap is a complete Binary tree structured as a heap data structure. Binary heaps are common way of implementing priority queues.

Ayush Sonare
Java

Basics of Hibernate (architecture + example)

Hibernate is a Java framework that maps Java classes and types into the relational databases, which solves problems of "paradigm mismatches". This article explains the basics of Hibernate and provides a simple example with the MySQL database.

Anna Burdanova
Decrease & Conquer

Decrease and Conquer

In this article, we will discuss about the technique Decrease and Conquer which is similar to Divide and Conquer. Decrease and Conquer can be used to solve several important problems such as Fake Coin Problem, Generating Subsets and much more.

Harshul Nanda Harshul Nanda
Machine Learning (ML)

Different Classification Trees in Machine Learning

In this article, we will be learning about different Classification tree methods such as C4.5, CHAID and much more along with some key similarities and differences between them. An implementation in Python is also explained.

Reyansh Bahl
Machine Learning (ML)

Local response normalization (LRN)

In this article, we have explained the concept of Local response normalization (LRN) in depth along with comparison with Batch Normalization.

Saroj Mali
Dynamic Programming (DP)

Longest Geometric Progression

In this article, we have explained how to solve the problem of Longest Geometric Progression efficiently using Dynamic Programming. It involves the use of Map data structure in implementation which is different from other standard problems.

Ue Kiao, PhD Ue Kiao, PhD
Greedy Algorithms

Fitting Shelves Problem [Greedy Algorithm]

In this article, we will understand what fitting shelves problem is and will see a greedy approach algorithm of solving this problem.

Rahul Kumar Yadav
Deep Learning

Neural Architecture Search (NAS)

The aim of this article is to provide a clear and intuitive understanding of the deep learning paradigm known as Neural Architecture Search (NAS).

Benedict O. Emoekabu Benedict O. Emoekabu
Compiler Design

Add support of Debugging: DWARF, Functions, Source locations, Variables

In this article, we continue to discuss other aspects involved with debugging and debugging information in Kaleidoscope. We discuss how to include function definitions, source locations, and variable locations in debug information.

Erick Lumunge Erick Lumunge
Compiler Design

Building a Compiler Front-End

The front-end of a compiler comprises four phases, source code is converted from high-level code to an intermediate representation which is optimized and compiled to machine code.

Erick Lumunge Erick Lumunge
game theory

Pure and Mixed Strategy Nash equilibrium

In this article, we will discuss about the pure and mixed strategy nash equilibrium which are important concepts in Game Theory.

Harshul Nanda Harshul Nanda
Compiler Design

Add debugging support in Programming Language

A good programming language should also be able to support debugging and debug information. In this article, we add support for debugging and debug information.

Erick Lumunge Erick Lumunge
Compiler Design

Bootstraping a Compiler

Bootstrapping a compiler involves producing a self-compiling compiler, that is, we write a compiler using language A that produces code for target machine B and can still compile itself.

Erick Lumunge Erick Lumunge
OpenGenus IQ © 2022 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter