GATE-CS-2015 (Set 3) - Chapter 40

This is a brief introduction to the GATE-CS-2015 (Set 3) question paper, specifically Chapter 40 which focuses on programming and algorithms.

Overview

Chapter 40 consists of questions related to programming and algorithms. It covers topics such as dynamic programming, sorting algorithms, searching algorithms, tree data structures, and graph algorithms. It is a relatively challenging chapter, aimed at testing the programming and algorithmic skills of the candidate.

Sample Question

As an example of the types of questions that can be expected in Chapter 40, consider the following:

1. Implement the MergeSort algorithm in Python.

def mergeSort(arr):
    if len(arr) <= 1:
        return arr
    mid = len(arr) // 2
    left = arr[:mid]
    right = arr[mid:]
    left = mergeSort(left)
    right = mergeSort(right)
    return merge(left, right)

def merge(left, right):
    result = []
    i = j = 0
    while i < len(left) and j < len(right):
        if left[i] <= right[j]:
            result.append(left[i])
            i += 1
        else:
            result.append(right[j])
            j += 1
    result += left[i:]
    result += right[j:]
    return result

The above is a basic implementation of the MergeSort algorithm in Python. It recursively splits the input array into smaller halves, until it reaches an array of length 1 or 0. It then merges these halves back together in a sorted fashion.

Conclusion

Chapter 40 of the GATE-CS-2015 (Set 3) question paper covers a range of programming and algorithmic concepts. It is important for candidates to have a foundational understanding of these topics, as well as the ability to implement common algorithms from scratch. By preparing well, candidates can increase their chances of success on this chapter of the exam.