GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Questions by amrendra pal
User amrendra pal
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User amrendra pal
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+3
votes
1
answer
1
cache memory
Consider a computer with a 4ways setassociative mapped cache of the following characteristics: a total of 256 MB of main memory, a word size of 1 byte, a line size of 128 words and a cache size of 512 KB. While accessing the memory location FC23CDEH by the ... /6]217 ,where TAG field is the content of the corresponding cache line. (a) 3 (b) 0 (c) 1 (d) 2
asked
Sep 3
in
CO & Architecture

76
views
co&architecture
cachememory
+3
votes
1
answer
2
cache memory
In kway set associative mapping , the tag field contains 8 bits and 64 no. of sets and propagation delay of a comparator is k/20 nsec and propagation delay of 2*1 multiplexer is k/10 nsec. then what will be the total delay? (let k=8)
asked
Sep 3
in
CO & Architecture

71
views
co&architecture
cachememory
+2
votes
4
answers
3
cache memory
when 8way set associative mapping of cache memory is done and main memory size is 32 GB and Tag field has 10 bits. what will be the cache size ( consider, memory is byte addresable )
asked
Sep 3
in
CO & Architecture

63
views
co&architecture
cachememory
+2
votes
1
answer
4
cache memory
what will be size of main memory. when 4way set associative mapping of cache memory is done and cache size is 256 KB and Tag field has 7 bits( consider, memory is byte addresable )
asked
Sep 3
in
CO & Architecture

48
views
co&architecture
cachememory
+4
votes
1
answer
5
programming in C output with explaination ???
asked
Aug 28
in
Programming

77
views
programminginc
+2
votes
1
answer
6
regular and CFL language
Let A and B be two languages over alphabet ∑ . which of the following are true ? (more than one options may be correct) (a) if A is regular and B is CFL then A∩B is also CFL. (b) if A is regular and B is CFL then A∪B is also CFL. (c) if A ... and B is CFL then A∩B will not be a CFL. (d) if A is not CFL and B is CFL then A∪B will not be a CFL.
asked
Aug 27
in
Theory of Computation

114
views
theoryofcomputation
contextfreelanguage
regularlanguages
+1
vote
0
answers
7
regular language
which of the following is not a finite state language? (a) L = {02n ; n>=0} on ∑ = {0} (b) L = {s  s ∈ {0,1}* and s when interpreted as a binary string is such that s mod 5 = 0 } (c) L = {s  s ∈ {0,1}* and s ... bit to most significant bit is such that its integer interpretation is divisible by 2 } (d) L = {0,0000,00000000,........} on ∑ = {0}
asked
Aug 27
in
Theory of Computation

15
views
regularlanguages
theoryofcomputation
+4
votes
1
answer
8
regular languages
let ∑ = {0, 1, +, =} and L = { x=y+z  x, y, z are binary integers, and x is the sum of y and z }. Is L regular ?
asked
Aug 23
in
Theory of Computation

39
views
regularlanguages
theoryofcomputation
+2
votes
1
answer
9
regular languages
A = { 0k1u0k  k >=1 and u ∈ ∑* }. Is A is regular ?
asked
Aug 23
in
Theory of Computation

31
views
regularlanguages
theoryofcomputation
+1
vote
0
answers
10
regular languages
L = {0ku0k  k >=1 and u ∈ ∑* }. Is L is regular ?
asked
Aug 23
in
Theory of Computation

12
views
regularlanguages
theoryofcomputation
+1
vote
1
answer
11
regular languages
A / B = { w  wx ∈ A for some x ∈ B }. Show that if A is regular and B is any language, then A / B is regular.
asked
Aug 22
in
Theory of Computation

23
views
regularlanguages
theoryofcomputation
+2
votes
0
answers
12
regular language
B = { x  x is a binary number that is a multiple of n }. Then how to proove that for each n>=1, the language B is regular.
asked
Aug 22
in
Theory of Computation

19
views
regularlanguages
theoryofcomputation
+2
votes
0
answers
13
regular language
C = {ak  k is multiple of n }. Then how to show that for each n>=1, the language C is regular.
asked
Aug 22
in
Theory of Computation

