The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by krish__
User krish__
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User krish__
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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)
retagged
Mar 13, 2018
in
IIITs

2.1k
views
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.
retagged
Mar 13, 2018
in
IISc/IITs

283
views
admission
iit
1
answer
3
admissions
Which is better IIIT alahabad or MNIT Alahabad?
retagged
Mar 13, 2018
in
NITs

251
views
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?
retagged
Mar 13, 2018
in
GATE

371
views
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)?
retagged
Mar 13, 2018
in
IISc/IITs

830
views
admissions
gettingtoiits
ismdhanbad
4
answers
6
GATE2006IT1
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 ... rain in the afternoon on a day when the temperature at noon is above $25°C$? $0.4$ $0.6$ $0.8$ $0.9$
answered
Jan 29, 2018
in
Probability

1.9k
views
gate2006it
probability
normal
1
answer
7
Gate_2018_Model Paper
Please explain the solution
commented
Jan 27, 2018
in
Programming

79
views
datastructures
algorithms
1
answer
8
MadeEasy Test Series 2018: General Aptitude  Modular Arithematic
The value of the expression 1388 (mod 19), in the range 0 to 18, is ________.
commented
Jan 27, 2018
in
Numerical Ability

164
views
generalaptitude
modulararithmetic
madeeasytestseries
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
commented
Jan 27, 2018
in
DS

2.1k
views
algorithms
bfs
dfs
graphalgorithms
programminginc
datastructures
0
answers
10
Cache and Main Memory
Consider a singlelevel 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.?
commented
Jan 25, 2018
in
CO and Architecture

78
views
coandarchitecture
2
answers
11
GATE2004IT34
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)$
commented
Jan 23, 2018
in
Combinatory

1.6k
views
gate2004it
recurrence
permutationandcombination
normal
8
answers
12
GATE201154
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 ij\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 ... minimum spanning tree (MST) of such a graph with $n$ nodes? $\frac{1}{12} (11n^2  5 n)$ $n^2n+1$ $6n11$ $2n+1$
commented
Jan 23, 2018
in
Algorithms

5.4k
views
gate2011
algorithms
graphalgorithms
spanningtree
normal
3
answers
13
GATE2006IT64
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. ... $1 \dfrac{ N}{i}$ $\dfrac{i}{(N + i)}$ $1$ $1  e^{\left(\frac{i}{N}\right)}$
commented
Jan 9, 2018
in
Computer Networks

4k
views
gate2006it
computernetworks
slidingwindow
normal
2
answers
14
GATE199812
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$
commented
Jan 6, 2018
in
Set Theory & Algebra

1.5k
views
gate1998
settheory&algebra
grouptheory
descriptive
3
answers
15
GATE20008
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 ... states in the above notation that accept the language $\left\{0^{n}1^{m} \mid n \leq m \leq 2n\right\}$ by empty stack
answer edited
Jan 5, 2018
in
Theory of Computation

1.6k
views
gate2000
theoryofcomputation
descriptive
pushdownautomata
5
answers
16
GATE2017224
Consider the quadratic equation $x^213x+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=$ _____
retagged
Dec 29, 2017
in
Set Theory & Algebra

4.5k
views
gate20172
polynomials
numericalanswers
settheory&algebra
1
answer
17
Dynamic programming
Which of the following statement(s) is/are correct? P: For a dynamic programming algorithm, computing all values in a bottomup 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 subproblems.( Marks: 0.66 ) I mark only P is true. Answer neither P and Q
commented
Dec 29, 2017
in
Algorithms

312
views
dynamicprogramming
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
commented
Dec 29, 2017
in
Digital Logic

169
views
1
answer
19
GATE19891v
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given n) is ___________.
commented
Dec 28, 2017
in
Set Theory & Algebra

1.8k
views
gate1989
descriptive
settheory&algebra
binaryoperation
3
answers
20
GATE19942.2
On the set $N$ of nonnegative integers, the binary operation ______ is associative and noncommutative.
commented
Dec 28, 2017
in
Set Theory & Algebra

1.3k
views
gate1994
settheory&algebra
normal
binaryoperation
descriptive
4
answers
21
Does fixed partitioning suffers from external fragmentation?
comment edited
Dec 28, 2017
in
Operating System

2.5k
views
operatingsystem
memorymanagement
5
answers
22
GATE200338
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows: ... $(x, y)$ that satisfy the equations) is $0$ $1$ $2$ $3$
answered
Dec 28, 2017
in
Set Theory & Algebra

2k
views
gate2003
settheory&algebra
normal
binaryoperation
7
answers
23
GATE200628
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)$
answer edited
Dec 28, 2017
in
Set Theory & Algebra

1.6k
views
gate2006
settheory&algebra
binaryoperation
9
answers
24
Minimum number of tables to represent ERDiagram
How many minimum relations required for given ER diagram ?
commented
Dec 27, 2017
in
Databases

