menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
Recent Posts
Feedback to GATE Overflow Test Takers
GATE 2021 – Online registration portal
IIT Madras MS CS Interview Experience - 2020
JEST TCS (Theoretical Computer Science) EXAM || Gateway of IISc other than GATE exam
Divisibility language and Minimum Number of States in a DFA accepting a binary number divisible by 'n'
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.4k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Programming
(3.6k)
DS
(1.4k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.5k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.4k)
Admissions
(595)
Exam Queries
(1k)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(873)
Recent Blog Comments
Yes, it must be censored or else someone will...
oh got it !!! yes his test series is worst.
I mentioned RBR but this particular name is...
@Musa why are u not mentioning *** test series...
I took made easy,RBR ,Gate overflow test...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Kerala PSC AP Exam
[closed]
0
votes
98
views
Let G be a weighted undirected graph and e be an edge with mazimum weight in G. suppose there is a minimum weight spanning tree in G containing edge e. which of the following statements are always true?
A) There exists a cutset in G having all edges of maximum weight
B) There exists a cycle in G having all edges of maximum weight
C) Edge e cannot be contained in a cycle
D) All edges in G have the same weight
closed as a duplicate of:
GATE2005-IT-52
graph-theory
minimum-spanning-trees
graph-algorithms
asked
Oct 27, 2016
in
DS
Sankaranarayanan P.N
closed
Oct 27, 2016
by
Kapil
98
views
comment
Please
log in
or
register
to add a comment.
0
Answers
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
0
votes
0
answers
1
116
views
Kerala PSC AP Exam
The maximum number of edges in an acyclic undirected graph with n vertices A) n - 1 B) n C) n +1 D) 2n -1
The maximum number of edges in an acyclic undirected graph with n vertices A) n - 1 B) n C) n +1 D) 2n -1
asked
Oct 27, 2016
in
DS
Sankaranarayanan P.N
116
views
graph-theory
graph-connectivity
0
votes
0
answers
2
115
views
Kerala PSC AP Exam
IN a binary tree, the number of internal nodes of degree one is 5 and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree is A) 15 B) 11 C) 12 D) 10
IN a binary tree, the number of internal nodes of degree one is 5 and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree is A) 15 B) 11 C) 12 D) 10
asked
Oct 27, 2016
in
DS
Sankaranarayanan P.N
115
views
binary-tree
0
votes
0
answers
3
107
views
Kerala PSC AP Exam
Let P be a singly linked list. Let Q be the pointer to an intermediate node X in the list. What is the worst case time complexity of the best known algorithm to delete node X from the list? A) O(n) B) O(log 2 n) C) O(log n) D) O(1)
Let P be a singly linked list. Let Q be the pointer to an intermediate node X in the list. What is the worst case time complexity of the best known algorithm to delete node X from the list? A) O(n) B) O(log 2 n) C) O(log n) D) O(1)
asked
Oct 27, 2016
in
DS
Sankaranarayanan P.N
107
views
linked-lists
1
vote
0
answers
4
90
views
Kerala PSC AP Exam
A binary search tree contains the numbers 1, 2, 3, 4, 5, 6, 7, 8. The tree is traversed in pre-order and the values of in each node printed out the sequence of values obtained is 5,3,1,2,4,6,8,7. If the tree is traversed in post order, the sequence obtained would be A) 8 7 6 5 4 3 2 1 B) 1 2 3 4 8 7 6 5 C) 2 1 4 3 6 7 8 5 D) 2 1 4 3 7 8 6 5
A binary search tree contains the numbers 1, 2, 3, 4, 5, 6, 7, 8. The tree is traversed in pre-order and the values of in each node printed out the sequence of values obtained is 5,3,1,2,4,6,8,7. If the tree is traversed in post order, the sequence obtained would be A) 8 7 6 5 4 3 2 1 B) 1 2 3 4 8 7 6 5 C) 2 1 4 3 6 7 8 5 D) 2 1 4 3 7 8 6 5
asked
Oct 27, 2016
in
DS
Sankaranarayanan P.N
90
views
binary-search-tree
tree-traversal
...