E8-DAA_7CSN

best-case and worst-case time complexities of a multistage graph are:

Time complexity of All pair shortest path Algorithm is:

Time complexity of Floyd Warshall Algorithm is:

G=Graph is with negative weights. Time complexity Single source shortest path Algorithm on G is:

G=Graph is with only positive weights. Time complexity Single source shortest path Algorithm on G is:

Consider two strings: X= replace, Y=delete, to convert X--> Y, number of edit operations are:

• 4

• 5

• 6

• 7

Consider the string editing cost table: if row ==column, which of the following operation(s) we will perform?

• insert

• delete

• replace

• edit

The objective of "Reliability Design problem" is?

• maximizing cost

• minimizing cost

• maximizing reliability

• minimizing reliability

The net reliability of the system is _________of individual device reliabilities

• sum

• product

• difference

• division

How many number of binary trees can be formed when number of nodes are 5?