GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2026 · session-8
Programming, Data Structures and AlgorithmsProgramming in PythonmediumMCQ2 marks
A recursive function in Python is given. def mystery(n): if n <= 0: return 1 else: return mystery(n-1) + mystery(n-2) Now, consider the following function call: mystery(4) Assume that a typical runtime stack is used to manage function calls. Each function call is pushed onto the stack and removed only after it finishes execution. Which of the following options denotes the total number of function calls (i.e., the total number of stack activations), including the initial call, to compute mystery(4)?
Save your progress

Related Programming, Data Structures and Algorithms PYQs

GATE 2026 · session-8

Consider that the quick sort algorithm is used to sort an array of \(n\) distinct randomly ordered elements. In every call, the pi…

GATE 2026 · session-8

Consider the given Python program. def append_to_lst(val, lst=[]): lst.append(val) return lst print(append_to_lst(1)) print(appe…

GATE 2026 · session-8

You are given the following Pre-order and In-order traversals of a Binary Tree \(T\) with nodes E, F, G, P, Q, R, S. Pre-order: P…

GATE 2026 · session-8

Let \(A\) be a sorted array containing 1000 distinct integers. You perform a recursive binary search on \(A\) to find an element \…

GATE 2026 · session-8

Consider a directed graph \(G = (V, E)\), where \(V\) is the finite set of vertices and \(E\) is the set of directed edges between…

GATE 2026 · session-8

Consider the problem of sorting the given array in ascending order: \(P = [1, 2, 3, 5, 4]\) Consider two sorting algorithms Bubb…