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
Answers by krish__
8
votes
1
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.5k
views
answered
Jan 29, 2018
Probability
gateit-2006
probability
normal
conditional-probability
+
–
1
votes
2
Gate_2018_Model Paper
Please explain the solution
Please explain the solution
491
views
answered
Jan 27, 2018
Programming in C
data-structures
algorithms
+
–
5
votes
3
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.5k
views
answered
Jan 27, 2018
DS
algorithms
breadth-first-search
depth-first-search
graph-algorithms
programming-in-c
data-structures
+
–
14
votes
4
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.3k
views
answered
Jan 5, 2018
Theory of Computation
gatecse-2000
theory-of-computation
descriptive
pushdown-automata
+
–
2
votes
5
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.2k
views
answered
Dec 28, 2017
Set Theory & Algebra
gatecse-2003
set-theory&algebra
normal
binary-operation
+
–
16
votes
6
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...
6.0k
views
answered
Dec 28, 2017
Set Theory & Algebra
gatecse-2006
set-theory&algebra
binary-operation
+
–
0
votes
7
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.8k
views
answered
Dec 26, 2017
Mathematical Logic
kenneth-rosen
mathematical-logic
descriptive
difficult
discrete-mathematics
+
–
5
votes
8
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
answered
Dec 26, 2017
Algorithms
dynamic-programming
algorithms
+
–
4
votes
9
Self doubt
Does fixed size partitioning suffer from external fragmentation?
Does fixed size partitioning suffer from external fragmentation?
9.6k
views
answered
Dec 26, 2017
Operating System
operating-system
memory-management
+
–
1
votes
10
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
840
views
answered
Dec 24, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
+
–
0
votes
11
Algo-test
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)
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)
386
views
answered
Dec 24, 2017
Algorithms
algorithms
asymptotic-notation
test-series
+
–
12
votes
12
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.
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...
1.5k
views
answered
Dec 24, 2017
Databases
sql
databases
query
+
–
1
votes
13
doubt in asymptotic notation
given : 1/4 and 1 1/4 = theta(1) is this correct or only this 1/4 = O(1)
given : 1/4 and 1 1/4 = theta(1)is this corrector only this 1/4 = O(1)
208
views
answered
Dec 23, 2017
Algorithms
algorithms
asymptotic-notation
+
–
1
votes
14
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 .......................
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 .......................
343
views
answered
Dec 23, 2017
1
votes
15
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 .????
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 ...
3.3k
views
answered
Dec 22, 2017
2
votes
16
#graph theory
325
views
answered
Dec 22, 2017
Graph Theory
graph-theory
discrete-mathematics
+
–
5
votes
17
can any one differentiate between below configurations
VIPT PIPT PIVT VIVT
VIPTPIPTPIVTVIVT
1.2k
views
answered
Dec 21, 2017
Operating System
operating-system
+
–
1
votes
18
Operating System Basic Question
why we do indexing and tagging in cache ??
why we do indexing and tagging in cache ??
332
views
answered
Dec 21, 2017
Operating System
operating-system
+
–
2
votes
19
NIELIT 2017 DEC Scientist B - Section B: 53
When the sum of all possible two digit numbers formed from three different one digit natural numbers are divided by sum of the original three numbers, the result is $26$ $24$ $20$ $22$
When the sum of all possible two digit numbers formed from three different one digit natural numbers are divided by sum of the original three numbers, the result is$26$$2...
1.7k
views
answered
Dec 18, 2017
Quantitative Aptitude
nielit2017dec-scientistb
general-aptitude
quantitative-aptitude
digit-sum
+
–
3
votes
20
Which function has asymptotically larger growth rate n^{logn} or logn^{n}
997
views
answered
Dec 18, 2017
Algorithms
recurrence-relation
asymptotic-notation
algorithms
+
–
0
votes
21
Digital signature doubt
Why do we need a "trusted third party" between a client and a receiver when sending a message with a digital signature? I mean what are the consequences if we don't do that?
Why do we need a "trusted third party" between a client and a receiver when sending a message with a digital signature?I mean what are the consequences if we don't do tha...
652
views
answered
Dec 15, 2017
Computer Networks
computer-networks
network-security
digital-signature
+
–
8
votes
22
TIFR CSE 2018 | Part A | Question: 12
An $n \times n$ matrix $M$ with real entries is said to be positive definite if for every non-zero $n$-dimensional vector $x$ with real entries, we have $x^{T}Mx>0.$ Let $A$ and $B$ be symmetric, positive definite matrices of size ... $(3)$ Only $(1)$ and $(3)$ None of the above matrices are positive definite All of the above matrices are positive definite
An $n \times n$ matrix $M$ with real entries is said to be positive definite if for every non-zero $n$-dimensional vector $x$ with real entries, we have $x^{T}Mx>0.$ Let ...
1.7k
views
answered
Dec 10, 2017
Linear Algebra
tifr2018
matrix
linear-algebra
+
–
3
votes
23
TIFR CSE 2018 | Part A | Question: 2
Consider the following subset of $\mathbb{R} ^{3}$ (the first two are cylinder, the third is a plane): $C_{1}=\left \{ \left ( x,y,z \right ): y^{2}+z^{2}\leq 1 \right \};$ ... $A?$ Circle Ellipse Triangle Square An octagonal convex figure with curved sides
Consider the following subset of $\mathbb{R} ^{3}$ (the first two are cylinder, the third is a plane):$C_{1}=\left \{ \left ( x,y,z \right ): y^{2}+z^{2}\leq 1 \right \};...
866
views
answered
Dec 10, 2017
Quantitative Aptitude
tifr2018
quantitative-aptitude
geometry
three-dimensional-geometry
non-gate
+
–
12
votes
24
TIFR CSE 2018 | Part A | Question: 1
Consider a point $A$ inside a circle $C$ that is at distance $9$ from the centre of a circle. Suppose you told that there is a chord of length $24$ passing through $A$ with $A$ as its midpoint. How many distinct chords of $C$ have integer length and pass through $A?$ $2$ $6$ $7$ $12$ $14$
Consider a point $A$ inside a circle $C$ that is at distance $9$ from the centre of a circle. Suppose you told that there is a chord of length $24$ passing through $A$ wi...
1.5k
views
answered
Dec 10, 2017
Quantitative Aptitude
tifr2018
quantitative-aptitude
geometry
circle
+
–
3
votes
25
Which of the following language generated by given grammar?
Which of the following language generated by given grammar? 1) L = {w : na(w) and nb(w) both are even} 2) L = {w : na(w) and nb(w) both are odd} 3) L = {w : na(w) or nb(w) are even} 4) L = {w : na(w) or nb(w) are odd}
Which of the following language generated by given grammar?1) L = {w : na(w) and nb(w) both are even}2) L = {w : na(w) and nb(w) both are odd}3) L = {w : na(w) or nb(w) a...
471
views
answered
Dec 10, 2017
Theory of Computation
theory-of-computation
+
–
4
votes
26
infix to prefix
Convert following infix to prefix expression e^d-a*b^f/g+h*c/i+j-k Explain each step
Convert following infix to prefix expressione^d-a*b^f/g+h*c/i+j-kExplain each step
2.6k
views
answered
Dec 6, 2017
5
votes
27
Previous Gate
The second moment of a Poisson-distributed random variable is 2. The mean of the variable is .... My question on solving we get 2 values of lamda(ie mean) .One is -2 and the other is 1 .So which one to choose?
The second moment of a Poisson-distributed random variable is 2. The mean of the variable is ....My question on solving we get 2 values of lamda(ie mean) .One is -2 and t...
4.8k
views
answered
Nov 23, 2017
Mathematical Logic
mathematics
gate-2015
engineering-mathematics
statistics
probability
poisson-distribution
+
–
22
votes
28
GATE IT 2006 | Question: 73
An array $X$ of n distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. If the root node is at level $0$, the level of element $X[i]$, $i \neq 0$, is $\left \lfloor \log _2 i \right \rfloor$ ... $\left \lfloor \log _2 (i+1) \right \rfloor$ $\left \lceil \log _2 i \right \rceil$
An array $X$ of n distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. If the root node is at level $0$, the le...
9.2k
views
answered
Nov 19, 2017
DS
gateit-2006
data-structures
binary-tree
normal
+
–
2
votes
29
Number of Monotonic function
Consider a function F from set A to B having A={1,2,...n} and B={1,2,....m} Find number's of f in F where f is defined as : 1. f(i)<=f(j) and 1<=i<=j<=n 2.f(i)< f(j) and 1<=i<=j<=n 3. f(i) >=f(j) and 1<=i<=j<=n 4. f(i) > f(j) and 1<=i<=j<=n.
Consider a function F from set A to B having A={1,2,...n} and B={1,2,....m} Find number's of f in F where f is defined as :1. f(i)<=f(j) and 1<=i<=j<=n2.f(i)< f(j) and 1<...
1.7k
views
answered
Nov 15, 2017
Set Theory & Algebra
set-theory&algebra
+
–
16
votes
30
self doubt computer organization
The most relevant addressing mode to write position-independent code what is the meaning of postion - independent code
The most relevant addressing mode to write position-independent code what is the meaning of postion - independent code
4.5k
views
answered
Nov 15, 2017
CO and Architecture
co-and-architecture
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register