Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
garimanand
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by garimanand
0
answers
1
TEST_BOOK_TEST
let <M > be a encoding of turing machine that accepts a string over inputs {0,1} .Let L={ <M>/M is a turing machine that accepts a string which is a plaindrome } Tyes =ww^r Tno = {0,1}^* Tyes is a subset of Tno so it should be unrecognizable by the turing machine please correct me if m wrong here??????
let <M be a encoding of turing machine that accepts a string over inputs {0,1} .Let L={ <M>/M is a turing machine that accepts a string which is a plaindrome }Tyes =ww^r...
130
views
asked
Jan 28, 2019
0
answers
2
Speedup
297
views
commented
Jan 22, 2019
CO and Architecture
co-and-architecture
speedup
+
–
1
answer
3
ME_FULL LENGTH
let x be an integer which can take a value of either 0 or 1 .then the statement (x=0) ? x=1: x=0 x=x+1 x=1-x x=x-1 none of these according to me x=0 is always going to be true so that expression will evaluate to x=1 which is not matching with any of the option so answer should be D none of these but in answer they ‘ve given B as true please confirm it.
let x be an integer which can take a value of either 0 or 1 .then the statement (x=0) ? x=1: x=0x=x+1x=1-xx=x-1none of theseaccording to me x=0 is always going to be true...
283
views
asked
Jan 22, 2019
0
answers
4
Made Easy Mock
Consider the following statements about relation R: S1: If a relation R is in 3NF but not in BCNF, then relation R must consist proper subset of candidate key determines proper subset of some other candidate key. S2: If a relation R is in 3NF but not BCNF, then relation R ... of the following statements is/are correct? (a) Both S1 and S2 (b) Only S1 © Only S2 (d) None of the above
Consider the following statements about relation R:S1: If a relation R is in 3NF but not in BCNF, then relation R must consist proper subset of candidate key determines p...
1.6k
views
commented
Jan 21, 2019
2
answers
5
MadeEasy Test Series 2019: Computer Networks - Sliding Window
Assume 2 computers are connected via a network. The network uses GB-7 sliding window protocol for flow control.It is observed that every 5th packet that has been sent is lost. The number of extra packets needs to resend Number of total packets transmitted by sender for sending 10 packets .
Assume 2 computers are connected via a network. The network uses GB-7 sliding window protocol for flow control.It is observed that every 5th packet that has been sent is ...
3.8k
views
commented
Jan 20, 2019
Computer Networks
made-easy-test-series
computer-networks
go
go-back-n
+
–
0
answers
6
ME_TEST
find the total number of comparisons- for(j=1;j<=n-1;j++) { for(k=j+1;k<=n+1;j++) { if(A[j]<A[k]) A[j]=A[j]+2; } } so my question is do i need to consider for loop condition comparison too or not because in answer they did not consider the comparison of “for loop”
find the total number of comparisons-for(j=1;j<=n-1;j++){for(k=j+1;k<=n+1;j++){if(A[j]<A[k])A[j]=A[j]+2;}}so my question is do i need to consider for loop condition compa...
223
views
commented
Jan 20, 2019
1
answer
7
doubt ME_test
primary index may or may not be sparse whether this statement is true or false given answer was true but in book it is given primary index is a nondense (sparse) index, since it includes an entry for each disk block of the data file and the keys ... record) source : Fundamentals of Database Systems Book by Ramez Elmasri does it mean we cannot make dense index by primary index????
primary index may or may not be sparsewhether this statement is true or falsegiven answer was truebut in book it is givenprimary index is a nondense (sparse) index, since...
194
views
asked
Jan 19, 2019
1
answer
8
Kenneth Rosen Edition 6th Exercise 8.2 Question 43 (Page No. 554)
How many subgraphs possible with at least one vertex for the following two graphs ? (labelled vertices) 1. $K_3$ 2. $W_4$ (total 4 vertices)
How many subgraphs possible with at least one vertex for the following two graphs ? (labelled vertices)1. $K_3$2. $W_4$ (total 4 vertices)
3.5k
views
commented
Jan 19, 2019
Graph Theory
kenneth-rosen
discrete-mathematics
graph-theory
graph-connectivity
+
–
1
answer
9
ME_test
please explain this ---- how to find the loop using sql
please explain this how to find the loop using sql
272
views
answer selected
Jan 19, 2019
0
answers
10
doubt
how to find number of labeled sub graph possible for a graph i dont want to know to formula please tell me the procedure with an example
how to find number of labeled sub graph possible for a graphi dont want to know to formula please tell me the procedure with an example
157
views
asked
Jan 19, 2019
1
answer
11
Time complexity
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers O(log n) O(n log n) O(n)^2 O(n^2 log n) The answer given was B but since worst case time is stated shouldn't the answer be C? I mean we can check all possible pairs in the worst case. Correct me if I am wrong?
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers O(log n)O(n log n)O(n)^2O(n^2 log n)The an...
1.2k
views
commented
Jan 18, 2019
Algorithms
algorithms
time-complexity
algorithm-design
+
–
1
answer
12
Complexity
An unordered list contains n distinct elements. Number of comparisons to find element larger than second minimum is O(1) O(n) None
An unordered list contains n distinct elements. Number of comparisons to find element larger than second minimum isO(1)O(n)None
604
views
commented
Jan 17, 2019
Algorithms
algorithms
time-complexity
easy
+
–
1
answer
13
sorted list
we are given (log m) sorted list each of size (log n) / (log m) the time complexity of merging list into single sorted list using mergesort is equal to a) O ( log m log(log n) ) b) O ( log n log(log m) ) c) O ( log m log n) d) O ( m log log n)
we are given (log m) sorted list each of size (log n) / (log m) the time complexity of merging list into single sorted list using mergesort is equal to a) O ( log m log(l...
888
views
answer edited
Jan 17, 2019
Algorithms
algorithms
sorting
time-complexity
+
–
1
answer
14
made easy test series question on MST
501
views
commented
Jan 17, 2019
Algorithms
made-easy-test-series
graph-algorithm
+
–
0
answers
15
Asymptotic analysis
what is the time complexities of the following code snippets. 1. k=1;i=1; while(k<=n) { i++; k=k+i; } 2. for(i=1;i<=n;++i) { for(j=1;j<n;j=j*2) c=c+1; } 3. m=pow(2,n) for(i=1;i<=n;i++) { for(j=1;j<=m;j=j*2) c=c+1; }
what is the time complexities of the following code snippets. 1.k=1;i=1;while(k<=n){ i++; k=k+i;} 2.for(i=1;i<=n;++i){ for(j=1;j<n;j=j*2) c=c+1;} 3.m=pow(2...
341
views
commented
Jan 17, 2019
Algorithms
algorithms
+
–
0
answers
16
Test by Bikram | Mock GATE | Test 4 | Question: 35
Let $DM$ be a single-tape, Deterministic Turing machine with tape alphabet $\left \{ blank,0,1 \right \}$, and let $C_i$ denote the (possibly infinite) computation of $DM$ starting with a blank tape. The input to each problem below is ... $k$ distinct tape squares during the computation $C_i.$ III only I and III only II and III only I, II, and III
Let $DM$ be a single-tape, Deterministic Turing machine with tape alphabet $\left \{ blank,0,1 \right \}$, and let $C_i$ denote the (possibly infinite) computation of $DM...
456
views
commented
Jan 17, 2019
Theory of Computation
tbb-mockgate-4
theory-of-computation
easy
decidability
turing-machine
+
–
1
answer
17
Test by Bikram | Mock GATE | Test 2 | Question: 9
Consider these three grammars. ... by $G2$, then it can be generated by $G1$. If w can be generated by $G3$, then it can be generated by $G1$.
Consider these three grammars.$$\begin{array}{|c|c|c|} \hline \textbf{Grammar G1:} & \textbf{Grammar G2:} & \textbf{Grammar G3:} \\ \hline E\rightarrow E+T \mid T & E\r...
802
views
commented
Jan 17, 2019
GATE
tbb-mockgate-2
theory-of-computation
grammar
multiple-selects
+
–
1
answer
18
Test by Bikram | Mock GATE | Test 3 | Question: 24
A $4-bit$ carry-lookahead adder adds two $4-bit$ numbers. The adder is designed only using $AND, OR, NOT, NAND $ and $NOR$ gates. We assume that all the inputs are available in both complemented and uncompleted forms. The delay ... using two-level $AND-OR$ logic. Thus, the overall propagation delay of the adder is ______ in terms of time units.
A $4-bit$ carry-lookahead adder adds two $4-bit$ numbers. The adder is designed only using $AND, OR, NOT, NAND $ and $NOR$ gates. We assume that all the inputs are availa...
555
views
commented
Jan 16, 2019
GATE
tbb-mockgate-3
digital-logic
numerical-answers
adder
digital-circuits
+
–
3
answers
19
GATE CSE 1994 | Question: 1.24
Consider the following heap (figure) in which blank regions are not in use and hatched region are in use. The sequence of requests for blocks of sizes $300, 25, 125, 50$ can be satisfied if we use either first fit or best fit policy (any one) first fit but not best fit policy best fit but not first fit policy None of the above
Consider the following heap (figure) in which blank regions are not in use and hatched region are in use.The sequence of requests for blocks of sizes $300, 25, 125, 50$ c...
11.7k
views
commented
Jan 14, 2019
Operating System
gate1994
operating-system
page-replacement
normal
+
–
1
answer
20
Test by Bikram | Mock GATE | Test 4 | Question: 16
Consider a sorted array of $k+1$ elements, where the elements are first $k$ natural numbers $-\left \{ 1, 2, 3, 4, 5,\dots, k \right \}$ and any one of those $k$ numbers is repeated. The time complexity of best algorithm to find that repeated number is: $O\left ( k \right )$ $O\left ( k\log k \right )$ $O\left ( \log k \right )$ $O(1)$
Consider a sorted array of $k+1$ elements, where the elements are first $k$ natural numbers $-\left \{ 1, 2, 3, 4, 5,\dots, k \right \}$ and any one of those $k$ numbers ...
539
views
commented
Jan 11, 2019
Algorithms
tbb-mockgate-4
algorithms
time-complexity
+
–
1
answer
21
Test by Bikram | Mock GATE | Test 4 | Question: 25
The Eigen values of a $2 \times 2$ matrix $’A’$ are $1, -2$, and its Eigen vectors $x_1$ and $x_2$ respectively. The Eigen values and Eigen vectors of the matrix $A^{2} - 3A + 4I$ (where $I$ is the identity matrix) will be: $2,14$ and $ x_1,x_2$ $2,14$ and $x_1+x_2 , x_1- x_2$ $2,0$ and $x_1,x_2$ $2,0$ and $x_1+x_2, x_1- x_2$
The Eigen values of a $2 \times 2$ matrix $’A’$ are $1, -2$, and its Eigen vectors $x_1$ and $x_2$ respectively.The Eigen values and Eigen vectors of the matrix $A^{2...
701
views
commented
Jan 11, 2019
Linear Algebra
tbb-mockgate-4
eigen-value
linear-algebra
engineering-mathematics
+
–
1
answer
22
Test by Bikram | Mock GATE | Test 4 | Question: 41
Read the following grammars and their translations: $S\rightarrow xX\;\left \{ print ``0" \right \}$ $X\rightarrow zZ\;\left \{ print ``1" \right \}$ $X\rightarrow y\;\left \{ print ``2" \right \}$ ... for the input string $xzpzpy$ using Bottom-Up Parsing (with the above translations)? $0111012$ $0111-20$ $0211-10$ $011112$
Read the following grammars and their translations:$S\rightarrow xX\;\left \{ print 0" \right \}$$X\rightarrow zZ\;\left \{ print 1" \right \}$$X\rightarrow y\;\left ...
331
views
commented
Jan 11, 2019
Compiler Design
tbb-mockgate-4
syntax-directed-translation
compiler-design
+
–
1
answer
23
Test by Bikram | Mock GATE | Test 4 | Question: 38
In a height balanced binary search tree, the heights of the left and right descendants of any node differ at most by $1.$ Which of the following statements are TRUE for such kind of tree? Worst case search time is logarithmic in the number of nodes. ... is logarithmic in the number of nodes. II and IV only I, II and IV I and III only I, III and IV
In a height balanced binary search tree, the heights of the left and right descendants of any node differ at most by $1.$ Which of the following statements are TRUE for s...
390
views
commented
Jan 11, 2019
DS
tbb-mockgate-4
data-structures
avl-tree
binary-search-tree
+
–
0
answers
24
Made Easy CN
here is my approach. at max packets needs to travel 1000m distance so propagation delay should be Tp=(1000)/(2x10^8) = 5 micro sec hub having delay of 2.5 micro sec so for collision detection it needs Tt >= 2*Tp + hub delay L>=B(2x5+ 2.5) L>=125 bits so at max we need minimum 125 bits please tell me where i m wrong ???????
here is my approach.at max packets needs to travel 1000m distance so propagation delay should beTp=(1000)/(2x10^8) = 5 micro sechub having delay of 2.5 micro secso for co...
223
views
commented
Jan 11, 2019
1
answer
25
GATE Overflow | Mock GATE | Test 1 | Question: 27
Which of the following statements is incorrect with respect to B-tree and B+ trees? Deletion operation is easier in B-tree but complex in case of B+ trees. In B+ trees, data records are stored only in the leaf nodes but in B trees data ... repeated in case of B+ trees but not in case of B trees. Searching is faster in B+ trees compared to B trees
Which of the following statements is incorrect with respect to B-tree and B+ trees?Deletion operation is easier in B-tree but complex in case of B+ trees.In B+ trees, dat...
4.5k
views
commented
Jan 9, 2019
Databases
go-mockgate-1
databases
b-tree
+
–
4
answers
26
GATE Overflow | Mock GATE | Test 1 | Question: 34
Let $G$ be a graph of order $n$ in which every vertex has degree equal to $d$. How large must $d$ be in order to guarantee that $G$ is connected? $\frac{n}{2}$ $\lceil (n-1)/2 \rceil$ $\lfloor (n+1)/2 \rfloor$ $(n-1)/2$
Let $G$ be a graph of order $n$ in which every vertex has degree equal to $d$. How large must $d$ be in order to guarantee that $G$ is connected?$\frac{n}{2}$$\lceil (n-1...
2.1k
views
commented
Jan 9, 2019
Graph Theory
go-mockgate-1
discrete-mathematics
graph-theory
graph-connectivity
+
–
1
answer
27
Made_easy
251
views
answer selected
Jan 8, 2019
0
answers
28
Made_Easy
125
views
asked
Jan 8, 2019
0
answers
29
made_easy
389
views
commented
Jan 7, 2019
0
answers
30
Made_easy
how can A be true?? for all x ( 7p(x) v q(x) ) → for all x 7(p(x)) v for all x q(x) here left hand side can be true for all x, if either p(x) is false or q(x) is true for a particular x but for RHS either for all x p(x) has to false or for all x q(x) has to true so it shouldn’t be valid and i think B should be valid please confirm it ??? and tell me where m wrong??
how can A be true??for all x ( 7p(x) v q(x) ) → for all x 7(p(x)) v for all x q(x)here left hand side can be true for all x, if either p(x) is false or q(x) is true for...
176
views
asked
Jan 6, 2019
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register