JSD (Algorithm Analysis)

What is the maximum number of children a node in a binary tree can have?

• 0

• 1

• 2

• any number of children

Which data structure is used to evaluate a postfix expression?

• 
  Array

• Stack

• Queue

• Tree

In a priority queue, which element is dequeued first?

• The element with the highest priority

• The element with the least priority

• The first element enqueued

• The last element enqueued

In a binary search tree, which traversal method gives the nodes in ascending order?

• Preorder

• Postorder

• Inorder

• Levelorder

A queue follows __________

• FIFO (First In First Out) principle

• LIFO (Last In First Out) principle

• 
  Ordered array

• 
  Linear tree

What data structure is used for breadth first traversal of a graph?

• queue

• stack

• list

• none of the option

A graph is said to be connected if:

• There is a path between every pair of vertices

• Every vertex is connected to at least one other vertex

• It contains no cycles

• The graph has minimum number of edges

Which of the following is not a linear data structure?

• Stack

• Queue

• Tree

• Array

In an adjacency matrix representation of a graph, what does a value of 1 at position [i][j] represent?

• There is a self-loop at vertex i

• There is an edge between vertex i and vertex j

• Vertex i is connected to itself

• There is no edge between vertex i and vertex j

What is the height of a tree with only a single node?

• -1

• 0

• 1

• Depends on the implementation