IITG

IITG GATECSE Cutoff

IITG Cutoffs (last ranks) for Master’s admission in CSE

Array A is in non-decreasing order (2 or more same elements can be present). ∴ A[1] ≼ A[2] ≼ A[3] ≼

OPTION D none of these code-.unit testing design-> integration testing requirements->validat

Option-A is ruled out because it is not register. Registers are more faster than cache memory. Opt

The answer to this question is simply max-heapify function on root (Max-Heapify(root)). Time complex

every internal node is $k$ children Total node$ =nk+1$(1 is for root) $leaves$ =$total$ $node$ - $in

Option C Let G be a graph with n vertices and m edges. the tightest upper bound on the running time

$Given$ : $x^{a}$$=$$y^{b}$$=$$z^{c}$ & $y^{2}=zx$ $Let$ $x^{a}$$=$$y^{b}$$=$$z^{c}$$=$$k$ $\Rig

$Let\ 1^{st}$ $number$ $is$ $x$ $and$ $2^{nd}$ $number$ $is$ $y.$ $\Rightarrow$ $\textrm{($\frac{1}{

$\textrm{On throwing two dices Possible Outcomes are:}$ $(1,1)(1,2)(1,3)(1,4)(1,5)(1,6)$ $(2,1)(2,2

$\textrm{There is a meal for 200 children.}$ $\textrm{150 children have taken the meal}$ $\textrm{Re

$\textrm{Let the required number of days be x.}$ $\textrm{Less men, More days (Indirect proportion)}

$\textrm{3 pair,9 and 6 or 7 and 2 or 23 and 22. }$

%d bloggers like this: