Isn’t it dangerous to throw your data at a black box algorithm (deep learning)? Will you trust a decision made by such an algorithm?

Can the tree structures be manipulated in MATLAB (i.e. removing a node)?

Why is the running time of an insertion sort n2?

How I can write Hanoi game’s code in data structure?

What are some cool websites to learn and practice algorithms, data structures and OOPS concepts for beginners other than hackerrank.com?

How can you find the path of maximum length in a binary tree T?

What is the algorithm behind in-store heat maps?

Assume G is a graph with minimum vertices between all K-regular graphs with girth w. How do you prove that the diameter of G can’t be more than w?

What is the logic to check whether two binary search trees are structually identical or not?

I am good in Data Structure, Algorithm and Core Java. Is this enough to get a high paying job?

What would a graph with edge connectivity 4, vertex connectivity 3 and the degree of each vertex greater than or equal to 5 look like?

How can I reduce dynamic programming to linear programming?

How could I develop a formula to distribute the RAM, processor, and disk into two machines?

Why is a pairing heap faster than a binary heap?

What is the significance of negative weighted edges in bellman Ford algorithm?

How is the back propagation algorithm implemented in the brain?

Which computer language(s) or program(s) should I learn to become an Operations Research Analyst?

How does one implement a queue?

Is there any source code for the random walk algorithm in R?

In chess, is there a way to place 8 queens in which any queen can be attacked by the others?