Skip to main content

Accenture Mock Quiz | Part 4

Image
By Astrio Jather

 

Question 31

Correct
Marked out of 1.00
Flag question

Question text

What will be the output of the following Java code?

class Test extends Throwable { }
class Base extends Test {}
public class Main {
   public static void main(String args[]) { 
      try {
         throw new Base();
      }
      catch(Test t) {
         System.out.println("Test Exception");
      }
      finally {
         System.out.println("Finally block ");
      }
  }
}

Select one:
 

Feedback

Question 32

Correct
Marked out of 1.00
Flag question

Question text

Which of the following statement(s) is/are TRUE?
(i) In a non-correlated(independent) subquery, the subquery is always executed only once.
(ii) In a non-correlated(independent) subquery, the inner query (sub query) references the column from the outer query (main query).
Choose most appropriate option

Select one:
 

Feedback

Question 33

Incorrect
Marked out of 1.00
Flag question

Question text

The employee tables contains EmployeeId,EmployeeName and DeptCode Columns. Which is the CORRECT SQL query to display the EmployeeId and EmployeeName of employees who are working in DeptCode 10 OR 20?
(i) SELECT EmployeeId,EmployeeName FROM Employee WHERE DeptCode IN (10,20);
(ii) SELECT EmployeeId,EmployeeName FROM Employee WHERE DeptCode = 10 OR DeptCode = 20;
Choose most appropriate option.

Select one:
 

Feedback

Question 34

Correct
Marked out of 1.00
Flag question

Question text

Which of the following statement(s) is/are TRUE?


(i) In a subquery, the inner query is responsible for giving result.


(ii) In a subquery, the outer query is responsible to display output.


Choose most appropriate option

Select one:
 

Feedback

Question 35

Incorrect
Marked out of 1.00
Flag question

Question text

Which of the following SQL query will not be executed successfully? Assume all the column names and table name given here are correct. Choose the most appropriate option.

Select one:
 

Feedback

Question 36

Correct
Marked out of 1.00
Flag question

Question text

Assume that table Asset(assetId number(2)) is created and 2 records are already inserted and saved.

COMMIT;
DELETE FROM ASSET;
ROLLBACK;
INSERT INTO ASSET VALUES(5);
COMMIT;

What would be the output of the below SQL statement after executing the above statements sequentially.

SELECT COUNT(*) FROM Asset;
Select one:
 

Feedback

Question 37

Incorrect
Marked out of 1.00
Flag question

Question text

Consider the below tables.
Event(eventId,eventName) – eventId is primary key
Employee(empId, empName, eventId) – empId is primary key and eventId is foreign key referring to Event table.
Identify the correct SQL statement to retrieve empid, empname and eventName for all employees. If employee has not registered for an event then it should display ‘Not Registered’.
Select one:
 

Feedback

Question 38

Incorrect
Marked out of 1.00
Flag question

Question text

'link', 'vlink' and 'alink' are attributes of which HTML tag?


Choose the most appropriate option.

Select one:
 

Feedback

Question 39

Correct
Marked out of 1.00
Flag question

Question text

Which of the following attribute is used by a HTML tag to apply inline style? Choose most appropriate option.

Select one:
 

Feedback

Labels:

Comments

Post a Comment

Must Read:

Software Engineering Concepts Basics Of Testing Basics Of Testing | Quiz 2

By Astrio Jather
Software Engineering Concepts  Basics Of Testing  Basics Of Testing Quiz 2
Post a Comment
Read more

Pyramid

By Astrio Jather
/*  To Print  1    2   2    3   3   3    4   4   4   4    5   5   5   5   5    */ #include   <iostream> using   namespace   std ; int   main (){       #ifndef  ONLINE_JUDGE          freopen ( "../asset/input.txt" , "r" , stdin );          freopen ( "../asset/output.txt" , "w" , stdout );     #endif     // Code here!!      int   n ;  cin >> n ;      for ( int   i = 1 ; i <= n ; i ++){          for ( int   j = 1 ; j <=  i ; j ++){     ...
Post a Comment
Read more

If a Prime Number

By Astrio Jather
  /* @ToDo     If a Prime Number    9 => Not a Prime Number    7 => Prime Number */ #include   <iostream> using   namespace   std ; int   main (){       #ifndef  ONLINE_JUDGE          freopen ( "../asset/input.txt" , "r" , stdin );          freopen ( "../asset/output.txt" , "w" , stdout );     #endif     // Code here!!     int   n ;  cin >> n ;     bool   flag  =  true ;     for ( int   i = 2 ; i * i <= n ; i ++)      if ( n % i == 0 ){          flag  =  false ;          break ;   ...