1.7k
views
erdiagram
databases
ertorelational
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?
commented
Dec 27, 2017
in
Operating System

180
views
os
2
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
answered
Dec 27, 2017
in
Mathematical Logic

246
views
kennethrosen
mathematicallogic
descriptive
difficult
discretemathematics
3
answers
27
GATE2007IT65
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$
commented
Dec 26, 2017
in
Databases

3.5k
views
gate2007it
databases
relationalcalculus
probability
normal
4
answers
28
GATE2007IT66
Consider the following two transactions : T1 and T2. T1 : read (A); T2 : read (B); read (B); read (A); if A = 0 then B ← B + 1; if B ≠ 0 then A ← A  1; write (B); write (A); Which of the following schemes, using shared and exclusive locks, satisfy the requirements for ... ← B + 1; then A ← A  1; write (B); write (A); unlock (A); unlock (A); unlock (B); unlock (B); commit; commit;
commented
Dec 26, 2017
in
Databases

4.1k
views
gate2007it
databases
transactions
normal
2
answers
29
graph theory
Maximum no of edges in a trianglefree, simple planar graph with 10 vertices
answered
Dec 24, 2017
in
Graph Theory

226
views
graphtheory
discretemathematics
graphconnectivity
graphmatching
engineeringmathematics
3
answers
30
GATE2014122
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 ... 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
commented
Dec 24, 2017
in
Databases

5.8k
views
gate20141
databases
normal
sql
7
answers
31
GATE200336
How many perfect matching are there in a complete graph of $6$ vertices? $15$ $24$ $30$ $60$
commented
Dec 24, 2017
in
Graph Theory

5.4k
views
gate2003
graphtheory
graphmatching
normal
2
answers
32
no of perfect matching in complete graph
Is there a way to find no of perfect matchings in a complete graph Kn where n could be either even or odd..?
answer edited
Dec 24, 2017
in
Graph Theory

3.3k
views
graphmatching
2
answers
33
Algotest
Let f (n) = Ο(n), g(n) = Ο(n) and h(n) = θ(n). Then [f (n) . g(n)] + h(n) is : a) Ο(n) b)θ(n) I think it must be 0(n)
answered
Dec 24, 2017
in
Algorithms

47
views
algorithms
1
answer
34
SQL keyword ANY and ALL
Hi Guys, In SQL, <condition> ALL evaluates to TRUE if inner query returns no tuples. { X < ALL (empty) == TRUE } <condition> ANY evaluates to FALSE if inner query returns no tuples. { X < ANY (empty) == FALSE } But what is the logical reason behind this ? PS: ping @Krish__, @Anu007, @Ashwin Kulkarni @reena_kandari and @srestha ji.
commented
Dec 24, 2017
in
Databases

329
views
sql
databases
query
3
answers
35
GATE20021.20
With regards to the expressive power of the formal relational query languages, which of the following statements is true? Relational algebra is more powerful than relational calculus Relational algebra has the same power as relational calculus Relational algebra has the same power as safe relational calculus None of the above
answer edited
Dec 24, 2017
in
Databases

1.9k
views
gate2002
databases
relationalcalculus
normal
1
answer
36
no. of functions
The number of function from set {1, 2, 3, 4, 5, 6, 7, 8} to set {0, 1} such that assign 1 to exactly one of given number less than 8 are .......................
commented
Dec 23, 2017
in
Combinatory

67
views
0
answers
37
Testbook Test Series: Mathematical Logic  Logical Reasoning
In a village there are only two types of people. Type F are those who always lie and Type T always tell the truth. X says according to Y, I always lie . Assume both X and Y belong to above mentioned village Which of the following is not possible? I ... and Y both are Type T III) X is type F and Y is Type T IV) X is type T and Y is Type F
commented
Dec 23, 2017
in
Mathematical Logic

160
views
testbooktestseries
mathematicallogic
logicalreasoning
1
answer
38
doubt in asymptotic notation
given : 1/4 and 1 1/4 = theta(1) is this correct or only this 1/4 = O(1)
answered
Dec 23, 2017
in
Algorithms

43
views
5
answers
39
GATE2015141
Consider an EntityRelationship $(ER)$ model in which entity sets E$_{1}$ and E$_{2}$ are connected by an m:n relationship R$_{12}$. E$_{1}$ and E$_{3}$ are connected by a 1 : n (1 on the side of E$_{1}$ and n on ... If a relational model is derived from the above $ER$ model, then the minimum number of relations that would be generated if all relation are in $3NF$ is________________.
commented
Dec 23, 2017
in
Databases

4.9k
views
gate20151
databases
erdiagram
normal
numericalanswers
2
answers
40
KENETH ROSEN
How many different ways are there to seat four people around a circular table, where two seatings are considered the same when each person has the same left neighbor and the same right neighbor? ANSWER IS 6 OR 3 .????
commented
Dec 23, 2017
in
Combinatory

157
views
50,741
questions
57,244
answers
198,016
comments
104,608
users