L&T Infotech –Test Pattern

L&T INFOTECH Technical Questions

  1. Reference is__________
    • alias of an object
    • used to rename an object
    • a special operator
    • a pointer to virtual function


  2. If the two networks having different protocols then the device used to communicate between these systems is
    • Bridge
    • Repeater
    • Hub
    • Gateway

  3. Merge sort algorithm uses___________________technique
    • Brute force
    • Dynamic programming
    • Greedy
    • Divide and conquer
  4. What is the asymptotic worst case complexity of the given pseudo code
    for(i=0;i {
    for(j=0;j {
    c[i][j]=0;
    for(k=0;k {
    c[i][j]=c[i][j]+a[i][k]*b[k][j];
    }
    }
    }
    • O(n)
    • O(1)
    • O(n^2)
    • O(n^3)

  5. The least frequently used (LFU) page replacement algorithm requires_________
    • the page with the smallest count to be replaced.
    • the page with the longest count to be replaced.
    • the page with the smallest count was brought in, yet to be used.
    • the page with the longest count was brought in, yet to be used.

  6. Choose the valid statement
    • All variables are initialized to 0 after declaration
    • Only local and static variables have junk values
    • Static and global variables are automatically initialized to zero at the time of declaration
    • All automatic variables are initialized to zero