The Gateway to Computer Science Excellence
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
Exam Category
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.
Recent activity 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
1
answer
1
Turing Decidable Languages
Are Turing decidable languages are closed under Complementation, Reversal, Homomorphism, Inverse Homomorphism and Substitution?
comment edited
Sep 11
in
Theory of Computation

67
views
theoryofcomputation
turingmachine
decidability
0
answers
2
regular set
what is the meaning of regular set??
commented
Sep 8
in
Theory of Computation

63
views
finiteautomata
1
answer
3
self doubt
what is cantor's theorem and diagonalization theorem
answered
Sep 8
in
Theory of Computation

32
views
5
answers
4
GATE20162GA10
$f(x) = 1  x  1$ $f(x) =1 + x  1$ $f(x) = 2  x  1$ $f(x) = 2 + x  1$
answered
Sep 8
in
Numerical Ability

872
views
gate20162
numericalability
datainterpretation
normal
0
answers
5
Limits
someone please explain how to solve these kind of questions. i am familiar with one variable and do not know how to solve for more than one variables
commented
Sep 8
in
Calculus

70
views
2
answers
6
decidability
E={<M>  M is a TM and L(M)=Φ}. Is E Turingrecognizable?
answer selected
Sep 8
in
Theory of Computation

51
views
decidability
2
answers
7
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.
commented
Sep 8
in
Theory of Computation

49
views
decidability
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
2
answers
8
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
answer selected
Sep 8
in
Theory of Computation

83
views
decidability
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
turingmachine
0
answers
9
turing machine and language
commented
Sep 7
in
Theory of Computation

41
views
turingmachine
1
answer
10
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
answer selected
Sep 4
in
CO & Architecture

135
views
coandarchitecture
cachememory
1
answer
11
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

107
views
coandarchitecture
cachememory
4
answers
12
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 )
commented
Sep 3
in
CO & Architecture

111
views
coandarchitecture
cachememory
2
answers
13
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 )
commented
Sep 3
in
CO & Architecture

121
views
coandarchitecture
cachememory
1
answer
14
[Gate IN 2016 Set A] Linear algebra,Eigen values
commented
Sep 1
in
Linear Algebra

190
views
linearalgebra
engineeringmathematics
eigenvalue
1
answer
15
Gate CE 2005 linear algebra
Consider a non homogeneous system of linear equations representing mathematically an over determined system. Such a system will be (A) consistent having a unique solution (B) consistent having many solutions (C) inconsistent having a unique solution (D) inconsistent having no solution
answered
Sep 1
in
Linear Algebra

121
views
engineeringmathematics
linearalgebra
5
answers
16
GATE2016223
Anarkali digitally signs a message and sends it to Salim. Verification of the signature by Salim requires. Anarkali's public key. Salim's public key. Salim's private key. Anarkali's private key.
answered
Sep 1
in
Computer Networks

1.5k
views
gate20162
computernetworks
networksecurity
cryptography
easy
2
answers
17
GATE2005IT79
Suppose that two parties A and B wish to setup a common secret key (DH key) between themselves using the DiffieHellman key exchange technique. They agree on 7 as the modulus and 3 as the primitive root. Party A chooses 2 and party B chooses 5 as their respective secrets. Their DH key is 3 4 5 6
commented
Sep 1
in
Computer Networks

785
views
gate2005it
computernetworks
networksecurity
normal
0
answers
18
How to calculate "value" in GCD(value,constant value) = 1 in RSA?
commented
Sep 1
in
Computer Networks

113
views
networksecurity
computernetworks
2
answers
19
assignment operators
#include <stdio.h> int main(){ int a=1 , b=3; a += b = a=b; printf("%d %d",a,b); } what is the output ? a. 3 4 b. 3 5 c. 2 4 d. compilation fails
answered
Sep 1
in
Programming

66
views
output
1
answer
20
group theory
Which book to follow for Group Theory ?
commented
Aug 30
in
Set Theory & Algebra

