AI ML NW DSA APP

Which of the following is application of Breath First Search on the graph?

• Finding diameter of the graph

  
  

• Finding bipartite graph

• Both (A) and (B)

• None of the above

Breadth First Search(BFS) is started on a binary tree beginning from the root vertex. There is a vertex t at a distance four from the root. If t is the n-th vertex in this BFS traversal, then the maximum possible value of n is______ .

• 16

• 15

• 31

• 32

Which of the following algorithms solves the all pair shortest path problem?

• Prim's algorithm

• Dijkstra's algorithm

• Bellman ford algorithm

• 
  Floyd warshalls algorithm

The Floyd-Warshall algorithm for all-pair shortest paths computation is based on

• Greedy paradigm

• Divide-and-Conquerparadigm.

• Dynamic Programing paradigm.

• neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm

The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is _________________.

• 100

• 99

• 148

• 198

What is the worst case time complexity of inserting n elements into an empty linked list, if the linked list needs to be maintained in sorted order?

• O(n log n)
• O(n)
• O(log n)
• O(n^2)

Which of the following operations is performed more efficiently by doubly linked list than by linear linked list?

• Deleting a node whose location is given

• Insertion of a node at the beginning is faster.
• Traversal of the list is more efficient.
• Searching for a node is quicker.

The time required to search an element in a linked list of length n is

• O(1)
• O(n)
• O(log n)
• O(n^2)

The post-order traversal of binary tree is ACEDBHIGF. The pre-order traversal is

• FEACBDHIG
• F B A D C E G I H

• ACEDFGHI
• GFEACBDHI

The infix expression A+(B−C)∗D is correctly represented in prefix notation as

• * A + B C D
• + A * - B C D
• A + * B C D
• - A + B C D