List of top Data Science and Artificial Intelligence Questions on Binary Operations

Consider a state space where the start state is number 1. The successor function for the state numbered n returns two states numbered n+1 and n+2. Assume that the states in the unexpanded state list are expanded in the ascending order of numbers and the previously expanded states are not added to the unexpanded state list.
Which ONE of the following statements about breadth-first search (BFS) and depth-first search (DFS) is true, when reaching the goal state number 6 ?

The fundamental operations in a double-ended queue D are :
insertFirst (e) - Insert a new element e at the beginning of D.
insertLast (e) - Insert a new element e at the end of D.
removeFirst () - Remove and return the first element of D.
removeLast () - Remove and return the last element of D.
In an empty double-ended queue, the following operations are performed :
insertFirst (10)
insertLast (32)
a ← removeFirst()
insertLast (28)
insertLast (17)
a ←removeFirst()
a ← removeLast ()
The value of a is _______.

Let H, I, L, and N represent height, number of internal nodes, number of leaf nodes, and the total number of nodes respectively in a rooted binary tree.
Which of the following statements is/are always TRUE ?

Let F(n) denote the maximum number of comparisons made while searching for an entry in a sorted array of size n using binary search.
Which ONE of the following options is TRUE ?