Last Updated on Dec 2, 2015
0 of 20 questions completed
Questions:
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
Information
Quiz Description :
Name : Graph Theory : Question answers for GATE
Subject: Graph Theory
Questions: 20 Objective type
Time Allowed : 15 minutes
Important for : GATE, IES and Job Interviews.
You have already completed the quiz before. Hence you can not start it again.
quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
You have Completed " Graph Theory : Question answers for GATE "
0 of 20 questions answered correctly
Your time:
Time has elapsed
Your Final Score is : 0
You have attempted : 0
Number of Correct Questions : 0 and scored 0
Number of Incorrect Questions : 0 and Negative marks 0
Average score |
|
Your score |
|
-
Not categorized
You have attempted: 0
Number of Correct Questions: 0 and scored 0
Number of Incorrect Questions: 0 and Negative marks 0
-
It’s time to share this quiz with your friends on Facebook, Twitter, Google Plus, Whatsapp or LinkedIn…
Click on View Questions Button to check Correct and incorrect answers.
Login
Register
Forgot Password
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- Answered
- Review
-
Question 1 of 20
1. Question
1 pointsIn a binary tree the post order traversal is DEBFCA. What will be the pre order traversal.
Correct
Incorrect
Unattempted
-
Question 2 of 20
2. Question
1 pointsWhen a binary tree converted into the extended binary tree form, all the original nodes in binary tree called ____________.
Correct
Incorrect
Unattempted
-
Question 3 of 20
3. Question
1 pointsWhich statement is correctly explain about Tree
Correct
Incorrect
Unattempted
-
Question 4 of 20
4. Question
1 pointsIf a tree T having 21 vertices, then which statement will be true.
Correct
Incorrect
Unattempted
-
Question 5 of 20
5. Question
1 pointsThe in-order traversal of a tree will yield a sorted listing of elements of tree in _________.
Correct
Incorrect
Unattempted
-
Question 6 of 20
6. Question
1 pointsConsider a binary tree, via special pointer certain null entries in binary tree are replaced which point to the nodes higher in the tree for efficiency. These special pointer are known as ___________.
Correct
Incorrect
Unattempted
-
Question 7 of 20
7. Question
1 pointsWhich statement is correct about a head tree?
Correct
Incorrect
Unattempted
-
Question 8 of 20
8. Question
1 pointsThe in-order traversal of tree will yield a sorted listing of elements of tree in______.
Correct
Incorrect
Unattempted
-
Question 9 of 20
9. Question
1 pointsIn a graph G what is the meaning of e= (u, v)________.
Correct
Incorrect
Unattempted
-
Question 10 of 20
10. Question
1 pointsIn a binary tree if every node has either zero (0) or two (2) children is known as________.
Correct
Incorrect
Unattempted
-
Question 11 of 20
11. Question
1 pointsIn a graph ‘G’ if every node ‘u’ is adjacent to every other node ‘v’ then the graph G is said to be________.
Correct
Incorrect
Unattempted
-
Question 12 of 20
12. Question
1 pointsIn a graph ‘G’ consider e=[u,v] then u and v are known as
Correct
Incorrect
Unattempted
-
Question 13 of 20
13. Question
1 pointsIn a tree the in-order traversing is represented as EACKFHDBG, What will be the pre-order traversal of the tree.
Correct
Incorrect
Unattempted
-
Question 14 of 20
14. Question
1 pointsIf a connected graph G having no cycles is called_____________.
Correct
Incorrect
Unattempted
-
Question 15 of 20
15. Question
1 pointsIn the linked list representation of Binary trees the LEFT[k] contains the_________of at the node N, where k represent the location of the node N.
Correct
Incorrect
Unattempted
-
Question 16 of 20
16. Question
1 pointsWhich set of standards ways of traversing in a binary tree T with root ‘R’ is correct?
Correct
Incorrect
Unattempted
-
Question 17 of 20
17. Question
1 pointsA complete graph is defined as
Correct
Incorrect
Unattempted
-
Question 18 of 20
18. Question
1 pointsBy considering a threaded binary tree______________ points to higher nodes in tree.
Correct
Incorrect
Unattempted
-
Question 19 of 20
19. Question
1 pointsIf all the edges of a graph are assigned data then the graph is called _____________.
Correct
Incorrect
Unattempted
-
Question 20 of 20
20. Question
1 pointsIn a binary tree if node N is a terminal node then tree is called_______.
Correct
Incorrect
Unattempted