Data Structure Test 3
Questions Result & StatisticsQuiz-summary
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
Questions
Instruction:
- Total number of questions : 20
- Time allotted : 25 minutes.
- Each question carry 1 mark, no negative marks.
- Click the “Finish quiz” button given in bottom of this page to submit your answer.
- Test will be submitted automatically if the time expired.
- Don’t refresh the page.
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:
Results
| Marks : 0 of 20 questions answered correctly | ||
| Total number of questions | : | 20 |
| Number of currect answered | : | 0 |
| Your time | : |
|
Time has elapsed
You have reached 0 of 0 points, (0)
Categories
- Not categorized 0%
-
Thank you for submitting online test!
- 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 pointsCorrectAnswer : A
IncorrectAnswer : A
-
Question 2 of 20
2. Question
1 pointsCorrectAnswer : A
IncorrectAnswer : A
-
Question 3 of 20
3. Question
1 pointsCorrectAnswer : B
IncorrectAnswer : B
-
Question 4 of 20
4. Question
1 points.
Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
CorrectAnswer : D
IncorrectAnswer : D
-
Question 5 of 20
5. Question
1 pointsCorrectAnswer : D
IncorrectAnswer : D
-
Question 6 of 20
6. Question
1 pointsCorrectAnswer : C
IncorrectAnswer : C
-
Question 7 of 20
7. Question
1 pointsCorrectAnswer : A
IncorrectAnswer : A
-
Question 8 of 20
8. Question
1 points.
When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
CorrectAnswer : B
IncorrectAnswer : B
-
Question 9 of 20
9. Question
1 pointsCorrectAnswer : A
IncorrectAnswer : A
-
Question 10 of 20
10. Question
1 pointsCorrectAnswer : D
IncorrectAnswer : D
-
Question 11 of 20
11. Question
1 pointsCorrectAnswer : A
IncorrectAnswer : A
-
Question 12 of 20
12. Question
1 pointsCorrectAnswer : C
IncorrectAnswer : C
-
Question 13 of 20
13. Question
1 points.
A data structure where elements can be added or removed at either end but not in the middle
CorrectAnswer : D
IncorrectAnswer : D
-
Question 14 of 20
14. Question
1 points.
When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
CorrectAnswer : B
IncorrectAnswer : B
-
Question 15 of 20
15. Question
1 pointsCorrectAnswer : C
IncorrectAnswer : C
-
Question 16 of 20
16. Question
1 pointsCorrectAnswer : B
IncorrectAnswer : B
-
Question 17 of 20
17. Question
1 pointsCorrectAnswer : A
IncorrectAnswer : A
-
Question 18 of 20
18. Question
1 pointsCorrectAnswer : D
IncorrectAnswer : D
-
Question 19 of 20
19. Question
1 points.
Consider the tree.If the post order travesal gives ab –cd * + then the label of the nodes 1, 2, 3, ….. will be
CorrectAnswer : A
IncorrectAnswer : A
-
Question 20 of 20
20. Question
1 points.
A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves
CorrectAnswer : B
IncorrectAnswer : B
