Bellman ford algorithm does not work for graphs that
Contains negative weight cycles
In queue an element can be inserted and deleted by using
Rear and front
Time complexity for evaluating postfix expression
O(n)
The maximum number of nodes at level i of a binary tree is
2i
The maximum number of nodes in a binary tree of height k is
2K+1 igt;=1
The complexity of heap sort algorithm
O(nlogn)
A full binary tree with n non leaf noad contains
2n+1 nodes
What is the use of banker’s algorithm
To prevent deadlock in os
What is the extension of backup file
.bak
The number of process completed per unit time is known as
Rear and front
Time complexity for evaluating postfix expression
O(n)
The maximum number of nodes at level i of a binary tree is
2i
The maximum number of nodes in a binary tree of height k is
2K+1 igt;=1
The complexity of heap sort algorithm
O(nlogn)
A full binary tree with n non leaf noad contains
2n+1 nodes
What is the use of banker’s algorithm
To prevent deadlock in os
What is the extension of backup file
.bak
The number of process completed per unit time is known as
Throughput
How many digit of DNIC identify country
First three
If you wanted to locate the hardware address of a local device which protocol would you use
How many digit of DNIC identify country
First three
If you wanted to locate the hardware address of a local device which protocol would you use
ARP
The dialogue control and token management are responsibility of which layer
Session layer
The dialogue control and token management are responsibility of which layer
Session layer
