Data Structure & Algorithms
 Date February 8, 2022
Quiz Summary
0 of 40 Questions completed
Questions:
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 must first complete the following:
Results
Results
0 of 40 Questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 point(s), (0)
Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)
Categories
 Not categorized 0%
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 Current
 Review
 Answered
 Correct
 Incorrect

Question 1 of 40
1. Question
Each data item in a record may be a group item composed of subitems; those items which are indecomposable are called
CorrectIncorrect 
Question 2 of 40
2. Question
Which of the following statement is false ?
CorrectIncorrect 
Question 3 of 40
3. Question
Binary search algorithm cannot be applied to
CorrectIncorrect 
Question 4 of 40
4. Question
When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
CorrectIncorrect 
Question 5 of 40
5. Question
The situation when in a linked list START=NULL is
CorrectIncorrect 
Question 6 of 40
6. Question
The following is twoway list
CorrectIncorrect 
Question 7 of 40
7. Question
The following name does not relate to stacks
CorrectIncorrect 
Question 8 of 40
8. Question
In a binary tree, certain null entries are re placed by special pointers which point to nodes higher in tree for efficiency. These special pointers are called
CorrectIncorrect 
Question 9 of 40
9. Question
In a graph if e=(u, v) means
CorrectIncorrect 
Question 10 of 40
10. Question
If every node u in G is adjacent to every other node v in G, A graph is said to be
CorrectIncorrect 
Question 11 of 40
11. Question
A variable P is called pointer if
CorrectIncorrect 
Question 12 of 40
12. Question
The Worst case occur in linear search algorithm when
CorrectIncorrect 
Question 13 of 40
13. Question
The Average case occur in linear search algorithm
CorrectIncorrect 
Question 14 of 40
14. Question
The complexity of the average case of an algorithm is
CorrectIncorrect 
Question 15 of 40
15. Question
The following data structure allows deleting data elements from front and inserting at rear
CorrectIncorrect 
Question 16 of 40
16. Question
This data structure allows deletions at both ends of the list but insertion at only one end.
CorrectIncorrect 
Question 17 of 40
17. Question
The following data structure is nonlinear type
CorrectIncorrect 
Question 18 of 40
18. Question
The following data structure is linear type
CorrectIncorrect 
Question 19 of 40
19. Question
To represent hierarchical relationship between elements, the following data structure is not suitable
CorrectIncorrect 
Question 20 of 40
20. Question
A binary tree whose every node has either zero or two children is called
CorrectIncorrect 
Question 21 of 40
21. Question
Arrays are best data structures for
CorrectIncorrect 
Question 22 of 40
22. Question
Linked lists are best suited for
CorrectIncorrect 
Question 23 of 40
23. Question
Each array declaration need not give, implicitly or explicitly, the information about the
CorrectIncorrect 
Question 24 of 40
24. Question
The complexity of merge sort algorithm is
CorrectIncorrect 
Question 25 of 40
25. Question
The indirect change of the values of a variable in one module by another module is called
CorrectIncorrect 
Question 26 of 40
26. Question
Two main measures for the efficiency of an algorithm are
CorrectIncorrect 
Question 27 of 40
27. Question
The time factor when determining the efficiency of algorithm is measured by
CorrectIncorrect 
Question 28 of 40
28. Question
The space factor when determining the efficiency of algorithm is measured by
CorrectIncorrect 
Question 29 of 40
29. Question
Which of the following data structures are indexed structures
CorrectIncorrect 
Question 30 of 40
30. Question
Which of the following is not the required condition for binary search algorithm
CorrectIncorrect 
Question 31 of 40
31. Question
Which of the following is not a limitation of binary search algorithm ?
CorrectIncorrect 
Question 32 of 40
32. Question
Two dimensional arrays are also called
CorrectIncorrect 
Question 33 of 40
33. Question
The term “push” and “pop” is related to the
CorrectIncorrect 
Question 34 of 40
34. Question
A data structure where elements can be added or removed at either end but not in the middle is referred as
CorrectIncorrect 
Question 35 of 40
35. Question
The following sorting algorithm is of divide andconquer type
CorrectIncorrect 
Question 36 of 40
36. Question
An algorithm that calls itself directly or indi rectly is known as
CorrectIncorrect 
Question 37 of 40
37. Question
The elements of an array are stored suc cessively in memory cells because
CorrectIncorrect 
Question 38 of 40
38. Question
The memory address of the first element of an array is called
CorrectIncorrect 
Question 39 of 40
39. Question
The memory address of fifth element of an array can be calculated by the formula
CorrectIncorrect 
Question 40 of 40
40. Question
The following data structure can’t store the nonhomogeneous data elements
CorrectIncorrect