Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE? [G16S2Q23]

Explanation

The Floyd-Warshall algorithm for all-pair shortest paths computation is based on [G16S2Q24]

Explanation

N items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed. [G16S2Q25]

Explanation

The given diagram shows the flowchart for a recursive function A(n). Assume that all statements, except for the recursive calls, have O(1) time complexity [G16S2Q49]

Explanation

A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in the queue)? [G16S1Q20]

Explanation

The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are: [G16S1Q23]

Explanation

An operator delete(i) for a binary heap data structure is to be designed to delete the item in the i-th node. Assume that the heap is implemented in an array and i refers to the i-th index of the array. [G16S1Q47]

Explanation

Consider the weighted undirected graph with 4 vertices, where the weight of edge {i, j} is given by the entry Wi j in the matrix W. [G16S1Q48]

Explanation

Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of G can have is . [G16S1Q49]

Explanation

G = (V,E) is an undirected simple graph in which each edge has a distinct weight, and e is a particular edge of G. Which of the following statements about the minimum spanning trees (MSTs) of G is/are TRUE? [G16S1Q50]

Explanation

Let Q denote a queue containing sixteen numbers and S be an empty stack. Head(Q) returns the element at the head of the queue Q without removing it from Q. [G16S1Q51]

Explanation

Match the algorithms with their time complexities: [G17S2Q3]

Explanation

Consider the recurrence function [G17S2Q30]

Explanation

The asymptotic upper bound solution of the recurrence relation given by [J17P3Q31]

Explanation

Any decision tree that sorts n elements has height ________. [J17P3Q32]

Explanation

Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take ________ time in the worst case. [J17P3Q33]

Explanation

The minimum number of scalar multiplication required, for parenthesization of a matrixchain product whose sequence of dimensions for four matrices is [J17P3Q34]

Explanation

Dijkstra’s algorithm is based on [J17P3Q35]

Explanation

Match the following with respect to algorithm paradigms : [J17P3Q36]

Explanation

Consider the following functions from positive integers to real numbers: [G17S1Q4]

Explanation