# Recent activity by krish__

1
What should be the preference order for mtech from these institutes and is it worth the fee (specifically BITS and IIIT Bengaluru)
2
#admissions If anyone receives any update regarding opening of admission process in any IIT please comment. If there is any existing post then let us know. IISc has started it. IITB not yet. IITD/IITM not sure.
3
4
Are the answer keys of GO matching with the official answer keys given by GATE? If they are not, will the Pragy's app get updated and the data get changed?
5
I have a GATE 2017 score of 594 in CS(general category). According to 2017, GATE cutoff for MTech in CSE(IS) was 533 for general category. Do I have any chance of getting admission into this course this year with my score? Also, how much do cutoffs vary each year for this institute in CSE(IS)?
6
In a certain town, the probability that it will rain in the afternoon is known to be $0.6$. Moreover, meteorological data indicates that if the temperature at noon is less than or equal to $25°C$, the probability that it will rain in the afternoon is $0.4$. The temperature at noon is ... will rain in the afternoon on a day when the temperature at noon is above $25°C$? $0.4$ $0.6$ $0.8$ $0.9$
7
8
The value of the expression $13^{88} \text{(mod 19)},$ in the range $0$ to $18,$ is ________.
9
Consider the following statements: 1. Let T be the DFS tree resulting from DFS traversal on a connected directed graph the root of the tree is an articulation point, iff it has at least two children. 2. When BFS is carried out on a directed graph G, the edges of G will ... as tree edge, back edge, or cross edge and not forward edge as in the case of DFS. Find TRUE or FALSE for both the statements
10
Consider a single-level cache with an access time of 1.8ns, a line size of 16 bytes, and a hit ratio of 0.85. Main memory uses a block transfer capability that has a first word (4 bytes) access time of 40 ns and an access time of 5 ns for each word thereafter. ... = 40ns(first 4 bytes) + 75 (remaining 60 bytes) How it get 75ns accesstime ? After 4 words each words is accessed at 5ns Access time.?
11
Let $H_1, H_2, H_3,$ ... be harmonic numbers. Then, for $n \in Z^+$, $\sum_{j=1}^{n} H_j$ can be expressed as $nH_{n+1} - (n + 1)$ $(n + 1)H_n - n$ $nH_n - n$ $(n + 1) H_{n+1} - (n + 1)$
12
An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $0 < \mid i-j\mid \leq 2$. Each edge $(v_i,v_j)$ is assigned a weight $i+j$. A sample graph with $n=4$ is shown below. What will be the cost of the minimum spanning tree (MST) of such a graph with $n$ nodes? $\frac{1}{12} (11n^2 - 5 n)$ $n^2-n+1$ $6n-11$ $2n+1$
13
Suppose that it takes $1$ unit of time to transmit a packet (of fixed size) on a communication link. The link layer uses a window flow control protocol with a window size of $N$ packets. Each packet causes an ack or a nak to be generated by the receiver, and ack/nak transmission times are negligible. Further, ... is $1- \dfrac{ N}{i}$ $\dfrac{i}{(N + i)}$ $1$ $1 - e^{\left(\frac{i}{N}\right)}$
14
Let $(A, *)$ be a semigroup, Furthermore, for every $a$ and $b$ in $A$, if $a \neq b$, then $a*b \neq b*a$. Show that for every $a$ in $A$, $a*a=a$ Show that for every $a$, $b$ in $A$, $a*b*a=a$ Show that for every $a,b,c$ in $A$, $a*b*c=a*c$
15
A push down automation (pda) is given in the following extended notation of finite state diagram: The nodes denote the states while the edges denote the moves of the pda. The edge labels are of the form $d$, $s/s'$ where $d$ is the input symbol read and $s, s'$ are the stack ... states in the above notation that accept the language $\left\{0^{n}1^{m} \mid n \leq m \leq 2n\right\}$ by empty stack
16
Consider the quadratic equation $x^2-13x+36=0$ with coefficients in a base $b$. The solutions of this equation in the same base $b$ are $x=5$ and $x=6$. Then $b=$ _____
17
Which of the following statement(s) is/are correct? P: For a dynamic programming algorithm, computing all values in a bottom-up fashion is asymptotically faster than using recursion Q: The running time of a dynamic programming algorithm is always Θ(P) where P is the number of sub-problems.( Marks: -0.66 ) I mark only P is true. Answer neither P and Q
18
What should be approach to solve this type questions (FC2)16 X (DE0)16 = ? A (D2A3C)16 B. (D3A3C)16 C. (D4A3C)16 D. (D3A2C)16
19
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given n) is ___________.
20
On the set $N$ of non-negative integers, the binary operation ______ is associative and non-commutative.
21
22
Consider the set $\{a, b, c\}$ with binary operators $+$ and $*$ defined as follows: ... $(b * x) + (c * y) = c$ The number of solution(s) (i.e., pair(s) $(x, y)$ that satisfy the equations) is $0$ $1$ $2$ $3$
23
A logical binary relation $\odot$ ... to $A\wedge B$ ? $(\sim A\odot B)$ $\sim(A \odot \sim B)$ $\sim(\sim A\odot\sim B)$ $\sim(\sim A\odot B)$
24
How many minimum relations required for given ER diagram ?
25
16 bit virtual address space 20 bit physical address space Page Table 0x1F 0x3F 0x23 0x17 What are the physical address for virtual address 0xF0F0 and 0x001F?
26
Fuzzy logic is used in artificial intelligence. In fuzzy logic, a proposition has a truth value that is a number between 0 and 1, inclusive.A proposition with a truth value of 0 is false and one with a truth value of 1 is true. Truth values that are between 0 ... nth statement is At least n of the statements in this list are false. Answer part (b) assuming that the list contains 99 statements
Consider a selection of the form $\sigma_{A\leq 100} (r)$, where $r$ is a relation with $1000$ tuples. Assume that the attribute values for $A$ among the tuples are uniformly distributed in the interval $[0, 500].$ Which one of the following options is the best estimate of the number of tuples returned by the given selection query ? $50$ $100$ $150$ $200$
Given the following statements: S1: A foreign key declaration can always be replaced by an equivalent check assertion in SQL. S2: Given the table $R(a,b,c)$ where $a$ and $b$ together form the primary key, the following is a valid table definition. CREATE TABLE S ( a INTEGER, d ... is CORRECT? S1 is TRUE and S2 is FALSE Both S1 and S2 are TRUE S1 is FALSE and S2 is TRUE Both S1 and S2 are FALSE