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 Kapil
5
votes
161
subnetting
A. GIVE A POSSIBLE ARRANGEMENT OF SUBNET MASK TO MAKE THIS POSSIBLE B. SUGGEST WHAT THE ORGANIZATION MIGHT DO IF DEPARTMENT D GROWS TO 34 HOSTS
A. GIVE A POSSIBLE ARRANGEMENT OF SUBNET MASK TO MAKE THIS POSSIBLEB. SUGGEST WHAT THE ORGANIZATION MIGHT DO IF DEPARTMENT D GROWS TO 34 HOSTS
3.3k
views
answered
Jul 11, 2016
Computer Networks
subnetting
computer-networks
+
–
8
votes
162
TestBook Test Series: Theory Of Computation - Finite Automata
The minimum number of states in a DFA that recognizes the language L = (000 + 0000)* over the alphabet {0}.
The minimum number of states in a DFA that recognizes the language L = (000 + 0000)* over the alphabet {0}.
1.1k
views
answered
Jul 10, 2016
Theory of Computation
testbook-test-series
theory-of-computation
finite-automata
minimal-state-automata
+
–
6
votes
163
cnw
957
views
answered
Jul 10, 2016
Computer Networks
tcp
+
–
2
votes
164
UGC NET CSE | June 2014 | Part 3 | Question: 24
Match the following $:$ ... $\text{a-ii; b-i; c-iv; d-iii}$ $\text{a-iii; b-i; c-iv; d-iii}$
Match the following $:$ $\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Timeout ordering protocol} & \text{i.} & \text{Wait for...
2.3k
views
answered
Jul 9, 2016
Operating System
ugcnetjune2014iii
operating-system
+
–
3
votes
165
self made
Q1. {an bn } U { an b2n } U {an b3n } U{an b4n} ...Is it in DCFL OR CFL? Q2. {an} U {an bn} is it in DCFL OR CFL? Please explain with solution....
Q1. {an bn } U { an b2n } U {an b3n } U{an b4n} ...Is it in DCFL OR CFL?Q2. {an} U {an bn} is it in DCFL OR CFL? Please explain with solution....
1.2k
views
answered
Jul 9, 2016
4
votes
166
ISRO2016-65
A company needs to develop a digital signal processing software for one of its newest inventions. The software is expected to have 20000 lines of code. The company needs to determine the effort in person-months needed to develop this software using the basic COCOMO model ... exponentiation factor is given as 1.5. What is the estimated effort in person-months? 196.77 206.56 199.56 210.68
A company needs to develop a digital signal processing software for one of its newest inventions. The software is expected to have 20000 lines of code. The company needs ...
7.5k
views
answered
Jul 4, 2016
IS&Software Engineering
non-gate
is&software-engineering
isro2016
+
–
3
votes
167
ISRO2016-61
The extent to which the s/w can continue to operate correctly despite the introduction of invalid inputs is called as Reliability Robustness Fault tolerance Portability
The extent to which the s/w can continue to operate correctly despite the introduction of invalid inputs is called asReliabilityRobustnessFault tolerancePortability
4.8k
views
answered
Jul 3, 2016
IS&Software Engineering
is&software-engineering
isro2016
+
–
2
votes
168
ISRO2016-62
Which one of the following is a functional requirement ? Maintainability Portability Robustness None of the mentioned
Which one of the following is a functional requirement ?MaintainabilityPortabilityRobustnessNone of the mentioned
13.7k
views
answered
Jul 3, 2016
IS&Software Engineering
is&software-engineering
isro2016
+
–
6
votes
169
ISRO2016-39
Access time of the symbolic table will be logarithmic if it is implemented by Linear list Search tree Hash table Self organization list
Access time of the symbolic table will be logarithmic if it is implemented byLinear listSearch treeHash tableSelf organization list
3.2k
views
answered
Jul 3, 2016
Algorithms
isro2016
algorithms
symbol-table
+
–
10
votes
170
ISRO2016-32
AN FSM(finite state machine) can be considered to be a turing machine of finite tape length without rewinding capability and unidirectional tape movement rewinding capability and unidirectional tape movement without rewinding capability and bidirectional tape movement rewinding capability and bidirectional tape movement
AN FSM(finite state machine) can be considered to be a turing machine of finite tape lengthwithout rewinding capability and unidirectional tape movementrewinding capabili...
8.4k
views
answered
Jul 3, 2016
Theory of Computation
theory-of-computation
isro2016
turing-machine
+
–
7
votes
171
ISRO2016-68
Dynamic routing protocol enable routers to Dynamically discover and maintain routes Distribute routing updates to other routers Reach agreement with other routers about the network topology All of the above
Dynamic routing protocol enable routers toDynamically discover and maintain routesDistribute routing updates to other routersReach agreement with other routers about the ...
4.3k
views
answered
Jul 3, 2016
Computer Networks
isro2016
computer-networks
routing
+
–
6
votes
172
GATE CSE 2007 | Question: 15, ISRO2016-26
Consider the following segment of C-code: int j, n; j = 1; while (j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any $n > 0$ is: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$
Consider the following segment of C-code:int j, n; j = 1; while (j <= n) j = j * 2;The number of comparisons made in the execution of the loop for any $n 0$ is:$\lceil \...
37.1k
views
answered
Jul 3, 2016
Algorithms
gatecse-2007
algorithms
time-complexity
normal
isro2016
+
–
9
votes
173
ISRO2016-24
In which class of Flynn's taxanomy, Von Neumann architecture belongs to? SISD SIMD MIMD MISD
In which class of Flynn's taxanomy, Von Neumann architecture belongs to?SISDSIMDMIMDMISD
9.7k
views
answered
Jul 3, 2016
CO and Architecture
co-and-architecture
isro2016
instruction-format
+
–
5
votes
174
if list is almost sorted and largest element is wrongly placed
A list of integers is almost sorted with only the largest number being out of place. If this information is not known to the algorithm, then which of the following algorithms can sort the list the fastest? Bubble sort Selection sort Insertion sort Shell sort
A list of integers is almost sorted with only the largest number being out of place. If this information is not known to the algorithm, then which of the following algori...
1.3k
views
answered
Jul 2, 2016
Algorithms
algorithms
sorting
+
–
6
votes
175
ISRO2014-69
For a software project, the spiral model was employed. When will the spiral stop? When the software product is retired When the software product is released after Beta testing When the risk analysis is completed After completing five loops
For a software project, the spiral model was employed. When will the spiral stop?When the software product is retiredWhen the software product is released after Beta test...
3.3k
views
answered
Jul 1, 2016
IS&Software Engineering
isro2014
is&software-engineering
non-gate
+
–
19
votes
176
ISRO2014-54
The conic section that is obtained when a right circular cone is cut through a plane that is parallel to the side of the cone is called _____ parabola hyperpola circle ellipse
The conic section that is obtained when a right circular cone is cut through a plane that is parallel to the side of the cone is called _____parabolahyperpolacircleellips...
6.4k
views
answered
Jul 1, 2016
Geometry
isro2014
non-gate
geometry
+
–
10
votes
177
ISRO2014-46
If the maximum output voltage of a DAC is $V$ volts and if the resolution is $R$ bits then the weight of the most significant bit is ________ $V/(2^R -1)$ $(2^{R-1}).V/(2^R-1)$ $(2^{R-1}).V$ $V/(2^{R-1})$
If the maximum output voltage of a DAC is $V$ volts and if the resolution is $R$ bits then the weight of the most significant bit is ________$V/(2^R -1)$$(2^{R-1}).V/(2^R...
3.2k
views
answered
Jul 1, 2016
Integrated Circuits
isro2014
non-gate
integrated-circuits
+
–
18
votes
178
ISRO2014-45
Consider a $50$ kbps satellite channel with a $500$ milliseconds round trip propagation delay. If the sender wants to transmit $1000$ bit frames, how much time will it take for the receiver to receive the frame? $250$ milliseconds $20$ milliseconds $520$ milliseconds $270$ milliseconds
Consider a $50$ kbps satellite channel with a $500$ milliseconds round trip propagation delay. If the sender wants to transmit $1000$ bit frames, how much time will it ta...
8.1k
views
answered
Jul 1, 2016
Computer Networks
isro2014
computer-networks
communication
+
–
14
votes
179
ISRO2014-41
Consider the following binary search tree T given below: Which node contains the fourth smallest element in T? Q V W X
Consider the following binary search tree T given below: Which node contains the fourth smallest element in T?QVWX
6.0k
views
answered
Jul 1, 2016
DS
isro2014
data-structures
binary-search-tree
+
–
13
votes
180
ISRO2014-26
The output of a tristate buffer when the enable input in $0$ is Always $0$ Always $1$ Retains the last value when enable input was high Disconnected state
The output of a tristate buffer when the enable input in $0$ isAlways $0$Always $1$Retains the last value when enable input was highDisconnected state
3.8k
views
answered
Jul 1, 2016
Digital Logic
isro2014
digital-logic
translation-lookaside-buffer
+
–
7
votes
181
Madeeasy
DMA is transferring characters to the processor, from a device transmitting at 16000 bits per second. Assume DMA is using cycle stealing, If the Processor needs access to main memory once every microsecond, find how much percentage will the processor be slowed down due to DMA activity? a. 0.20 b 0.25 c.0.30 d.0.35
DMA is transferring characters to the processor, from a device transmitting at 16000 bits per second. Assume DMA is using cycle stealing, If the Processor needs access to...
2.6k
views
answered
Jun 30, 2016
4
votes
182
Question on char *const and const char*
What is the answer? How char *const and const char* differ
What is the answer?How char *const and const char* differ
1.9k
views
answered
Jun 30, 2016
5
votes
183
push down automata
The pushdown automation $M=(\{q_0, q_1, q_2\}, \{a,b\}, \{0,1\}, \delta, q_0, 0, \{q_0\})$ with $\delta(q_0,a,0)=\{q_1,10)\}$ $\delta(q_1,a,1)=\{q_1,11)\}$ $\delta(q_0,b,1)=\{q_2,\lambda)\}$ $\delta(q_2,b,1)=\{q_2,\lambda)\}$ $\delta(q_2,\lambda,0)=\{q_0,\lambda)\}$ Accepts ... $L=\{a^nb^n \mid n \geq 0\}$ $L=\{a^nb^m \mid n,m > 0\}$ $L=\{a^nb^n \mid n > 0\}$
The pushdown automation $M=(\{q_0, q_1, q_2\}, \{a,b\}, \{0,1\}, \delta, q_0, 0, \{q_0\})$ with$\delta(q_0,a,0)=\{q_1,10)\}$$\delta(q_1,a,1)=\{q_1,11)\}$$\delta(q_0,b,1)=...
5.6k
views
answered
Jun 30, 2016
Theory of Computation
theory-of-computation
pushdown-automata
+
–
3
votes
184
SLIDING WINDOW CONCEPT IN S/W PROJECT MANAGEMENT
Sliding window concept of software project management is: Preparation of comprehensible plan Preparation of the various stages of development Ad-hoc planning Requirement analysis
Sliding window concept of software project management is:Preparation of comprehensible planPreparation of the various stages of developmentAd-hoc planningRequirement anal...
4.0k
views
answered
Jun 29, 2016
2
votes
185
Finite Automata
There are exactly ______different finite automata with 3 states x,y,and z over the alphabet {a,b} where x is always the start state 1)64 2) 256 3) 1024 4)5832
There are exactly ______different finite automata with 3 states x,y,and z over the alphabet {a,b} where x is always the start state1)64 2) 256 3) 1024 4)5832
3.2k
views
answered
Jun 29, 2016
Theory of Computation
theory-of-computation
finite-automata
+
–
3
votes
186
UGC NET CSE | June 2014 | Part 2 | Question: 34
Match the following $:$ ... $\text{a-i; b-ii; c-iv; d-iii}$ $\text{a-i; b-iv; c-ii; d-iii}$
Match the following $:$$\begin{array}{clcl} \text{} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Contiguous allocation} & \text{i.} & \text{This s...
6.2k
views
answered
Jun 29, 2016
Operating System
ugcnetcse-june2014-paper2
operating-system
file-system
+
–
4
votes
187
UGC NET CSE | December 2014 | Part 3 | Question: 19
Consider the following statements $S1, S2$ and $S3$: $S1$: In call-by-value, anything that is passed into a function call is unchanged in the caller's scope when the function returns. $S2$: In call-by-reference, a function receives implicit reference to a ... $S3$ and $S1$ are true. $S2$ and $S1$ are true. $S1, S2, S3$ are true.
Consider the following statements $S1, S2$ and $S3$:$S1$: In call-by-value, anything that is passed into a function call is unchanged in the caller’s scope when the fun...
2.9k
views
answered
Jun 29, 2016
Compiler Design
ugcnetcse-dec2014-paper3
compiler-design
runtime-environment
parameter-passing
+
–
5
votes
188
UGC NET CSE | June 2014 | Part 2 | Question: 33
Consider a system with five processes $P_{0}$ through $P_{4}$ and three resource types $R_{1}$, $R_{2}$ and $R_{3}$ . Resource type $R_{1}$ has $10$ instances, $R_{2}$ has $5$ instances and $R_{3}$ has ... $R_{3}$. The state resulting after this allocation will be Ready state Safe state Blocked state Unsafe state
Consider a system with five processes $P_{0}$ through $P_{4}$ and three resource types $R_{1}$, $R_{2}$ and $R_{3}$ . Resource type $R_{1}$ has $10$ instances, $R_{2}$ ha...
7.0k
views
answered
Jun 29, 2016
Operating System
ugcnetcse-june2014-paper2
operating-system
resource-allocation
+
–
3
votes
189
UGC NET CSE | June 2014 | Part 2 | Question: 32
Match the following $:$ ... $\text{a-iii; b-i; c-iv; d-i}$ $\text{a-ii; b-iii; c-iv; d-i}$
Match the following $:$$\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a}. & \text{Multilevel feedback queue} & \text{i.} & \text{Time-slicin...
3.2k
views
answered
Jun 29, 2016
Operating System
ugcnetcse-june2014-paper2
operating-system
process-scheduling
+
–
5
votes
190
Java oops basic question
what is the difference between a bit wise operator and a short circuit operator?
what is the difference between a bit wise operator and a short circuit operator?
265
views
answered
Jun 28, 2016
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register