To represent hierarchical relationship between elements, Which data structure is suitable?
Tree
Graph
Priority
Dequeue
Correct Answer :
A. Tree
Related Questions
Which of the following data structure is non linear type?
Lists
Strings
Graph
Stacks
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 term push and pop is related to the
array
lists
stacks
all of above
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
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
Herder node is used as sentinel in ____
Graphs
Binary tree
Stacks
Queues
Finding the location of the element with a given value is:
Traversal
Search
Sort
None of above
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
The Average case occur in linear search algorithm
When Item is somewhere in the middle of the array
When Item is not in the array at all
When Item is the last element in the array
When Item is the last element in the array or is not there at all
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
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
Linked list are not suitable data structure of which one of the following problems ?
Binary search
Insertion sort
Radix sort
Polynomial manipulation
A data structure where elements can be added or removed at either end but not in the middle
Linked lists
Stacks
Queues
Deque
Which of the following is not the part of ADT description?
Data
Operations
Both of the above
None of the above
For an algorithm the complexity of the average case is
Much more complicated to analyze than that of worst case
Much more simpler to analyze than that of worst case
Sometimes more complicated and some other times simpler than that of worst case
None or above
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
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.
_______ level is where the model becomes compatible executable code
Abstract level
Implementation level
Application level
All of the above
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
Which of the following is true about the characteristics of abstract data types?
i) It exports a type.
ii) It exports a set of operations
True, False
False, True
True, True
False, False
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.
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
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
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
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 data structure is linear data structure?
Trees
Graphs
Arrays
None of above
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
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
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