23
views
turingmachine
regularlanguages
theory
of
theoryofcomputation
+4
votes
0
answers
14
decidability
C = { <G,x>  G is a CFG and x is substring of some y ∈ L(G) } . Then C is  a) undecidable b) Turing unrecognizable c) Recursive enumerable d) decidable
asked
Aug 22
in
Theory of Computation

24
views
decidability
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
turingmachine
+2
votes
0
answers
15
decidability
C = { <G,k>  G is a CFG and L(G) contains exactly k strings where k>=0 or k=∞ } . Then C will be a) decidable b) Turing unrecognizable c) Recursive enumerable d) undecidable
asked
Aug 22
in
Theory of Computation

26
views
decidability
contextfreelanguage
recursiveandrecursivelyenumerablelanguages
turingmachine
+7
votes
1
answer
16
c programming
output with explanation ?
asked
Aug 21
in
Programming

133
views
programminginc
pointers
+3
votes
0
answers
17
decidability
S = { < R >  R is a regular expression describing a language containing at least one string w has 111 as a substring (i.e., w = x111y for some x ans y)}. Then what will be S  a) decidable b) undecidable c) Recursive enumerable d) Turing unrecognizable
asked
Aug 20
in
Theory of Computation

42
views
decidability
recursiveandrecursivelyenumerablelanguages
+2
votes
3
answers
18
decidability
S = { < M>  M is a DFA that accepts some string containing an equal number of 0s and 1s}. Then what will be S  a) Recursive enumerable b) undecidable c) decidable d) Turing corecognizable
asked
Aug 20
in
Theory of Computation

60
views
+6
votes
2
answers
19
decidability
S = { <M>  M is a DFA that accepts some palindrome }. Then what will be S  a) Turing recognizable b) decidable c) undecidable d) none of these
asked
Aug 20
in
Theory of Computation

35
views
+2
votes
1
answer
20
decidability
A = { <M>  M is a DFA that accepts WR whenever it accepts W }. Then A is  a) Turing recognizable b) Turing unrecognizable c) decidable d) undecidable
asked
Aug 20
in
Theory of Computation

12
views
+4
votes
2
answers
21
decidability
A = { <M>  M is a DFA that accepts some string with more 1s than 0s }. Then A is  a) undecidable b) recursive enumerable c) decidable d) none of the above
asked
Aug 20
in
Theory of Computation

35
views
decidability
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
turingmachine
+2
votes
0
answers
22
decidability
A = { <M>  M is a DFA that doesn't accept any string containing an odd number of 1s }. Then A will be  a) Recursive enumerable b) Turing corecognizable c) decidable d) none of these
asked
Aug 20
in
Theory of Computation

27
views
+2
votes
2
answers
23
decidability
A = { <R,S>  R and S are regular expressions and L(R) ⊆ L(S) }. Then what about A  a) Turing recognizable b) decidable c) undecidable d) Turing unrecognizable
asked
Aug 20
in
Theory of Computation

30
views
decidability
recursiveandrecursivelyenumerablelanguages
+3
votes
2
answers
24
decidability
INFINITEDFA= {<A>  A is a DFA and L(A) is an infinite language } . Then  a) INFINITEDFA is decidable. b) INFINITEDFA is undecidable. c) INFINITEDFA is Turingrecognizable. d) INFINITEDFA is Turingunrecognizable.
asked
Aug 20
in
Theory of Computation

32
views
decidability
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
+2
votes
1
answer
25
decidability
INFINITEPDA = {<M>  M is a PDA and L(M) is an infinite language } . Then  a) INFINITEPDA is undecidable. b) INFINITEPDA is decidable. c) INFINITEPDA is recursive enumerable. d) INFINITEPDA is Turing corecognizable.
asked
Aug 20
in
Theory of Computation

26
views
decidability
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
+5
votes
2
answers
26
decidability
E={<M>  M is a TM and L(M)=Φ}. Is E Turingrecognizable?
asked
Aug 20
in
Theory of Computation

41
views
decidability
26,163
questions
33,743
answers
79,987
comments
31,123
users