Recent activity

0 votes

0 answers

1

linkedlist_made easy question
ans givn in B but i think it should be D [closed]

closed 41 minutes ago in Programming by Arjun Veteran (286k points) | 3 views

0 votes

4 answers

2

c programming
what is the o/p #include<stdio.h> void main() { int a=5; printf("%d %d %d",a++,++a,--a); } also suggest me notes so i can clear my concept about printf function (For Gate)

answer selected 53 minutes ago in Programming by Arjun Veteran (286k points) | 41 views

0 votes

0 answers

3

Tuple relational calculus
can someone give me a explanation of how any divide query in relational algebra be written using tuple calculus(using implication) . thanks in advance

asked 1 hour ago in Databases by chetan raghav (19 points) | 2 views

0 votes

0 answers

4

Madeasy workbook

asked 1 hour ago in Digital Logic by shefali1 Junior (527 points) | 2 views

+13 votes

3 answers

5

GATE2006-67
Consider the relation account (customer, balance) where customer is a primary key and there are no null values. We would like to rank customers according to decreasing balance. The customer with the largest balance gets rank 1. Ties are not broke but ranks are ... using ODBC. Which two of the above statements are correct? 2 and 5 1 and 3 1 and 4 3 and 5

commented 2 hours ago in Databases by Kaluti Junior (767 points) | 1.6k views

+2 votes

1 answer

6

Parsing doubt
$\begin{align*} &\color{blue}{\text{Top down predictive parsers detect errors earlier than bottom up parsers (true/false)}} \\ &\color{maroon}{\text{Justify your answer}} \\ \end{align*}$

answered 2 hours ago in Compiler Design by Abbas2131 Junior (531 points) | 282 views

+1 vote

2 answers

7

GATE1987-10d
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.

commented 3 hours ago in Theory of Computation by Vishal Goyal Active (1.6k points) | 85 views

+1 vote

1 answer

8

Regular Expression to CFG
So , 1 is mandatory in Regular expression ; and both of above grammar allows strings without 1 to be genearated. So , I expected None of above to be answer. What Am I missing here ? Consider for (A) Production = A0 -> A1 A1-> 0

answered 4 hours ago in Theory of Computation by Vishal Goyal Active (1.6k points) | 96 views

+5 votes

2 answers

9

GATE2008-IT-74
Student (school-id, sch-roll-no, sname, saddress) School (school-id, sch-name, sch-address, sch-phone) Enrolment(school-id sch-roll-no, erollno, examname) ExamResult(erollno, examname, marks) What does the following SQL query output? ... the school and the number of its students scoring 100 in at least one exam nothing; the query has a syntax error

commented 4 hours ago in Databases by Kaluti Junior (767 points) | 921 views

+1 vote

1 answer

10

test book
The minimum number of states required to contruct a DFA accepting languages L= { w | w has an even number of both 0's and 2 's , and an odd number of 1's } over the alphabet $\Sigma =\left \{ 0,1,2,3 \right \}$ is _____ please write regular expression also.

commented 4 hours ago in Theory of Computation by Vishal Goyal Active (1.6k points) | 164 views

+3 votes

4 answers

11

subgraphs
number of subgraph for K3 is

answered 4 hours ago in Graph Theory by erh Junior (707 points) | 118 views

0 votes

3 answers

12

Network layer
The routine table of a router is shown below : Destination subnet Interface 132.81.0.0 255.225.0.0 eth0 132.81.64.0 255.255.224.0 eth1 132.81.68.0 255.255.255.0 eth2 132.81.68.64 255.255.255.224 eth3 A packet begining a destination address 132.81 ... at the router . on which of the interfaces it cant be forwarded ? a) eth 0 b ) eth 1 c) eth 2 d) eth 3

commented 4 hours ago in Computer Networks by Digvijaysingh Gautam Boss (7.8k points) | 191 views

0 votes

2 answers

13

oprator in C
anyone explain this prog?? how to output is evaluvated?? int main() { int x = 10, y; y = (x++, printf("x = %d\n", x), ++x, printf("x = %d\n", x), x++); printf("y = %d\n", y); printf("x = %d\n", x); return 0; }

commented 4 hours ago in Programming by neeraj33negi (129 points) | 51 views

+2 votes

1 answer

14

matrix
If A3x3 is a matrix with |A| = 2. What is the determinant of Adj (Adj (Adj A))?

commented 5 hours ago in Linear Algebra by Arnab Bhadra Loyal (3.1k points) | 558 views

0 votes

