GATE (Graduate Aptitude Test in Engineering) Computer Science & IT (CS) Algorithms-Asymptotic Notation Study Material (Page 2 of 4)
Choose Programs:
🎓 Study Material (1190 Notes): 2024-2025 Syllabus
Rs. 1000.00 -OR-
3 Year Validity (Multiple Devices)
Topic-wise Notes & SampleDetails
🎯 302 Numeric, 2894 MCQs (& PYQs) with Full Explanations (2024-2025 Exam)
Rs. 650.00 -OR-
3 Year Validity (Multiple Devices)
CoverageDetailsSample Explanation
Help me Choose & Register (Watch Video) Already Subscribed?
Asymptotic Notations – Big Ohm, Omega and Theta: Constant Time
Edit
Constant Time
- – This represents the Constant Time. An operation՚s complexity is constant regardless of the number of inputs. Accessing the first element in an array will always be (1) . It is the same for an array with elements as it is for an array with 10. In fact, accessing any element in the array by its index should be a constant complexity operation regardless of whether it is the first item or the th. The execution time of these algo…
… (128 more equations, 24 figures) …
Subscribe (by clicking here) to view full notes and track progress.
Asymptotic Notations: Factorial Notation
Edit
Factorial Notation
- – This 2 to the power “n” is by far the most complex of all the operations involved. Knowing the power of 2 from the number systems like binary etc. we know that even the smaller values of n like 10 or would mean a highly complex algorithm. Example we know that 220 itself is a milli…
… (179 more words, 27 figures) …
Subscribe (by clicking here) to view full notes and track progress.