...
March 12, 2025

GATE 2005

Question 6 An undirected graph C has n nodes. Its adjacency matrix is given by an n × n square matrix whose (i) diagonal elements are […]
March 12, 2025

GATE 2005

Question 36 In a complete k-ary tree, every internal node has exactly k children. The number of leaves in such a tree with n internal nodes is: […]
March 12, 2025

GATE 2005

Question 84 Let s and t be two vertices in a undirected graph G=(V,E) having distinct positive edge weights. Let [X, Y] be a partition of […]
March 12, 2025

GATE 2005

Question 83 Let s and t be two vertices in a undirected graph G=(V,E) having distinct positive edge weights. Let [X, Y] be a partition of […]