0 answers

15

[Engineering maths] Linear homogeneous system of equation

asked 5 hours ago in Linear Algebra by rahul sharma 5 Loyal (4.8k points) | 4 views

0 votes

1 answer

16

networks
In Hierarchical routing for 400 router subnet, the optimal number of levels is (A) 20 (B) 400 (C) 3 (D) 6

comment edited 5 hours ago in Computer Networks by alokraj1142 (59 points) | 29 views

0 votes

0 answers

17

relational algebra
State True/False: "Result of a division operation in relational algebra can never be an empty relation".

commented 5 hours ago in Databases by erh Junior (707 points) | 71 views

0 votes

1 answer

18

RELATIONAL ALGEBRA
What is the output of below question please draw table according to question.

answered 5 hours ago in Databases by erh Junior (707 points) | 4 views

0 votes

0 answers

19

[Engineering Mathematics]
In system of Linear equations Ax=B, where A is m*n ,which of the following is/are true? a:) If b=0, and m=n,then only trivial solution is possible. b:) If b=0, and m=n,then always trivial solution is possible. c:)If b=0 ... If b=0,and m<n ,then only non-trivial solution possible. d:)If b=0,and m>n ,then only non-trivial solution possible.

asked 5 hours ago in Linear Algebra by rahul sharma 5 Loyal (4.8k points) | 3 views

0 votes

1 answer

20

GATE_2015_ECE Matrices
.

answered 5 hours ago in Mathematical Logic by Arnab Bhadra Loyal (3.1k points) | 51 views

0 votes

1 answer

21

TESTBOOK TEST

answered 5 hours ago in Set Theory & Algebra by erh Junior (707 points) | 5 views

+4 votes

1 answer

22

GATE2006-72
The $2^n$ vertices of a graph G corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements. The maximum degree of a vertex in G is: $\binom{n/2}{2}2^{n/2}$ $2^{n-2}$ $2^{n-3}\times 3$ $2^{n-1}$

edited 5 hours ago in Graph Theory by Silpa Junior (551 points) | 664 views

+5 votes

1 answer

23

GATE2006-73
The $2^n$ vertices of a graph G corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in G is: $n$ $n + 2$ $2^{n/2}$ $\frac{2^{n}}{n}$

edited 5 hours ago in Graph Theory by Silpa Junior (551 points) | 660 views

+1 vote

1 answer

24

CMI2012-B-01
Let $G=(V, E)$ be a graph where $|V| =n$ and the degree of each vertex is strictly greater than $\frac{n}{2}$. Prove that $G$ has a Hamiltonian path. (Hint: Consider a path of maximum length in $G$.)

retagged 5 hours ago in Graph Theory by Silpa Junior (551 points) | 31 views

0 votes

2 answers

25

GATE1988-2xvi
Write the adjacency matrix representation of the graph given in below figure.

edited 5 hours ago in Graph Theory by Silpa Junior (551 points) | 79 views

0 votes

1 answer

26

TIFR2017-B-2
Consider the following statements: Checking if a given $undirected$ graph has a cycle is in $\mathsf{P}$ Checking if a given $undirected$ graph has a cycle is in $\mathsf{NP}$ Checking if a given $directed$ graph has a cycle is in $\mathsf{P}$ Checking ... following options. Only i and ii Only ii and iv Only ii, iii, and iv Only i, ii and iv All of them

edited 5 hours ago in Graph Theory by Silpa Junior (551 points) | 90 views

+13 votes

4 answers

27

GATE2007-23
Which of the following graphs has an Eulerian circuit? Any $k$-regular graph where $k$ is an even number. A complete graph on 90 vertices. The complement of a cycle on 25 vertices. None of the above

edited 5 hours ago in Graph Theory by Silpa Junior (551 points) | 1.1k views

+7 votes

1 answer

28

GATE2001-2.15
How many undirected graphs (not necessarily connected) can be constructed out of a given set $V=\{v_1, v_2, \dots v_n\}$ of $n$ vertices? $\frac{n(n-1)} {2}$ $2^n$ $n!$ $2^\frac{n(n-1)} {2} $

edited 5 hours ago in Graph Theory by Silpa Junior (551 points) | 710 views

+11 votes

2 answers

29

GATE2009-3
Which one of the following is TRUE for any simple connected undirected graph with more than $2$ vertices? No two vertices have the same degree. At least two vertices have the same degree. At least three vertices have the same degree. All vertices have the same degree.

edited 5 hours ago in Graph Theory by Silpa Junior (551 points) | 464 views

