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

Ned Nedialkov

Professor of Computing at McMaster University | Ph.D in Computer Science from University of Toronto in 1999 | Native of Bulgaria | Research in Scientific Computing

Ontario, Canada •
24 posts •
System Design

Always On availability

Always On availability refers to the ability of a system to remain operational and accessible at all times, even during planned maintenance or unexpected outages.

Dharmik Patel Dharmik Patel
Machine Learning (ML)

AUC (Area Under The Curve) and ROC (Receiver Operating Characteristics)

In binary classification issues, the metrics AUC (Area Under the Curve) and ROC (Receiver Operating Characteristics) are frequently employed. AUC is a numerical metric that measures the performance of the classifier, whereas ROC is a graphical plot that shows the performance of a binary classifier.

Vaishnav Nagnath Kumbhar
System Design

Database Clustering

Database clustering is a technique used to increase the availability, scalability, and reliability of a database system.

Dharmik Patel Dharmik Patel
Natural Language Processing (NLP)

Sentiment analysis with NLP

Sentiment Analysis is the method of locating and extracting subjective information from text data. It entails determining whether the emotional bias of a text is positive, negative, or neutral by looking at its contents.

Ambarish Deb Ambarish Deb
System Design

Database mirroring and log shipping

Today, we are going to discover or learn more about how a SQL database can be safely backed up. What is database mirroring? What is Log shipping? Are they different?

Ana Julia Oliveira Marçal Ana Julia Oliveira Marçal
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.

Benjamin QoChuk, PhD Benjamin QoChuk, PhD
Python

Python lambda if else

In this article, we have presented how to use if else elif as a part of Lambda function in Python. We have covered different cases like if, if else and if else elif with Python code examples.

Ned Nedialkov Ned Nedialkov
Python

[FIXED] TypeError: unsupported operand type(s) for +: 'NoneType' and 'NoneType'

In this article, we have explained the reason behind the Python runtime error "TypeError: unsupported operand type(s) for +: 'NoneType' and 'NoneType'" and presented two ways to fix the error.

Ned Nedialkov Ned Nedialkov
Python

[FIXED] <lambda>() takes 1 positional argument but 2 were given

In this article, we have explained the reason behind the Python error "() takes 1 positional argument but 2 were given" and have presented multiple ways in which this error can be fixed.

Ned Nedialkov Ned Nedialkov
Python

Python Min Lambda [5 ways]

In this article, we have explored how to use lambda for Minimum() in Python with and without using the min() built-in function. We have explained the concepts using Python code snippets.

Ned Nedialkov Ned Nedialkov
Python

Python Max Lambda [6 ways]

In this article, we have explained how to use lambda with max() built-in function in Python to find the maximum element in any iterable with custom objects. Additionally, we have presented how to implement max from scratch using lambda without using any built-in function.

Ned Nedialkov Ned Nedialkov
Python

Python Sum Lambda [3 different ways]

In this article, we have presented 3 approaches to use lambda to get the sum of all elements of a list along with complete Python code.

Ned Nedialkov Ned Nedialkov
Linux

Use astyle to format C++ code

In this article, we have presented how to use astyle tool to format C/ C++ code files and set your custom code format style.

Ned Nedialkov Ned Nedialkov
Python

Python lambda for loop

In this article, we have explored how to use Lambda in Python to replicate the behavior of for loop and how to use for loop within lambda.

Ned Nedialkov Ned Nedialkov
Linux

Remove End of Line (EOL) whitespace in Files in UNIX/ Ubuntu

In this article, we have demonstrated how to Remove End of Line (EOL) whitespace in Files in UNIX/ Ubuntu using grep and sed commands.

Ned Nedialkov Ned Nedialkov
Linux

Install astyle in Ubuntu

In this article, we have presented how to install astyle (Artistic Style) tool in UNIX/ Ubuntu.

Ned Nedialkov Ned Nedialkov
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

Sum and Number of Divisors of a Number

In this post, we discuss formulas for getting the number of divisors of a number and their sum, additionally we will implement an algorithm that solves this problem.

Erick Lumunge
Algorithms

Distributed Hash Table

In this article, we discuss hash tables and their implementations on a larger scale while maintaining its computational complexity that is Distributed Hash Table.

Erick Lumunge
Algorithms

Parallel Quick Sort

In this post, we have discussed how to implement Quick Sort algorithm parallelly using 5 different approaches including HyperQuickSort, Parallel quicksort by regular sampling and many more.

Erick Lumunge
Algorithms

Time & Space Complexity of Merge Sort

In this article, we have explained the different cases like worst case, best case and average case Time Complexity (with Mathematical Analysis) and Space Complexity for Merge Sort. We will compare the results with other sorting algorithms at the end.

Kirti Singh
Algorithms

Recovering a Binary Search Tree that has two nodes swapped

In this article, we will be developing and implementing an algorithm that recovers a Binary Search Tree (BST) that had two of its nodes swapped accidentally.

Thompson Mina
Algorithms

Two Sum Problem: Check if pair with given sum exists [Solved]

In this article, we have explained different approaches to solve the Two Sum Problem using techniques like Binary Search, Hash Map and others.

Ue Kiao, PhD Ue Kiao, 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
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