Theory of Computation - Old Questions
11. Define complexity of a Turing machine. Explain about big Oh, big Omega and big Theta notation used for complexity measurement. (1+4)
5 marks
|
Asked in 2076 (new)