+9 votes

2 answers

30

GATE2002-1.25, ISRO2008-30, ISRO2016-6

edited 5 hours ago in Graph Theory by Silpa Junior (551 points) | 2.1k views

+7 votes

4 answers

31

GATE2003-40
A graph $G=(V,E)$ satisfies $|E| \leq 3 |V| - 6$. The min-degree of $G$ is defined as $\min_{v\in V}\left\{degree (v)\right \}$. Therefore, min-degree of $G$ cannot be 3 4 5 6

edited 5 hours ago in Graph Theory by Silpa Junior (551 points) | 839 views

+8 votes

1 answer

32

GATE2004-79
How many graphs on $n$ labeled vertices exist which have at least $\frac{(n^2 - 3n)}{ 2}$ edges ? ${}^{\left(\frac{n^2-n}{2}\right)}C_{\frac{n^2-3n} {2}}$ ${\sum_{k=0}^{\left (\frac{n^2-3n}{2} \right )}} .^{\left(n^2-n\right)}C_k$ ${}^{\left(\frac{n^2-n}{2}\right)}C_n$ ${\sum_{k=0}^n}.^{\left(\frac{n^2-n}{2}\right)}C_k$

edited 5 hours ago in Graph Theory by Silpa Junior (551 points) | 1.1k views

+8 votes

2 answers

33

GATE2010-1
Let $G=(V, E)$ be a graph. Define $\xi(G) = \sum\limits_d i_d*d$, where $i_d$ is the number of vertices of degree $d$ in G. If $S$ and $T$ are two different trees with $\xi(S) = \xi(T)$, then $\mid S\mid = 2\mid T \mid$ $\mid S \mid = \mid T \mid - 1$ $\mid S\mid = \mid T \mid$ $\mid S \mid = \mid T\mid + 1$

edited 5 hours ago in Graph Theory by Silpa Junior (551 points) | 693 views

+6 votes

1 answer

34

GATE2005-11
Let G be a simple graph with 20 vertices and 100 edges. The size of the minimum vertex cover of G is 8. then, the size of the maximum independent set of G is: 12 8 less than 8 more than 12

edited 5 hours ago in Graph Theory by Silpa Junior (551 points) | 734 views

+1 vote

5 answers

35

GATE2017-2-23
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .

retagged 5 hours ago in Graph Theory by Silpa Junior (551 points) | 1.4k views

+3 votes

1 answer

36

GATE2013_25
Which of the following statements is/are TRUE for undirected graphs? P: Number of odd degree vertices is even. Q: Sum of degrees of all vertices is even. (A) P only (B) Q only (C) Both P and Q (D) Neither P nor Q

edited 5 hours ago in Graph Theory by Silpa Junior (551 points) | 455 views

+15 votes

3 answers

37

GATE2014-1-51
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $(a,b)$ and $(c,d)$ if $|a-c| \leq 1$ and $|b-d| \leq 1$. The number of edges in this graph is______.

retagged 6 hours ago in Graph Theory by Silpa Junior (551 points) | 2.1k views

+11 votes

2 answers

38

GATE2006-71
The $2^n$ vertices of a graph G corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of vertices of degree zero in G is: $1$ $n$ $n + 1$ $2^n$

edited 6 hours ago in Graph Theory by Silpa Junior (551 points) | 1.3k views

+2 votes

1 answer

39

UGCNET-Dec2015-III-70
Consider a unit square centered at origin. The coordinates at the square are translated by a factor $\biggr( \frac{1}{2}, 1 \biggl)$ and rotated by an angle of 90$^o$. What shall be the coordinates of the new square? $\biggr(\frac{-1}{2},0 \biggl), \biggr( ... ( \frac{1}{2},1 \biggl),\biggr( \frac{-3}{2},1 \biggl), \biggr( \frac{-3}{2},0 \biggl)$

commented 6 hours ago in Linear Algebra by moorthivcs (9 points) | 480 views

+5 votes

1 answer

40

TIFR2017-B-12
An undirected graph is complete if there is an edge between every pair of vertices. Given a complete undirected graph on $n$ vertices, in how many ways can you choose a direction for the edges so that there are no directed cycles? $n$ $\frac{n(n-1)}{2}$ $n!$ $2^n$ $2^m, \: \text{ where } m=\frac{n(n-1)}{2}$

edited 6 hours ago in Graph Theory by Silpa Junior (551 points) | 138 views

Recent activity

Recent Posts

Recent Blog Comments