Quiz
DS Tutorial 2
Create a free account to finish this quiz
Save your progress and see your final score.
Already have an account? Sign in
Questions in this quiz (21)
1Two main measures for the efficiency of an algorithm are
- AProcessor and memory
- BComplexity and capacity
- CTime and space
- DDate and space
2The time factor when determining the efficiency of algorithm is measured by
- ACounting microseconds
- BCounting the number of key operations
- CCounting the number of statements
- DCounting the kilobytes of algorithm
3Which of the following case does not exist in complexity theory
- ABest case
- BWorst case
- CAverage case
- DNull case
4The worst case occur in linear search algorithm
- AWhen item is somewhere in the middle of the array
- BWhen item is not in the array at all
- CWhen item is the last element in the array
- DWhen item is the last element in the array or is not there at all
5The average case occur in linear search algorithm
- AWhen item is somewhere in the middle of the array
- BWhen item is not in the array at all
- CWhen item is the last element in the array
- DWhen item is the last element in the array or is not there at all
6Which of the following data structure is not linear data structure
- AArrays
- BLinked list
- CBoth of above
- DNone of above
7Which of the following data structure is linear data structure?
- ATrees
- BGraphs
- CArrays
- DNone of above
8The operation of processing each element in the list is known as
- ASorting
- BMerging
- CInserting
- DTraversal
9Linked list are best suited
- AFor relatively permanent collections of data
- BFor the size of the structure and the data in the structure are constantly changing
- CFor both of above situation
- DFor none of above situation
10The memory address of the first element of an array is called
- AFloor address
- BFoundation address
- CFirst address
- DBase address
11Which of the following data structures are indexed structures
- ALinear arrays
- BLinked lists
- CBoth of above
- DNone of above
12Two dimensional arrays are also called
- ATables arrays
- BMatrix arrays
- CBoth of above
- DNone of above
13Binary search algorithm can not be applied to
- ASorted linked list
- BSorted binary trees
- CSorted linear array
- DPointer array
14Binary search algorithm can not be applied to
- ASorted linked list
- BSorted binary trees
- CSorted linear array
- DPointer array
15When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
- AUnderflow
- BOverflow
- CHousefull
- DSaturated
16Which of the following name does not relate to stacks?
- AFIFO lists (because It belongs to queue)
- BLIFO list
- CPiles
- DPush-down lists
17The term “push” and “pop” is related to the
- AArray
- BLists
- CStacks
- DAll of above
18When in order traversing a tress resulted E A C K F H D B G, the preorder traversal would return
- AFAEKCDBHG
- BFAEKCDHGB
- CEAFKHDCBG
- DFEAKDCHBG
19Which data structure allows deleting data elements from font and inserting at rear
- AStacks
- BQueues
- CDe ques
- DBinary search tree
20Which of the following data structure can’t store the non-homogeneous data elements
- AArrays
- BRecords
- CPointers
- DNone
21The situation when in a linked list START=NULL is
- AUnderflow
- BOverflow
- CHouseful
- DSaturated
Information
- Description
- Quiz on DS Tutorial 2, created by Karmila on 28/07/2014.
- Author
- Karmila
- Language
- English
- Views
- 26
- Rating
- No ratings yet Rate this quiz