# Recent questions tagged usermod

1
Was solving the GO 2019 pdf when I encountered this question asked in TIFR 2017. Although I have understood this question, I have one doubt- It is mentioned in the question that for a 3-bit number, the ordering (000, 100, 101, 111, 110, 010, 011, 001) is one of the possible Gray codes. Then, how many such orders are there for an n-bit number?
2
Which of the following functions is not differentiable in the domain $[-1,1]$ ? (a) $f(x) = x^2$ (b) $f(x) = x-1$ (c) $f(x) = 2$ (d) $f(x) = Maximum (x,-x)$
3
Consider a max-heap of n distinct integers, n ≥ 4, stored in an array A[1 . . . n]. The second minimum of A is the integer that is less than all integers in A except the minimum of A. Find all possible array indices of A in which the second minimum can occur. Justify your answer.
1 vote
4
Let the valid moves along a staircase be U (one step up) and D (one step down). For example, the string s = UUDU represents the sequence of moves as two steps up, then one step down, and then again one step up. Suppose a person is initially at the base of the ... to the base of the staircase after the final step. (a) Show that L is not regular. (b) Write a context free grammar for accepting L.
1 vote
5
Let $a_{n−1}a_{n−2}...a_0$ and $b_{n−1}b_{n−2}...b_0$ denote the $2's$ complement representation of two integers $A$ and $B$ respectively. Addition of $A$ and $B$ yields a sum $S=s_{n−1}s_{n−2}...s_0.$ The outgoing carry generated at the most significant bit ... $\oplus$ denotes the Boolean XOR operation. You may use the Boolean identity: $X+Y=X⊕Y⊕(XY)$ to prove your result.
6
Consider three relations $R_1(\underline{X},Y,Z), R_2(\underline{M},N,P),$ and $R_3(\underline{N,X})$. The primary keys of the relations are underlined. The relations have $100,30,$ and $400$ ... during execution of the join. For, (a), Order could be anything and min. cost =$100*30*400*$total size of all the attributes.
7
A $64000$-byte message is to be transmitted over a $2$-hop path in a store-and-forward packet-switching network. The network limits packets toa maximum size of $2032$ bytes including a $32$-byte header. The trans-mission lines in the network are error free and have a speed of $50$ Mbps. ... getting answer as $1*3*(T_t+T_p) + \;31*T_t$ where $T_t=0.325\; ms$ and $T_p=3.333\; ms$. Please Confirm.
8
In the dld 1 mark ques on prob,it was mentioned that we need to select pairs whose MSB same and they must be( Unsigned ) from 1 to 13.Is that doesn’t means we have to select only +ve ones(i.e 1-7) ,bcoz MSB 1 will be -ve.Please clarify.Shouldn’t we select only 1-7
9
Hi All, My GATE 2019 Score is 467, Marks: 40 and Rank is: 6124. I belong to OBC(Non-Creamy Layer). I have a probability of getting M.Tech(CS-IS) at IIT(ISM) Dhanbad and M.Tech(CS) at University of Hyderabad(UoH). Can somebody help me what to ... Two Options OR Suggest me any good colleges for my GATE Score ? Any other suggestions or college recommendations will also be very helpful. Thank you. :)
10
@arjunsir @pragyAgrawal Is the career suggestion link in gate college predictor working? I haven't received any mail regarding the same. I have 64.33/100 marks and 737/1000 score. My rank is 498 in General category. Please suggest which colleges I should focus on. How do I gauge which colleges I can get?
11
Will gate rank predictor be revised according to the official and final answer key?
12
Consider the group $G \;=\; \begin{Bmatrix} \begin{pmatrix} a & b \\ 0 & a^{-1} \end{pmatrix}\;: a,b \in \mathbb{R},a>0 \end{Bmatrix}$ ... is of finite order (D) $N$ is a normal subgroup and the quotient group is isomorphic to $\mathbb{R}^{+}$(the group of positive reals with multiplication).
1 vote
13
Let $P_{1},P_{2},$ and $P_{3}$ denote, respectively, the planes defined by $a_{1}x + b_{1}y + c_{1}z = \alpha _{1}$ $a_{2}x + b_{2}y + c_{2}z = \alpha _{2}$ $a_{3}x + b_{3}y + c_{3}z = \alpha _{3}$ ... then the planes (A) do not have any common point of intersection (B) intersect at a unique point (C) intersect along a straight line (D) intersect along a plane
1 vote
14
Let, $a_{n} \;=\; \left ( 1-\frac{1}{\sqrt{2}} \right ) ... \left ( 1- \frac{1}{\sqrt{n+1}} \right )$ , $n \geq 1$. Then $\lim_{n\rightarrow \infty } a_{n}$ (A) equals $1$ (B) does not exist (C) equals $\frac{1}{\sqrt{\pi }}$ (D) equals $0$
15
If two real polynomials $f(x)$ and $g(x)$ of degrees $m\;(\geq2)$ and $n\;(\geq1)$ respectively, satisfy $f(x^{2}+1) = f(x)g(x)$ $,$ for every $x\in \mathbb{R}$ , then (A) $f$ has exactly one real root $x_{0}$ such that $f'(x_{0}) \neq 0$ (B) $f$ has exactly one real root $x_{0}$ such that $f'(x_{0}) = 0$ (C) $f$ has $m$ distinct real roots (D) $f$ has no real root.
16
Is the rank of 631/28326 a good rank? What college I must apply to? or any advice/suggestion will be helpful and r welcome. Marks – 61.67 Accuracy – 98%+ (Only 1 -ve in Tag bit question) Category – SC but ok with OPEN too. Thank You in Advance (^_^)
17
I am getting 74.67 marks, and a score of about 866, will I get direct admission in IITK or IITB ?
18
I am getting around 72 marks in GATE CSE 2019 with an estimated rank between 133-158 on GO RANK PREDICTOR, how should i start off my preparation for interviews in IIT’s ?
19
I am getting 62.34 marks and my rank according to gateoverflow rank predictor wil be between 400-500.Is there any chance of getting iit in cs
20
1 vote
21
1 vote
22
23
1 vote
24
any idea, what will be the rank for marks 35 in gate 19.I really messed by exam. Any chances for NIT's. ?
25
Will ISRO 2019 recruit this year? till now there is no information about ISRO 2019 form. Please share if you have information regarding it.
26
Value of Z, for SRTF ques? So that WT avg is 1ms?
27
What will be the answer to this question ? Will it go in infinite loop ?