ViewTube

GATE CS 2020 Let G=(V,E) be a weighted undirected graph and let T be a Minimum Spanning Tree (MST) of G maintained using ...

Algorithm PYQ GATE CS 2013 GATE CS 2013 Consider the following function: int unknown(int n){ int i, j, k=0; for (i=n/2; i≤n; i++) ...

GATE CS 2020 Consider a double hashing scheme in which the primary hash function is h1(k)=k mod 23, and the secondary ...

Consider the following sorting algorithms: (i) Bubble sort (ii) Insertion sort (iii) Selection sort Which ONE among the following ...

GATE CS 2015 The graph shown below has 8 edges with distinct integer edge weights. The minimum spanning tree (MST) is of ...

TYPES OF LINKLIST OF DATA STRUCTURE (DSA) mohammad RIZWAN 8676 follow instragram ID mr884072020 and Facebook ...