Register

Recent posts tagged mtech-admission

3
All about M.Tech. and Research Admissions at IITGn
If activation record size is known at compile time. Then why can't we place it in the area where static or global variables is placed ?? why do we need heap for it ??
User Avatar
4
All about M.Tech. and Research Admissions at IITR
since ,the type of a is float and type of 3 is int in that expression so,the expression is converted into float type.why it is n't converted into int type ??
User Avatar
5
All about M.Tech. and Research Admissions at IITH
haa you did wrong.... 00 then 11 then 01 then 10 and again 00...
User Avatar
6
All about M.Tech. and Research Admissions at IITG
Parallel should be opposite of hierarchical. Parallel means things are done together. Hierarchical means there is a serial way of access.
User Avatar
8
All about M.Tech. and Research Admissions at IITD
During runtime, it is difficult to do anything on stack- as activation record size is decided at compile time. So, it must always be on heap. But I don't know if any lang...
User Avatar
9
All about M.Tech. and Research Admissions at IITK
everybody telling different different approach , so please give me the right one .
User Avatar
10
All about M.Tech. and Research Admissions at IITM
RE : 0*(10)* (in question)Here is a trick for option B) and C) B) 0+(0+10)+ C) (0+1)*10(0+1)*Both of these cannot accept Empty set or Empty St...
User Avatar
11
All about M.Tech. and Research Admissions at IITB
There are many configurations possible here. So, why look for formula. Just understand the working of different types of cache and apply the logic as per the given questi...
User Avatar
12
All about M.Tech. and Research Admissions at IISc
If the counters are connected one followed by other then the overall frequency of the counters together is equal to frequency/overall MOD of counteroverall MOD of connect...
User Avatar
13
IIT Delhi and Pro and Cons.
Sorry, my answer was wrong. I had missed the possibility of $x = y$. Also, two interpretations are possible here as shown now.
User Avatar
15
GATECSE 2020 Admissions Live Discussion
Which of following statement is true ?S1. Any boolean function can be realized using decoders2. One multiplexer can realize 1 function at a timea) S1 is trueb) S2 is true...
User Avatar
16
IIT Delhi CSE Mtech interview 14 may
bhai integration is area only http://www.mathsisfun.com/calculus/integration-introduction.html
User Avatar
18
IIT Kanpur Interview Experience
If $g(x) = 1 - x$ and $h(x) = \frac{x}{x-1}$, then $\frac{g(h(x))}{h(g(x))}$ is:$\frac{h(x)}{g(x)}$$\frac{-1}{x}$$\frac{g(x)}{h(x)}$$\frac{x}{(1-x)^{2}}$
User Avatar
19
IIIT Hyderabad Interview Experience
C) P - iii, Q - i, R - iv, S - iiRef: https://en.wikipedia.org/wiki/Software_testing
User Avatar
20
IIT Delhi Interview Experience
Is there any SQL command which belongs to both DDL and DML?
User Avatar
21
IIT Hyderabad Interview Experience
Answer is D.$L_1$ is context-free and hence recursive also. Recursive set being closed under complement, $L_1$' will be recursive.$L_1$' being recursive it is also recurs...
User Avatar
22
IIT Bombay Interview Experience
$\displaystyle \lim_{x\rightarrow \infty } x^{ \tfrac{1}{x}}$ is$\infty $$0$$1$Not defined
User Avatar
23
IISc Research Interview Experience
Correct Option: BWorst case for quick sort happens when $1$ element is on one list and $n-1$ elements on another list.
User Avatar
24
IIT BHUBANESWAR MTECH WRITTEN TEST/INTERVIEW
Match the following:(P) Condition Coverage (i) Black-box testing(Q) Equivalence class partitioning (ii) System testing(R) Volume testing ...
User Avatar
25
Tips for COAP-2019
Correct Option: D$foo$ is printing the lowest digit. But the $printf$ inside it is after the recursive call. This forces the output to be in reverse order$2, 0, 4, 8$The ...
User Avatar
26
Important Dates for Counselling (GATE 2019)
Let $G$ be a finite group. If $A$ and $B$ are subgroups of $G$ with orders 4 and 5 respectively, then $|A \cap B|$ = ______.
User Avatar
27
IITH Mtech RA Interview Experience
2 is correct answer. fig 2, b and c have {f,g} as upperbound. but for the graph to be a lattice it should have a least upper bound. Since b and c have two upper bounds th...
User Avatar
28
Need suggestions for what to do next after Gate ??
answer - CThere are 2 decision points in this module1. while condition and2. if conditionhence cyclomatic complexity = number of decision points + 1 = 3
User Avatar
29
For GATECSE Admissions 2019
Here bound of the loop are constants, therefore compiler will do the loop unrolling(If compiler won't then prefetcher will do) to increase the instruction level paralleli...
User Avatar
Page: