Miscellaneous On Data Structures - Practice Test

(A) srand(0)

(B) srand(1)

(C) srand(time(null))

(D) srand(-1)

(B) srand(1)

(A) Fibonacci number can be calculated by using Dynamic programming

(B) Fibonacci number can be calculated by using Recursion method

(C) Fibonacci number can be calculated by using Iteration method

(D) No method is defined to calculate Fibonacci number

(D) No method is defined to calculate Fibonacci number

(A) Bipartite Graph

(B) Claw Graph

(C) Star Graph

(D) Cartesian Graph

(B) Claw Graph

(A) {A, B}

(B) {A, E}

(C) {B, C}

(D) {D, B}

(A) {A, B}

(A) true

(B) false

(A) true

Miscellaneous On Data Structures - Study Mode