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:

RDBMS Data Definition Language | Create Sales_info table

By Astrio Jather
  Write a query to create Sales_info with constraints mentioned. Refer the below schema  Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+
Post a Comment
Read more

Climb Stairs With Variable Jumps

By Astrio Jather
 1. You are given a number n, representing the number of stairs in a staircase. 2. You are on the 0th step and are required to climb to the top. 3. You are given n numbers, where ith element's value represents - till how far from the step you       could jump to in a single move.        You can of course jump fewer number of steps in the move. 4. You are required to print the number of different paths via which you can climb to the top. Input Format A number n .. n more elements Output Format A number representing the number of ways to climb the stairs from 0 to top. Constraints 0 <= n <= 20 0 <= n1, n2, .. <= 20 Sample Input 10 3 3 0 2 1 2 4 2 0 0 Sample Output 5 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);   ...
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

RDBMS Data Definition Language | Alter - Add CHECK constraint to Mobile_Master

By Astrio Jather
RDBMS  Data Definition Language  Alter - Add CHECK constraint to Mobile_Master Refer the following schema and add a constraint CHK_WARRANTY in Mobile_Master table to ensure that the warranty in years is greater than zero. Evaluation Result: Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+
Post a Comment
Read more

RDBMS Data Definition Language | Drop Mobile Specification table (parent)

By Astrio Jather
  RDBMS  Data Definition Language  Drop Mobile Specification table (parent) Refer the following schema and drop Mobile Specification table. (Hint: To drop parent table all associate tables need to be dropped or Use 'cascade constraints' command) Evaluation Result: Result Description Summary of tests +------------------------------+ | 1 tests run / 1 test passed | +------------------------------+
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

RDBMS Data Definition Language | Create Distributor table

By Astrio Jather
  Write a query to create Distributor table with constraints mentioned.  Refer the below schema  Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+
Post a Comment
Read more

Zero One Knapsack | Recursion

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. Note: Each item can be taken 0 or 1 number of times. You are not allowed to put the same item again and again. Input Format A number n v1 v2 .. n number of elements w1 w2 .. n number of elements A number cap Output Format A number representing the maximum value that can be created in the bag without overflowing it's capacity Constraints 1 <= n <= 20 0 <= v1, v2, .. n elements <= 50 0 < w1, w2, .. n elements <= 10 0 < cap <= 10 Sample Input 5 15 14 10 45 30 2 5 1 3 4 7 Sample Output 75 Solution: import java.io.*; import java.util.*; public class Main...
Post a Comment
Read more

Coin Change Permutations

By Astrio Jather
 1. You are given a number n, representing the count of coins. 2. You are given n numbers, representing the denominations of n coins. 3. You are given a number "amt". 4. You are required to calculate and print the number of permutations of the n coins using which the       amount "amt" can be paid. Note 1: You have an infinite supply of each coin denomination i.e. same coin denomination can be                    used for many installments in payment of "amt" Note 2: You are required to find the count of permutations and not combinations i.e.                   2 + 2 + 3 = 7 and 2 + 3 + 2 = 7 and 3 + 2 + 2 = 7 are different permutations of same                    combination. You should treat them as 3 and not 1. Input Format A number n n1 n2 .. n number of elements A number amt Output Format A number representing the cou...
Post a Comment
Read more

Subscribe to Get's Answer by Email