54
views
1
answer
21
programming in C output with explaination ???
answer selected
Aug 30
in
Programming

108
views
programminginc
3
answers
22
C Program 3
What type of conversion is not accepted in C ? a. from char to int b. from float to char pointer c.from negative int to char d. from double to char
answered
Aug 29
in
Programming

113
views
programminginc
1
answer
23
#cprogramming
#include<stdio.h> int func(){ return (double)(char)5.0; } What will be the data type returned? A)char B)int C)double D)multiple type casting in return is illegal
commented
Aug 29
in
Programming

111
views
programminginc
5
answers
24
C Program 2
#include<stdio.h> int f(int a){ a > 20 ? return 10: return 20; } int main(){ int b=fun(20); return 0; } what will be the output of this program ?
commented
Aug 28
in
Programming

130
views
programminginc
2
answers
25
c programming
What will be the output of the program in DOS (Compiler  Turbo C)? #include<stdio.h> double i; int main() { (int)(float)(char) i; printf("%d",sizeof(i)); return 0; } A. 4 B. 8 C. 16 D. 22
answered
Aug 28
in
Programming

35
views
1
answer
26
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

147
views
theoryofcomputation
contextfreelanguage
regularlanguages
1
answer
27
general doubt
MISSPELLING OF KEYWORDS CAUSE WHICH TYPE OF ERROR SYNTAX ERROR OR LEXICAL ERROR?? printf("%d") without any integer argument will cause which type of error??
commented
Aug 27
in
Compiler Design

115
views
compilerdesign
lexicalanalysis
0
answers
28
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}
edited
Aug 27
in
Theory of Computation

21
views
regularlanguages
theoryofcomputation
0
answers
29
http://ee.gateoverflow.in/212/gate201612
commented
Aug 27
in
Linear Algebra

71
views
eigenvalue
1
answer
30
how to determine this
given { x = (a)^4/3 , a>0 } x is positive or negative how to determine
answered
Aug 27
in
Mathematical Logic

43
views
1
answer
31
#flooding
Two copies of same packet reach the router at same time during flooding. Which one will it accept ?
commented
Aug 27
in
Computer Networks

70
views
2
answers
32
self doubt
how many subsets of a set with 100 elements have more than one element? answer should be 2^(100)1 ot it should be 2^(100)101 which one correct?
answered
Aug 27
in
Combinatory

41
views
1
answer
33
regular languages
Given that a language L = L1 ∪ L2, where L1 and L2 are two other languages. If L is known to be a regular language, then which of the following statements is necessarily TRUE? (a) If L1 is regular then L2 will also be regular (b) If L1 ... then L2 will be regular (c) If L1 is regular and finite the L2 will also be regular and finite (d) None of these
commented
Aug 25
in
Theory of Computation

51
views
theoryofcomputation
regularlanguages
0
answers
34
Rosen example 1
You cannot ride the roller coaster if you are under 4 feet tall unless you are older than 16 years old . express it in the form of propositional logic?
commented
Aug 25
in
Mathematical Logic

53
views
1
answer
35
Matrices
answered
Aug 24
in
Mathematical Logic

42
views
2
answers
36
language (TM)
what is the difference between recursive, RE and REL language?? confuse...
answer edited
Aug 24
in
Theory of Computation

122
views
recursiveandrecursivelyenumerablelanguages
1
answer
37
#theory of computation # turing machine
commented
Aug 23
in
Theory of Computation

119
views
theoryofcomputation
turingmachine
1
answer
38
theory of computation
if L1 ={a^n  n>=0} then L1^R is?
commented
Aug 23
in
Graph Theory

42
views
2
answers
39
Doubt in ordered tree and binary tree.
answered
Aug 23
in
DS

40
views
1
answer
40
regular languages
A = { 0k1u0k  k >=1 and u ∈ ∑* }. Is A is regular ?
commented
Aug 23
in
Theory of Computation

39
views
regularlanguages
theoryofcomputation
28,834
questions
36,686
answers
90,617
comments
34,640
users