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
+3
votes
1
Peter Linz Exercise 4.3
answered
5 days
ago
in
Theory of Computation

82
views
theoryofcomputation
regularlanguage
+3
votes
2
Relations
Proof that a relation which is symmetric and transitive, need not be reflexive relation.
answered
6 days
ago
in
Mathematical Logic

40
views
discretemathematics
relations
+3
votes
3
Asymptotic notations
Is $ (5  n^3) \in \Omega (n^2) $ ?
answered
6 days
ago
in
Algorithms

77
views
asymptoticnotations
+5
votes
4
A directed acyclic graph represents one form of intermediate repsentation .
answered
6 days
ago
in
Compiler Design

57
views
+3
votes
5
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

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

71
views
+3
votes
7
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

149
views
+2
votes
8
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

49
views
+2
votes
9
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

42
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
+2
votes
10
graph theory
chromatic number of a graph <= ( maxdegree of the graph ) + 1 can somebody explain how ?
answered
Mar 12
in
Graph Theory

37
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
+2
votes
11
memory management
In paging no. of entries in page table is same as no. of pages in LAS what does this mean? Does this mean the pages present at particular time in LAS only those pages should be present in page table?
answered
Mar 12
in
Operating System

22
views
operatingsystem
+3
votes
12
graph theory
The cardinality of the vertexcut ( seperating set ) of a complete graph with n vertices is ___
answered
Mar 12
in
Graph Theory

48
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
+2
votes
13
process management
when a process move from ready to suspend ready state i.e. form main memory to backing store. is it possible that process move to another processor for execution?
answered
Mar 12
in
Operating System

27
views
operatingsystem
+5
votes
14
C language
Consider the following C program. What's the Output and does it depends on the compiler used to run this code? #include<stdio.h> int main() { int i = 1; printf("%d %d %d\n", i++, i++, i); return 0; }
answered
Mar 10
in
Programming

40
views
+2
votes
15
integer promotion RULE in C gate 2017
answered
Mar 9
in
Programming

147
views
+3
votes
16
graph theory
answered
Mar 9
in
Graph Theory

43
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
+3
votes
17
ISI 2015 PCB C4 A
Design a context free grammar for the language consisting of all strings over {a,b} that are not the form ww for any string w
answered
Mar 9
in
Theory of Computation

31
views
pushdownautomata
theoryofcomputation
isi2015
+5
votes
18
algorithm
finf the tc T(n)=nlogn +T(n1)
answered
Mar 9
in
Algorithms

49
views
+9
votes
19
binary search
I/p  array of n element in which untill some postion all are integer and afterward all are star (*) O/p find the postion of 1st star (*) Hint  if lenear search is possible the go to BS Find time complexity ..?
answered
Mar 9
in
Algorithms

87
views
algorithms
binarysearch
binarysearchtree
+4
votes
20
graph theory
Find 1) Vertex connectivity 2) Edge connectivity 3) Is it a seperable graph ? If so then find the cutvertex
answered
Mar 9
in
Graph Theory

30
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
+3
votes
21
How many bit strings of length n contains at least ,at most , exactly r 1's
answered
Mar 9
in
Combinatory

23
views
+5
votes
22
how many solutions are there to equation x1+x2+x3 =11
answered
Mar 9
in
Combinatory

38
views
+2
votes
23
Scheduling
Which of the following event doesn't effect a process in the running time ? a) Interupt b) exit c) I/O event d)schedular dispatch
answered
Aug 22, 2016
in
Operating System

102
views
+8
votes
24
permutation and combination
A dice is rolled 6 times ,one ,two,three,four,five,and six appears on consecutive throws of dice ,how many ways are possible of having one before six?? plz explain clearly
answered
Jul 24, 2016
in
Combinatory

56
views
+2
votes
25
Sorting
What is the Worst Case Space Complexity of Quick Sort?
answered
Jul 24, 2016
in
Algorithms

57
views
+7
votes
26
UGCNETDec2012III45
Which of the following regular expression identifies are true? (r+s)*=r*s* (r+s)*=r*+s* (r+s)*=(r*s*)* r*s*=r*+s*
answered
Jun 18, 2016
in
Theory of Computation

93
views
theoryofcomputation
ugcnetdec2012iii
+4
votes
27
ISRO200757
Which of the following programming language(s) provides garbage collection automatically Lisp C++ Fortan C
answered
Jun 17, 2016
in
Programming

462
views
isro2007
programming
memorymanagement
+4
votes
28
primary key for an entity
A primary key for an entity is a candidate key any attribute a unique attribute a superkey
answered
Jun 17, 2016
in
Databases

112
views
+9
votes
29
Minimum number of states in DFA
answered
Jun 17, 2016
in
Theory of Computation

126
views
+5
votes
30
UGCNETDec2014II35
Recognize the CFL for the given CFG. S> aB bA, A> aaSbAA, B> bbSaBB A. strings contain equal number of a's and equal number of b's. B. strings contain odd number of a's and odd number of b's. C. strings contain odd number of a's and even number of b's. D. strings contain even number of a's and even number of b's.
answered
Jun 17, 2016
in
Theory of Computation

148
views
ugcnetdec2014ii35
theoryofcomputation
+4
votes
31
how many no of times the instruction sequence below will loop before coming out of loop?
answered
Jun 16, 2016
in
ISRO

115
views
+8
votes
32
Write regular expression to denote a language L which accepts all the strings which begin or end with either 00 or 11
answered
Jun 16, 2016
in
Theory of Computation

307
views
theoryofcomputation
regularexpressions
peterlinz
+5
votes
33
Grammar that produce more than one Parse tree for same sentence is:
answered
Jun 16, 2016
in
Theory of Computation

103
views
compilerdesign
parsing
+4
votes
34
Regular expression for the language L = { w ∈ {0, 1}*  w has no pair of consecutive zeros} is
answered
Jun 16, 2016
in
Theory of Computation

313
views
theoryofcomputation
+4
votes
35
Which of the following conversion is not possible (algorithmically)?
answered
Jun 16, 2016
in
Theory of Computation

152
views
theoryofcomputation
+7
votes
36
UGCNETSep2013II18
The number of 8bit strings beginning with either 111 or 101 is 64 128 265 None of the above
answered
Jun 16, 2016
in
Theory of Computation

129
views
theoryofcomputation
ugcnetsep2013ii
+4
votes
37
Let T(n) be the function defined by T(n) = 1 and T(n) = 2T (n/2) + n, which of the following is TRUE ?
answered
Jun 16, 2016
in
Algorithms

169
views
+6
votes
38
UGCNETDec2012II2
The worst case time complexity of AVL is tree is better in comparison to binary search tree for A. Search and Insert Operations B. Search and Delete Operations C. Insert and Delete Operations D. Search, Insert and Delete Operations
answered
Jun 16, 2016
in
DS

393
views
datastructure
binarytree
ugcnetdec2012ii
avltree
+4
votes
39
UGCNETSep2013III40
The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is O(n) O(n Ig n) O(n$^2$) None of the above
answered
Jun 16, 2016
in
Algorithms

70
views
algorithms
ugcnetsep2013iii
+4
votes
40
Linked List
Linked Lists are not suitable for _____. A. Binary Search B. Polynomial Manipulation C. Insertion D. Radix Sort
answered
Jun 16, 2016
in
DS

223
views
linkedlists
binarysearch
Page:
1
2
3
4
5
6
next »
21,446
questions
26,759
answers
60,943
comments
22,955
users