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 worst_engineer
2
votes
1
linear algebra
Let A and B be two matrices.Which of the following statements is TRUE ? S1 : If product of A and B ( (i.e) AB ) = 0-matrix ,then either one of A or B should be equal to 0-matrix. S2 : If product of A and B ( (i.e) AB ) = A , then B should be an identity matrix.
Let A and B be two matrices.Which of the following statements is TRUE ? S1 : If product of A and B ( (i.e) AB ) = 0-matrix ,then either one of A or B should be equa...
350
views
answered
Mar 30, 2017
Linear Algebra
engineering-mathematics
linear-algebra
+
–
2
votes
2
Regarding MS from iit kgp or madras
What are the prospects of MS from IIT KGP andIITM?What score is needed? Branch CS.which is better Mtech or MS?
What are the prospects of MS from IIT KGP andIITM?What score is needed? Branch CS.which is better Mtech or MS?
4.2k
views
answered
Feb 20, 2017
IISc/IITs
getting-to-iits
admissions
+
–
0
votes
3
#uppcl
Q. The expressions are evaluated ____________ according to the precedence of set operators. A. from left to right B.from right to left C.as per user defined specification D.from bottom to up
Q. The expressions are evaluated ____________ according to the precedence of set operators.A. from left to rightB.from right to leftC.as per user defined specificationD.f...
252
views
answered
Dec 2, 2016
1
votes
4
counting
How many team of six with a captain can be selected from 12 person?
How many team of six with a captain can be selected from 12 person?
593
views
answered
Sep 20, 2016
Combinatory
combinatory
discrete-mathematics
+
–
0
votes
5
probability
A fair coin is tossed until one of 2 sides occurs twice in a row . Probability that the number of toses required is even is
A fair coin is tossed until one of 2 sides occurs twice in a row . Probability that the number of toses required is even is
466
views
answered
Jan 30, 2016
0
votes
6
DBMS
309
views
answered
Jan 19, 2016
Databases
databases
+
–
2
votes
7
DBMS
502
views
answered
Jan 19, 2016
Databases
databases
+
–
0
votes
8
Consider a hash table with ‘m’ slots that uses chaining for collision resolution.
Consider a hash table with $m$ slots that uses chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inserted that at least a chain of size 3 is created? (Assume simple uniform ... $m^{–3} (m – 1)$ $3m^{–1}$
Consider a hash table with $m$ slots that uses chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inserted tha...
7.8k
views
answered
Jan 18, 2016
Algorithms
data-structures
hashing
+
–
6
votes
9
Deadlock
A computer has six tape drivers, with n processes competing for them. Each process may need two drivers. What is the maximum value of n for the system to be deadlock free? a] 6 b] 5 c] 4 d] 3
A computer has six tape drivers, with n processes competing for them. Each process may need two drivers. What is the maximum value of n for the system to be deadlock free...
770
views
answered
Jan 16, 2016
Operating System
deadlock-prevention-avoidance-detection
operating-system
gate1997
+
–
2
votes
10
MadeEasy Test Series: CO & Architecture - Pipelining
Assume that execution of 200 instructions on a 6 staged pipeline where the target address is available at 4th stage.Let X be the probability of an instruction not being branch. The value of X such that speedup is atleast 5 is ________ ? ------------ ... 5 => 1200 = 1040 - 15X => 15X = - 160 Which is not possible. Where am I going wrong ?? :
Assume that execution of 200 instructions on a 6 staged pipeline where the target address is available at 4th stage.Let X be the probability of an instruction not being b...
1.1k
views
answered
Jan 14, 2016
CO and Architecture
made-easy-test-series
co-and-architecture
pipelining
speedup
+
–
4
votes
11
Frame Size
Suppose the round trip propagation delay for 10Mbps Ethernet has 24.2micro sec The network has 48bit jamming signal then what is minimum frame size in bits
Suppose the round trip propagation delay for 10Mbps Ethernet has 24.2micro sec The network has 48bit jamming signal then what is minimum frame size in bits
878
views
answered
Jan 5, 2016
1
votes
12
how many tables will get generated for following E-R
how many tables will get generated for following E-R I believe an answer is 3. 2 tables for 2 different multivalued attributes and one for entity "Dept.".
how many tables will get generated for following E-RI believe an answer is 3.2 tables for 2 different multivalued attributes and one for entity "Dept.".
1.0k
views
answered
Jan 2, 2016
Databases
databases
er-diagram
+
–
0
votes
13
solve calculate the limit
$\lim_{n \to \infty} \left [ \frac{1}{(1+n)} + \frac{1}{(2+n)} + - - - - - + \frac{1}{(n+n)} \right ]$ a) $log 2$ b) $2$ c) $\frac{1}{2}$ d) $\Pi /4$
$\lim_{n \to \infty} \left [ \frac{1}{(1+n)} + \frac{1}{(2+n)} + - - - - - + \frac{1}{(n+n)} \right ]$a) $log 2$ b) $2$c) $\frac{1}{2}$ ...
841
views
answered
Jan 1, 2016
Calculus
limits
+
–
5
votes
14
GATE IT 2006 | Question: 79
A pipelined processor uses a 4-stage instruction pipeline with the following stages: Instruction fetch (IF), Instruction decode (ID), Execute (EX) and Writeback (WB). The arithmetic operations as well as the load and store operations are carried out in the EX ... is used. The number of clock cycles required to complete the sequence of instructions is $10$ $12$ $14$ $16$
A pipelined processor uses a 4-stage instruction pipeline with the following stages: Instruction fetch (IF), Instruction decode (ID), Execute (EX) and Writeback (WB). The...
17.4k
views
answered
Jan 1, 2016
CO and Architecture
gateit-2006
co-and-architecture
pipelining
normal
+
–
2
votes
15
Postfix evaluation
The following post-fix expression with single digit operands is evaluated using stack, $16\;2\;4\;\wedge \; / \;4\;3\;*\;+\;6\;2\;*\;-$ Note that $\wedge$ is the exponential operator. What is the maximum height of the stack and the final value of post-fix evaluation respectively are a. $3,\;1$ b. $4,\;1$ c. $3,\;12$ d. $2,\;1$
The following post-fix expression with single digit operands is evaluated using stack, $16\;2\;4\;\wedge \; / \;4\;3\;*\;+\;6\;2\;*\;-$Note that $\wed...
5.3k
views
answered
Dec 21, 2015
DS
infix-prefix
data-structures
+
–
3
votes
16
ptr
458
views
answered
Dec 21, 2015
0
votes
17
Stack
In a stack (index from 1 to n) the command to access ith element from the top pf the stack S will be known as Peep(S,i). What is the condition to check for underflow on Peep. A)S[Top-i] <= 0 B)S[Top+i] <= 0 C)S[Top-i+1] <= 0 D)NONE
In a stack (index from 1 to n) the command to access ith element from the top pf the stack S will be known as Peep(S,i). What is the condition to check for underflow on P...
4.7k
views
answered
Dec 20, 2015
6
votes
18
GATE CSE 2005 | Question: 82a
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$. Consider the edge $e$ having the minimum weight amongst all those edges that ... of $G$ the weighted shortest path from $s$ to $t$ each path from $s$ to $t$ the weighted longest path from $s$ to $t$
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$...
12.8k
views
answered
Nov 12, 2015
Algorithms
gatecse-2005
algorithms
graph-algorithms
normal
+
–
–1
votes
19
TIFR CSE 2014 | Part A | Question: 9
Solve min $x^{2}+y^{2}$ subject to $\begin {align*} x + y &\geq 10,\\ 2x + 3y &\geq 20,\\ x &\geq 4,\\ y &\geq 4. \end{align*}$ $32$ $50$ $52$ $100$ None of the above
Solve min $x^{2}+y^{2}$ subject to$$\begin {align*} x + y &\geq 10,\\2x + 3y &\geq 20,\\x &\geq 4,\\y &\geq 4.\end{align*}$$$32$$50$$52$$100$None of the above
1.8k
views
answered
Nov 11, 2015
Calculus
tifr2014
calculus
maxima-minima
+
–
2
votes
20
TIFR CSE 2013 | Part A | Question: 10
Three men and three rakhsasas arrive together at a ferry crossing to find a boat with an oar, but no boatman. The boat can carry one or at the most two persons, for example, one man and one rakhsasas, and each man or rakhsasas can row. But if at any ... any mishap, what is the minimum number of times that the boat must cross the river? $7$ $9$ $11$ $13$ $15$
Three men and three rakhsasas arrive together at a ferry crossing to find a boat with an oar, but no boatman. The boat can carry one or at the most two persons, for examp...
1.6k
views
answered
Nov 6, 2015
Analytical Aptitude
tifr2013
analytical-aptitude
logical-reasoning
+
–
0
votes
21
TIFR CSE 2013 | Part A | Question: 16
The minimum of the function $f(x) = x \log_{e}(x)$ over the interval $[\frac{1}{2}, \infty )$ is $0$ $-e$ $\frac{-\log_{e}(2)}{2}$ $\frac{-1}{e}$ None of the above
The minimum of the function $f(x) = x \log_{e}(x)$ over the interval $[\frac{1}{2}, \infty )$ is$0$$-e$$\frac{-\log_{e}(2)}{2}$$\frac{-1}{e}$None of the above
1.4k
views
answered
Nov 6, 2015
Calculus
tifr2013
calculus
maxima-minima
+
–
0
votes
22
TIFR CSE 2013 | Part A | Question: 20
Consider a well functioning clock where the hour, minute and the seconds needles are exactly at zero. How much time later will the minutes needle be exactly one minute ahead ($1/60$ th of the circumference) of the hours needle and the seconds needle again ... of $1/60$ th of the circumference. $144$ minutes $66$ minutes $96$ minutes $72$ minutes $132$ minutes
Consider a well functioning clock where the hour, minute and the seconds needles are exactly at zero. How much time later will the minutes needle be exactly one minute ah...
1.8k
views
answered
Nov 6, 2015
Quantitative Aptitude
tifr2013
quantitative-aptitude
clock-time
+
–
0
votes
23
toc
Consider a regular expression over the alphabet set $\{r,s\}$. The following regular expressions are to be considered $( r^{*}s^{*})^{*}+ (r^{+}s^{+})^{*}$ $(r^{+}s^{+}r^{+} )^{+}+ (\varepsilon + r)^{*}$ ... $(r+s)^{+}$ all denote an infinite number of strings but not equivalent to $(r+s)^{*}$ all denotes a finite number of strings
Consider a regular expression over the alphabet set $\{r,s\}$. The following regular expressions are to be considered$( r^{*}s^{*})^{*}+ (r^{+}s^{+})^{*}$$(r^{+}s^{+}r^{+...
463
views
answered
Nov 5, 2015
Theory of Computation
theory-of-computation
regular-expression
+
–
28
votes
24
TIFR CSE 2010 | Part A | Question: 12
The coefficient of $x^{3}$ in the expansion of $(1 + x)^{3} (2 + x^{2})^{10}$ is. $2^{14}$ $31$ $\left ( \frac{3}{3} \right ) + \left ( \frac{10}{1} \right )$ $\left ( \frac{3}{3} \right ) + 2\left ( \frac{10}{1} \right )$ $\left ( \frac{3}{3} \right ) \left ( \frac{10}{1} \right ) 2^{9}$
The coefficient of $x^{3}$ in the expansion of $(1 + x)^{3} (2 + x^{2})^{10}$ is.$2^{14}$$31$$\left ( \frac{3}{3} \right ) + \left ( \frac{10}{1} \right )$$\left ( \frac{...
3.3k
views
answered
Oct 4, 2015
Combinatory
tifr2010
generating-functions
+
–
5
votes
25
GATE2004_13 Let R1 (A, B, C) and R2 (D, E) be two relation schema, where the primary key...
----SPOILERS------ My doubt is that why option "c" shouldnt be an answer, as join is performed on the C not equal to D, and there will be no case where C is not equal to d as it satisfies referential integrity constraints. . ?
SPOILERS My doubt is that why option "c" shouldnt be an answer, as join is performed on the C not equal to D, and there will be no case where C is not equal to d as i...
5.2k
views
answered
Sep 28, 2015
Databases
databases
natural-join
+
–
0
votes
26
Which of the following changes to typical QuickSort improves its performance on average and are generally done in practice ?
1) Randomly picking up to make worst case less likely to occur. 2) Calling insertion sort for small sized arrays to reduce recursive calls. 3) QuickSort is tail recursive...
3.1k
views
answered
Aug 12, 2015
Algorithms
sorting
+
–
0
votes
27
number of v's that are pushed more than once in a dfs?
1.4k
views
answered
Jul 28, 2015
3
votes
28
GATE CSE 2000 | Question: 2.6
Let $P(S)$ denotes the power set of set $S.$ Which of the following is always true? $P(P(S)) = P(S)$ $P(S) ∩ P(P(S)) = \{ Ø \}$ $P(S) ∩ S = P(S)$ $S ∉ P(S)$
Let $P(S)$ denotes the power set of set $S.$ Which of the following is always true?$P(P(S)) = P(S)$$P(S) ∩ P(P(S)) = \{ Ø \}$$P(S) ∩ S = P(S)$$S ∉ P(S)$
13.6k
views
answered
Jul 19, 2015
Set Theory & Algebra
gatecse-2000
set-theory&algebra
easy
set-theory
+
–
3
votes
29
GATE CSE 2006 | Question: 3
The set $\{1,2,3,5,7,8,9\}$ under multiplication modulo $10$ is not a group. Given below are four possible reasons. Which one of them is false? It is not closed $2$ does not have an inverse $3$ does not have an inverse $8$ does not have an inverse
The set $\{1,2,3,5,7,8,9\}$ under multiplication modulo $10$ is not a group. Given below are four possible reasons. Which one of them is false?It is not closed$2$ does no...
9.9k
views
answered
Jul 18, 2015
Set Theory & Algebra
gatecse-2006
set-theory&algebra
group-theory
normal
+
–
1
votes
30
GATE CSE 1999 | Question: 2.3
Let $L$ be a set with a relation $R$ which is transitive, anti-symmetric and reflexive and for any two elements $a, b \in L$, let the least upper bound $lub (a, b)$ and the greatest lower bound $glb (a, b)$ exist. Which of the following is/are true? $L$ is a poset $L$ is a Boolean algebra $L$ is a lattice None of the above
Let $L$ be a set with a relation $R$ which is transitive, anti-symmetric and reflexive and for any two elements $a, b \in L$, let the least upper bound $lub (a, b)$ and ...
5.6k
views
answered
Jul 17, 2015
Set Theory & Algebra
gate1999
set-theory&algebra
normal
relations
multiple-selects
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register