Gems of TCS: Questionnaire

JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.

There are no wrong answers here, please choose an option that describes your background best. Answers to these questions will help us to get a sense of the students' background, and to adjust the lectures accordingly.

Algorithms *

Big O notation, Sorting algorithms, Breadth-first search algorithm, Minimum spanning tree algorithms.

I know all or most of this

I know some of this

What??

Discrete Math *

Closed-form expression for 1+2+3+...+n, Binomial coefficients; Graphs: path, cycle, connected component.

I know all or most of this

I know some of this

I don't know this

Linear Algebra *

Basis, Rank, Linear independence, determinant.

I know all or most of this

I know some of this

I don't know this

Probability *

Expected value, Independent events, Markov's inequality.

I know all or most of this

I know some of this

I don't know this

Computability *

Turing machine, the class P, the class NP, Boolean Circuit, Example of an NP-complete problem, Proof of NP-completeness.

I know all or most of this

I know some of this

I don't know this

Programming *

I can write a "Hello, World!" program in some programming language; I can implement Breadth-first search algorithm; I can implement Dijkstra's algorithm.

I know all or most of this

I know some of this

I don't know this

Submit

Clear form

This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Privacy Policy

Forms