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.
Answers by rude
User rude
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User rude
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
GATE2016Session7GA5
The sum of the digits of a two digit number is $12$. If the new number formed by reversing the digits is greater than the original number by $54$, find the original number. $39$ $57$ $66$ $93$
answered
Apr 27
in
Numerical Ability

88
views
gate2016session7aptitude
numericalability
numericalcomputation
0
votes
2
pointer
Which of the following declaration throw runtime error? A. int **c = &c; B. int **c = &*c; C. int **c = **c; D. None of the mentioned. I think C is correct but mentioned correct ans is D how?
answered
Apr 19
in
Programming

71
views
+1
vote
3
Check for Regular Language
Check whether given language is Regular or not? WXWR / W,X∈(0,1)+
answered
Apr 19
in
Theory of Computation

81
views
theoryofcomputation
regularlanguages
0
votes
4
How to find size of integer on your system in C programming
answered
Apr 19
in
Programming

59
views
programminginc
0
votes
5
theory of computation
Is this correct ...?
answered
Apr 12
in
Theory of Computation

48
views
theoryofcomputation
regularexpressions
0
votes
6
theory of computation
What language is accepted by the npda below if we make F = {q0, qf }, where F denotes set of final states. Answer is L = $\sum$* ...........right ???
answered
Apr 12
in
Theory of Computation

43
views
theoryofcomputation
+2
votes
7
theory of computation
Let C be a contextfree language and R be a regular language. Prove that the language C $\cap$ R is context free.
answered
Apr 12
in
Theory of Computation

43
views
theoryofcomputation
+3
votes
8
theory of computation
The Language is given by, L is a A) Deterministic CFL. B) Non deterministic CFL but not DCFL. Please draw the PDA for the above language ...
answered
Apr 12
in
Theory of Computation

42
views
theoryofcomputation
+7
votes
9
Gate 2017 Admission for AIR in 800(s).
answered
Apr 5
in
IISc/IITs

312
views
gate2017addmission
gettingtoiits
+5
votes
10
theory of computation
State TRUE or FALSE . For every regular language , there exists a unique minimal DFA . I know that for every regular language, there is a minimal DFA ...but is it unique ? i think it is ...please explain ...
answered
Apr 4
in
Theory of Computation

85
views
theoryofcomputation
finiteautomata
grammar
regularexpressions
+5
votes
11
CIL17
answered
Apr 3
in
DS

353
views
+5
votes
12
gate 2018
How can i keep motivated during fulltime gate preparation?
answered
Apr 2
in
GATE

84
views
gate
+5
votes
13
how many context switches occur whenever application processes are multiplexed
answered
Apr 1
in
Operating System

54
views
+7
votes
14
ISRO20087
Consider the grammar $S \rightarrow ABCc \mid bc$ $BA \rightarrow AB$ $Bb \rightarrow bb$ $Ab \rightarrow ab$ $Aa \rightarrow aa$ Which of the following sentences can be derived by this grammar? abc aab abcc abbc
answered
Apr 1
in
Theory of Computation

1.2k
views
isro2008
theoryofcomputation
contextfreelanguage
grammar
+4
votes
15
theory of computation
answered
Apr 1
in
Theory of Computation

42
views
theoryofcomputation
grammar
+5
votes
16
IISc CDS
Hello, I've just received my Call Letter for IISc CDS (M. Tech). My query is that if I attend the interview then will they consider my application for CSA (M.Tech, Direct Admission) ? While filling the form I've chosen CSA as my first preference and CDS as my second. Thank you.
answered
Apr 1
in
IISc/IITs

500
views
iiscinterview
iisc
cds
admissions
+4
votes
17
cpu scheduling
There are six processes waiting in ready queue with the burst time are 9 , 7 , 4 , 2 , 1 and x . In what order should they run to minimize the average waiting time when the value of x is either 5 or 6. a) 1 , 2 , 4 , x , 7 , 9 b) 9 , 7 , x , 4 , 2 , 1 c) x , 7 , 9 , 4 , 2 , 1 d) order cannot be decided
answered
Apr 1
in
Operating System

36
views
+4
votes
18
Peter Linz Exercise 8.1
#8 Determine whether or not the following languages are contextfree (a) L= { anwwRan : n>=0 , w ∈ {a,b}* } (b) L = { anbjanbj : n>=0, j>=0 } (c) L = { anbjajbn : n>=0, j>=0 } (d) L= { anbjakbl : n+j<=k+l } (e) L ... nb(w)=2nc(w) } My answers are : (a)CFL (b)Not CFL (c)CFL (d) CFL (e)Not CFL (f)Not CFL (g) Not CFL Please verify.
answered
Apr 1
in
Theory of Computation

83
views
theoryofcomputation
contextfreelanguage
+4
votes
19
Peter Linz Exercise 8.1
#10 Is the below language context free? L = { w1cw2 : w1,w2 ∈ {a,b}* , w1≠ w2} As per my analysis it is not. Please verify.
answered
Apr 1
in
Theory of Computation

76
views
theoryofcomputation
contextfreelanguage
+3
votes
20
Peter Linz Exercise 8.1
#20 Is the following language L = { amn : m and n are prime } context free?
answered
Apr 1
in
Theory of Computation

70
views
theoryofcomputation
contextfreelanguage
+3
votes
21
How to check if a function follows identity?
answered
Mar 29
in
Digital Logic

