BARC Quiz-9

Consider the following function:

Which of the following recursion formula depicts the running time of function, as a function of ‘n’?

For parameters a and b, both of which are T(n) = T(n^1/a) + 1, and T(b)=1. Then T(n) is:

Consider the following grammar:

S → A + A | A

A → AB | B

B → a | b

Which of the given options is true regarding the grammar?

Find the type of given grammar :

S -> #S | @ A#

A -> @ A @ | #B!A

B -> &B% | ! | e

Non Terminal (V) = { S , A , B }

Terminal (T) = { # , ! , @ , % , & }

Here e is epsilon or null symbol.

If an Ethernet port on a router were assigned an IP address of 172.16.112.1/25, what would be the valid subnet address of this host?

Consider Three-way Handshaking for TCP connection termination is shown below:

Which of the following is false?

S₁ : Loss of ACK from client doesn’t effect on termination of connection.
S₂ : The client moves FIN-Wait-1 → FIN-Wait-2 → closed in the state machine on no packet loss.
S₃ : Loss of ACK from server restrict termination of connection.

If we apply DFS algorithm, on the following graph, then what is the maximum depth of recursive call?

What of the following is valid DFS?

Consider the following set of functional dependencies F on the schema (A, B, C)

F = {A->BC, B->C, A->B, AB->C} The canonical cover of this set is:

An attribute in a relation is a foreign key if the _______ key from one relation is used as an attribute in that relation.