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 Pranav Kant Gaur
User Pranav Kant Gaur
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Pranav Kant Gaur
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
CMI2013B03
A simple graph is one in which there are no self loops and each pair of distinct vertices is connected by at most one edge. Show that any finite simple graph has at least two vertices with the same degree.
answered
Mar 30, 2017
in
Graph Theory

202
views
cmi2013
descriptive
graphtheory
graphconnectivity
5
answers
2
GATE2014138
Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following represents the correct Venn diagram of the complexity classes P, NP and NP Complete (NPC)?
answer edited
Feb 12, 2017
in
Theory of Computation

1.7k
views
gate20141
algorithms
pnpnpcnph
normal
outofsyllabusnow
2
answers
3
GATE2016242
Consider the following two statements: If all states of an NFA are accepting states then the language accepted by the NFA is $\Sigma_{}^{*}$. There exists a regular language $A$ such that for all languages $B$, $A \cap B$ is regular. Which one of the following is CORRECT? Only I is true Only II is true Both I and II are true Both I and II are false
commented
Feb 10, 2017
in
Theory of Computation

7.1k
views
gate20162
theoryofcomputation
finiteautomata
normal
3
answers
4
GATE201326
The line graph $L(G)$ of a simple graph $G$ is defined as follows: There is exactly one vertex $v(e)$ in $L(G)$ for each edge $e$ in $G$. For any two edges $e$ and $e'$ in $G$, $L(G)$ has an edge between $v(e)$ and $v(e')$, if and only if $e$ and $e'$ ... graph of a planar graph is planar. (S) The line graph of a tree is a tree. $P$ only $P$ and $R$ only $R$ only $P, Q$ and $S$ only
commented
Jan 31, 2017
in
Graph Theory

4.8k
views
gate2013
graphtheory
normal
linegraph
3
answers
5
GATE201322
Which one of the following functions is continuous at $x = 3?$ $f(x) = \begin{cases} 2,&\text{if $x = 3$ } \\ x1& \text{if $x > 3$}\\ \frac{x+3}{3}&\text{if $x < 3$ } \end{cases}$ $f(x) = \begin{cases} 4,&\text{if $ ... $} \end{cases}$ $f(x) = \begin{cases} \frac{1}{x^327}&\text{if $x \neq 3$ } \end{cases}$
commented
Jan 30, 2017
in
Calculus

2.1k
views
gate2013
calculus
continuity
normal
6
answers
6
GATE201028
The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph? $7, 6, 5, 4, 4, 3, 2, 1$ $6, 6, 6, 6, 3, 3, 2, 2$ $7, 6, 6, 4, 4, 3, 2, 2$ $8, 7, 7, 6, 4, 2, 1, 1$ I and II III and IV IV only II and IV
commented
Jan 28, 2017
in
Graph Theory

5.1k
views
gate2010
graphtheory
degreeofgraph
2
answers
7
GATE201062
Hari(H), Gita(G), Irfan(I) and Saira(S) are siblings (i.e., brothers and sisters). All were born on 1st January. The age difference between any two successive siblings (that is born one after another) is less than three years. Given the following facts: Hari's age ... Saira is not the youngest. There are no twins. In what order they were born (oldest first)? $HSIG$ $SGHI$ $IGSH$ $IHSG$
answered
Jan 26, 2017
in
Numerical Ability

3.7k
views
gate2010
numericalability
logicalreasoning
normal
4
answers
8
GATE200727
Consider the set of (column) vectors defined by$X = \left \{x \in R^3 \mid x_1 + x_2 + x_3 = 0, \text{ where } x^T = \left[x_1,x_2,x_3\right]^T\right \}$ ... a linearly independent set, but it does not span $X$ and therefore is not a basis of $X$. $X$ is not a subspace of $R^3$. None of the above
commented
Jan 25, 2017
in
Linear Algebra

3.8k
views
gate2007
linearalgebra
normal
vectorspace
1
answer
9
GO2017Programming116
What is the number of tokens in the below C code? int foo(int i, int j){ return printf(" I do it correctly", i > j); }
commented
Jan 23, 2017
in
Programming

331
views
go2017programming1
programming
tokens
numericalanswers
1
answer
10
Output of Program ?
#include <stdio.h> int main() { int i = 10; int *const p = &i; fd(&p); printf("%d\n", *p); } void fd(int **p) { int j = 11; *p = &j; printf("%d\n", **p); }
comment edited
Jan 19, 2017
in
Programming

173
views
programminginc
pointers
1
answer
11
Recursion
Consider the following recursive function which is used by dynamic programming. Assume for every function call T(i) it checks the table first, if its value is already computed it retrieves the value from table. Otherwise it calls a recursive function call to ... number of function calls that need the support of stack to complete the execution of the function T(12) are __________ .
commented
Jan 19, 2017
in
Programming

