# Tag Archives: GATE-CS-DS-&-Algo

## Data Structures and Algorithms | Set 38

This topic contains basic questions of Algorithm which can be helpful for GATE CS Preparation. So, it is recommended to solve each of these questions… Read More »

## Data Structures and Algorithms | Set 37

Que – 1. For 8 keys and 6 slots in a hashing table with uniform hashing and chaining, what is the expected number of items… Read More »

## Data Structures and Algorithms | Set 36

Que – 1. The function shiftNode() which takes as input two linked lists- destination and source. It deletes front node from source and places it… Read More »

## Data Structures and Algorithms | Set 35

Following questions have been asked in GATE CS 2014 exam. 1) The number of distinct minimum spanning trees for the weighted graph below is ____… Read More »

## Data Structures and Algorithms | Set 34

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… Read More »

## Data Structures and Algorithms | Set 33

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… Read More »

## Data Structures and Algorithms | Set 32

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… Read More »

## Data Structures and Algorithms | Set 31

Following questions have been asked in GATE CS 2013 exam. 1) What is the return value of f(p, p) if the value of p is… Read More »

## Data Structures and Algorithms | Set 30

Following questions have been asked in GATE CS 2013 exam. 1) Which of the following statements is/are TRUE for an undirected graph? P: Number of… Read More »

## Data Structures and Algorithms | Set 29

Following questions have been asked in GATE 2012 exam. 1) The recurrence relation capturing the optimal time of the Tower of Hanoi problem with n… Read More »

## Data Structures and Algorithms | Set 28

Following questions have been asked in GATE 2012 exam. 1) Let w(n) and A(n) denote respectively, the worst case and average case running time of… Read More »

## Data Structures and Algorithms | Set 27

Following questions have been asked in GATE CS 2011 exam. 1) An undirected graph G(V, E) contains n ( n > 2 ) nodes named… Read More »

## Data Structures and Algorithms | Set 26

Following questions have been asked in GATE 2011 exam. 1) A max-heap is a heap where the value of each parent is greater than or… Read More »

## Data Structures and Algorithms | Set 25

Following questions have been asked in GATE 2010 exam. 1 Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry Wij… Read More »

## Data Structures and Algorithms | Set 24

Following questions have been asked in GATE CS 2010 exam. 1. The following C function takes a simply-linked list as input argument. It modifies the… Read More »