The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by sripo
User sripo
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User sripo
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
3
answers
1
GATE2016115
Consider the following C program. # include <stdio.h> void mystery (int *ptra, int *ptrb) { int *temp; temp = ptrb; ptrb =ptra; ptra = temp; } int main () { int a = 2016, b=0, c= 4, d = 42; mystery (&a, &b); if (a < c) mystery (&c, &a); mystery (&a, &d); print f("%d\n", a); } The output of the program is _________.
commented
Nov 29, 2019
in
Programming

5.7k
views
gate20161
programminginc
easy
numericalanswers
1
answer
2
Eligibility of UGCNET
What is the eligibility criteria for UGCNET? I have just completed my bachelors in 2018 am I eligible to answer this exam?
answer selected
May 14, 2019
in
CBSE/UGC NET

93
views
ugc
ugcnetjuly2018ii
netexam
exam
preparation
1
answer
3
JEST Sample Question 1a
Let a and b be positive integers such that a > b and a^ 2 − b^ 2 is a prime number. Then a^2 − b^ 2 is equal to (A) a − b (B) a + b (C) a × b (D) none of the above
asked
Feb 15, 2019
in
Set Theory & Algebra

80
views
jest
discretemathematics
settheory&algebra
1
answer
4
JEST Sample Question 1b
When is the following statement true? (A ∪ B) ∩ C = A ∩ C (A) If Ā ∩ B ∩ C = φ (B) If A ∩ B ∩ C = φ (C) always (D) never
asked
Feb 15, 2019
in
Set Theory & Algebra

78
views
jest
discretemathematics
settheory&algebra
1
answer
5
JEST Sample Question 1d
T (n) = T (n/2) + 2; T (1) = 1 When n is a power of 2, the correct expression for T (n) is: (A) 2(log n + 1) (B) 2 log n (C) log n + 1 (D)2 log n + 1
asked
Feb 15, 2019
in
Algorithms

136
views
jest
algorithms
timecomplexity
1
answer
6
JEST Sample Question 1c
If a fair die (with 6 faces) is cast twice, what is the probability that the two numbers obtained differ by 2? (A) 1/12 (B) 1/6 (C) 2/9 (D) 1/2
asked
Feb 15, 2019
in
Probability

59
views
jest
probability
discretemathematics
1
answer
7
JEST Sample Question2
Consider the following function, defined by a recursive program: function AP(x,y: integer) returns integer; {if {x = 0 then return y+1} else if { y = 0 then return AP(x1,1)} else return AP(x1, AP(x,y1)) } (a) Show that on all nonnegative arguments x and y, the function AP terminates. (b) Show that for any x, AP(x, y) > y.
asked
Feb 15, 2019
in
Programming

