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
Correct Answer :
C. side effect
Related Questions
Linked list are not suitable data structure of which one of the following problems ?
Binary search
Insertion sort
Radix sort
Polynomial manipulation
When determining the efficiency of algorithm, the space factor is measured by
Counting the maximum memory needed by the algorithm
Counting the minimum memory needed by the algorithm
Counting the average memory needed by the algorithm
Counting the maximum disk space needed by the algorithm
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
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
Which of the following is not the required condition for binary search algorithm?
The list must be sorted
there should be the direct access to the middle element in any sublist
There must be mechanism to delete and/or insert elements in list
none of above
A ______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
Stacks linked list
Queue linked list
Both of them
Neither of them
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
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which of the following algorithm design technique is used in the quick sort algorithm?
Dynamic programming
Greedy method
Divide and conquer
Backtracking
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 is linear type?
Graph
Binary tree
Trees
Stack
The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?
3,4,5,2,1
3,4,5,1,2
5,4,3,1,2
1,5,2,3,4
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue
The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which of the following is not the part of ADT description?
Data
Operations
Both of the above
None of the above
Each array declaration need not give, implicitly or explicitly, the information about
the name of array
the data type of array
the index set of the array
the first data from the set to be stored
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
Stack
Input restricted dequeue
Priority queues
Output restricted qequeue
The term push and pop is related to the
array
lists
stacks
all of above
Merge sort uses ?
Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
In linear search algorithm the Worst case occurs when
The item is somewhere in the middle of the array
The item is not in the array at all
The item is the last element in the array
The item is the last element in the array or is not there at all
The situation when in a linked list START=NULL is
underflow
overflow
housefull
saturated
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 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 lists are best suited
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