The Gateway to Computer Science Excellence
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
Lists
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. For hardcopy of previous year questions please see
here
Recent questions in Programming & DS
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
Webpage
Programming in C.
Recursion.
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
0
votes
1
answer
1
Self Study
What is the output of given program? main() { char g[] = "iamsahilraza"; printf("%s", g + g[8]  g[10]); }
asked
4 hours
ago
in
Programming
by
Sahil Raza
(
55
points)

21
views
0
votes
0
answers
2
test question
We wish to implement a double ended queue using link list. The double ended queue must support , the operations of (i) struct node *push_back(struct node*,struct node * ,int )  pushing at the end of the list (ii) struct node *pop_back(struct node* ) popping ... rear; S3:front==NULL S4:front=front>next S1:rear>next=temp; S2:rear=temp; S3:front==NULL S4:front=front>next
asked
8 hours
ago
in
Programming
by
Prince Sindhiya
Active
(
3.6k
points)

12
views
doubly
linked
list
0
votes
1
answer
3
test series question
(int *) a means the base address of the array a ,(int *) a+1 means the address of 2nd element in the array. or base address of 2nd row of the array ? please clear this doubt i am facing problems in these type of question or if anyone knows basics of these types problems please explain that one. 1, 1, 1, 1 ... , 4 1, 1, 1, 1 2, 4, 2, 4 3, 0, 3, 0 4, 2, 4, 2 5, 5, 5, 5 6, 0, 6, 0
asked
8 hours
ago
in
Programming
by
Prince Sindhiya
Active
(
3.6k
points)

12
views
arrayofpointers
0
votes
1
answer
4
Topological Sort
How many Topological Orderings possible?
asked
10 hours
ago
in
DS
by
Lakshman Patel RJIT
Loyal
(
9.6k
points)

23
views
datastructure
topologicalsort
nooftopologicalordering
0
votes
0
answers
5
Circular Queue
II possible but Why not I also(When direction of queue is opposite of previous one)?
asked
11 hours
ago
in
Programming
by
Abhisek Tiwari 4
Junior
(
925
points)

8
views
datastructure
circularqueue
queues
linkedlists
0
votes
0
answers
6
Programming
asked
12 hours
ago
in
Programming
by
Abhisek Tiwari 4
Junior
(
925
points)

24
views
gate
output
programming
0
votes
1
answer
7
minimum spanning is a spanning tree in which removal of any edges disconnnects the tree. True or false?
asked
19 hours
ago
in
DS
by
Hc GUPTA
(
7
points)

16
views
0
votes
1
answer
8
Linked list insertion
In a linked list with $n$ nodes, the time taken to insert an element after an element pointed by some pointer is: $(A) O(1)$ $(B) O(logn)$ $(C) O(n)$ $(D) O(nlogn)$
asked
1 day
ago
in
DS
by
Lakshman Patel RJIT
Loyal
(
9.6k
points)

33
views
datastructure
linkedlists
+1
vote
0
answers
9
Linked list
If the head of a Linked List is pointing to $k$ th element, then how will you get the elements before $k$ th element?
asked
1 day
ago
in
DS
by
Lakshman Patel RJIT
Loyal
(
9.6k
points)

27
views
datastructure
linkedlists
0
votes
0
answers
10
Linked List Data Structures And Algorithms Made Easy By Narasimha Karumanchi
asked
1 day
ago
in
DS
by
Lakshman Patel RJIT
Loyal
(
9.6k
points)

24
views
datastructure
linkedlists
0
votes
0
answers
11
Binary tree
No. Of unlabeled binary tree possible with n nodes
asked
2 days
ago
in
DS
by
Risi
(
11
points)

16
views
0
votes
0
answers
12
GATEBOOK2019DS21
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, 5, 5, 3, 3, 2, 2, 2 6, 6, 6, 6, 3, 3, 2, 2, 1, 1 8, 7, 6, 4, 4, 3, 2, 2, 2 8, 7, 6, 6, 4, 4, 2, 2, 2 II and III III and IV IV only I and IV
asked
2 days
ago
in
Programming
by
GATEBOOK
(
471
points)