Post a Comment
Read more

Programming using Java Hands On - Arrays | Find & Display the position of a number

By Astrio Jather
  Write a java program to find the given number from the array of elements and display its position. If the number is not present in an array then display it as 0. Assume the position starts from 1. Sample Input 1 Enter the array size 4 Enter the values 9 32 17 4 Enter the number to find 17 Sample Output 1 3 Sample Input  2 Enter the array size 3 Enter the values 29 53 11 Enter the number to find 49 Sample Output  2 0 Result Description Summary of tests *Note: All the test cases might not have same weightage +------------------------------+ |4 tests run / 4 tests passed | +------------------------------+ TEST CASE PASSED
Post a Comment
Read more

Arrange Buildings

By Astrio Jather
1. You are given a number n, which represents the length of a road. The road has n plots on it's each side. 2. The road is to be so planned that there should not be consecutive buildings on either side of the road. 3. You are required to find and print the number of ways in which the buildings can be built on both side of roads. Input Format A number n Output Format A number representing the number of ways in which the buildings can be built on both side of roads. Constraints 0 < n <= 45 Sample Input 6 Sample Output 441 Solution: import java.io.*; import java.util.*; public class Main{ public static void main(String[] args) throws Exception {     // write your code here     Scanner scn = new Scanner(System.in);     long n = scn.nextInt();     long ob = 1;     long os = 1;     for (int i = 2; i <= n; i++) {       long nb = os;       long ns = os + ob;       ob = nb;   ...
Post a Comment
Read more

Rhumbus Pattern

By Astrio Jather
  /* @ToDo     Rhumbus Pattern                 *   *   *   *   *                *   *   *   *   *            *   *   *   *   *        *   *   *   *   *    *   *   *   *   *        */ #include   <iostream> using   namespace   std ; int   main (){       #ifndef  ONLINE_JUDGE        ...
Post a Comment
Read more

Count Binary Strings

By Astrio Jather
1. You are given a number n. 2. You are required to print the number of binary strings of length n with no consecutive 0's. Note: In this problem, you are given a number n. All we need to print is the number of binary strings of length n with no consecutive 0's For example: Sample Input: 3 Sample Output: 5 How 5? We have a total of eight binary numbers for length 3, out of which we have 5 numbers in which there are no consecutive zeros. Input Format A number n Output Format A number representing the number of binary strings of length n with no consecutive 0's. Constraints 0 < n <= 45 Sample Input 6 Sample Output 21 Solution: import java.io.*; import java.util.*; public class Main{ public static void main(String[] args) throws Exception {     // write your code here     Scanner sc = new Scanner(System.in);     int n = sc.nextInt();          int dp[][] = new int[n+1][2];     dp[1][0] = 1;     dp[1][1] ...
Post a Comment
Read more

0-1 Pattern

By Astrio Jather
  /* @ToDo  0-1 Pattern     1     0   1     0   1   0     1   0   1   0     1   0   1   0   1 */ #include   <iostream> using   namespace   std ; int   main (){       #ifndef  ONLINE_JUDGE          freopen ( "../asset/input.txt" , "r" , stdin );          freopen ( "../asset/output.txt" , "w" , stdout );     #endif     // Code here!!      int   n ;  cin >> n ;      int   sign  =  1 ;      for ( int   i = 1 ; i <= n ; i ++){    ...
Post a Comment
Read more

Fractional Knapsack

By Astrio Jather
1. You are given a number n, representing the count of items. 2. You are given n numbers, representing the values of n items. 3. You are given n numbers, representing the weights of n items. 3. You are given a number "cap", which is the capacity of a bag you've. 4. You are required to calculate and print the maximum value that can be created in the bag without overflowing it's capacity. Note1: Items can be added to the bag even partially. But you are not allowed to put same items again and again to the bag. Input Format A number n v1 v2 .. n number of elements w1 w2 .. n number of elements A number cap Output Format A decimal number representing the maximum value that can be created in the bag without overflowing it's capacity 1. You are given a number n, representing the count of items. 2. You are given n numbers, representing the values of n items. 3. You are given n numbers, representing the weights of n items. 3. You are given a number "cap", which i...
Post a Comment
Read more

Subscribe to Get's Answer by Email