Herder node is used as sentinel in ____
Graphs
Binary tree
Stacks
Queues
Correct Answer :
B. Binary tree
Related Questions
Two main measures for the efficiency of an algorithm are
Processor and memory
Complexity and capacity
Time and space
Data and space
Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
elementary items
atoms
scalars
all of above
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
The situation when in a linked list START=NULL is
underflow
overflow
housefull
saturated
Which of the following is not the part of ADT description?
Data
Operations
Both of the above
None of the above
Which of the following is not a limitation of binary search algorithm?
must use a sorted array
requirement of sorted array is expensive when a lot of insertion and deletions are needed
there must be a mechanism to access middle element directly
binary search algorithm is not efficient when the data elements are more than 1000.
The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
Arrays are best data structures
for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for none of above situation
Binary search algorithm can not be applied to
sorted linked list
sorted binary trees
sorted linear array
pointer array
The elements of an array are stored successively in memory cells because
by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
the architecture of computer memory does not allow arrays to store other than serially
both of above
none of above
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
11
12
13
14
When determining the efficiency of algorithm the time factor is measured by
Counting microseconds
Counting the number of key operations
Counting the number of statements
Counting the kilobytes of algorithm
Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?
mn
max(m,n)
min(m,n)
m+n-1
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
Which of the following is non-liner data structure?
List
Stacks
Trees
Strings
……………. Is a pile in which items are added at one end and removed from the other.
Queue
Stack
List
None of the above
Which of the following data structure is linear type?
Graph
Binary tree
Trees
Stack
A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
AVL tree
Red-black tree
Lemma tree
None of the above
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.
push, pop
insert, delete
pop, push
delete, insert
If the values of a variable in one module is indirectly changed by another module, this situation is called
internal change
inter-module change
side effect
side-module update
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?
3 additions and 2 deletions
2 deletions and 3 additions
3 deletions and 4 additions
3 deletions and 3 additions
Linked list are not suitable data structure of which one of the following problems ?
Binary search
Insertion sort
Radix sort
Polynomial manipulation
Which of the following data structures are indexed structures?
linear arrays
linked lists
both of above
none of above
The memory address of fifth element of an array can be calculated by the formula
LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array
None of above