Register
Filter

Answers by Kapil

3 votes
201
Gate Discrete Mathematics
If f : R - > R defined by , Show that f is invertible.
If f : R - R defined by , Show that f is invertible.
4 votes
202
TOC
3 votes
203
Opereating System
14 votes
205
ISRO2014-4
Consider the following pseudo- code while (m<n) if (x>y ) and (a<b) then a=a+1 y=y-1 end if m=m+1 end while What is cyclomatic complexity of the above pseudo -code? 2 3 4 5
Consider the following pseudo- codewhile (m<n) if (x>y ) and (a<b) then a=a+1 y=y-1 end if m=m+1 end whileWhat is cyclomatic complexity of the above pseudo -code?2345
1 votes
207
TOC John C Martin Finite Automata
Draw an FA accepting the language of all strings that begin or end with aa or bb, where indicated language is over {a, b} .
Draw an FA accepting the language of all strings that begin or end with aa or bb, where indicated language is over {a, b} .
6 votes
208
locality of reference
State True/False: "Some programs do not exhibit locality of reference."
State True/False:"Some programs do not exhibit locality of reference."
3 votes
209
ISRO2014-47
The following three 'C' language statements is equivalent to which single statement? y=y+1; z=x+y; x=x+1 z = x + y + 2; z = (x++) + (++y); z = (x++) + (y++); z = (x++) + (++y) + 1;
The following three 'C' language statements is equivalent to which single statement?y=y+1; z=x+y; x=x+1z = x + y + 2;z = (x++) + (++y);z = (x++) + (y++);z = (x++) + (++y)...
3 votes
210
NFA to DFA
NFA can be converted into DFA using Sub set construction method Lazy evaluation method either A or B both A and B
NFA can be converted into DFA usingSub set construction methodLazy evaluation methodeither A or Bboth A and B
4 votes
211
Check whether graph with following degrees are possible?
Check whether graph with following degrees are possible? I) 6, 6, 6, 6, 3, 3, 2, 2 II) 7, 6, 6, 4, 4, 3, 2, 2 (How to solve this type of questions? Please explain..)
Check whether graph with following degrees are possible?I) 6, 6, 6, 6, 3, 3, 2, 2II) 7, 6, 6, 4, 4, 3, 2, 2(How to solve this type of questions? Please explain..)
5 votes
212
Array
7 votes
213
Power Matrix
If $X=\begin{bmatrix} 3 & -4 \\ 1 & -1 \end{bmatrix}$, the value of $X^n$ is $\begin{bmatrix} 3n & -4n \\ n & -n \end{bmatrix}$ $\begin{bmatrix} 2+n & 5-n \\ n & -n \end{bmatrix}$ $\begin{bmatrix} 3^n & (-4)^n \\ 1^n & (-1)^n \end{bmatrix}$ None of the above
If $X=\begin{bmatrix} 3 & -4 \\ 1 & -1 \end{bmatrix}$, the value of $X^n$ is$\begin{bmatrix} 3n & -4n \\ n & -n \end{bmatrix}$$\begin{bmatrix} 2+n & 5-n \\ n & -n \end{bm...
2 votes
215
mergesort
Given the following list of numbers: [21, 1, 26, 45, 29, 28, 2, 9, 16, 49, 39, 27, 43, 34, 46, 40] which answer illustrates the list to be sorted after 3 recursive calls to mergesort? [16, 49, 39, 27, 43, 34, 46, 40] [21,1] [21, 1, 26, 45] [21]
Given the following list of numbers:[21, 1, 26, 45, 29, 28, 2, 9, 16, 49, 39, 27, 43, 34, 46, 40]which answer illustrates the list to be sorted after 3 recursive calls to...
10 votes
216
ISRO2011-52
Given X: 0 10 16 Y: 6 16 28 The interpolated value X=4 using piecewise linear interpolation is 11 4 22 10
GivenX:01016Y:61628The interpolated value X=4 using piecewise linear interpolation is1142210
14 votes
217
ISRO2011-78
A symbol table of length $152$ is processing $25$ entries at any instant. What is occupation density? $0.164$ $127$ $8.06$ $6.08$
A symbol table of length $152$ is processing $25$ entries at any instant. What is occupation density?$0.164$$127$$8.06$$6.08$
13 votes
218
ISRO2011-79
A problem whose language is recursion is called? Unified problem Boolean function Recursive problem Decidable
A problem whose language is recursion is called?Unified problemBoolean functionRecursive problemDecidable
2 votes
219
special software to create a job queue is
5 votes
220
ISRO-2013-22
Any set of Boolean operators that is sufficient to represent all Boolean expressions is said to be complete. Which of the following is not complete ? {$NOT$, $OR$} {$NOR$} {$AND$, $OR$} {$AND$, $NOT$}
Any set of Boolean operators that is sufficient to represent all Boolean expressions is said to be complete. Which of the following is not complete ?{$NOT$, $OR$}{$NOR$}{...
5 votes
222
Finite Automation
A language L is accepted by finite automata if and only if it is Right linear Primitive Recursive Context Sensitive Recursive
A language L is accepted by finite automata if and only if it isRight linearPrimitive RecursiveContext SensitiveRecursive
6 votes
223
NIELIT 2016 MAR Scientist C - Section C: 13
Context-free grammar can be recognized by finite state automation $2$- way linear bounded automata push down automata both (B) and (C)
Context-free grammar can be recognized by finite state automation$2$- way linear bounded automatapush down automataboth (B) and (C)
0 votes
224
ToC \ Reg Expression
Give a regular expression for L = {set of all strings in which number of a's are multiples of 3} ∑={a,b,c}
Give a regular expression for L = {set of all strings in which number of a's are multiples of 3}∑={a,b,c}
2 votes
225
shortest path adaptive routing
11 votes
226
ISRO2011-71
One SAN switch has $24$ ports. All $24$ supports $8$ Gbps Fiber Channel technology. What is the aggregate bandwidth of that SAN switch? $96$ Gbps $192$ Mbps $512$ Gbps $192$ Gbps
One SAN switch has $24$ ports. All $24$ supports $8$ Gbps Fiber Channel technology. What is the aggregate bandwidth of that SAN switch?$96$ Gbps$192$ Mbps$512$ Gbps$192$ ...
9 votes
227
ISRO2011-65
The Cyclomatic Complexity metric V(G) of the following control flow graph 3 4 5 6
The Cyclomatic Complexity metric V(G) of the following control flow graph3456
4 votes
228
ISRO2011-51
Warnier Diagram enables the analyst to represent Class structure Information Hierarchy Data Flow State Transition
Warnier Diagram enables the analyst to representClass structureInformation HierarchyData FlowState Transition
10 votes
229
ISRO2014-56
Which of the following is not valid Boolean algebra rule? $\text{X.X = X}$ $\text{(X+Y).X = X}$ $\overline{X}+\text{XY = Y}$ $\text{(X+Y).(X+Z) = X + YZ}$
Which of the following is not valid Boolean algebra rule?$\text{X.X = X}$$\text{(X+Y).X = X}$$\overline{X}+\text{XY = Y}$$\text{(X+Y).(X+Z) = X + YZ}$
4 votes
230
MadeEasy Workbook: CO & Architecture - Pipelining
We need to calculate average instruction execution time here. Actually I don't get the meaning of branch need not be taken, branch is taken. Kindly help me to solve this please! Thank You
We need to calculate average instruction execution time here. Actually I don't get the meaning of branch need not be taken, branch is taken. Kindly help me to solve this ...
Page: