×
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

Stateless and Stateful architecture [explained]

We have explained the Idea of stateless and stateful architecture ind depth. There seems to be a raging debate as to which is better, stateless architecture or stateful architecture. We have explained everything in depth.

Zvinodashe Mupambirei
Algorithms

Arithmetic Expression Evaluation using Stack

We have explained how an Arithmetic Expression (like 2 * 3 + 4) is evaluated using Stack. We have presented the algorithms and time/ space complexity.

Tushti
Software Engineering

MVC pattern in iOS apps

We have explained MVC pattern in iOS apps in depth. MVC stands for Model View Controller which is a software design pattern to organize the software project into three parts model, view and controller

Sai Balaji
Algorithms

Boundary Fill Algorithm

Boundary Fill algorithm is used to fill a inside of closed polygon having boundary of same color with a desired color. It is mainly used with interactive-painting packages. We have explained Boundary Fill algorithm in depth.

Naveen Singla
Machine Learning (ML)

Separable convolution in Machine Learning

In MobileNet architecture, you must have stumbled across the term "Separable convolution". What is separable convolution and how is it different from regular convolution? We have explained everything in this article.

Akshay Atam
Machine Learning (ML)

Questions on Regression [with answers]

Practice multiple choice questions on Regression with answers. This is one of the fundamental techniques in Machine Learning which is widely used in basic problems.

Leandro Baruch Leandro Baruch
Machine Learning (ML)

Principal Component Analysis (PCA) questions [with answers]

Practice multiple choice questions on Principal Component Analysis (PCA) with answers. This is a fundamental technique in Machine Learning applications.

Leandro Baruch Leandro Baruch
Machine Learning (ML)

Recurrent Neural Network (RNN) questions [with answers]

Practice multiple choice questions on Recurrent Neural Network (RNN) with answers. It is an important Machine Learning model and is a significant alternative to Convolution Neural Network (CNN).

Leandro Baruch Leandro Baruch
Machine Learning (ML)

Convolution Layer questions [with answers]

Practice multiple choice questions on Convolutional Layers with answers. This is the most important layer in a Machine Learning model in terms of both functionality and computation.

Leandro Baruch Leandro Baruch
Machine Learning (ML)

Questions on Fully Connected (FC) Layer

Practice multiple choice questions on Fully Connected Layers with answers. These are the most important layer in a Machine Learning model in terms of both functionality and computation.

Leandro Baruch Leandro Baruch
Software Engineering

Process of deleting an array in C++

We have explained how to delete an array or delete an element in an array in C++. We can covered the case of static and dynamic memory allocated array along with the basics of array.

Hritik Bhardwaj
Software Engineering

Dynamic vs Static memory allocation in C

We have compared the differences with Dynamic Memory Allocation and Static Memory Allocation in C Programming Language. We cover the basics of memory and the different types of memory allocation as well.

Nimrat Matharoo
Algorithms

Addition using Bitwise Operations

In this article, we will see how to add any two positive numbers using the bitwise operators like and, xor, and left shift operators rather than using the normal addition operator (+).

Adith Narein T Adith Narein T
TensorFlow

Advanced Interview Questions on TensorFlow

We have presented advanced interview questions on TensorFlow with multiple options to choose from. Select an answer to find out if you got it right and get explanation for the answer.

Benjamin QoChuk, PhD Benjamin QoChuk, PhD
Algorithms

Time Complexity Bound for comparison based sorting

We have explained the mathematical analysis of time complexity bound for comparison based sorting algorithm. The time complexity bound is O(N logN) but for non-comparison based sorting, the bound is O(N).

Mallika Dey
TensorFlow

Questions on TensorFlow (with Answers)

We have present the most insightful and MUST attempt questions on TensorFlow with multiple options to choose from. Select an answer to find out if you got it right and get explanation for the answer.

OpenGenus Tech Review Team OpenGenus Tech Review Team
Algorithms

Karp's Minimum Mean Cycle Algorithm

We have presented Karp's Minimum Mean Cycle Algorithm along with C++ Implementation. Karp's theorem and Complexity Analysis.

Naveen Singla
Software Engineering

GraphQL API in Django with CRUD operations

In this article, we have explored GraphQL API, using GraphQL in Django and CRUD operations for users in Django.

Nitin Sharma Nitin Sharma
Culture

Coding Interview New Tab

"Coding Interview New Tab" is an Offline Browser Extension that displays a new one line knowledge on a Computing topic for every New Tab you open. It helps you learn something new every now and then.

OpenGenus Tech Review Team OpenGenus Tech Review Team
Software Engineering

Simple CRUD Application with Django Rest Framework

Ever wondered how your favorite web applications work? like Twitter, Facebook and so on, Yes they look fabulous but what really makes them tick? Simple CRUD Application with Django Rest Framework

Akan Bassey Akan Bassey
Algorithms

Bubble Sort using Two Stacks

We have explored the algorithm to perform Bubble Sorting Algorithm using Two Stacks and sort a given array.

Aaliyah Ahmed
Dynamic Programming (DP)

List of 100+ Dynamic Programming Problems

This is the List of 100+ Dynamic Programming Problems along with different types of DP problems such as Mathematical DP, Combination DP, String DP, Tree DP, Standard DP and Advanced DP optimizations.

OpenGenus Tech Review Team OpenGenus Tech Review Team
Algorithms

Approximate algorithms for NP problems

We have covered Idea of Approximate algorithms for NP problems. NP problems are tough but Approximate algorithms are considered to be a good approach as we get a answer close to the real answer in reasonable time. We have covered the basics with examples of problems like Bin Packing.

Sumit Kumar
Algorithms

Shortest Unsorted Continuous Subarray

We have solved the problem "Shortest Unsorted Continuous Subarray" and explained the logic behind it and what are the different methods (like Monotonic Stack) we can use to solve it efficiently.

Adith Narein T Adith Narein T
Software Engineering

Idea of Layer 4 and Layer 7 Load Balancing

We have covered the idea of Layer 4 and Layer 7 Load Balancing along with advantages and disadvantages. This is an important topic in System Design and is an effective Load Balancing technique.

Fahd Agodzo Mohammed Fahd Agodzo Mohammed
OpenGenus IQ © 2026 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter