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 akash.dinkar12
1
votes
161
What is hidden terminal problem?How is the problem of hidden terminal solved in wireless LAns ?
What is hidden terminal problem?How is the problem of hidden terminal solved in wireless LAns ?
What is hidden terminal problem?How is the problem of hidden terminal solved in wireless LAns ?
1.9k
views
answered
Apr 14, 2017
Computer Networks
computer-networks
+
–
1
votes
162
ISRO2015-41
The number of spanning trees for a complete graph with seven vertices is $2^5$ $7^5$ $3^5$ $2^{2 \times 5}$
The number of spanning trees for a complete graph with seven vertices is$2^5$$7^5$$3^5$$2^{2 \times 5}$
6.9k
views
answered
Apr 14, 2017
Algorithms
isro2015
algorithms
spanning-tree
+
–
1
votes
163
ISRO2015-20
Let $\text{R = (A, B, C, D, E, F)}$ be a relation scheme with the following dependencies $\text{C} \rightarrow \text{F, E} \rightarrow \text{A}, \text{EC} \rightarrow \text{D, A} \rightarrow \text{B}$. Which of the following is a key of $\text{R}?$ $\text{CD}$ $\text{EC}$ $\text{AE}$ $\text{AC}$
Let $\text{R = (A, B, C, D, E, F)}$ be a relation scheme with the following dependencies $\text{C} \rightarrow \text{F, E} \rightarrow \text{A}, \text{EC} \rightarrow \te...
3.9k
views
answered
Apr 14, 2017
Databases
isro2015
databases
database-normalization
functional-dependency
+
–
0
votes
164
ISRO2015-27
Which one of the following is a top-down parser? Recursive descent parser Shift left associative parser $\text{SLR}(k)$ parser $\text{LR}(k)$ parser
Which one of the following is a top-down parser?Recursive descent parserShift left associative parser$\text{SLR}(k)$ parser$\text{LR}(k)$ parser
3.6k
views
answered
Apr 14, 2017
Compiler Design
isro2015
compiler-design
parsing
+
–
3
votes
165
ISRO2015-31
If there are 32 segments, each size 1 k bytes, then the logical address should have 13 bits 14 bits 15 bits 16 bits
If there are 32 segments, each size 1 k bytes, then the logical address should have13 bits14 bits15 bits16 bits
10.9k
views
answered
Apr 14, 2017
Operating System
isro2015
operating-system
virtual-memory
segmentation
+
–
1
votes
166
ISRO2015-37
Consider the following program. main() { fork(); fork(); fork(); } How many new processes will be created? 8 6 7 5
Consider the following program.main() { fork(); fork(); fork(); }How many new processes will be created?8675
3.9k
views
answered
Apr 14, 2017
Operating System
isro2015
operating-system
fork-system-call
+
–
0
votes
167
ISRO2015-39
If a node has $K$ children in $B$ tree, then the node contains exactly _____ keys. $K^2$ $K-1$ $K+1$ $\sqrt{K}$
If a node has $K$ children in $B$ tree, then the node contains exactly _____ keys.$K^2$$K-1$$K+1$$\sqrt{K}$
3.8k
views
answered
Apr 14, 2017
Databases
isro2015
databases
b-tree
+
–
1
votes
168
ISRO2015-43
Let $R_1$ and $R_2$ be regular sets defined over the alphabet, then $ R_1 \cap R_2$ is not regular $R_1 \cup R_2$ is not regular $\Sigma^* - R_1$ is regular $R_1^*$ is not regular
Let $R_1$ and $R_2$ be regular sets defined over the alphabet, then$ R_1 \cap R_2$ is not regular$R_1 \cup R_2$ is not regular$\Sigma^* - R_1$ is regular$R_1^*$ is not re...
3.1k
views
answered
Apr 14, 2017
Theory of Computation
isro2015
theory-of-computation
regular-language
+
–
1
votes
169
ISRO2015-50
How many bits internet address is assigned to each host on a TCP/IP internet which is used in all communication with the host? $16$ bits $32$ bits $48$ bits $64$ bits
How many bits internet address is assigned to each host on a TCP/IP internet which is used in all communication with the host?$16$ bits$32$ bits$48$ bits$64$ bits
4.7k
views
answered
Apr 14, 2017
Computer Networks
isro2015
computer-networks
tcp
+
–
6
votes
170
Cyclic Group
How to find no. of generators of cyclic group of orden n ?
How to find no. of generators of cyclic group of orden n ?
5.4k
views
answered
Apr 14, 2017
8
votes
171
GATE CSE 2017 Set 2 | Question: 23
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .
17.5k
views
answered
Apr 13, 2017
Graph Theory
gatecse-2017-set2
graph-theory
numerical-answers
degree-of-graph
+
–
0
votes
172
c programming
explain the output #include <stdio.h> int main() { int a=1; printf("%d %d %d",a,a++,--a); return 0; }
explain the output#include <stdio.h>int main(){ int a=1; printf("%d %d %d",a,a++, a); return 0; }
658
views
answered
Apr 13, 2017
Programming in C
programming-in-c
+
–
4
votes
173
GATE CSE 2017 Set 1 | Question: 50
Instruction execution in a processor is divided into $5$ stages, Instruction Fetch (IF), Instruction Decode (ID), Operand fetch (OF), Execute (EX), and Write Back (WB). These stages take 5, 4, 20, 10 and 3 nanoseconds (ns) ... speedup (correct to two decimal places) achieved by EP over NP in executing $20$ independent instructions with no hazards is _________ .
Instruction execution in a processor is divided into $5$ stages, Instruction Fetch (IF), Instruction Decode (ID), Operand fetch (OF), Execute (EX), and Write Back (WB). T...
19.1k
views
answered
Apr 13, 2017
CO and Architecture
gatecse-2017-set1
co-and-architecture
pipelining
normal
numerical-answers
+
–
0
votes
174
How Bounded waiting is satisfied
https://gateoverflow.in/109195/made-easy-mock-test https://gateoverflow.in/108500/made-easy-test-series https://gateoverflow.in/112717/synchronisation https://gateoverflow.in/107206/made-easy-mock-test-1 https://gateoverflow.in/102011/made-easy All ... then P3 (acquires S2 before P1 acquires) Then bounded wait may not satisfied please explain will this happen or not
https://gateoverflow.in/109195/made-easy-mock-testhttps://gateoverflow.in/108500/made-easy-test-serieshttps://gateoverflow.in/112717/synchronisationhttps://gateoverflow.i...
1.3k
views
answered
Apr 13, 2017
Operating System
process-synchronization
operating-system
+
–
6
votes
175
GATE CSE 2017 Set 1 | Question: GA-8
The expression $\large \frac{(x+y) - |x-y|}{2}$ is equal to : The maximum of $x$ and $y$ The minimum of $x$ and $y$ $1$ None of the above
The expression $\large \frac{(x+y) - |x-y|}{2}$ is equal to :The maximum of $x$ and $y$The minimum of $x$ and $y$$1$None of the above
9.0k
views
answered
Apr 12, 2017
Quantitative Aptitude
gatecse-2017-set1
general-aptitude
quantitative-aptitude
maxima-minima
absolute-value
+
–
1
votes
176
theory of computation
Let C be a context-free language and R be a regular language. Prove that the language C $\cap$ R is context free.
Let C be a context-free language and R be a regular language. Prove thatthe language C $\cap$ R is context free.
684
views
answered
Apr 12, 2017
Theory of Computation
theory-of-computation
+
–
1
votes
177
theory of computation
The transition function of Non-deterministic push down automata is A) Q * $\sum$ * $\Gamma$ ----> ( 2Q ) * $\Gamma$* B) Q * $\sum$ * $\Gamma$ ----> 2 ( Q * $\Gamma$* ) Answer is A) or B) ...please explain your answer ...
The transition function of Non-deterministic push down automata is A) Q * $\sum$ * $\Gamma$ ( 2Q ) * $\Gamma$*B) Q * $\sum$ * $\Gamma$ 2 ( Q * $\Gamma$* )Answer is...
858
views
answered
Apr 12, 2017
Theory of Computation
theory-of-computation
+
–
1
votes
178
Propositions
"I'm hungry" is it a proposition? Bob is Hungry, is it a proposition? How to tell whether an idea is proposition or not when speaker speak's about himself.
"I'm hungry" is it a proposition?Bob is Hungry, is it a proposition?How to tell whether an idea is proposition or not when speaker speak's about himself.
545
views
answered
Apr 12, 2017
Mathematical Logic
propositional-logic
+
–
0
votes
179
theory of computation
A context-free grammar G is known to be free from epsilon productions and unit productions.The maximum number of steps needed to derive a string of length "n"(where n>1) is given by A) n B) 2n C) 2n-1 D) n^2 ANSWER is option B) or C) ...please verify ...
A context-free grammar G is known to be free from epsilon productions and unit productions.The maximum number of steps needed to derive a string of length "n"(where n>1)...
224
views
answered
Apr 12, 2017
Theory of Computation
theory-of-computation
+
–
2
votes
180
Peter line 2.1
Construct the DFA for all string with at least one a and exactly two b
Construct the DFA for all string with at least one a and exactly two b
223
views
answered
Apr 11, 2017
1
votes
181
find maximum channel capacity
If the spectrum of a channel is between 3 Mhz and 5 Mhz. Find the maximum channel capacity if the SNR is 251.
If the spectrum of a channel is between 3 Mhz and 5 Mhz. Find the maximum channel capacity if the SNR is 251.
981
views
answered
Apr 11, 2017
Computer Networks
computer-networks
+
–
2
votes
182
No idea about what to study in File System of OS
Hello, please kindly list out the topics which are needed to be studied from topic file system?! You can also pinpoint the topics from Galvin book 7th edition.
Hello, please kindly list out the topics which are needed to be studied from topic file system?!You can also pinpoint the topics from Galvin book 7th edition.
1.8k
views
answered
Apr 11, 2017
Operating System
file-system
operating-system
+
–
2
votes
183
The netID and hostID for the IP address is
This is the IP address : 198.7.3.8 now how to find its hostid and netid
This is the IP address : 198.7.3.8now how to find its hostid and netid
8.4k
views
answered
Apr 11, 2017
Computer Networks
computer-networks
+
–
0
votes
184
ISRO 2006-ECE Matrix determinant
The determinant of is: a) 0 b) -1 c) 1 d) 2
The determinant of is:a) 0b) -1c) 1d) 2
393
views
answered
Apr 10, 2017
Linear Algebra
isro-ece
engineering-mathematics
linear-algebra
+
–
0
votes
185
ISRO 2015 Truth table [EE]
The truth table X Y F 0 0 0 0 1 0 1 0 1 1 1 1 Represent the Boolean function (a) X (b) X - Y (c) X +Y (d) Y
The truth tableXYF000010101111 Represent the Boolean function(a) X(b) X - Y(c) X +Y(d) Y
559
views
answered
Apr 10, 2017
Digital Logic
isro-ee
digital-logic
+
–
9
votes
186
GATE CSE 2017 Set 2 | Question: 33
A system shares $9$ ... describes current state of the system? Safe, Deadlocked Safe, Not Deadlocked Not Safe, Deadlocked Not Safe, Not Deadlocked
A system shares $9$ tape drives. The current allocation and maximum requirement of tape drives for that processes are shown below:$$\begin{array}{ccc} \textbf{Process} &...
13.8k
views
answered
Apr 10, 2017
Operating System
gatecse-2017-set2
operating-system
resource-allocation
normal
+
–
7
votes
187
Gatebook Test
A man ate 300 mangoes in 15 days , each day eating two more than the previous day . How many mangoes did he eat on the 3rd day?
A man ate 300 mangoes in 15 days , each day eating two more than the previous day . How many mangoes did he eat on the 3rd day?
571
views
answered
Apr 10, 2017
3
votes
188
cil-2017 AQ24
379
views
answered
Apr 9, 2017
Quantitative Aptitude
cil-2017
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register