Dark Mode

Answers by Prashant.

29 votes

151

GATE CSE 1987 | Question: 9b
How many one-to-one functions are there from a set $A$ with $n$ elements onto itself?

answered in Set Theory & Algebra Nov 14, 2016

4.3k views

2 votes

152

answered in Databases Nov 14, 2016

357 views

1 vote

153

B+ tree
In B+ tree organization if Block SIze is 4096 Bytes Size of key is 4 bytes Block Pointer is of size 8 Bytes How many keys are possible per block?

answered in Databases Nov 14, 2016

211 views

6 votes

154

MADE EASY TEST SERIES
A file system with 512 GB disk uses a file descriptor with 16 direct block addresses, 1 indirect block address, 1 doubly indirectly block address and 1 triple indirect block addresses. Size of each disk block is 256 bytes and the size of each disk ... 8 bytes. The maximum possible file size is __________ (in MB). Which topic does the above question belong to? Please guide.

answered in Operating System Nov 14, 2016

945 views

7 votes

155

GB TOC Q13
Which of the following is not regular? (A). {/n>=0 and input alphabet is {a,b}} (B). where i+j+k>100 & k>50 (C). where i+j+k>100 & j+k>50 (D). None of the above

answered in Theory of Computation Nov 14, 2016

955 views

4 votes

156

Normalization
Consider the schema R=(S,T,U,V) and the dependencies S→T,T→U,U→V and V→S. Let R=(R1 and R2) be a decomposition such that R1∩R2=ϕ. The decomposition is not in 2NF in 2NF but not 3NF in 3NF but not in 2 NF in both 2NF and 3NF

answered in Databases Nov 14, 2016

3.0k views

2 votes

157

Please provide Regular Expression's for all three?

answered in Theory of Computation Nov 14, 2016

596 views

4 votes

158

TOC-Regular/CFL

answered in Theory of Computation Nov 14, 2016

600 views

20 votes

159

GATE CSE 2000 | Question: 2.12
The following arrangement of master-slave flip flops has the initial state of $P, Q$ as $0, 1$ (respectively). After three clock cycles the output state $P, Q$ is (respectively), $1, 0$ $1, 1$ $0, 0$ $0, 1$

answered in Digital Logic Nov 14, 2016

11.5k views

4 votes

160

Algo-Topological Sort

answered in Algorithms Nov 14, 2016

1.8k views

5 votes

161

Compiler SDT Evaluation

answered in Compiler Design Nov 14, 2016

345 views

5 votes

162

Compiler Parse Tree Evaluation

answered in Compiler Design Nov 14, 2016

497 views

5 votes

163

Compiler SDT Evaluation

answered in Compiler Design Nov 14, 2016

1.3k views

5 votes

164

no of comparisons are needed in the worst case to find min and max in an array

answered in Algorithms Nov 13, 2016

758 views

1 vote

165

decidiability
Which of the following statements is/are true? I. If L is decidable, LR may or may not be decidable. II. If L⊆{0}*, then L is decidable III. If L≤m {0n 1n│n≥0}, then L is Decidable

answered in Theory of Computation Nov 13, 2016

352 views

2 votes

166

Language regular or not?
L={w(wR)* , w=(a+b)* }. Is this language regular? According to me it should not be regular as we can have strings of form wwR which is not regular but the answer is that its a regular language.

answered in Theory of Computation Nov 13, 2016

584 views

1 vote

167

Asymptotic functions
When can i used logarithms to compare two functions asymptotically? What is the procedure and rules? If we have n^2 ans n^3..if we compare using logarithms..thwn they tuen out to be asymptotically equal.should i then compare them by "not" ignoring the constant terms?.

answered in Algorithms Nov 13, 2016

451 views

6 votes

168

Location of element using Row Major Order
My question is : in the row [8][-8] to [8][5] will be 5-(-8)+1 = 14 elements , right ? so , it should be 1060 then considering 4 Byte is one element. I know , this is pretty basic question. But , still got me wrong :)

answered in DS Nov 13, 2016

3.8k views

1 vote

169

correct ?
Which of the following statement(s) is/are correct? I.A constraint showing the maximum number of entities to which another entity can be associated via a relationship set is called participation constraint. II.The number of entity sets participating in the relationship is known as the degree of that relationship

answered in Databases Nov 13, 2016

623 views

1 vote

170

Priority Queue Delete

answered in Algorithms Nov 12, 2016

871 views

1 vote

171

Finding if decomposition is in 3NF
Consider the relation $R(A,B,C,D,E)$ with $FD\{ A\rightarrow C, D\rightarrow CE\} $. Which of the following decomposition is in 3NF? (A) $R_1(A,C); R_2(B,E); R_3(A,B,D)$ (B) $R_1(A,C); R_2(D,C,E); R_3(A,B,D)$ (C) Already is in 3NF (D) None of these

answered in Databases Nov 12, 2016

601 views

3 votes

172

Select the correct statement about TTL
Select the correct statement about TTL (Time to Live) field in IP: I. TTL value can never be increased while the packet is going from source machine to destination machine. II. Whenever TTL value is decreased at each intermediate node, its value is alwyas decrmeented by 1 , not more than that. a. I only b. II only c. Both I and II d. Neither I nor II

answered in Computer Networks Nov 12, 2016

2.4k views

3 votes

173

ACE Database Grand Test-1

answered in Databases Nov 12, 2016

315 views

3 votes

174

Compiler-LL(1)/LL(0)

answered in Compiler Design Nov 12, 2016

4.1k views

3 votes

175

How many memory refernces are required for fetching and executing...
How many memory refernces are required for fetching and executing each of the following instructions? (a)ADD 50(R1),R2 b)SUB (R1)+R2

answered in CO and Architecture Nov 11, 2016

3.5k views

2 votes

176

Conflict serializability when schedule contains commit
Is following schedule conflict serializable? $W_1(x), W_2(x),C_2,W_1(x),C_1$ Does existence of commit operation have any effect on deciding conflict serializability of the schedule?

answered in Databases Nov 11, 2016

3.1k views

1 vote

177

which of the following instr. is needed if we want to convert from Kernel mode to User mode in OS?
option a) Previlized instr. with interrupt Option b) Non previlized instr option c) Previlized instr. without interrupt

answered in CO and Architecture Nov 11, 2016

533 views

5 votes

178

DFS based question
How many times 8 is pushed into stack ? a detail answer will be welcomed.

answered in Programming in C Nov 10, 2016

2.5k views

3 votes

179

Testbook :
$S_1 :$ Recursive decent parser takes more time and less space. $S_2 :$ LL(1) Parser takes more time and more space. $S_3 :$ LL(1) Parser takes less time and less space. $S_4 :$ Recursive descent Parser takes more time and more space. a). (1) and (2) is ... and (3) is correct. Ques2: Consider $2^{nd}$ production as $\tt A \rightarrow Bc|dA|\epsilon$ (I think answer given is wrong)

answered in Compiler Design Nov 10, 2016

862 views

Page:

« prev
1
2
3
4
5
6
7
8
9
10
11
...
21
next »