Ue Kiao, PhD - OpenGenus IQ: Learn Algorithms, DL, System Design (Page 4)

Biomedical Image Segmentation

In the Biomedical field segmented images can be used for anomaly detection, diagnosing diseases, computer-integrated surgery, treatment planning, studying anatomical structures, and much more.

bitwise algorithm

Find the rightmost set bit in a number (+ toggle it)

Finding the rightmost set bit in a number is a common problem in computer science and is used in many applications, from competitive programming to low-level programming and data compression. In this article, we will explore various techniques to find the rightmost set bit in a number.

Algorithms

Cheatsheet for Selection Algorithms (selecting K-th largest element)

This is a cheatsheet for different selection algorithms for selecting K-th largest or smallest element.

Odisha Technical Authorship Contest (OTAC)

Odisha Technical Authorship Contest 2023

This is a Technical Authorship Contest for Engineering Students in Odisha to reward and recognized emerging authors and researchers. This contest is free of cost and completely online participation. All prizes will be delivered to the participant's home address.

Algorithms

Complexity analysis of Sieve of Eratosthenes

In this article, we will discuss the Sieve of Eratosthenes method for identifying prime numbers, including its implementation, computational complexity, and alternative solutions.

Data Structures

Kinetic Heap

In this article, we will explore the topic of Kinetic Heap Data Structures, including its implementation and practical applications.

Algorithms

Largest sub-array with equal number of 1 and 0

In this article, we have explored 3 different approaches to find the Largest sub-array with equal number of 1 and 0. This involve the concept of Hash Map/ Set and Prefix Sum.

Algorithms

Height Checker Problem

In this article, we have solved the Height Checker Problem with two different approaches. This involve the concept of using Counting Sort efficiently.

backtracking

Parallel Backtracking

In this article, we have covered the Parallel Backtracking algorithm. We have presented the Time and Space Complexity for various cases.

backtracking

Disadvantages of Backtracking

In this article, we have covered the Disadvantages of Backtracking algorithm.

backtracking

Backtracking vs Branch and Bound

In this article, we have compared Backtracking vs Branch and Bound algorithms.

Algorithms

H-index problem

Calculate the researcher's h-index from an array of integer citations, where citations[i] is the number of citations a researcher obtained for their ith work.

C Programming

Matrix Multiplication in C

In this article, we are going to perform the matrix multiplication operation using C language. We will also be learning how to optimize it using Strassen's algorithm.

Python

Tic tac toe game in Python

In this article, we have presented how to develop the classic Tic Tac Toe game project in Python Programming Language. This will be a strong addition to Software Developer Portfolio.

Data Structures

(a,b) Tree Data Structure

An (a,b)-tree is a type of self-balancing tree data structure that is designed to maintain a balance between the height of the tree and the number of elements stored in the tree. In short we can say that (a,b)-tree is a generalization of a B-tree. Now lets get to know it in depth.

Time Complexity

Time Complexity to sort N strings

In this article, we have explored the Time Complexity to sort N strings when each string is of length M. This is an important Algorithmic questions which most get it wrong.

Algorithms

2D Prefix Sum

In this article, we discuss about how to find the Prefix sum of a given matrix that is 2D Prefix Sum. We have demonstrated 3 methods to find the 2D prefix sum.

Graph Algorithms

Biconnected Components [Explained + Algorithm to find it]

Turns out, biconnected components are one of the most important topic in design analysis of algorithms, data structures and in many competitive exams. Biconnected components are defined as a maximal biconnected subgraph.

Python

53 Intermediate Python Projects

In this article, we have listed 53 Intermediate Python Projects which you should work on to gain a strong hold in implementing programs in Python and strengthen your portfolio.

Algorithms

L-Systems and Carnatic Music

Ever been amazed by plant's geometry? Lindenmayer systems,in short , L-systems have been inspired by the recurrence pattern observed in plants. We will learn more about L-systems , its history , applications and learn how L-systems were used to generate plants and trees models, snowflakes and so on.

C Programming

C program to add two numbers [Explained for Beginners]

In this article, we have explained how to find the sum of two numbers and write a C program for it taking the two numbers as command line arguments.

Python

56 Python Projects for Beginners [2023] [with source code]

In this article, we have listed Python Projects you must do as a Beginner which when added to your portfolio will give a good initial career boost and may help you land your first Internship.

Deep Learning

109 Deep Learning projects [with source code]

In this article, we have listed 109 Deep Learning projects that will help you boost your Portfolio. We have provided resources to explore the project ideas further along with source code. You can do this as a part of your College Project (B.Sc, M.Sc and even PhD) or take it up for your portfolio.

Rust Programming

32 Rust Projects [2023] [with source code]

In this article, we have listed 32 Project ideas with Rust Programming Language which you should work on and add to your portfolio. Rust is an emerging Programming Language with focus on scalability and security and is a strong alternative to C Programming Language.

backtracking

Kirkman Schoolgirls Problem

In this article, we have covered the Backtracking Algorithm for Kirkman Schoolgirls Problem and compared with the Brute Force approach. We have presented the Time and Space Complexity for various cases.