×
Home Discussions Write at Opengenus IQ
×
  • DSA Cheatsheet
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • RANDOM
  • One Liner

Naveen Singla

6 posts •
System Design

Different Caching Strategies in System Design

We have explained different Strategies to update Cache in a System such as Cache Aside, Read Through, Write Back and much more. This is an important topic to design efficient system.

Naveen Singla
Algorithms

Move even number to front of array

We have explained two efficient approaches to Move even number to front of array using Hoare's Partition and Lomuto Partition.

Naveen Singla
Algorithms

Inside Outside Test [2 algorithms: Even-Odd and Winding Number]

In Computer Graphics, Inside Outside is performed to test whether a given point lies inside of a closed polygon or not. Mainly, there are two methods to determine a point is interior/exterior to polygon: Even-Odd / Odd-Even Rule or Odd Parity Rule and Winding Number Method.

Naveen Singla
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
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

Dynamic Memory Allocation in C++

Dynamic Memory Allocation in C++ is the process of allocating memory while a program is running or at run time rather than at compile time. C++ uses new and delete operator for dynamic allocation and freeing up of memory.

Naveen Singla
OpenGenus IQ © 2025 All rights reserved â„¢
Contact - Email: team@opengenus.org
Primary Address: JR Shinjuku Miraina Tower, Tokyo, Shinjuku 160-0022, JP
Office #2: Commercial Complex D4, Delhi, Delhi 110017, IN
Top Posts LinkedIn Twitter
Android App
Apply for Internship