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

Consider the following C function in which size is the number of elements in the array E: The value returned by the function MyX is the

int MyX(int *E, unsigned int size)
{
    int Y = 0;
    int Z;
    int i, j, k;
    for(i = 0; i < size; i++)
        Y = Y + E[i];
    for(i = 0; i < size; i++)
        for(j = i; j < size; j++)
        {
            Z = 0;
            for(k = i; k <= j; k++)
                Z = Z + E[k];
            if (Z > Y)
                Y = Z;
        }
    return Y;
}

Consider the expression tree shown. Each leaf represents a numerical value, which can either be 0 or 1. Over all possible choices of the values at the leaves, the maximum possible value of the expression represented by the tree is _______.

Which of the following statements are CORRECT?

1) Static allocation of all data areas by a compiler makes it impossible to implement recursion.
2) Automatic garbage collection is essential to implement recursion.
3) Dynamic allocation of activation records is essential to implement recursion.
4) Both heap and stack are essential to implement recursion.

The procedure given below is required to find and replace certain characters inside an input character string supplied in array A. The characters to be replaced are supplied in array oldc, while their respective replacement characters are supplied in array newc. Array A has a fixed length of five characters, while arrays oldc and newc contain three characters each. However, the procedure is flawed

void find_and_replace(char *A, char *oldc, char *newc) {
    for (int i = 0; i < 5; i++)
       for (int j = 0; j < 3; j++)
           if (A[i] == oldc[j]) A[i] = newc[j];
}

The procedure is tested with the following four test cases

(1) oldc = "abc", newc = "dab" (2) oldc = "cde", newc = "bcd" 
(3) oldc = "bca", newc = "cda" (4) oldc = "abc", newc = "bac" 

The tester now tests the program on all input strings of length five consisting of characters ‘a’, ‘b’, ‘c’, ‘d’ and ‘e’ with duplicates allowed. If the tester carries out this testing with the four test cases given above, how many test cases will be able to capture the flaw?

Which of the following statements is true?

The principle of locality justifies the use of

Consider a grammar with the following productions

S → a∝b|b∝c| aB
S → ∝S|b
S → ∝b b|ab
S ∝ → bd b|b 

The above grammar is:

Which of the following statements is true?

I. As the number of entries in a hash table increases, the number of collisions increases.
II. Recursive programs are efficient
III. The worst case complexity for Quicksort is O(n²)

Which one of the following statements is true?

Match the following items

Match the following items

Match the following items

State True or False with reason
Logical data independence is easier to achieve than physical data independence

A part of the system software, which under all circumstances must reside in the main memory, is:

In which of the cases stated below is the following statement true?

 “For every non-deterministic machine M1 there exists an equivalent deterministic machine M2 recognizing the same language“.  

Match the pairs in the following questions by writing the corresponding letters only.

(A) IEEE 488    (P) specifies the interface for connecting a single device
(B) IEEE 796    (Q) specifies the bus standard for connecting a computer to 
                    other devices including CPU’s
(C) IEEE 696    (R) specifies the standard for an instrumentation bus
(D) RS232-C     (S) specifies the bus standard for the “backplane” bus called  
                    multibus. 

Match the pairs in the following questions by writing the corresponding letters only.

(A) Buddy system     (P) Run-time type specification
(B) Interpretation   (Q) Segmentation
(C) Pointer type     (R) Memory allocation
(D) Virtual memory   (S) Garbage collection

Match the pairs in the following questions by writing the corresponding letters only.

(A) The number distinct binary trees with n nodes       (P) n!/2        
(B) The number of binary strings of length of 2n        (Q) (3n/n)
    with an equal number of 0’s and 1’s                                     
(C) The number of even permutations of n objects        (R) (2n/n) 
(D) The number of binary strings of length 6m which     (S) 1/n+1(2n/n) 
    are palindromes with 2n 0’s.

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Which one of the following is the strongest correct statement about a finite language over some finite alphabet ∑?

In the following table, the left column contains the names of standard graph algorithms and the right column contains the time complexities of the algorithms. Match each algorithm with its time complexity.

1. Bellman-Ford algorithm       A: O ( m log n)   
2. Kruskal’s algorithm          B: O (n3) 
3. Floyd-Warshall algorithm     C: O (nm)
4. Topological sorting	        D: O (n + m) 

Which one of the following statements is FALSE?

Which one of the following statements is FALSE?

Which one of the following statements is FALSE?

A serial transmission T1 uses 8 information bits, 2 start bits, 1 stop bit and 1 parity bit for each character. A synchronous transmission T2 uses 3 eight bit sync characters followed by 30 eight bit information characters. If the bit rate is 1200 bits/second in both cases, what are the transfer rates of T1 and T2?

Consider a list of recursive algorithms and a list of recurrence relations as shown below. Each recurrence relation corresponds to exactly one algorithm and is used to derive the time complexity of the algorithm.

RECURSIVE ALGORITHM		  RECURRENCE RELATION
 P. Binary search	      I. T(n) = T(n-k) + T(k) + cn
 Q. Merge sort	             II. T(n) = 2T(n-1) + 1
 R. Quick sort	            III. T(n) = 2T(n/2) + cn
 S. Tower of Hanoi	     IV. T(n) = T(n/2) + 1