NEW
Font size
WorksheetsTechnical Evaluation - 101 - 2024
Total questions: 50
Worksheet time: 1hrs 15mins
What are the disadvantages of normal binary tree traversals?
improper traversals
complexity in implementing
there is no traversal which is efficient
there are many pointers which are null and thus useless
The maximum, minimum child for internal node in B-tree
m/2,m
m,m/2
m,m/2-1
m/2-1,m
Circular Queue is also known as ________
a) Ring Buffer
b) Square Buffer
c) Rectangle Buffer
d) Curve Buffer
What does the following function do for a given Linked List with first node as head?
void fun1(struct node* head)
{
if(head == NULL)
return;
fun1(head->next);
printf("%d ", head->data);
}
a) Prints all nodes of linked lists
b) Prints all nodes of linked list in reverse order
c) Prints alternate nodes of Linked List
d) Prints alternate nodes in reverse order
To measure Time complexity of an algorithm Big O notation is used which:
A. describes limiting behaviour of the function
B. characterises a function based on growth of function
C. upper bound on growth rate of the function
D. all of the mentioned
If for an algorithm time complexity is given by O(1) then complexityof it is:
A. constant
B. polynomial
C. exponential
D. none of the mentioned
In the __________traversal we process all of a vertex’s descendents before we move to an adjacent vertex.
Depth First
Breadth First
With First
Depth Limited
_____________is the method used by card sorter?
Radix sort
Insertion
Heap
Quick
______________the condition indicate the queue is empty.
Front=Null
Null=Front
Front=Rear
Rear=Null
Other name for directed graph is _________
Direct graph
Digraph
Dir-graph
Dgraph
Which method of graph traversal makes use of a queue?
Depth-First
Breadth-First
Which of the following is true?
A graph may contain no edges and many vertices
A graph may contain many edges and no vertices
A graph may contain no edges and no vertices