19
views
gb2019ds2
graphtheory
degreeofgraph
0
votes
1
answer
13
GATEBOOK2019DS22
Let G be an undirected labelled graph with 8 vertices. Every vertex in G is connected with every other vertex except one vertex which is not connected with any of the vertex. Which of the following represents number of distinct cycles of length 5 in G: (A) 252 (B) 490 (C) 504 (D) 662
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

27
views
gb2019ds2
0
votes
1
answer
14
GATEBOOK2019DS23
A quinpartite graph is a graph whose vertices can be partitioned into five groups such that no two vertices in same group are connected via some edge. The maximum number of edges in a quinpartite graph with $10$ vertices, where cardinalities of those five sets are given as $\{2,3,2,1,2\},$ is: $16$ $20$ $26$ $39$
asked
2 days
ago
in
Programming
by
GATEBOOK
(
471
points)

23
views
gb2019ds2
graphtheory
graphconnectivity
0
votes
0
answers
15
GATEBOOK2019DS24
Consider a weighted undirected graph with positive integer edge weights and let there be edges or at least one path between each of the vertices u,v and k. It is known that the shortest path from the source vertex s to u has weight 79, shortest path from s to k has weight 31 and the ... (u, v) $>$ 23 weight (k, v) $\ge$ 24 weight (u, k) $\le$ 48 weight (u, v) $\ge$ 24
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

7
views
gb2019ds2
0
votes
1
answer
16
GATEBOOK2019DS25
Consider following statements about tripartite graph, i.e. TPG, which contains three subsets of vertices of graph as A,B and C: (i) Minimum number of edges in a cycle in a TPG which passes through all three subsets of vertices is 6. (ii) A complete TPG can be colored with ... {3}$. Which of the above statements are true: (i) only (iii) only (ii) and (iii) only (i) and (ii) only
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

8
views
gb2019ds2
0
votes
1
answer
17
GATEBOOK2019DS26
Let $\alpha$(G) be the size of the largest independent set in a graph G, and $\chi$(G) the chromatic number of G. Which of the following statements about a graph is true? $\alpha(G)*\chi(G) \ge G$ $\alpha(G) > \chi(G)$ $\alpha(G) < \chi(G)$ $\alpha(G)*\chi(G) \le G$
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

14
views
gb2019ds2
0
votes
0
answers
18
GATEBOOK2019DS27
In a binary tree with $n$ nodes, every nonleaf node has an even number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child? $0$ $1$ $\frac{(n  1)}{2}$ $n1$
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

16
views
gb2019ds2
0
votes
0
answers
19
GATEBOOK2019DS28
Consider following four graphs each with five vertices whose edgesets are shown below: (i) \{(1,3),(2,4),(1,2),(2,3),(3,5),(4,5)\} (ii) \{(1,2),(2,3),(3,4),(4,5),(2,4)\} (iii) \{(2,3),(1,2),(1,5),(2,5),(1,3),(3,4)\} (iv) \{(1,4),(3, ... ),(4,5),(1,2),(2,3)\} Which of the above graphs are isomorphic to each other: (i), (ii) and (iii) (ii) and (iii) (i) and (iv) None of the above
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

3
views
gb2019ds2
0
votes
0
answers
20
GATEBOOK2019DS29
Consider following statements: (i) Every simple graph has at least two vertices of the same degree. (ii) If u is a vertex of odd degree in a graph, then there exists a path from u to another vertex v of the graph where v also has odd degree. (iii) If there are ... in the graph. Which of the above statements are not true? (i) and (ii) only (iii) only (ii) only None of the above
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

3
views
gb2019ds2
0
votes
0
answers
21
GATEBOOK2019DS210
For which of the following scenarios does there exist a simple graph G = (V, E) satisfying the specified conditions? It has 3 components 20 vertices and 16 edges. It has 10 vertices, 38 edges, and more than one component. It has 7 vertices, 10 edges, and more than two components. It is connected and has 10 edges 5 vertices and fewer than 6 cycles.
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

6
views
gb2019ds2
+1
vote
1
answer
22
GATEBOOK2019DS211
The number of simple digraphs with $V  = 3$ is: $8$ $27$ $64$ $256$
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

