Data Structure Test 1
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 : B
IncorrectAnswer : B
-
Question 2 of 20
2. Question
1 pointsCorrectAnswer : D
IncorrectAnswer : D
-
Question 3 of 20
3. Question
1 pointsCorrectAnswer : B
IncorrectAnswer : B
-
Question 4 of 20
4. Question
1 pointsCorrectAnswer : D
IncorrectAnswer : D
-
Question 5 of 20
5. Question
1 pointsCorrectAnswer : D
IncorrectAnswer : D
-
Question 6 of 20
6. Question
1 points.
…………………. Is a directed tree in which outdegree of each node is less than or equal to two
CorrectAnswer : C
IncorrectAnswer : C
-
Question 7 of 20
7. Question
1 pointsCorrectAnswer : D
IncorrectAnswer : D
-
Question 8 of 20
8. Question
1 points.
A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called
CorrectAnswer : A
IncorrectAnswer : A
-
Question 9 of 20
9. Question
1 pointsCorrectAnswer : C
IncorrectAnswer : C
-
Question 10 of 20
10. Question
1 pointsCorrectAnswer : A
IncorrectAnswer : A
-
Question 11 of 20
11. Question
1 pointsCorrectAnswer : D
IncorrectAnswer : D
-
Question 12 of 20
12. Question
1 pointsCorrectAnswer : D
IncorrectAnswer : D
-
Question 13 of 20
13. Question
1 points.
Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
CorrectAnswer : A
IncorrectAnswer : A
-
Question 14 of 20
14. Question
1 pointsCorrectAnswer : B
IncorrectAnswer : B
-
Question 15 of 20
15. Question
1 points.
………… is very useful in situation when data have to stored and then retrieved in reverse order.
CorrectAnswer : A
IncorrectAnswer : A
-
Question 16 of 20
16. Question
1 points.
A linear collection of data elements where the linear node is given by means of pointer is called
CorrectAnswer : A
IncorrectAnswer : A
-
Question 17 of 20
17. Question
1 pointsCorrectAnswer : B
IncorrectAnswer : B
-
Question 18 of 20
18. Question
1 points.
If the address of A[1][1] and A[2][1] are 1000 and 1010 respectively and each element occupies 2 bytes then the array has been stored in _________ order
CorrectAnswer : A
IncorrectAnswer : A
-
Question 19 of 20
19. Question
1 pointsCorrectAnswer : D
IncorrectAnswer : D
-
Question 20 of 20
20. Question
1 pointsCorrectAnswer : D
IncorrectAnswer : D
