MHB What Are the Focus Areas in the Course Algorithms and Complexity?

[mathmari]

Hey!

I take the course Algorithm and Complexity and I have to choose one of the fields Computer Science(the operations of a computer), Computational Geometry or Cryptography.

Could you give some information about these fields?? (Wondering)

 

[mathmari]

At the course Algorithm and complexity the prof told me that I have to chose on which of the above fields I want to focus.

Could you tell me what these subjects/fields are about?? (Wondering)

What knowledge is required at each one?? (Wondering)

 

[I like Serena]

At the course Algorithm and complexity the prof told me that I have to chose on which of the above fields I want to focus.

Could you tell me what these subjects/fields are about?? (Wondering)

What knowledge is required at each one?? (Wondering)

I would expect that Algorithm is about creating algorithms for tasks like finding the shortest path in a graph, and that Complexity is about figuring out how expensive a given algorithm is. (Mmm)

 

[mathmari]

I would expect that Algorithm is about creating algorithms for tasks like finding the shortest path in a graph, and that Complexity is about figuring out how expensive a given algorithm is. (Mmm)

What algorithms can be created in these fields?? (Wondering)

 

[I like Serena]

What algorithms can be created in these fields?? (Wondering)

Well, I guess for instance an algorithm to add a node to a binary tree that is as leftmost as possible, and that is at least at level $l$.
Like in http://mathhelpboards.com/computer-science-58/add-node-13307.html. (Wasntme)

 

[Fallen Angel]

Hi,

I think the better way to know this is asking professors but,

Probably the course Algorithms and complexity it's not about creating algorithms, you can study there Turing machines, complexity classes (in time and space), cook's conjecture and some other theorems related to this.

In Computational geometry you can study for example combinatorial theorems over polytopes, Delauny's triangularizations and Grobner bases.

In Criptography, I just know the basic RSA system which is based in the CRT and little's fermat theorem, so I can't tell you much more.