• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

Sudo Placement [1.7]

Question 1

Which of the following class cannot be inherited?
  • Sealed Class
  • Private class
  • Both of the above
  • None of the above

Question 2

What will be the range of a 5 byte signed integer?
  • -549755813888 to 549755813887
  • -1099511627776 to 1099511627775
  • -549755813887 to 549755813888
  • -549755813886 to 549755813889

Question 3

Which layer in OSI model works as the data translator?
  • Application Layer
  • Session Layer
  • Presentation Layer
  • Network Layer

Question 4

What is the name given to the stack frame for function call?
  • Recursion Tree
  • Call Stack
  • Activation Record
  • None of the above

Question 5

What will be the output of following code? C
int main() {
    
    int n = 5;
    
    while(n-- > 0);
        cout << n << \" \";
    
    return 0;
}
  • 5 4 3 2 1
  • 4
  • 0
  • -1

Question 6

Which of the following is TRUE?
  • Every relation in 3NF is also in BCNF
  • A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R
  • Every relation in BCNF is also in 3NF
  • No relation can be in both BCNF and 3NF

Question 7

Which testing is used to assess the quality of the test cases which should be robust enough to fail fault code?
  • Mutation Testing
  • Gorilla Testing
  • A/B Testing
  • Mutable Testing

Question 8

In a complete k-ary tree, every internal node has exactly k children. The number of leaves in such a tree with n internal nodes is:
  • N * k
  • (n - 1) k+ 1
  • n( k - 1) + 1
  • n( k - 1)

Question 9

Which of the statement in following code will work without errors? [sourcecode] int main() { int n, m = 5; cin >> n; // Statement 1 for(int i = 3; i > -1 ;i--) { cout << (n/i); } // Statement 2 while(m--); cout << (n/m); return 0; } [/sourcecode]
  • Statement 1 and Statement 2 both
  • Neither Statement 1 nor Statement 2
  • Statement 1 only
  • Statement 2 only

Question 10

What will be the time complexity for finding all the primes smaller than N using Sieve method?
  • O(sqrt(N) LogLog(N))
  • O(N * LogLog(N))
  • O(N * Log (N))
  • O(sqrt(Log Log (N)))

There are 15 questions to complete.

Last Updated :
Take a part in the ongoing discussion