Data Structures Quiz Online
Data Structures Quiz:
Number of Questions: 20
Time: 20 minutes
Each question carry 1 mark each
No negative marking
Quiz-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
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
0 of 20 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 points, (0)
Average score |
|
Your score |
|
Categories
- Not categorized 0%
-
Thanks for Submitting
Webeduclick Data Structures Quiz 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 pointsWhich data structure is mainly used for implementing the recursive algorithm?
Correct
Incorrect
-
Question 2 of 20
2. Question
1 points___________ is a collection of elements of used to store the same type of data.
Correct
Incorrect
-
Question 3 of 20
3. Question
1 pointsDynamic Array is –
Correct
Incorrect
-
Question 4 of 20
4. Question
1 pointsWhich data structure is required to convert the infix to prefix notation?
Correct
Incorrect
-
Question 5 of 20
5. Question
1 pointsWhich of the following is not the correct statement for a stack data structure?
Correct
Incorrect
-
Question 6 of 20
6. Question
1 pointsThe minimum number of stacks required to implement a stack is –
Correct
Incorrect
-
Question 7 of 20
7. Question
1 pointsWhich of the following principle does Queue use?
Correct
Incorrect
-
Question 8 of 20
8. Question
1 pointsValue of the postfix expression 6324+–* is –
Correct
Incorrect
-
Question 9 of 20
9. Question
1 pointsOn which element we perform insertion and deletion operation is stacks –
Correct
Incorrect
-
Question 10 of 20
10. Question
1 points#define SIZE 11
struct STACK
{
int arr[SIZE];
int top=-1;
}
What would be the maximum value of the top that does not cause the overflow of the stack?Correct
Incorrect
-
Question 11 of 20
11. Question
1 pointsProcess of removing an element from the stack is known as –
Correct
Incorrect
-
Question 12 of 20
12. Question
1 pointsAnother name of Circular Queue –
Correct
Incorrect
-
Question 13 of 20
13. Question
1 pointsThe postfix form of the following expression A*B+C/D ?
Correct
Incorrect
-
Question 14 of 20
14. Question
1 pointsBreadth First Search uses which of the following data structure –
Correct
Incorrect
-
Question 15 of 20
15. Question
1 pointsThe operation of processing each element in the list is known as –
Correct
Incorrect
-
Question 16 of 20
16. Question
1 pointsThe memory address of the first element of an array is called –
Correct
Incorrect
-
Question 17 of 20
17. Question
1 pointsFirst Index of Array is –
Correct
Incorrect
-
Question 18 of 20
18. Question
1 pointsAsymptotic time complexity to find an element in the linked list is
Correct
Incorrect
-
Question 19 of 20
19. Question
1 pointsWhich data structure is the best for implementing a priority queue?
Correct
Incorrect
-
Question 20 of 20
20. Question
1 pointsTime complexity of Quick Sort is –
Correct
Incorrect
Click the ‘Quiz-summary‘ button and then click ‘Finish quiz‘ button to submit your quiz answers
Your Online quiz will be submitted after time is expired
Do not refresh the Page.