Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
ankit
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by ankit
0
answers
1
Peripheral devices : CAO
Consider READ and WRITE bits: a) Both are written by CPU b) Both are written by peripheral c) READ bit is written by peripheral while WRITE bit is written by CPU d) WRITE bit is written by peripheral while READ bit is written by CPU
Consider READ and WRITE bits:a) Both are written by CPUb) Both are written by peripheralc) READ bit is written by peripheral while WRITE bit is written by CPUd) WRITE bit...
820
views
commented
May 12, 2017
CO and Architecture
io-organization
co-and-architecture
+
–
1
answer
2
cache memory
Array A contains 256 elements of 4 bytes each. Its first element is stored at physical address 4,096. Array B contains 512 elements of 4 bytes each. Its first element is stored at physical address 8,192. Assume that only arrays A and B can be cached in an initially empty, ... will be written to memory if the cache has a write-through policy? (a) 0 (b) 256 (c) 1,024 (d) 2,048
Array A contains 256 elements of 4 bytes each. Its first element is stored at physical address 4,096. Array B contains 512 elements of 4 bytes each. Its first element is ...
510
views
commented
May 12, 2017
2
answers
3
cache memory
Suppose after analyzing a new cache design, you discover that the cache has far too many conflict misses and this needs to be resolved. You know that you must increase associativity in order to decrease the number of cache misses. What are the implications of increasing associativity? (a) Slower cache access time (b) Increase index bits (c) Increase block size (d) All of these
Suppose after analyzing a new cache design, you discover that the cache has far too many conflict misses and this needs to be resolved. You know that you must increase as...
3.0k
views
commented
May 12, 2017
CO and Architecture
co-and-architecture
+
–
2
answers
4
Finite Automata
How to convert Regular Grammar to Deterministic Finite Automata directly?
How to convert Regular Grammar to Deterministic Finite Automata directly?
667
views
commented
Apr 28, 2017
Theory of Computation
theory-of-computation
+
–
2
answers
5
write locks are released after last operation of transaction but before its commit ! explain
Somebody please explain this i am not able to understand please given an example of transaction or explain in hindi what the question and answer is please explain somebody please Here i am posting the Entire ... please explain which choice is correct and which is wrong I am not able to understand it.
Somebody please explain this i am not able to understand please given an example of transaction or explain in hindi what the question and answer is please explain somebod...
1.6k
views
commented
Mar 17, 2017
Databases
databases
transaction-and-concurrency
+
–
2
answers
6
maximum records in join operation ME mock
Consider the following relation: R (A B C) A primary key with 100 tuples. S (E F G) E primary key with 50 tuples. T (AE D) AE primary key with 80 tuples. U (D G H) H primary key with 10 tuples. The maximum number of possible records in the result of R⋈S⋈T⋈U _______.
Consider the following relation:R (A B C) A primary key with 100 tuples.S (E F G) E primary key with 50 tuples.T (AE D) AE primary key with 80 tuples.U (D G H) H primary ...
632
views
commented
Mar 8, 2017
1
answer
7
ISRO 2007- ECE Vectors
A unit vector perpendicular to the vectors a= 2i –3j + k and b=i+j-2k , is a) (1/ √ 3 ) (–i+j+k) b) (1/ √ 3 )(i+j- k) c) (1/ √ 3 )(i + j+k) d) (i+j+k)
A unit vector perpendicular to the vectors a= 2i –3j + k and b=i+j-2k , isa) (1/ √ 3 ) (–i+j+k)b) (1/ √ 3 )(i+j- k)c) (1/ √ 3 )(i + j+k)d) (i+j+k)
561
views
commented
Mar 4, 2017
Linear Algebra
isro-ece
engineering-mathematics
+
–
1
answer
8
GATE IT 2005 | Question: 67
A company maintains records of sales made by its salespersons and pays them commission based on each individual's total sales made in a year. This data is maintained in a table with following schema: salesinfo = (salespersonid, ... running concurrently throughout Execute T3 followed by T2; T1 running concurrently throughout Execute T3 followed by T2 followed by T1
A company maintains records of sales made by its salespersons and pays them commission based on each individual's total sales made in a year. This data is maintained in a...
7.9k
views
commented
Mar 4, 2017
Databases
gateit-2005
databases
transaction-and-concurrency
normal
+
–
5
answers
9
ISRO2007-18
The number of digit 1 present in the binary representation of $3 \times 512 + 7 \times 64 + 5 \times 8 + 3$ is 8 9 10 12
The number of digit 1 present in the binary representation of$3 \times 512 + 7 \times 64 + 5 \times 8 + 3$ is891012
12.1k
views
answered
Mar 3, 2017
Digital Logic
isro2007
digital-logic
number-representation
+
–
0
answers
10
ISRO 2006-ECE AND OR gates
In the given network of AND and OR gates f can be written as: a) X0 X1 X2 .....Xn + X1 X2 . ....Xn + X2 X3 ....Xn.... Xn b) X0 X1 + X2 + X3 +....... +Xn-1 . Xn C) X0+X1+ X2+ .......+ Xn d) X0 X1 X3........ Xn-1 + X2+X3+X5 ......... Xn-1 + ........+ Xn-2 + Xn-1 +Xn
In the given network of AND and OR gates f can be written as: a) X0 X1 X2 .....Xn + X1 X2 . ....Xn + X2 X3 ....Xn.... Xnb) X0 X1 + X2 + X3 +....... +Xn-1 . XnC) X0+X1+ X2...
693
views
commented
Mar 3, 2017
Digital Logic
isro-ece
digital-logic
+
–
7
answers
11
Partial dependency
The number of partial dependencies in a relation R{X,Y,V,U,Z} with FD set F={X->YZ, Z->V, V->XY} is ____
The number of partial dependencies in a relation R{X,Y,V,U,Z} with FD set F={X->YZ, Z->V, V->XY} is ____
2.9k
views
commented
Mar 3, 2017
Databases
databases
database-normalization
+
–
11
answers
12
GATE CSE 2014 Set 1 | Question: 47
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true? There exists a $y$ in the interval $(0,1)$ such that $f(y) = f(y+1)$ For every $y$ ... the function in the interval $(0,2)$ is $1$ There exists a $y$ in the interval $(0,1)$ such that $f(y)$ = $-f(2-y)$
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true?There exis...
20.7k
views
commented
Jan 26, 2017
Calculus
gatecse-2014-set1
calculus
continuity
normal
+
–
3
answers
13
GATE CSE 2009 | Question: 25
$\int^{\pi/4}_0 (1-\tan x)/(1+\tan x)\,dx $ $0$ $1$ $\ln 2$ $1/2 \ln 2$
$\int^{\pi/4}_0 (1-\tan x)/(1+\tan x)\,dx $$0$$1$ $\ln 2$$1/2 \ln 2$
5.7k
views
commented
Jan 14, 2017
Calculus
gatecse-2009
calculus
integration
normal
+
–
4
answers
14
GATE CSE 1995 | Question: 2.17
Let $A$ be the set of all non-singular matrices over real number and let $*$ be the matrix multiplication operation. Then $A$ is closed under $*$ but $\langle A, *\rangle$ is not a semigroup. $\langle A, *\rangle$ is a semigroup but not a monoid. $\langle A, * \rangle$ is a monoid but not a group. $\langle A, *\rangle$ is a a group but not an abelian group.
Let $A$ be the set of all non-singular matrices over real number and let $*$ be the matrix multiplication operation. Then$A$ is closed under $*$ but $\langle A, *\rangle$...
9.8k
views
commented
Jan 13, 2017
Set Theory & Algebra
gate1995
set-theory&algebra
group-theory
+
–
9
answers
15
GATE CSE 2015 Set 1 | Question: 29
Consider a LAN with four nodes $S_1, S_2, S_3,$ and $S_4$. Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A collision is said to have occurred if more than ... respectively. The probability of sending a frame in the first slot without any collision by any of these four stations is__________________.
Consider a LAN with four nodes $S_1, S_2, S_3,$ and $S_4$. Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A...
13.3k
views
commented
Jan 12, 2017
Computer Networks
gatecse-2015-set1
computer-networks
normal
numerical-answers
congestion-control
+
–
7
answers
16
GATE IT 2008 | Question: 29
If $M$ is a square matrix with a zero determinant, which of the following assertion (s) is (are) correct? S1: Each row of $M$ can be represented as a linear combination of the other rows S2: Each column of $M$ can be represented as a linear combination of the other columns S3 ... solution S4: $M$ has an inverse $S3$ and $S2$ $S1$ and $S4$ $S1$ and $S3$ $S1, S2$ and $S3$
If $M$ is a square matrix with a zero determinant, which of the following assertion (s) is (are) correct?S1: Each row of $M$ can be represented as a linear combination of...
9.4k
views
commented
Jan 12, 2017
Linear Algebra
gateit-2008
linear-algebra
normal
matrix
+
–
5
answers
17
GATE CSE 2007 | Question: 25
Let A be a $4 \times 4$ matrix with eigen values -5,-2,1,4. Which of the following is an eigen value of the matrix$\begin{bmatrix} A & I \\ I & A \end{bmatrix}$, where $I$ is the $4 \times 4$ identity matrix? $-5$ $-7$ $2$ $1$
Let A be a $4 \times 4$ matrix with eigen values -5,-2,1,4. Which of the following is an eigen value of the matrix$\begin{bmatrix} A & I \\ I & A \end{bmatrix}$, where $...
16.5k
views
commented
Jan 10, 2017
Linear Algebra
gatecse-2007
eigen-value
linear-algebra
difficult
+
–
1
answer
18
How to remember Closure table
2.1k
views
commented
Nov 13, 2016
4
answers
19
GATE CSE 2004 | Question: 10
Consider the grammar rule $E \rightarrow E1 - E2$ for arithmetic expressions. The code generated is targeted to a CPU having a single user register. The subtraction operation requires the first operand to be in the register. If $E1$ and $E2$ do ... Evaluation of $E1$ and $E2$ should necessarily be interleaved Order of evaluation of $E1$ and $E2$ is of no consequence
Consider the grammar rule $E \rightarrow E1 – E2$ for arithmetic expressions. The code generated is targeted to a CPU having a single user register. The subtraction...
13.4k
views
commented
Nov 13, 2016
Compiler Design
gatecse-2004
compiler-design
target-code-generation
normal
+
–
2
answers
20
probability
A bag contains 12 pairs of socks .four socks are picked up at random.Find the probability that there is at least one pair
A bag contains 12 pairs of socks .four socks are picked up at random.Find the probability that there is at least one pair
757
views
commented
Nov 12, 2016
Mathematical Logic
engineering-mathematics
probability
+
–
1
answer
21
GATE CSE 2016 Set 2 | Question: 52
Consider the following database table named water_schemes: ... total_avg (capacity) as select avg (capacity) from total select name from total, total_avg where total.capacity ≥ total_avg.capacity
Consider the following database table named water_schemes:$$\overset{\text{Water_schemes}}{\begin{array}{|c|c|c|}\hline\textbf{scheme_no}& \textbf{district_name}& \te...
11.0k
views
commented
Nov 3, 2016
Databases
gatecse-2016-set2
databases
sql
normal
numerical-answers
+
–
1
answer
22
Online test
766
views
commented
Oct 27, 2016
Databases
databases
database-normalization
bcnf
+
–
1
answer
23
GATE CSE 2016 Set 1 | Question: 06
Consider the Boolean operator # with the following properties : $x \# 0 = x, x \# 1=\overline{x}, x \# x = 0$ and $x \# \overline{x} = 1.$ Then $x\#y$ is equivalent to $x\overline{y}+\overline{x}y$ $x\overline{y}+ \overline{x} \; \overline{y}$ $\overline{x}y+xy$ $xy+\overline{x} \; \overline{y}$
Consider the Boolean operator # with the following properties :$x \# 0 = x, x \# 1=\overline{x}, x \# x = 0$ and $x \# \overline{x} = 1.$ Then $x\#y$ is equivalent to $x\...
7.1k
views
commented
Oct 16, 2016
Digital Logic
gatecse-2016-set1
digital-logic
boolean-algebra
easy
+
–
1
answer
24
prime implicants
Find all prime implicants and all essential prime implicants for... $F(A,B,C,D)=Σ(1,3,4,5,10,11,12,13,14,15)$
Find all prime implicants and all essential prime implicants for...$F(A,B,C,D)=Σ(1,3,4,5,10,11,12,13,14,15)$
1.9k
views
commented
Oct 16, 2016
Digital Logic
digital-logic
k-map
prime-implicants
+
–
1
answer
25
#Digital
No.of half adder and full adder required to add 1 +1 +1 +1 Draw the circuit...
No.of half adder and full adder required to add1+1+1+1Draw the circuit...
495
views
commented
Oct 15, 2016
3
answers
26
MADE EASY TEST SERIES
What will be the output of multiplexer shown below ?
What will be the output of multiplexer shown below ?
829
views
commented
Oct 15, 2016
4
answers
27
GATE CSE 2014 Set 3 | Question: 37
Suppose you want to move from $0$ to $100$ on the number line. In each step, you either move right by a unit distance or you take a shortcut. A shortcut is simply a pre-specified pair of integers $i,\:j \:\text{with}\: i <j$. Given a shortcut $(i,j)$, if you ... $y$ and $z$ be such that $T(9) = 1 + \min(T(y),T(z))$. Then the value of the product $yz$ is _____.
Suppose you want to move from $0$ to $100$ on the number line. In each step, you either move right by a unit distance or you take a shortcut. A shortcut is simply a pre-s...
10.0k
views
commented
Oct 12, 2016
Algorithms
gatecse-2014-set3
algorithms
normal
numerical-answers
dynamic-programming
+
–
1
answer
28
ISRO2014-67
What is the time complexity for the following C module? Assume that $n>0$. int module(int n) { if (n == 1) return 1; else return (n + module(n-1)); } $O(n)$ $O(\log n)$ $O(n^2)$ $O(n!)$
What is the time complexity for the following C module? Assume that $n>0$.int module(int n) { if (n == 1) return 1; else return (n + module(n-1)); }$O(n)$$O(\log n)$$O(n^...
4.9k
views
commented
Oct 5, 2016
Algorithms
isro2014
algorithms
time-complexity
+
–
1
answer
29
GATE CSE 2015 Set 3 | Question: 48
Consider the following C program: #include<stdio.h> int main() { int i, j, k = 0; j=2 * 3 / 4 + 2.0 / 5 + 8 / 5; k-=--j; for (i=0; i<5; i++) { switch(i+k) { case 1: case 2: printf("\n%d", i+k); ... : printf("\n%d", i+k); default: printf("\n%d", i+k); } } return 0; } The number of times printf statement is executed is _______.
Consider the following C program:#include<stdio.h int main() { int i, j, k = 0; j=2 * 3 / 4 + 2.0 / 5 + 8 / 5; k-= j; for (i=0; i<5; i++) { switch(i+k) { case 1: case 2: ...
22.3k
views
commented
Oct 4, 2016
Programming in C
gatecse-2015-set3
programming
programming-in-c
switch-case
normal
numerical-answers
+
–
4
answers
30
GATE IT 2006 | Question: 37
For a state machine with the following state diagram the expression for the next state $S^+$ in terms of the current state $S$ and the input variables $x$ and $y$ is $S^+ = S' . y' + S . x$ $S^+ = S. x . y' + S' . y . x'$ $S^+ = x . y'$ $S^+ = S' . y + S . x'$
For a state machine with the following state diagram the expression for the next state $S^+$ in terms of the current state $S$ and the input variables $x$ and $y$ is$S^+ ...
8.3k
views
commented
Sep 29, 2016
Theory of Computation
gateit-2006
theory-of-computation
finite-automata
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register