Which bitwise operation can be used to toggle a particular bit?

Which of the following is a linear data structure?

What is the output of the inorder traversal of a Binary Search Tree (BST)?

Consider the array representation of a binary min-heap containing 1023 elements. The minimum number of comparisons required to find the maximum in the heap is

The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height h is:

The most desirable condition for interpolation search is that the array should be sorted and the values should be uniformly distributed.

Consider the usual algorithm for determining whether a sequence of parentheses is balanced. The maximum number of parentheses that appear on the stack AT ANY ONE TIME when the algorithm analyzes the sequence (()(())((())) is:

A person wants to visit every vertex in a graph, starting from a vertex, visiting each vertex once, and backtracking to explore other vertices from the same starting vertex. What algorithm should the person use?

The tree T formed by the tree arcs of a Breadth-First Search (BFS) traversal from a source node W in an unweighted, connected, undirected graph is a data structure for computing.

The following code computes the shortest path between vertices in a graph using the Floyd-Warshall algorithm. What should be the value of the missing expression?

m=rows[x]
A(0)=x
for z=1 to m
    do for x=1 to m
         do for y=1 to m
                do ________________________________
return A(m)