IITG

IITG GATECSE Cutoff

April 12, 2016 by ibia Leave a Comment

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

13,344 total views

GATE Overflow
Aptitude Overflow

Answered: Peter Linz Edition 4 Exercise 1.2 Question 2 (Page No. 27)

$(uv)^R = v^Ru^R,$ for all strings $u,v.$ If $u = \epsilon,$ then $u^R = \epsilon$ and hence $(uv)^R = v^R = v^Ru^R.$ If $v = \epsilon,$ then $v^R = \epsilon$ and hence $(uv)^R = u^R = v^Ru^R.$ Now, suppose $u = u_1u_2 \dots u_m$ and $v = v_1v_2 \dots v_n$, with $m,n \geq 1.$ Then, $(uv)^R = (u_1u_2 \dots u_mv_1v_2 \dots v_n)^R = v_n \dots v_2v_1x_m \dots x_2x_1 = v^Ru^R.$ Detailed Video Solution [...]

Answered: Peter Linz Edition 4 Exercise 1.2 Question 1 (Page No. 27)

Solution from Peter Linz itself: For $n = 1,$ $|u^1| = |u|.$ Assume $|u^k| = k|u|$ holds for $k = 1, 2, ..., n,$ then $|u^{n+1}| = |u^nu| = |u^n| + |u| = n|u| + |u| = (n + 1)|u|.$ Detailed Video Solution [...]

Answered: Kenneth Rosen Edition 7 Exercise 6.1 Question 41 (Page No. 397)

Ans: $2^{\lceil n/2 \rceil}$ APPROACH: for even length strings: 1st bit and nth bit are same. similarly, 2nd and (n-1)th bits are same. Now, 2 bits for every position, and we are filling n/2 positions. therefore $2^{n/2}$ strings for odd-length strings 1st bit and nth bit are same. similarly, 2nd and (n-1)th bits are same. but {(n+1)/2}th positions has 2 more ways to be filled Now, 2 bits for every position, and we are filling n/2 positions. therefore $2^{n+1/2}$ strings. We can also write it as $2^{\lceil n/2 \rceil}$. [...]

Answered: #nptel

C. To be able to infer the flow of control from the program source code … The main goal of structured Programming is to get an understanding about the flow of control in the given program text. In structure programming various control structures such as switch case. If then – else, while, etc. Allows a programmer to decode the flow of the program easily… [...]

Answered: GATE CSE 2008 | Question: 40

Say we need to find the number of occurence of a number k. If k has to occur atleast n/2 times (that is half of the array size), then k must be there in the middle. There is no way that there are atleast n/2 occurences of k and k is not there in array[middle]. BUT, vice-versa is not true. Maybe what we can do here is to first look in the condition C1: (array[middle] == k) If C1 is False, go home. But if C1 is True we may have something to work with. Now the n/2 appearances of… [...]

Answered: Kenneth Rosen Edition 7 Exercise 6.1 Question 40 (Page No. 397)

No of subsets of a set with n elements = $\large 2^n$ n = 100. $\large \therefore$ no. of subsets with more than one elements = $\large 2^{100} -101$ (100 subsets of size 1, 1 subset of size 0) PS: do correct me, if I’m wrong [...]

Five ladies are sitting in a row .Savita is

NIELIT 2022 Feb Scientist D - Section E: 1

Which type of conflict management technique is described as cooperating and that one s gives way to the other ? Avoiding Accommodating Competing Compromising [...]

NIELIT 2022 Feb Scientist D - Section E: 2

Free - rein Leadership is also known as : Authoritarian Leadership Laissez Faire Leadership Democratic Leadership Participative Leadership [...]

NIELIT 2022 Feb Scientist D - Section E: 3

Identify the four main styles of leaders displayed by the manager which w identified in Tannenbaum and Schmid continuum of possible leaders behaviour : Tells, help, joins and leads Commands, sells, consults and resis Tells, sells, consults and joins Commands, help, join and leads [...]

NIELIT 2022 Feb Scientist D - Section E: 4

Success of each organisation is depend upon the ___________ of employees. Satisfaction Behaviour Attitude Performance [...]

NIELIT 2022 Feb Scientist D - Section E: 5

A leader motivates his followers to work hard by offering them reward is ____________ . Positive style Negative style Autocratic style Democratic style [...]

%d bloggers like this:

Skip links

IITG

Share this:

Like this: