PyQdeck LogoPyQdeckSubjects
Back to the 2024 paper

Module 1: Introduction

20242m

Which of the following best describes space complexity?
(i) Time taken by the algorithm
(ii) Memory required to run an algorithm
(iii) Number of recursive calls
(iv) Number of loops used

Search GoogleAsk AI

Similar questions

Design and Analysis of Algorithms In algorithm analysis, what does "space complexity" refer to? (i) The number of input elements (ii) The amount of physical memory used (iii) The number of recursive calls (iv) The number of lines of code in the algorithm20232mDesign & Analysis of AlgorithmsWrite time function and calculate the time complexity, space complexity and number of function calls of the following pseudocode using substitution method: ``c rec(n) { if (n <= 1) return(1); else { rec(n / 2); for (i = 1; i <= n; i++) printf("algorithm"); } } ``20227mDesign and Analysis of Algorithms Define time complexity and space complexity. Write an algorithm for adding n natural numbers and find the space required by that algorithm.20257mSoftware EngineeringCyclomatic Complexity is primarily used to measure: (i) Lines of code (ii) Logical paths in a program (iii) Execution speed (iv) Code documentation quality20252m
NextIf an algorithm has time complexity T(n) = 5n^2 + 3n + 7, its asymptotic upper bound is: (i) O(n) (ii) O(n^2) (iii) O(n \log n) (iv) O(n^3)