Consider that the quick sort algorithm is used to sort an array of \(n\) distinct randomly ordered elements. In every call, the pi…
Consider the given Python program. def append_to_lst(val, lst=[]): lst.append(val) return lst print(append_to_lst(1)) print(appe…
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…
A recursive function in Python is given. def mystery(n): if n <= 0: return 1 else: return mystery(n-1) + mystery(n-2) Now, consi…
Consider a directed graph \(G = (V, E)\), where \(V\) is the finite set of vertices and \(E\) is the set of directed edges between…
Consider the problem of sorting the given array in ascending order: \(P = [1, 2, 3, 5, 4]\) Consider two sorting algorithms Bubb…
Free account benefits
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.