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.
Recent activity 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
2
answers
1
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
answer selected
3 days
ago
in
Operating System

102
views
1
answer
2
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 ..?
answer selected
3 days
ago
in
Algorithms

87
views
algorithms
binarysearch
binarysearchtree
1
answer
3
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?
answer selected
3 days
ago
in
Operating System

27
views
operatingsystem
2
answers
4
graph theory
chromatic number of a graph <= ( maxdegree of the graph ) + 1 can somebody explain how ?
answer selected
3 days
ago
in
Graph Theory

37
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
1
answer
5
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?
answer selected
3 days
ago
in
Theory of Computation

49
views
2
answers
6
typedef
typedef int (*test)(float*, float*); test tmp; i am unable to understand the code ,please help!
answer selected
3 days
ago
in
Programming

71
views
2
answers
7
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).
answer selected
3 days
ago
in
CO & Architecture

290
views
addressingmodes
3
answers
8
Asymptotic notations
Is $ (5  n^3) \in \Omega (n^2) $ ?
answer selected
3 days
ago
in
Algorithms

77
views
asymptoticnotations
1
answer
9
Relations
Proof that a relation which is symmetric and transitive, need not be reflexive relation.
answer selected
3 days
ago
in
Mathematical Logic

40
views
discretemathematics
relations
1
answer
10
ace mock 6
which of the following methods will be the best if number of swappings done, is the only measure of efficiency? A) Bubble sort B) Selection sort C) Insertion sort D) Quick sort
commented
3 days
ago
in
Algorithms

36
views
1
answer
11
Solve the Recurrence
T(n) = 2n T(n/2) + nn
commented
3 days
ago
in
Algorithms

52
views
algorithms
timecomplexity
algorithm
asymptoticnotations
recurrenceequation
2
answers
12
Peter Linz Exercise 4.3
commented
4 days
ago
in
Theory of Computation

82
views
theoryofcomputation
regularlanguage
1
answer
13
A directed acyclic graph represents one form of intermediate repsentation .
commented
6 days
ago
in
Compiler Design

57
views
1
answer
14
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.
commented
Mar 14
in
Programming

149
views
1
answer
15
graph theory
The cardinality of the vertexcut ( seperating set ) of a complete graph with n vertices is ___
commented
Mar 14
in
Graph Theory

48
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
2
answers
16
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 ?
commented
Mar 14
in
Graph Theory

42
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
1
answer
17
float vs double
Program 1: #include<stdio.h> int main() { float x = 0.1; if (x == 0.1) printf("IF"); else if (x == 0.1f) printf("ELSE IF"); else printf("ELSE"); } The output of above program is ... weird output and is there any way to predict these outputs on the same processor. Also how comparison is done of two variables in C ?
answer selected
Mar 12
in
Programming

131
views
programminginc
ieeerepresentation
undefinedbehaviour
2
answers
18
Dout ###
How dual and complement different from each other
answer selected
Mar 12
in
Digital Logic

55
views
dcld
booleanexpressions
2
answers
19
graph theory
State TRUE or FALSE. The chromatic number of a Bipartite graph is ALWAYS 2.
answer selected
Mar 12
in
Graph Theory

30
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
1
answer
20
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
1
answer
21
Kenneth Rosen Edition7 Ch1 Ex1.2 QueNo11
answer selected
Mar 12
in
Set Theory & Algebra

119
views
kennethrosen
settheory&algebra
descriptive
2
answers
22
GATE1991_03,iv
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: The TRAP interrupts mechanism of the $8085$ microprocessor: (a). executes an $RST$ by hardware (b). executes an instruction supplied by an external ... (c). executes an instruction from memory location $20H$ (d). executes a NOP (e). none of the above
answer selected
Mar 12
in
CO & Architecture

215
views
gate1991
co&architecture
outofsyllabusnow
8085
normal
5
answers
23
#Regular Expression
The regular expression 0*(10*)* denotes the same set as (A) (1*0)*1* (B) 0 + (0 + 10)* (C) (0 + 1)* 10(0 + 1)* (D) none of these
answer selected
Mar 12
in
Theory of Computation

227
views
theoryofcomputation
regularexpressions
1
answer
24
garbage collection
Why C language does not provide heap or garbage collection ?? Is there any higher level mechanism??
answer selected
Mar 12
in
Programming

91
views
programminginc
3
answers
25
Which of these programs are possible in C++/Java without the use of File I/O ?
answer selected
Mar 12
in
Programming

115
views
barc2016
programming
others
geeks
1
answer
26
Lexical Analysis
printf("Hello); In the statement given above,is there any lexical error or not ?
commented
Mar 10
in
Compiler Design

71
views
1
answer
27
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
answers
28
ISRO201363
Consider the following $C$ code. #include <stdio.h> #include <math.h> void main () { double pi = 3.1415926535; int a = 1; int i; for (i=0; i < 3; i++) if (a = cos(pi * i/2)) printf("% d", 1); else printf("%d", 0); } What would the program print? $000$ $010$ $101$ $111$
commented
Mar 10
in
Programming

472
views
isro2013
programminginc
identifyfunction
programoutput
2
answers
29
forest and tree
answer selected
Mar 10
in
Graph Theory

47
views
1
answer
30
CMI2011A09
You have a laptop with a fixed amount of memory and hard disk space and no external storage devices connected (CD, USB drives, . . . ). Which of the following is the most accurate formal model of your laptop? Turing machine Linear bounded automaton Pushdown automaton Finite state automaton
commented
Mar 10
in
Theory of Computation

53
views
cmi2011
theoryofcomputation
1
answer
31
Compiler
Which of the following is not a production of grammar ,which generate the expression 1925+70 ? T→0123456789 E→E+T E→ETT E→EE
answer selected
Mar 10
in
Compiler Design

86
views
1
answer
32
Difference between deadloack & spinlock
answer selected
Mar 10
in
Operating System

103
views
2
answers
33
Difference between Depth first traversal and Depth first search
answer selected
Mar 10
in
Algorithms

81
views
2
answers
34
kenneth H rosen 7th ed. Ex 2.1
answer selected
Mar 10
in
Set Theory & Algebra

96
views
kennethrosen
settheory&algebra
sets
2
answers
35
GATE19962.20, ISRO200815
Four jobs to be executed on a single processor system arrive at time $0$ in the order $A, B, C, D$. Their burst CPU time requirements are $4, 1, 8, 1$ time units respectively. The completion time of $A$ under round robin scheduling with time slice of one time unit is $10$ $4$ $8$ $9$
answer selected
Mar 10
in
Operating System

584
views
gate1996
operatingsystem
processschedule
normal
isro2008
1
answer
36
Data structure Array
Suppose we have a circular array implementation of a queue, with 9 items in the queue stored at data[7] through data[15]. The CAPACITY is 19. Where does the push member function place the new entry in the array? Explain via exp.
answer selected
Mar 10
in
Programming

43
views
datastructure
1
answer
37
integer promotion RULE in C gate 2017
commented
Mar 9
in
Programming

147
views
1
answer
38
kenneth H rosen 7th ed. Ex 2.2
answer selected
Mar 9
in
Mathematical Logic

58
views
kennethrosen
settheory&algebra
sets
3
answers
39
what is o/p and explain pls?
#include<stdio.h> #define SQR(x) (x*x) int main() { int a; int b=4; a=SQR(b+2); printf("%d\n",a); return 0; }
answer selected
Mar 9
in
Programming

82
views
1
answer
40
graph theory
answered
Mar 9
in
Graph Theory

43
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
21,446
questions
26,759
answers
60,943
comments
22,955
users