Two main measures for the efficiency of an algorithm are
Processor and memory
Complexity and capacity
Time and space
Data and space
Correct Answer :
C. Time and space
Related Questions
Merge sort uses ?
Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach
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
Which data structure allows deleting data elements from and inserting at rear?
Stacks
Dequeues
Queues
Binary search tree
Linked list are not suitable data structure of which one of the following problems ?
Binary search
Insertion sort
Radix sort
Polynomial manipulation
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Binary search algorithm can not be applied to
sorted linked list
sorted binary trees
sorted linear array
pointer array
Which of the following is non-liner data structure?
List
Stacks
Trees
Strings
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
The situation when in a linked list START=NULL is
underflow
overflow
housefull
saturated
The complexity of merge 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
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
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 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 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.
Which of the following data structure is not linear data structure?
Arrays
Linked lists
Both of above
None of above
Two main measures for the efficiency of an algorithm are
Processor and memory
Complexity and capacity
Time and space
Data and space
Which of the following statement is true ?
Breath first search cannot be used to find converted components of a graph.
Optimal binary search tree construction can be performed efficiently using dynamic programming.
Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
Depth first search can be used to find connected components of a graph.
Which if the following is/are the levels of implementation of data structure
Application level
Abstract level
Implementation level
All of the above
A variable P is called pointer if
P contains the address of an element in DATA.
P points to the address of first element in DATA
P can store only memory addresses
P contain the DATA and the address of DATA
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 non linear type?
Lists
Strings
Graph
Stacks
When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
FAEKCDBHG
FAEKCDHGB
EAFKHDCBG
FEAKDCHBG
Which of the following data structures are indexed structures?
linear arrays
linked lists
both of above
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
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)