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 Kaluti
0
votes
61
Regular language problem
Which of the following is TRUE? S1: Any language L over an alphabet Σ,L+=L-{ϵ} is always TRUE. S2: For any automata M, L(M)≠∅( Marks: 0.00 ) S1,S2 Only S1 Only S2 Both the statements are false
Which of the following is TRUE?S1: Any language L over an alphabet Σ,L+=L-{ϵ} is always TRUE.S2: For any automata M, L(M)≠∅( Marks: 0.00 ) S1,S2 Only S1 Only S2 Bot...
718
views
answered
Jun 25, 2017
0
votes
62
MadeEasy Subject Test: Theory of Computation - Finite Automata
What is the answer for following question.
What is the answer for following question.
1.0k
views
answered
Jun 25, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
0
votes
63
Binary tree
An array X of n distinct integers is interpreted as a complete binary tree.The index of first element of array is 0.index of parent of element X[i] is (i-2)/2 (i/2)-1
An array X of n distinct integers is interpreted as a complete binary tree.The index of first element of array is 0.index of parent of element X[i] is(i-2)/2(i/2)-1
441
views
answered
Jun 14, 2017
0
votes
64
Graph
What can be used to find if a graph is disconnected BFS DFS Both
What can be used to find if a graph is disconnectedBFSDFSBoth
220
views
answered
Jun 14, 2017
0
votes
65
theory of computation
Which of the following languages is/are REGULAR ? A) L1 = { wxwR / w,x $\in$ {a,b}* and length(w) = 6 } B) L2 = { wxwR / w,x $\in$ {a,b}* and length(x) = 6 } I feel A) is regular ..but B) is not ...Please verify ...
Which of the following languages is/are REGULAR ?A) L1 = { wxwR / w,x $\in$ {a,b}* and length(w) = 6 } B) L2 = { wxwR / w,x $\in$ {a,b}* and length(x) = 6 }I feel A) is r...
499
views
answered
Jun 4, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
66
Regular Expression
Given statement is true or false 1. L is regular language $\Leftrightarrow$ Ǝ a regular expression without $\bigstar$ answer in detail
Given statement is true or false 1. L is regular language $\Leftrightarrow$ Ǝ a regular expression without $\bigstar$ answer in detail
549
views
answered
May 31, 2017
0
votes
67
Digital Electronics
Size of rom for converting binary code to gray code?
Size of rom for converting binary code to gray code?
514
views
answered
May 30, 2017
0
votes
68
[COA][ Hamacher 1.6] Cache memory
1.6 Suppose that execution time for a program is directly proportional to instruction access time and that access to an instruction in the cache is 20 times faster than access to an instruction in the main memory. Assume that a requested instruction ... added only one then please explain why? part B) Does doubling cache means access time of cache is also doubled?
1.6 Suppose that execution time for a program is directly proportional to instruction access time and that access to an instruction in the cache is 20 times faster than a...
1.9k
views
answered
May 22, 2017
CO and Architecture
co-and-architecture
memory-interfacing
cache-memory
+
–
0
votes
69
Doubt
L = { an bm cp dq , n != m or p != q } Is it inherently ambiguous or not????
L = { an bm cp dq , n != m or p != q }Is it inherently ambiguous or not????
750
views
answered
Apr 15, 2017
Theory of Computation
theory-of-computation
inherently-ambiguous
+
–
0
votes
70
theory of computation
Give an algorithm which, for any given context-free grammar G, can determine whether or not: λ $\in$ L(G) ,where $\lambda$ denotes the empty string .
Give an algorithm which, for any given context-free grammar G, can determine whether or not: λ $\in$ L(G) ,where $\lambda$ denotes the empty string .
316
views
answered
Apr 15, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
71
ISI 2004 MIII
$x^{2}+x+1$ is a factor of $\left ( x+1 \right )^{n}-x^{n}-1$ whenever $n$ is odd $n$ is odd and multiple of $3$ $n$ is an even multiple of $3$ $n$ is odd and not a multiple of $3$
$x^{2}+x+1$ is a factor of $\left ( x+1 \right )^{n}-x^{n}-1$ whenever $n$ is odd$n$ is odd and multiple of $3$$n$ is an even multiple of $3$$n$ is odd and not a multiple...
548
views
answered
Apr 4, 2017
Set Theory & Algebra
factors
isi2004
engineering-mathematics
+
–
0
votes
72
Generating function
Let $h_n$ denote the number of non-negative integral solutions of the equation $3x_1 + 4x_2 + 2x_3 + 5x_4 = n$ Find the generating function $g(x)$ for $h_0,h_1,h_2,h_3 ... h_n$
Let $h_n$ denote the number of non-negative integral solutions of the equation $3x_1 + 4x_2 + 2x_3 + 5x_4 = n$Find the generating function $g(x)$ for $h_0,h_1,h_2,h_3 ....
704
views
answered
Apr 4, 2017
Combinatory
generating-functions
combinatory
+
–
0
votes
73
APTITUDE
A class is composed of 2 brothers and 6 other boys. In how many ways can all the boys be seated at a round table so that the two brothers are not seated together?
A class is composed of 2 brothers and 6 other boys. In how many ways can all the boys be seated at a round table so that the two brothers are not seated together?
693
views
answered
Mar 17, 2017
1
votes
74
radius ,diameter of graph
The distance between two distinct vertices v1 and v2 of a connected simple graph is the length (number of edges) of the shortest path between v1 and v2. The radius of a graph is the minimum over all vertices v of the maximum distance from v to another vertex. ... maximum distance between two distinct vertices. Find the radius and diameter of a) K6. b) K4,5. c) Q3. d) C6.
The distance between two distinct vertices v1 and v2 of aconnected simple graph is the length (number of edges) ofthe shortest path between v1 and v2. The radius of a gra...
2.0k
views
answered
Mar 16, 2017
0
votes
75
ISRO 2007-ECE : Binary Codes
The logic circuit given below converts a binary code Y1 Y2 Y3 into a) Excess -3 code b) Gray code c) BCD code d) Hamming code
The logic circuit given below converts a binary code Y1 Y2 Y3 intoa) Excess -3 codeb) Gray codec) BCD coded) Hamming code
921
views
answered
Mar 3, 2017
Digital Logic
isro-ece
digital-logic
digital-circuits
+
–
0
votes
76
ISRO 2008- ECE Computer architecture
------ machines tend to make use of internal resources of the processor, a rich set of registers and a pipelined organization. (a) CISC (b) Parallel processor (c) RISC (d) Array processor
machines tend to make use of internal resources of the processor, a rich set of registers and a pipelined organization.(a) CISC(b) Parallel processor(c) RISC(d) Array...
605
views
answered
Mar 1, 2017
CO and Architecture
isro-ece
co-and-architecture
+
–
0
votes
77
ISRO 2008-ECE Cache Memory
The advantage of write (copy) back data cache organization over write through organization is (a) Main memory consistency (b) Write allocate on write miss (c) Less memory bandwidth (d) Higher capacity requirement
The advantage of write (copy) back data cache organization over write through organization is(a) Main memory consistency(b) Write allocate on write miss(c) Less memory ba...
650
views
answered
Mar 1, 2017
CO and Architecture
isro-ece
co-and-architecture
+
–
0
votes
78
ISRO 2010-ECE Cache memory
A microprocessor has a cache memory with access time of 2 ns and a main memory with access time of 10 ns. If the cache miss ratio is 0.6, what is the average memory access time? a) 6.8 ns b) 6 ns c) 5.2 ns d) 12 ns
A microprocessor has a cache memory with access time of 2 ns and a main memory with access time of 10 ns. If the cache miss ratio is 0.6, what is the average memory acces...
401
views
answered
Mar 1, 2017
CO and Architecture
isro-ece
co-and-architecture
+
–
0
votes
79
ISRO 2009- ECE Code efficiency
A source produces 4 symbols with probabilities 1/2,1/4,1/8,1/8. For this source, a practical coding scheme has an average code- word length of 2 bits/symbol. The efficiency of the code is a) 1 b) 7/8 c) 1/2 d) 1/4
A source produces 4 symbols with probabilities 1/2,1/4,1/8,1/8. For this source, a practical coding scheme has an average code- word length of 2 bits/symbol. The efficien...
6.0k
views
answered
Mar 1, 2017
Computer Networks
isro-ece
+
–
1
votes
80
ISRO 2008-ECE array processor
An array processor is a machine (a) SIMD (b) MIMD (c) SISD (d) MISD
An array processor is a machine(a) SIMD(b) MIMD(c) SISD(d) MISD
1.3k
views
answered
Mar 1, 2017
CO and Architecture
isro-ece
co-and-architecture
+
–
1
votes
81
output of program
If the following fragment (assume negative numbers are stored in 2's complement form) unsigned i=1; int j=-4; printf("%u",i+j); prints x then printf("%d", 8*sizeof(int)); outputs an integer that is same as (log in the options are of base 2) a)8*log(x+3) b)log(x+3) c)unpredictable value d)none of the above
If the following fragment (assume negative numbers are stored in 2's complement form)unsigned i=1;int j=-4;printf("%u",i+j);prints x then printf("%d", 8*sizeof(int));outp...
956
views
answered
Feb 28, 2017
1
votes
82
max min in an array
Consider the problem of computing min-max in an unsorted array where min and max are minimum and maximum elements of array. Algorithm A1 can compute min-max in a1 comparisons without divide and conquer. Algorithm A2 can compute min-max in a2 comparisons by scanning the array linearly. What could be the relation between a1 and a2 considering the worst case scenarios?
Consider the problem of computing min-max in an unsorted array where min and max are minimum and maximum elements of array. Algorithm A1 can compute min-max in a1 compari...
3.0k
views
answered
Feb 28, 2017
Algorithms
algorithms
array
maximum-minimum
+
–
0
votes
83
The number of ways of seating three gentlemen
The number of ways of seating three gentlemen and three ladies in a row, such that each gentlemen is adjacent to atleast one lady.
The number of ways of seating three gentlemen and three ladies in a row, such that each gentlemen is adjacent to atleast one lady.
456
views
answered
Feb 25, 2017
Combinatory
combinatory
+
–
0
votes
84
the number of ways in which 4 distinct balls
the number of ways in which 4 distinct balls can be put in 4 boxes labelled a,b,c,d such that b does not follow a, and c does not follow b, and d does not follow c,is
the number of ways in which 4 distinct balls can be put in 4 boxes labelled a,b,c,d such that b does not follow a, and c does not follow b, and d does not follow c,is
472
views
answered
Feb 25, 2017
Combinatory
combinatory
+
–
0
votes
85
ISI2016-PCB-CS-3
Consider the following extract from a program, written in a C-like language, that computes the transpose of a matrix. for (i=0; i<N; i++) for (j=0; j<N; j++) B[i,j]=A[i,j]; $A$ and $B$ are $N \times N$ matrices with floating point entries ... Each of $A$ and $B$ is stored starting from the beginning of a page None of the pages allocated to $A$ and $B$ are initially in memory.
Consider the following extract from a program, written in a C-like language, that computes the transpose of a matrix.for (i=0; i<N; i++) for (j=0; j<N; j++) B[i,j]=A[i,j]...
931
views
answered
Feb 25, 2017
Operating System
isi2016-pcb-cs
operating-system
demand-paging
page-fault
non-gate
descriptive
+
–
0
votes
86
ISRO2015-EC Flipflop
What is the functionality of following digital circuit? A is input data, CLK is system clock ind Y is output. Falling edge detection of input A Clock division by $2$ Rising edge detection of input A Clock division by $4$
What is the functionality of following digital circuit? A is input data, CLK is system clock ind Y is output.Falling edge detection of input AClock division by $2$Rising ...
738
views
answered
Feb 24, 2017
Digital Logic
isro2015-ece
isro-ece
digital-logic
+
–
3
votes
87
ISRO2015-EC Pipelining
Pipelining technique is used in microprocessor to improve which of the following parameter? Power dissipation Interrupt latency Die size Maximum clock frequency
Pipelining technique is used in microprocessor to improve which of the following parameter?Power dissipationInterrupt latencyDie sizeMaximum clock frequency
927
views
answered
Feb 24, 2017
CO and Architecture
isro2015-ece
isro-ece
co-and-architecture
pipelining
+
–
0
votes
88
ISI2015-PCB-CS-2b
Let $P_1(x, y_1),\: P_2(x, y_2), \dots, P_n(x, y_n)$ be a collection of $n$ distinct points lying on a vertical line $L$. The value of $x$ is stored in a variable, and $y_1, y_2, \dots, y_n$ are stored in an array in decreasing order. Additionally, you ... is to select an appropriate point $P_k$ on $L$ such that the cost of the route $R$ from $S$ to $D$ through $P_k$ is minimized.
Let $P_1(x, y_1),\: P_2(x, y_2), \dots, P_n(x, y_n)$ be a collection of $n$ distinct points lying on a vertical line $L$. The value of $x$ is stored in a variable, and $y...
583
views
answered
Feb 19, 2017
Algorithms
descriptive
isi2015-pcb-cs
algorithms
minimum-spanning-tree
+
–
0
votes
89
MST..
Let G(V, E) be an undirected graph with positive edge weights. What is the worst case time complexity to find minimum spanning tree using Kruskal algorithm is implemented using array data structure ? a) O(|E|+|V log V|) b) O(|V| |log V|) c) O(|V2|) d) O(|V| |log2V|)
Let G(V, E) be an undirected graph with positive edge weights. What is the worst case time complexity to find minimum spanning tree using Kruskal algorithm is implemented...
499
views
answered
Feb 3, 2017
Algorithms
minimum-spanning-tree
algorithms
+
–
Page:
« prev
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register