70
views
jest
programminginc
1
answer
8
JEST Sample Question4
A tournament is a directed graph in which there is exactly one directed edge between every pair of vertices. Let Tn be a tournament on n vertices. (a) Use induction to prove the following statement: Tn has a directed hamiltonian path (a directed ... or a simple description of the steps in the algorithm, will suffice. What is the worst case time complexity of your algorithm?
asked
Feb 15, 2019
in
Algorithms

92
views
jest
algorithms
timecomplexity
0
answers
9
JEST Sample Question6
Two gamblers have an argument. The first one claims that if a fair coin is tossed repeatedly, getting two consecutive heads is very unlikely. The second, naturally, is denying this. They decide to settle this by an actual trial; if, within n coin tosses, ... demonstrated. What happens for larger values of n? Is it true that P (n) only increases with n? Justify your answer.
asked
Feb 15, 2019
in
Probability

34
views
jest
engineeringmathematics
probability
1
answer
10
JEST Sample Question5
Describe two different data structures to represent a graph. For each such representation, specify a simple property about the graph that can be more efficiently checked in that representation than in the other representation. Indicate the worst case time required for verifying both of your properties in either representation.
asked
Feb 15, 2019
in
Algorithms

44
views
jest
algorithms
timecomplexity
0
answers
11
JEST Sample Question7
Consider the following program: function mu(a,b:integer) returns integer; var i,y: integer; begin P i = 0; y = 0; while (i < a) do begin Q y := y + b ; i = i + 1 end return y end Write a condition P such that the program terminates, and a condition Q which is true whenever program execution reaches the place marked Q above.
asked
Feb 15, 2019
in
Programming

39
views
jest
programminginc
1
answer
12
Jest Exam sample question3
How many subsets of even cardinality does an nelement set have ? Justify answer. Please give a proof if possible.This is part of subjective JEST paper.
asked
Feb 15, 2019
in
Set Theory & Algebra

33
views
jest
settheory&algebra
discretemathematics
0
answers
13
MadeEasy Test Series: Computer Networks Sliding Window
I am unable to understand their explanation,can anyone explain it in a better way?
commented
Feb 14, 2019
in
Computer Networks

120
views
computernetworks
slidingwindow
gobackn
madeeasytestseries
2
answers
14
Test Series For Gate 2020
Which are the best TestSeries for gate 2020.In terms of quality of question and for practice purposes. Just solving PYQ’s is it enough?
comment edited
Feb 9, 2019
in
GATE

2k
views
gatepreparation
1
answer
15
ACE TEST SERIES
is there is easy way to find no of candidate key in these type of questions.
commented
Jan 31, 2019
in
Databases

128
views
databases
0
answers
16
Jest Exam
please give answer or name a book from where i can access Describe two different data structures to represent a graph. For each such representa tion, specify a simple property about the graph that can be more efficiently checked in that representation than in the other representation. Indicate the worst case time required for verifying both of your properties in either representation.
commented
Jan 30, 2019
in
Written Exam

41
views
jest
3
answers
17
GATE19982.5
Let $L$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimal state deterministic finite state automaton accepting $L$ is $2$ $5$ $8$ $3$
commented
Jan 29, 2019
in
Theory of Computation

4.2k
views
gate1998
theoryofcomputation
finiteautomata
normal
minimalstateautomata
1
answer
18
NIELIT 201828
For the function $(z) = \frac{1}{z^2(e^z1)}, z=0$ is a pole of order: $1$ $2$ $3$ None of these
commented
Jan 28, 2019
in
Others

52
views
nielit2018
1
answer
19
GOCompiler1: Parsing14
Which of the below relations does hold TRUE regarding GRAMMARS? $LL(1) \subset SLR(1) \subset LR(1)$ $SLR(1) \subset \epsilon\text{free}\; LL(1) \subset LR(1)$ $\epsilon\text{free}\;LL(1) \subset SLR(1) \subset LR(1)$ $LL(1) \subset SLR(1) = LR(1)$
commented
Jan 27, 2019
in
Compiler Design

222
views
go2019cd1
5
answers
20
GATE2018GA4
What would be the smallest natural number which when divided either by $20$ or by $42$ or by $76$ leaves a remainder of $7$ in each case? $3047$ $6047$ $7987$ $63847$
commented
Jan 22, 2019
in
Numerical Ability

1.7k
views
gate2018
numericalability
factors
1
answer
21
Computer science gate psu
Which one test series should I purchase for that it will help me all types of computer science related exam like:: PSU,NVS,KVS,CIL,CRIS,BEL,BARC,ISRO ,IBPS SO,SBI SO . ....
answered
Jan 18, 2019
in
GATE

587
views
gatepreparation
isropreparation
1
answer
22
GATE201111
A computer handles several interrupt sources of which of the following are relevant for this question. Interrupt from CPU temperature sensor (raises interrupt if CPU temperature is too high) Interrupt from Mouse (raises Interrupt if the mouse is ... at the HIGHEST priority? Interrupt from Hard Disk Interrupt from Mouse Interrupt from Keyboard Interrupt from CPU temperature sensor
commented
Jan 16, 2019
in
Operating System

2.9k
views
gate2011
operatingsystem
interrupts
normal
2
answers
23
GATE201165
A container originally contains $10$ litres of pure spirit. From this container, $1$ litre of spirit replaced with $1$ litre of water. Subsequently, $1$ litre of the mixture is again replaced with $1$ litre of water and this process is repeated one more time. How much spirit is now left in the container? $7.58$ litres $7.84$ litres $7$ litres $7.29$ litres
commented
Jan 16, 2019
in
Numerical Ability

3.4k
views
gate2011
numericalability
normal
numericalcomputation
1
answer
24
How many Binary Search Trees are possible for a labelled nodes?
Let us there are n nodes which are labelled. Then the number of trees possible is given by the Catalan Number i.e $\binom{2n}{n} / (n+1)$ Then the binary search trees possible is just 1?
asked
Jan 16, 2019
in
DS

527
views
algorithms
graphtheory
binarysearchtree
binarysearch
binarytree
trees
datastructures
2
answers
25
GATE201163
The variable cost $(V)$ of manufacturing a product varies according to the equation $V=4q$, where $q$ is the quantity produced. The fixed cost $(F)$ of production of same product reduces with $q$ according to the equation $F=\dfrac{100}{q}$. How many units should be produced to minimize the total cost $(V+F)$? $5$ $4$ $7$ $6$
answered
Jan 16, 2019
in
Numerical Ability

1.8k
views
gate2011
numericalability
costmarketprice
normal
0
answers
26
#madeeasy test series
What is the good score in full length test series advance in madeeasy ??
commented
Jan 16, 2019
in
Study Resources

449
views
0
answers
27
Gate Preparation in the last 18 days from Now
I have completed some amount of syllabus,I have takes some tests also,I haven't solved all the PYQ's of the GO book.My FLT scores are very poor.I have realized that my ability to take stress is poor one bad score and the time I take to recover ... as I wake up late. I just feel that Gate exam is not my cup of tea and I am wasting my time on it.
commented
Jan 15, 2019
in
GATE

132
views
gatepreparation
0
answers
28
CPU scheduling
How we can solve this question?
commented
Jan 7, 2019
in
Operating System

48
views
0
answers
29
Language accepted by this Turing Machine
As per the given solution,B should be the correct answer right why is D given as the correct answer as the machine accepts atleast one b.
asked
Jan 5, 2019
in
Theory of Computation

69
views
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
regularexpressions
1
answer
30
MadeEasy Subject Test 2019: Theory Of Computation  Regular Languages
Can anyone explain how S2 is false,I did not understand their logic.
commented
Jan 1, 2019
in
Theory of Computation

124
views
regularexpressions
theoryofcomputation
finiteautomata
regularlanguages
expression
madeeasytestseries
0
answers
31
Madeeasy Test Series: Operating System  Process Schedule
For the given question instead of the given order if we take one unit of P2 as its arrival time is 1 and then schedule P1 next we get the same answer,even in the hint they have given as the process which comes first ... and the solution given ends up giving the same answer,does this happen for all cases or just happening for this question?
commented
Jan 1, 2019
in
Operating System

124
views
cpuscheduling
operatingsystem
sjf
processschedule
madeeasytestseries
0
answers
32
Is ISRO not have exam for CSE students this year?
Below are the links of ISRO notification there are no positions advertised for CSE students? So ISRO is not having an exam for CSE students this year? https://gradeup.co/isrorecruitmenti?utm_campaign=gate3112&utm_medium=gate&utm_source=email_manual https://gradeup.co/liveData/f/2018/12/bilingual_advt_for_website.pdf17.pdf
commented
Dec 31, 2018
in
ISRO

248
views
job
isroapplication
1
answer
33
What is the reason for Belady's Anamoly
What is the reason for Belady’s Anomaly,I am aware that it is not a stack based algorithm and for a certain set of pages it shows this anomaly where the increase in page frame increases the page fault rate.
asked
Dec 28, 2018
in
Operating System

144
views
pagereplacement
virtualmemory
operatingsystem
0
answers
34
DAG Syllabus
Is DAG from compiler design is in the syllabus?
commented
Dec 27, 2018
in
Compiler Design

117
views
dag
compilerdesign
0
answers
35
Shortcut Method to find Maxima and Minima in Calculus
https://www.youtube.com/watch?v=tyiQLindzCE This is a great video but covers formula for cubic root what about for any given equation x^n,what would be the solution?
asked
Dec 26, 2018
in
Calculus

140
views
calculus
maximaminima
engineeringmathematics
2
answers
36
Regarding When to take test series
Which approach should be followed: Finishing subtopics and giving test series simultaneously or finishing the full syllabus first and then taking the test series, in DecemberJanuary? Also, I have heard that Made Easy test series have a lot of errors. Then which one to take?
answered
Dec 26, 2018
in
Study Resources

184
views
testseries
preparation
studyresources
0
answers
37
Breadth first Search
Which of following statement is true ? A. In BFS of UDG there are no back edges and forward edges. B. In BFS of Directed Graph there is no back edge and forward edges. C. In BFS of UDG for each back edge(u,v) we have 0<= v.d <= u.d D. Both b and c. Ans. A
commented
Dec 26, 2018
in
DS

697
views
bfs
datastructures
graphalgorithms
0
answers
38
Preparation Advice for GATE 2019
I have 3 subjects to complete,COA,CN and DL. I am forgetting all the other subjects which I have been doing,I tried to finish syllabus and delayed revision for max subject coverage,I have solved pyqs from GO book but not of all topics. I am ... What should I do from this stage? I have left my job in October and preparing full time(Just 3 months of experience).
commented
Dec 25, 2018
in
GATE

358
views
gatepreparation
studyresources
examstress
careeradvice
0
answers
39
Highest best case implies worst case?
Which of the below given sorting techniques has highest bestcase runtime complexity. (A) Quick sort (B) Selection sort (C) Insertion sort (D) Bubble sort Answer: (B) Explanation: Quick sort best case time complexity is Ο(n logn) Selection sort ... 12/ I did not understand this as best case time should be O(n) sorting method what does highest best cases mean?
commented
Dec 25, 2018
in
Algorithms

111
views
algorithms
asymptoticnotations
datastructures
sorting
timecomplexity
2
answers
40
In a 3array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?
commented
Dec 25, 2018
in
DS

430
views
binarytree
trees
graphtheory
algorithms
datastructures
50,737
questions
57,275
answers
198,154
comments
104,820
users