Big O, big theta and big Omega are:

(A) Wort, average and best case scenario of an algorithm
(B) Asymptotic notations that describe upper bound, both above and below bound and lower bound respectively.
(C) Notation used to compare order of growth.
(D) Set of algorithms with worst, second wort and best complexities respectively.

The answer is (B) Asymptotic notations that describe upper bound, both above and below bound and lower bound respectively.

“Software engineers should not use their technical skills to misuse other people’s computers.”Here the term misuse refers to:

a) Unauthorized access to computer material
b) Unauthorized modification of computer material
c) Dissemination of viruses or other malware
d) All of the mentioned

The answer is d) All of the mentioned

This MCQS is taken from www.sanfoundry.com