Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by krish__
1
answer
1
BITS Mtech or IIITB or IIIT D
What should be the preference order for mtech from these institutes and is it worth the fee (specifically BITS and IIIT Bengaluru)
What should be the preference order for mtech from these institutes and is it worth the fee (specifically BITS and IIIT Bengaluru)
4.1k
views
retagged
Mar 13, 2018
IIITs
iiit
mtech
iiitb
bits
+
–
1
answer
2
IISC/IIT admissions.
#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.
#admissionsIf 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 ...
641
views
retagged
Mar 13, 2018
IISc/IITs
admission
iit
+
–
1
answer
3
admissions
Which is better IIIT alahabad or MNIT Alahabad?
Which is better IIIT alahabad or MNIT Alahabad?
815
views
retagged
Mar 13, 2018
NITs
admission
mtech
+
–
1
answer
4
GATE CSE 2018
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?
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?
569
views
retagged
Mar 13, 2018
GATE
pragys
cse
+
–
1
answer
5
Admission in IIT(ISM) Dhanbad
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)?
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...
1.4k
views
retagged
Mar 13, 2018
IISc/IITs
admissions
getting-to-iits
ism-dhanbad
+
–
4
answers
6
GATE IT 2006 | Question: 1
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 ... in the afternoon on a day when the temperature at noon is above $25°C$? $0.4$ $0.6$ $0.8$ $0.9$
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 les...
7.4k
views
answered
Jan 29, 2018
Probability
gateit-2006
probability
normal
conditional-probability
+
–
1
answer
7
Gate_2018_Model Paper
Please explain the solution
Please explain the solution
481
views
commented
Jan 27, 2018
Programming in C
data-structures
algorithms
+
–
1
answer
8
MadeEasy Test Series 2018: General Aptitude - Modular Arithematic
The value of the expression $13^{88} \text{(mod 19)},$ in the range $0$ to $18,$ is ________.
The value of the expression $13^{88} \text{(mod 19)},$ in the range $0$ to $18,$ is ________.
598
views
commented
Jan 27, 2018
Quantitative Aptitude
general-aptitude
modular-arithmetic
made-easy-test-series
+
–
1
answer
9
Back edge,tree edge,forward edges in BFS
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 ... back edge, or cross edge and not forward edge as in the case of DFS. Find TRUE or FALSE for both the statements
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 i...
13.3k
views
commented
Jan 27, 2018
DS
algorithms
breadth-first-search
depth-first-search
graph-algorithms
programming-in-c
data-structures
+
–
0
answers
10
Cache and Main Memory
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 ... (first 4 bytes) + 75 (remaining 60 bytes) How it get 75ns accesstime ? After 4 words each words is accessed at 5ns Access time.?
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 firs...
477
views
commented
Jan 25, 2018
CO and Architecture
co-and-architecture
+
–
1
answer
11
GATE IT 2004 | Question: 34
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)$
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+...
5.6k
views
commented
Jan 23, 2018
Combinatory
gateit-2004
recurrence-relation
combinatory
normal
+
–
10
answers
12
GATE CSE 2011 | Question: 54
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. ... 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$
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 ...
17.3k
views
commented
Jan 23, 2018
Algorithms
gatecse-2011
algorithms
graph-algorithms
spanning-tree
normal
+
–
5
answers
13
GATE IT 2006 | Question: 64
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 ... $1- \dfrac{ N}{i}$ $\dfrac{i}{(N + i)}$ $1$ $1 - e^{\left(\frac{i}{N}\right)}$
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...
12.9k
views
commented
Jan 8, 2018
Computer Networks
gateit-2006
computer-networks
sliding-window
normal
+
–
3
answers
14
GATE CSE 1998 | Question: 12
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$
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$,...
7.3k
views
commented
Jan 6, 2018
Set Theory & Algebra
gate1998
set-theory&algebra
group-theory
descriptive
+
–
4
answers
15
GATE CSE 2000 | Question: 8
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$ ... the above notation that accept the language $\left\{0^{n}1^{m} \mid n \leq m \leq 2n\right\}$ by empty stack
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. ...
5.2k
views
answer edited
Jan 5, 2018
Theory of Computation
gatecse-2000
theory-of-computation
descriptive
pushdown-automata
+
–
5
answers
16
GATE CSE 2017 Set 2 | Question: 24
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=$ _____
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=$ _____
14.5k
views
retagged
Dec 29, 2017
Set Theory & Algebra
gatecse-2017-set2
polynomials
numerical-answers
set-theory&algebra
+
–
2
answers
17
Dynamic programming
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
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...
2.4k
views
commented
Dec 29, 2017
Algorithms
dynamic-programming
algorithms
+
–
0
answers
18
DLD Question
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
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
777
views
commented
Dec 28, 2017
2
answers
19
GATE CSE 1989 | Question: 1-v
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given $n$) is ___________.
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given $n$) is ___________.
6.5k
views
commented
Dec 28, 2017
Set Theory & Algebra
gate1989
descriptive
set-theory&algebra
binary-operation
+
–
4
answers
20
GATE CSE 1994 | Question: 2.2
On the set $N$ of non-negative integers, the binary operation ______ is associative and non-commutative.
On the set $N$ of non-negative integers, the binary operation ______ is associative and non-commutative.
5.9k
views
commented
Dec 28, 2017
Set Theory & Algebra
gate1994
set-theory&algebra
normal
group-theory
binary-operation
fill-in-the-blanks
+
–
6
answers
21
Self doubt
Does fixed size partitioning suffer from external fragmentation?
Does fixed size partitioning suffer from external fragmentation?
9.5k
views
comment edited
Dec 28, 2017
Operating System
operating-system
memory-management
+
–
10
answers
22
GATE CSE 2003 | Question: 38
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows: ... $(x, y)$ that satisfy the equations) is $0$ $1$ $2$ $3$
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows:$$\begin{array}{|c|c|c|c|} \hline \textbf{+} & \textbf{a}& \textbf{b} &\textbf{c...
7.1k
views
answered
Dec 28, 2017
Set Theory & Algebra
gatecse-2003
set-theory&algebra
normal
binary-operation
+
–
8
answers
23
GATE CSE 2006 | Question: 28
A logical binary relation $\odot$ ... $(\sim A\odot B)$ $\sim(A \odot \sim B)$ $\sim(\sim A\odot\sim B)$ $\sim(\sim A\odot B)$
A logical binary relation $\odot$, is defined as follows: $$\begin{array}{|l|l|l|} \hline \textbf{A} & \textbf{B}& \textbf{A} \odot \textbf{B}\\\hline \text{True} & \text...
5.9k
views
answer edited
Dec 28, 2017
Set Theory & Algebra
gatecse-2006
set-theory&algebra
binary-operation
+
–
13
answers
24
Minimum number of tables to represent ER-Diagram
How many minimum relations required for given ER diagram ?
How many minimum relations required for given ER diagram ?
8.9k
views
commented
Dec 27, 2017
Databases
er-diagram
databases
er-to-relational
relational
+
–
1
answer
25
ADDRESS TRANSLATION
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?
16 bit virtual address space20 bit physical address spacePage Table 0x1F 0x3F 0x23 0x17What are the physical address for virtual address 0xF0F0 and 0x...
958
views
commented
Dec 26, 2017
5
answers
26
Kenneth Rosen Edition 6th Exercise 1.1 Question 43 (Page No. 20)
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 ... least n of the statements in this list are false. Answer part (b) assuming that the list contains 99 statements
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 val...
3.7k
views
answered
Dec 26, 2017
Mathematical Logic
kenneth-rosen
mathematical-logic
descriptive
difficult
discrete-mathematics
+
–
5
answers
27
GATE IT 2007 | Question: 65
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$
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 unifo...
12.7k
views
commented
Dec 26, 2017
Databases
gateit-2007
databases
relational-calculus
probability
normal
+
–
5
answers
28
GATE IT 2007 | Question: 66
Consider the following two transactions$: T1$ and $T2.$ ...
Consider the following two transactions$: T1$ and $T2.$$\begin{array}{clcl} T1: & \text{read (A);} & T2: & \text{read (B);} \\ & \text{read (B);} & & \text{read (A);} \\ ...
18.0k
views
commented
Dec 25, 2017
Databases
gateit-2007
databases
transaction-and-concurrency
normal
+
–
2
answers
29
graph theory
Maximum no of edges in a triangle-free, simple planar graph with 10 vertices
Maximum no of edges in a triangle-free, simple planar graph with 10 vertices
822
views
answered
Dec 24, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
+
–
3
answers
30
GATE CSE 2014 Set 1 | Question: 22
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 ... 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
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$ an...
23.6k
views
commented
Dec 24, 2017
Databases
gatecse-2014-set1
databases
normal
sql
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register