399
views
1
answer
12
Testbook Test Series: Computer Networks  Csma Cd
A 2kmlong, 10Mbps CSMA/CD LAN (not 802.3) has a propagation speed of 200 m/microsec. Repeaters are not allowed in this system. Data frames are 512 bits long, including 32 bits of header, checksum, and ... The effective data rate is _____________________ Mbps (correct to 2 decimal places), excluding overhead, assuming that there are no collisions?
commented
Jan 19, 2017
in
Computer Networks

526
views
testbooktestseries
computernetworks
csmacd
effectivedatarate
12
answers
13
GATE200447
Consider a system with a twolevel paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. The ... instruction execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
commented
Jan 17, 2017
in
CO and Architecture

22.1k
views
gate2004
coandarchitecture
virtualmemory
normal
3
answers
14
GATE20161GA05
A cube is built using $64$ cubic blocks of side one unit. After it is built, one cubic block is removed from every corner of the cube. The resulting surface area of the body (in square units) after the removal is ________. $56$ $64$ $72$ $96$
commented
Jan 10, 2017
in
Numerical Ability

4.7k
views
gate20161
numericalability
geometry
normal
4
answers
15
GATE20161GA03
Archimedes said, "Give me a lever long enough and a fulcrum on which to place it, and I will move the world." The sentence above is an example of a ____________ statement. figurative collateral literal figurine
commented
Jan 10, 2017
in
Verbal Ability

1.8k
views
gate20161
verbalability
normal
englishgrammar
6
answers
16
GATE200847
We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. The total time required for this is $\Theta(\log n)$ $\Theta(n)$ $\Theta(n\log n)$ $\Theta(n^2)$
commented
Jan 7, 2017
in
Algorithms

5.5k
views
gate2008
algorithms
timecomplexity
normal
1
answer
17
gate 2005
Consider the following CFG, find the number of productions in the minimized grammar after it was convert it into Greibach normal form. S → AA 0, A → SS  1 plzzz explain how to convert the given grammer into gnf in detail.
commented
Jan 3, 2017
in
Theory of Computation

288
views
2
answers
18
TIFR2014B10
Given a set of $n$ distinct numbers, we would like to determine both the smallest and the largest number. Which of the following statements is TRUE? These two elements can be determined using $O\left(\log^{100}n\right)$ ... $2(n  1)$ comparisons. None of the above.
answered
Dec 8, 2016
in
Algorithms

