round 2

Which of the following option is objective of the topology diagram

•                     Configuring and Troubleshooting a Switched Network

•     Performing an Initial Switch Configuration

• Performing an Initial Router Configuration

•      Configuring WEP on a Wireless Router

  If circular queue is implemented using array having size MAX_SIZE in which array index starts with 0, front points to the first element in the queue, and rear points to the last element in the queue. Which one of the following conditions used to specify that the circular queue is empty?

•   Front=rear=0

•   Front=rear= -1

• Front=rear= --1

• a)   None of the above

You are given a function to find the shortest path using Dijkstra's Algorithm. Fill in the missing line.

• heapq.heappush(pq, (distance, neighbor))

• heapq.heappush(pq, (current_distance, neighbor))

• pq.append((distance, neighbor))

• pq.append((current_distance, neighbor))

You are given a function to merge two sorted arrays in the merge step of Merge Sort. Fill in the missing lines.

• j += 1 and i += 1

• i += 1 and j += 1

• i += 1 and k += 1

• i += 1 and k += 1

Identify the AVL tree among the following options?

• C

•   A

• Both A and C

•    B

Suppose a depth-first search is executed on the graph below, starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible recursion depth (including the initial call) is _________.

• 15

• 19

• 18

• 24

Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are:
i. isEmpty (Q)—returns true if the queue is empty, false otherwise.
ii. delete (Q): deletes the element at the front of the queue and returns its value.

iii. insert (Q, i)—inserts the integer i at the rear of the queue.
Consider the following function:.

What operation is performed by the below function, f?

• Reverses the order of the elements in the queue Q

•   Empties the queue Q

• Leaves the queue Q unchanged

•   None of the above

Consider the following statements:
(i) First-in-first-out types of computations are efficiently supported by STACKS.
(ii) Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations.
(iii) Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices.
(iv) Last-in-first-out types of computations are efficiently supported by QUEUES. 

• (i) and (ii) are true 

• (iv) and (ii) are true 

• (iii) and (iv) are true 

• (ii) and (iii) are true

Match the following time complexity for the given statements.

• II, I, III, and IV

• I, III, II, and IV

•  II, I, IV, and III

•  II, III, IV, and I

The following is the program, which consists of missing lines. Find the Hamilton path of the following graph with the help of code.

• ) 1-  if hamiltonian_path_util(graph, path, pos + 1):  2- path = [+1] * len(graph) 3- graph = [

      [1, 1, 1, 1, 0],

      [0, 1, 1, 1, 1],

      [0, 1, 1, 0, 0],

      [1, 1, 0, 1, 0],

      [0, 1, 0, 1, 1]

  ]   4 - Hamilton path:Found

• 1- if hamiltonian_path_util(graph, path, pos - 1):  2- path = [+1] + len(graph)   3- graph = [

      [0, 1, 0, 1, 0],

      [1, 0, 1, 1, 1],

      [0, 1, 0, 0, 0],

      [1, 1, 0, 0, 0],

      [0, 1, 0, 0, 0]

  ]                              4 – Hamilton path:Found

• 1 -  if hamiltonian_path_util(graph, path, pos - 1):   2 - path = [-1] * len(graph)  3 -

  graph = [

      [1, 1, 1, 1, 0],

      [0, 1, 1, 1, 1],

      [0, 1, 1, 0, 0],

      [1, 1, 0, 1, 0],

      [0, 1, 0, 1, 1]

  ]        4- Hamilton path: None

• 1 -  if hamiltonian_path_util(graph, path, pos + 1):   2 - path = [-1] * len(graph)  3 -

  graph = [

      [0, 1, 0, 1, 0],

      [1, 0, 1, 1, 1],

      [0, 1, 0, 0, 0],

      [1, 1, 0, 0, 0],

      [0, 1, 0, 0, 0]

  ]      4- Hamilton path: None