All the optimization problems in Computer Science have a predecessor analogue in continuous domain and they are generally expressed in the form of either functional differential equation or partial differential equation. A classic example is the Hamiltonian Jacobi Bellman equation which is the precursor of Bellman Ford algorithm in CS.

computer science

This is a probabilistic technique that is often used to solve computational problems. Often, it can be used to finding good programming paths by comparing/utilising date on graphs.

You don't get a degree with a subject; you get a degree in a subject. Bachelor of Science in Computer Science or Bachelor of Computer Science are common descriptions of this degree.

bachelor of science computer sciencemaster of science computer science