Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

Python19.6K+ articles

Experiences15.8K+ articles

Interview Experiences14.5K+ articles

School Learning11.1K+ articles

JavaScript9.9K+ articles

C Language1.3K+ articles

GATE-CS-DS-&-Algo39+ articles

GATE-CS-C-Language12+ articles

GATE-CS-2014

5 posts

Data Structures and Algorithms | Set 35

Last Updated: 23 July 2025

Following questions have been asked in GATE CS 2014 exam.1) The number of distinct minimum spanning trees for the weighted graph below is ____Answer: 6Highlighted (in gree...read more

article_image

GATE-CS-DS-&-Algo

Data Structures and Algorithms | Set 34

Last Updated: 23 July 2025

Following questions have been asked in GATE CS 2014 exam.1) Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an a...read more

article_image

GATE-CS-DS-&-Algo

Data Structures and Algorithms | Set 33

Last Updated: 23 July 2025

Following questions have been asked in GATE CS 2014 exam.1) Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirected graph. T...read more

GATE-CS-DS-&-Algo

C Language | Set 10

Last Updated: 23 July 2025

Following questions have been asked in GATE CS 2014 exam.1) Consider the following program in C language:C #include stdio.hmain(){ int i; int *pi = i; ...read more

GATE-CS-C-Language

Data Structures and Algorithms | Set 32

Last Updated: 23 July 2025

Following questions have been asked in GATE CS 2014 exam.1) Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time on Depth Fir...read more

article_image

GATE-CS-DS-&-Algo