1.4k
views
tifr2014
algorithms
minimummaximum
3
answers
19
TIFR2014B6
Consider the problem of computing the minimum of a set of $n$ distinct numbers. We choose a permutation uniformly at random (i.e., each of the n! permutations of $\left \langle 1,....,n \right \rangle$ is chosen with probability $(1/n!)$ and we inspect the numbers in the order given by this ... number of times MIN is updated? $O (1)$ $H_{n}=\sum ^{n}_{i=1} 1/i$ $\sqrt{n}$ $n/2$ $n$
commented
Dec 6, 2016
in
Algorithms

653
views
tifr2014
algorithms
minimummaximum
1
answer
20
Linear Dependent
I am getting independent but answer is given as dependent. Can some one tell me what worng with my approach
answered
Dec 6, 2016
in
Linear Algebra

112
views
engineeringmathematics
1
answer
21
Asymptotic Notations DAA
$f(x) = n^{log (n)}$ $g(x) = nlog (n)$ $h(x) = 2^{n}$ Arrange Them in Increasing Order of rate of growth
commented
Dec 6, 2016
in
Algorithms

109
views
asymptoticnotations
algorithms
4
answers
22
TIFR2014B4
Consider the following undirected graph with some edge costs missing. Suppose the wavy edges form a Minimum Cost Spanning Tree for $G$. Then, which of the following inequalities NEED NOT hold? cost$(a, b) \geq 6$. cost$(b, e) \geq 5$. cost$(e, f) \geq 5$. cost$(a, d) \geq 4$. cost$(b, c) \geq 4$.
commented
Dec 6, 2016
in
Algorithms

1.6k
views
tifr2014
algorithms
graphalgorithms
spanningtree
6
answers
23
TIFR2013A6
You are lost in the National park of Kabrastan. The park population consists of tourists and Kabrastanis. Tourists comprise twothirds of the population the park and give a correct answer to requests for directions with probability $\dfrac{3}{4}$. The air of Kabrastan has an amnesaic quality, ... $\left(\dfrac{1}{2}\right)$ $\left(\dfrac{2}{3}\right)$ $\left(\dfrac{3}{4}\right)$
commented
Nov 12, 2016
in
Probability

790
views
tifr2013
probability
conditionalprobability
2
answers
24
Placing n balls in r boxes(with a maximum of one ball per box)
How many ways are there to: Put n distinguishable balls in r distinguishable boxes? Put n indistinguishable balls in r distinguishable boxes? Put n distinguishable balls in r indistinguishable boxes? Put n indistinguishable balls in r indistinguishable boxes? Where, $r \geq n$
answer reshown
Jun 21, 2016
in
Combinatory

442
views
permutationandcombination
3
answers
25
Uniform Distribution
Question A subway train in a certain line runs after every half hour, between every midnight and 6 in the morning. What is the probability that a man entering the station at random will have to wait at least 20 minutes? I'm stuck here... It ... in this case what is the upper limit of the integral ? URL : https://www.assignmentexpert.com/homeworkanswers/MathAnswer40654.pdf
answered
Jun 20, 2016
in
Probability

907
views
probability
uniformdistribution
5
answers
26
Time complexity
Given a sorted array of n elements where other than one element x every other element repeat two times. Then how much time will it take to find position of x?
commented
Jun 20, 2016
in
Algorithms

904
views
2
answers
27
Expected sum value of permutaion
We have a set(A) of N elements. Let's assume elements are e1,e2,e3..etc. Value of each element can be 0 or 1. Another set of N elements(set B) are given, p1,p2,p3..etc. Where p (i) =probability of e (i) to be 1. If we pick a random ... contains 5 elements e1,e2,e3,e4,e5 and we picked a 5 element sequence 1,0,0,1,1. In this case sum = 3. Expected_Value of sum ?
answer edited
Jun 17, 2016

311
views
probability
permutationandcombination
expectation
descriptive
3
answers
28
What is the probability of getting total of 7 atleast once in 3 tosses of a fair dice... ?
commented
Jun 17, 2016
in
Probability

832
views
probability
1
answer
29
Assume the following C variable declaration int *A [10], B[10][10];
Of the following expressions I A[2] II A[2][3] III B[1] IV B[2][3] which will not give compiletime errors if used as left hand sides of assignment statements in a C program? I, II, and IV only B II, III, and IV only C II and IV only IV only
commented
Jun 17, 2016

751
views
1
answer
30
Why implication is used with Universal quantifier and not conjunction?
Also why conjunction is used with Existential Quantifier and not implication? I tried to understand the main reason behind the choice of implication or conjunction, but I haven't received the proper answer.
answered
Jun 17, 2016
in
Mathematical Logic

585
views
mathematicallogic
firstorderlogic
propositionallogic
1
answer
31
Data Structure Graph
What is the minimum number of edges which must be removed from a complete bipartite graph of six nodes K(6) so that the remaining graph is a planar? Explain with exp why your answer is Right .
answer edited
Jun 16, 2016
in
Theory of Computation

681
views
datastructures
graphtheory
1
answer
32
ISRO200871
The time required to search an element in a linked list of length n is $O(\log_2 n)$ $O(n)$ $O(1)$ $O(n^2)$
comment edited
Jun 13, 2016
in
DS

2.3k
views
isro2008
datastructures
linkedlists
2
answers
33
Combinations with Repetitions
Choose 4 letters from the word ' ARSUN SURESH ' ? My Approach A1 R2 S3 U2 N1 E1 H1 11 letter word . case 1 : All 4 letters are different case2 : 2 letters same 2 letters different case 3 : 2 letters same , 2 letters same case 4 : 3 letters ... 2 R's C(2,2)* C(3,2) CASE 4  There are no enough letters . Therefore req no of ways for case4 is 0
answer edited
Jun 11, 2016
in
Combinatory

182
views
permutationandcombination
5
answers
34
Mahima noticed me as she _____ yesterday
Mahima noticed me as she _____ yesterday. was passing by passed was passing passed by
answered
Jun 9, 2016

136
views
englishgrammar
2
answers
35
fill in the blanks with the most suitable option.
fill in the blanks with the most suitable option. She left her job to _____ upon her career as a dancer. a. withdraw b.depart c.embark d.abscond
answered
Jun 9, 2016

392
views
englishgrammar
1
answer
36
When will TIFR2017 application form come for CSE?
answered
Jun 6, 2016
in
Other Colleges

286
views
1
answer
37
Number of ways of choosing K balls from A White,B Red and C Green Balls.
Is a generic solution possible to this problem
answered
Jun 6, 2016
in
Mathematical Logic

84
views
1
answer
38
Probability that none of men selects his own hat
Suppose that each of N men at a party throws his hat into the center of the room. The hats are first mixed up, and then each man randomly selects a hat. What is the probability that none of the men selects his own hat?
answered
Jun 6, 2016
in
Probability

851
views
probability
engineeringmathematics
2
answers
39
ISRO 2014
answered
Jun 6, 2016
in
Digital Logic

387
views
1
answer
40
Which is correct and why?
Assume that there are two lower triangular matrices A and B of size n*n. If matrix A and transpose of B are fit into a rectangular matrix C of size n*(n+1), then a) B[i,j]=C[i,j+1] b)B[i,j]=C[j+1,i] c)B[i,j]=C[j, i+1]
comment edited
Jun 5, 2016
in
DS

557
views
50,737
questions
57,301
answers
198,297
comments
104,999
users