## Data Structures and Algorithms | Set 8

Following questions have been asked in GATE CS exam. 1. Consider the following functions Which of the following is true? (GATE CS 2000) (a) h(n)… Read More »

## Data Structures and Algorithms | Set 7

Following questions have been asked in GATE CS 2006 exam. 1. In a binary max heap containing n numbers, the smallest element can be found… Read More »

## Data Structures and Algorithms | Set 6

Following questions have been asked in GATE CS exam. 1. The usual Θ(n^2) implementation of Insertion Sort to sort an array uses linear search to… Read More »

## Data Structures and Algorithms | Set 5

Following questions have been asked in GATE CS exam. 1. Consider the following C function. filter_none edit close play_arrow link brightness_4 code float f(float x,… Read More »

## Data Structures and Algorithms | Set 4

Following questions have been asked in GATE CS exam. 1. Consider the following C program segment filter_none edit close play_arrow link brightness_4 code struct CellNode… Read More »

## Data Structures and Algorithms | Set 3

Following questions have asked in GATE CS exam. 1. Suppose you are given an array s[1…n] and a procedure reverse (s,i,j) which reverses the order… Read More »

## Data Structures and Algorithms | Set 2

Following questions have been asked in GATE CS exam. 1. Consider the function f defined below. filter_none edit close play_arrow link brightness_4 code struct item … Read More »

## Data Structures and Algorithms | Set 1

Following questions have been asked in GATE CS exam 1. Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, inorder and… Read More »