Which of the following lines of the code will delete two successive nodes of a single linked linear list(with more than two nodes)? Here 'LINK[X]' denotes the address field of node X.

A non- planar graph with the minimum number of vertices has:

A circuit which is a connected graph and which includes every vertex of the graph is known as_____.

A one dimensional array A has indices 1...75. Each element is a string and takes up three memory words. The array is stored starting at location 1120 decimal. The starting address of A[49] is:

A simple graph in which there exists an edge between every pair of vertices is called a/an _________.

Let A be a sorted array of n=10 elements. Assume that only one comparison is required to determine whether the target is equal to, less than, or greater than A[i]. Which of the following denotes the average successful time of finding an arbitrary element x in A using the binary search?

Every element in an array is assigned a unique number known as a ________.

Each object of a class has its own copy of the class's ________.

A(n) ________ informs the compiler that a class will be declared later in the program.

A member function that is declared ________ may not access any non-static data members in the class

A heuristic is a(n) ____.