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
Correct Answer :
B. Counting the number of key operations
Related Questions
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 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
Which of the following is non-liner data structure?
List
Stacks
Trees
Strings
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
Finding the location of the element with a given value is:
Traversal
Search
Sort
None of above
Which of the following is two way list?
grounded header list
circular header list
linked list with header and trailer nodes
none of above
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 data structure?
Trees
Graphs
Arrays
None of above
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
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
Which of the following data structure is linear type?
Graph
Binary tree
Trees
Stack
_______ level is where the model becomes compatible executable code
Abstract level
Implementation level
Application level
All 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
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
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
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 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
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
Two main measures for the efficiency of an algorithm are
Processor and memory
Complexity and capacity
Time and space
Data and space
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 difference between linear array and a record is
An array is suitable for homogeneous data but the data items in a record may have different data type
In a record, there may not be a natural ordering in opposed to linear array.
A record form a hierarchical structure but a linear array does not
All of above
Merge sort uses ?
Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach
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
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
The term push and pop is related to the
array
lists
stacks
all of above
Which if the following is/are the levels of implementation of data structure
Application level
Abstract level
Implementation level
All of the above
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out