76
views
digitallogic
+6
votes
22
IIT K interview dates
IIT K will be conducting interview/written tests around May 1416 and I have semester exams during that time. How am I supposed to attend the process? Will they change dates because many students may face this issue? Please someone answer. IIT K is the best option I have.
answered
Mar 29
in
IISc/IITs

125
views
+28
votes
23
Career advice
I am 2016 pass out.i dropped a year for gate and scored 461 marks 35 with rank 5361.i took online coaching of Ravindra sir in the month of July and saw his videos till October and practiced gate previous year questions.i did a major blunder by not ... I will be rejected because of the two year drop.I don't know wat to do.please tell me what should I do.
answered
Mar 29
in
Written Exam

2.4k
views
+7
votes
24
group theory
which among the following statements is TRUE ? S1 : ( { 0,1,2....(m1) } , +m ) where +m stands for "additionmodulom" S2 : ( {0,1,2....m} , +m ) where +m stands for "additionmodulom". A) ONLY S1 is a group. B) ONLY S2 is a group. C) BOTH S1 AND S2 are groups. D) NEITHER S1 NOT S2 is a group.
answered
Mar 25
in
Set Theory & Algebra

67
views
discretemathematics
groups
settheory&algebra
engineeringmathematics
sets
+6
votes
25
list type
// Graph class represents a undirected graph // using adjacency list representation class Graph { int V; // No. of vertices // Pointer to an array containing adjacency lists list<int> *adj; } is 'list' a datatype?? where can i study about it??
answered
Mar 25
in
Programming

73
views
programminginc
+6
votes
26
group theory
Is ( {0},* ) a group ? ( where * stands for multiplication operation ). Please provide explanations with your answer
answered
Mar 25
in
Set Theory & Algebra

113
views
discretemathematics
groups
settheory&algebra
engineeringmathematics
sets
+5
votes
27
BARC2017
Time complexity of dijkstra's algorithm when array used in place of priority queue Options O(V^2) , O(VlogV+E) , O(VlogV+ElogV) , O(V^3)
answered
Mar 25
in
Algorithms

83
views
+5
votes
28
Digital Logic
F is a function which have three variable A,B and C. How many Universal Gates will be needed to implement this function.
answered
Mar 24
in
Digital Logic

104
views
digitallogic
+5
votes
29
selfdoubt
Are ECE graduates eligible for admissions in IITs/IISc? I gave gate exam in CS and am expecting around 100 rank, Would I be eligible for admissions in IISC/ all IITs? Edit: IISC specifically. I got most of the other info.
answered
Mar 24
in
IISc/IITs

78
views
+7
votes
30
min max using divide and conquer
answered
Mar 24
in
Algorithms

155
views
divideandconquer
algorithms
+6
votes
31
C programming doubt
I am getting segmentation fault for the following code.Please help to rectify. #include <stdio.h> #include <stdlib.h> struct person { int age; float weight; char *name; }; int main() { struct person *ptr; int i, num; printf("Enter number of ... ;%s\t%d\t%.2f\n", ptr>name[i], (ptr+i)>age, (ptr+i)>weight); return 0; }
answered
Mar 24
in
Programming

182
views
+6
votes
32
Peter Linz Exercise 4.3
answered
Mar 18
in
Theory of Computation

128
views
theoryofcomputation
regularlanguages
+6
votes
33
Relations
Proof that a relation which is symmetric and transitive, need not be reflexive relation.
answered
Mar 17
in
Mathematical Logic

77
views
discretemathematics
relations
+5
votes
34
Asymptotic notations
Is $ (5  n^3) \in \Omega (n^2) $ ?
answered
Mar 17
in
Algorithms

121
views
asymptoticnotations
+7
votes
35
A directed acyclic graph represents one form of intermediate repsentation .
answered
Mar 17
in
Compiler Design

113
views
+6
votes
36
memory addressing
Consider $1 \text{GHz}$ clock frequency processor,uses different operand accessing models shown below: Operand Accessing Mode Frequency(%) Register 10 Immediate 20 Direct 30 Memory Indirect 20 Indexed 20 Assume that $2$ memory cycles consumed for ... fetch rate (in millions $\text{words/sec}$) of processor is __________ (upto 2 to decimal places).
answered
Mar 14
in
CO & Architecture

404
views
addressingmodes
+5
votes
37
typedef
typedef int (*test)(float*, float*); test tmp; i am unable to understand the code ,please help!
answered
Mar 14
in
Programming

133
views
+5
votes
38
source
void fun(int **pptr) { int q = 10; *pptr = &q; } int main() { int r = 20; int *p = &r; fun(&p); printf("%d", *p); return 0; } The output of the program is 10 . But as q here is an automatic variable, the result shouldn't be 10.
answered
Mar 14
in
Programming

178
views
+5
votes
39
theory of automata
do we need to study chomsky and griebach normal forms in detail for the gate exam? are they useful for solving anything in an easier way?
answered
Mar 12
in
Theory of Computation

68
views
+6
votes
40
graph theory
A graph with n vertices and 0 edges.can this graph be called as Bipartite ? i mean can we simply partition the n vertices into two sets of vertices such that there is no edge within the set as well there is no edge between the two sets and say it as a Bipartite graph ?
answered
Mar 12
in
Graph Theory

93
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
Page:
1
2
3
4
5
6
7
next »
24,796
questions
31,868
answers
73,708
comments
30,011
users