MEDIUM
HSSC Clerk
IMPORTANT
Earn 100
A strictly binary tree with n leaves always contains _____ nodes.
50% studentsanswered this correctly
Important Questions on Practice Sets
MEDIUM
HSSC Clerk
IMPORTANT
Given a graph G, F is a spanning tree of G if,
- F is a subgraph of G containing all the nodes of G.
- F is an ordered forest obtaining trees
- Ti contain all the nodes that are reachable in G from the root Ti and are not contained in Ti for some j<i of these.
MEDIUM
HSSC Clerk
IMPORTANT
A relation schema is said to be in _____ form if the values in the domain of each attribute of the relation are atomic.
MEDIUM
HSSC Clerk
IMPORTANT
The firewall has two components:
(1) Two routers and
(2) An application gateway.
Router's work is to do:
MEDIUM
HSSC Clerk
IMPORTANT
If storage class is missing in the array definition, by default it will be taken to be _____.
MEDIUM
HSSC Clerk
IMPORTANT
Which of the following algorithms solves the all-pair shortest path problem?
MEDIUM
HSSC Clerk
IMPORTANT
If the non-terminal on the left-hand side is repeated as the first symbol of the right-hand side. The phenomenon is called _____.
MEDIUM
HSSC Clerk
IMPORTANT
The _____ device provides a digital interface for connecting routers and digital circuits.
MEDIUM
HSSC Clerk
IMPORTANT
What error are you likely to get when you run the following program?
main()
{
struct emp;
{
char name ;
float sal;
}
struct emp
for
scanf;
}