13
views
gb2019ds2
0
votes
0
answers
23
GATEBOOK2019DS212
Let $T = (V, E)$ be a tree and let $d(v)$ be the degree of a vertex. Consider following statements: (i) $\sum_{v\in V}(2  d(v)) = 2$ (ii) If T has a vertex of degree $m \ge 2$, then it has at least m vertices of degree 1. (iii) $\sum_{v\in V}(k  d(v ... \: k\in Z^+$ Which of the above statements is/are ture: (i) only (i), (ii) only (ii) and (iii) only (i), (ii) and (iii) only
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

3
views
gb2019ds2
0
votes
0
answers
24
GATEBOOK2019DS213
For which of the following scenarios does there exist a Binary tree satisfying the specified conditions? A binary tree with 35 leaves and height 100. A full binary tree with 21 leaves and height 21. A binary tree with 33 leaves and height 5. A rooted tree of height 5 where every internal vertex has 3 children and there are 365 vertices.
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

2
views
gb2019ds2
0
votes
0
answers
25
GATEBOOK2019DS214
For each of the following graphs, the number of spanning trees are A, B and C, respectively. \The value of $A*B+C$ is: 16 32 48 64
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

3
views
gb2019ds2
0
votes
1
answer
26
GATEBOOK2019DS215
The chromatic number of the following graph is: \ 2 3 4 5
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

8
views
gb2019ds2
0
votes
0
answers
27
GATEBOOK2019DS216
Consider the weighted undirected graph shown below: \The weight of the minimum spanning tree of the above graph is: 25 28 30 33
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

2
views
gb2019ds2
0
votes
1
answer
28
GATEBOOK2019DS217
The line graph $L(G)$ of a graph $G(V,E)$ is a graph whose vertices are in 11 correspondence with the edges of G. Two vertices of $L(G)$ being adjacent iff the corresponding edges of G are adjacent. Consider following graphs: \Consider following statements: (i) L(A) is isomorphic ... are true? (i) and (iii) only (ii) and (iii) only (ii) and (iv) only (ii), (iii) and (iv) only
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

6
views
gb2019ds2
0
votes
0
answers
29
GATEBOOK2019DS218
Consider following statements about Cycle graph, Complete Bipartite graph and Complete graph. (i) Cycle graph $C_n$ is subgraph of a complete graph $K_n$. (ii) $K_{n,n}$ a subgraph of $K_m$ iff $m\le 2n$. (iii) $C_n$ a subgraph of $K_{n,n}$ iff $n$ is even. Which of the above statements are true? (i) and (ii) only (ii) and (iii) only (i) and (iii) only (ii) only
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

2
views
gb2019ds2
0
votes
0
answers
30
GATEBOOK2019DS219
Consider the following graph ? \Let number of shortest paths from node $a$ to node $j$ is represented by $A$, number of shortest paths from node $e$ to node $b$ is represented by $B$ and number of shortest paths from node $b$ to node $f$ is represented by $C$. Then the value of the expression: $A^B+B^C+C^A$ is: (A) 13 (B) 21 (C) 57 (D) 64
asked
2 days
ago
in
Programming & DS
by
GATEBOOK
(
471
points)

3
views
gb2019ds2
Page:
1
2
3
4
5
6
...
142
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Members at the site
MAY
Navneet Kalra
Recent Posts
List of Available Exams
New Assignment on Network programming : P2P simulation
Theory of Computation  GO Classroom
Probability  GO Classroom
Daily Quiz
All categories
General Aptitude
1.4k
Engineering Mathematics
5.9k
Digital Logic
2.3k
Programming & DS
4.3k
Programming
3.1k
DS
1.1k
Algorithms
3.7k
Theory of Computation
4.6k
Compiler Design
1.7k
Operating System
3.4k
Databases
3.4k
CO & Architecture
2.9k
Computer Networks
3.4k
Non GATE
1.2k
Others
1.3k
Admissions
506
Exam Queries
482
Tier 1 Placement Questions
22
Job Queries
64
Projects
15
Follow @csegate
Gatecse
Recent questions in Programming & DS
Recent Blog Comments
Nice 2 know. You are welcome. :)
Hello @Arjun, I got books now...thanks for your...
You may contact FedEx local delivery office. It...
Yes you are right, it's showing this status from...
FedEx delivery is shown and as per that it is out...
40,903
questions
47,558
answers
146,289
comments
62,305
users