Is improving one of the big data clustering algorithms enough as a topic for a PhD?

What is the minimum number of coplanar vectors whose sum can be zero (equal and unequal coplanars)? Explain.

How do you calculate the big O of: for (int k = 2; k < floor (sqrt(n)); k++)?

What are some of the complex codes/algorithms written to perform a simple task?

Why do we need to write a code to sort an array?

How does the Multiple Signal Classification (MUSIC) algorithm work?

I have a discrete math exam and this is in it. What is the recursive formula of an=an-1+2?

Could a quantum processor look for every single path in a Ripple network and bring back the shortest one?

Is it possible to implement the same quick sort algorithms in Python that is running faster than the one implemented in C?

In computational complexity, why do we assume that the search problem is more difficult than the verification problem?

A customer wants to know the total number of 2-wheelers in Pune. What are the possible approaches to solve this business problem?

How do you use C programming to compare two integer arrays and see whether they are identical?

How do you make a binary tree for prefix expressions in C++?

How bad is getting a C in a data structures and algorithms class, if the major in college is computational mathematics, and the minor is CS?

Can anyone give explanation of the Alternating Least Squares algorithm in a recommendation system with a simple numerical example?

Is it possible to get a job in good software companies by learning “core Java, data structures and algorithms” from scratch in just one month’s time?

Is it possible to edit a string without using an array?

What are the best line search algorithms for Quasi-Newton methods?

Why does Uber always connect users to ‘8 nearby drivers’? Does this have anything to do with an implementation of the closest pair algorithm?

What is a digital differential analyzer algorithm in computer graphics?