The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
Correct Answer :
B. 12
Related Questions
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
Which of the following is non-liner data structure?
List
Stacks
Trees
Strings
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
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
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
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.
Finding the location of the element with a given value is:
Traversal
Search
Sort
None of 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 name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which data structure allows deleting data elements from and inserting at rear?
Stacks
Dequeues
Queues
Binary search tree
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
______ is very useful in situation when data have to stored and then retrieved in reverse order.
Stack
Queue
List
Link list
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
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 store the homogeneous data elements?
Arrays
Records
Pointers
None
Which of the following algorithm design technique is used in the quick sort algorithm?
Dynamic programming
Greedy method
Divide and conquer
Backtracking
Which of the following data structure is linear type?
Graph
Binary tree
Trees
Stack
A data structure where elements can be added or removed at either end but not in the middle
Linked lists
Stacks
Queues
Deque
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
The complexity of merge sort 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 data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
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 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
The situation when in a linked list START=NULL is
underflow
overflow
housefull
saturated
Which of the following data structures are indexed structures?
linear arrays
linked lists
both of above
none of above
The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which of the following data structure is linear data structure?
Trees
Graphs
Arrays
None of 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