Skip to main content

Accenture TFA MCQ | Part 1

Question 1

Correct
Mark 1.00 out of 1.00
Flag question

Question text

 Identify whether the below statement is True or False: The hierarchy of Reader/Writer class is character-oriented and InputStream/OutputStream class is byte-oriented

Select one:

 

Feedback

Question 2

Correct
Mark 1.00 out of 1.00
Flag question

Question text

While garbage collection the java run time system automatically calls ______________method.

Select one:
 

Feedback

Question 3

Partially correct
Mark 0.67 out of 1.00
Flag question

Question text

Choose all the statement(s) that are valid.

Select one or more:
 
 

Feedback

Question 4

Incorrect
Mark 0.00 out of 1.00
Flag question

Question text

Predict the output:

public class Topper
{
public static void check() {
	this.display();
		}
public static void display() {
	System.out.println("Welcome to Java");
		}
public static void main(String args []) {
	check();
	}
}

Select one:
 

Feedback

Question 5

Partially correct
Mark 0.67 out of 1.00
Flag question

Question text

Which of the following are not Java keyword?

Select one or more:
 
 

Feedback

Question 6

Incorrect
Mark 0.00 out of 1.00
Flag question

Question text

What will happen if you attempt to compile and run the following code?

Integer i=new Integer(15);
Long l=new Long (10);
System.out.println(i + l);
int check=1;
System.out.println(check + i);

Select one:
 

Feedback

Question 7

Incorrect
Mark 0.00 out of 1.00
Flag question

Question text

Predict the output:

class One
{
    void calculate(int a, int b)
    {
        System.out.println("Class One");
    }
}
 
class Two extends One
{
    @Override
    void calculate(int a, int b)
    {
        System.out.println("Class Two");
    }
}
 
class Three extends Two
{
    @Override
    void calculate(int a, int b) 
    {
        System.out.println("Class Three");
    }
}
 
public class Test 
{   
    public static void main(String[] args)
    {
        One one = new Two();
         
        one.calculate(10, 20);
         
        Two two = (Two) one;
         
        two.calculate(50, 100);
         
        Three three = (Three) two;
         
        three.calculate(100, 200);
    }
}

Select one:
 

Feedback

Question 8

Incorrect
Mark 0.00 out of 1.00
Flag question

Question text

On exceuting the following code predict the output

public class TestMain {
	public static void main(String args[ ])
	{
	try
	{
	int x=10;
	throw(new Exception("Throw new Exception"));
	}
	catch(Exception e)
	{
	System.out.print("Exception caught in catch block. ");
	return;
	}
	finally
	{
	System.out.println("Exception caught in finally block.");
	}
	}
	}

Select one:
 

Feedback

Question 9

Incorrect
Mark 0.00 out of 1.00
Flag question

Question text

String str= new String("Hello World");

Which of the following calls are valid?
(A) str.trim()
(B) str.replace('o', 'A')
(C) str.substring(3)
(D) str.toUppercase()
(E) str.setCharAt(1,'A')
(F) str.append("xyz")

Select one:
 

Feedback

Question 10

Correct
Mark 1.00 out of 1.00
Flag question

Question text

Select the true statement ?

Select one:
 

Feedback

Question 11

Correct
Mark 1.00 out of 1.00
Flag question

Question text

How do we change the state of an object ?

Select one:
 

Feedback

Question 12

Correct
Mark 1.00 out of 1.00
Flag question

Question text

How does the different section of an application communicate in an OO approach ?

Select one:
 

Feedback

Question 13

Correct
Mark 1.00 out of 1.00
Flag question

Question text

Select the principle that best describes the given scenario. An air-condition can be operated using the button or remote control.

Select one:
 

Feedback

Question 14

Correct
Mark 1.00 out of 1.00
Flag question

Question text

Select the benefits of OOP ?

Select one or more:
 
 

Feedback

Question 15

Incorrect
Mark 0.00 out of 1.00
Flag question

Question text

Select the multiplicity between passenger and train reservation ticket? What is the multiplicity of passenger ?

Select one:
 

Feedback

Question 16

Correct
Mark 1.00 out of 1.00
Flag question

Question text

The given snippet describes ________________-

    BEGIN
        DECLARE marks[10] 
        DECLARE number
        SET number TO 0
        FOR index=0 TO 9
 INPUT array[index]
        END FOR
        number= marks[0]
        FOR index=0 TO 9
                 IF marks[index] > number THEN
                      number =marks[index]
                 END IF
        END FOR  
        PRINT number
END

Select one:
 

Feedback

Question 17

Correct
Mark 1.00 out of 1.00
Flag question

Question text

_________ is not the exact code for solving the problem but it would give us an idea of how the problem is going to be solved.


Select one:
 

Feedback

Question 18

Correct
Mark 1.00 out of 1.00
Flag question

Question text

SPOT THE ERROR:

Observe the below algorithm to find the average of three numbers. 

Step1: Start

Step2: Get num1, num2, num3

Step3: Add num1, num2, num3 and store it in Sum

Step4: Average=sum%3

Step5: Display Sum and Average

Step6: Stop

Identify the incorrect step(if any)

Select one:
 

Feedback

Question 19

Incorrect
Mark 0.00 out of 1.00
Flag question

Question text

Carefully read the question and answer accordingly. From the list of input elements one element is taken during each iteration to find its corresponding position. This idea of sorting is said to be _______.

Select one:
 

Feedback

Question 20

Correct
Mark 1.00 out of 1.00
Flag question

Question text

Carefully read the question and answer accordingly. Which data structure is said to be linear data structure?

Select one:
 

Feedback

Question 21

Correct
Mark 1.00 out of 1.00
Flag question

Question text

What is the time complexity of below function?

void cal_fun(int m,int a[])

{

int i=0,j=0;

for(;i<m;++i)

       while(j<m && a[i] < a[j])

             j++;

}

Select one:
 

Feedback

Question 22

Correct
Mark 1.00 out of 1.00
Flag question

Question text

From the given options identify the appropriate algorithm that has the lowest worst-case complexity?

Select one:
 

Feedback

Question 23

Correct
Mark 1.00 out of 1.00
Flag question

Question text

Time complexity of an algorithm signifies the total time required by the algorithm to complete its execution with provided resources. State True or False.

Select one:
 

Feedback

Question 24

Correct
Mark 1.00 out of 1.00
Flag question

Question text

State true or false.

 Configuration management is important only during the coding phase

Select one:
 

Feedback

Question 25

Correct
Mark 1.00 out of 1.00
Flag question

Question text

The SRS document should be

Select one:
 

Feedback

Comments

Must Read:

Data Formats ( XML & JSON ) XML AND JSON | Generate XSD for Students

  Generate XSD for Students   Generate XSD for the following XML. XYZ School wants to store the details of students in an xml file. The following scenario helps in designing the XML document. Here StudentList  is the root tag. StudentList contains the entry of each student with rollno, name, age, address and department. <?xml version="1.0" encoding="UTF-8"?> <StudentList  xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"  xsi:noNamespaceSchemaLocation="StudentList.xsd">     <Student rollno="2017CSE0055">         <name>             <firstname>Savitha</firstname>         </name>         <age>20</age>         <address>             <doorno>35</doorno>     ...

Climb Stairs With Variable Jumps

 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);   ...

Zero One Knapsack | Recursion

 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...

Accenture Mock Quiz | Part 1

Question  1 Incorrect Marked out of 1.00 Remove flag Question text Select the true statement ? Select one: a.  Inheritance forms a is-a part of relationship between classes.   b.  Aggregation is the stronger form of Inheritance. c.  Aggregation forms the is-a type of relationship between classes. d.  Aggregation forms a is-a part of relationship between classes. Composition is the stronger form of Aggregation. Feedback The correct answer is: Aggregation forms a is-a part of relationship between classes. Composition is the stronger form of Aggregation. Question  2 Correct Marked out of 1.00 Flag question Question text What is the diagram that depicts the interaction between objects by arranging the objects in time sequence ? Select one: a.  Use Case Diagram b.  Sequence Diagram   c.  Component Diagram d.  Activity Diagram Feedback The correct answer is: Sequence Diagram Question  3 Incorrect Marked out of 1.00 Flag question...

Algorithm Analysis and Design Concepts Analysis of Algorithms Post-Quiz

 Algorithm Analysis and Design Concepts       Analysis of Algorithms            Post-Quiz  

Count Encodings

 1. You are given a string str of digits. (will never start with a 0) 2. You are required to encode the str as per following rules     1 -> a     2 -> b     3 -> c     ..     25 -> y     26 -> z 3. You are required to calculate and print the count of encodings for the string str.      For 123 -> there are 3 encodings. abc, aw, lc      For 993 -> there is 1 encoding. iic       For 013 -> This is an invalid input. A string starting with 0 will not be passed.      For 103 -> there is 1 encoding. jc      For 303 -> there are 0 encodings. But such a string maybe passed. In this case       print 0. Input Format A string str Output Format count of encodings Constraints 0 < str.length <= 10 Sample Input 123 Sample Output 3 Solution: import java.io.*; import java.util.*; public class Main {   ...

Data Formats ( XML & JSON ) XML AND JSON | Generate XSD 4

  Generate XSD 4 Generate an XSD for the following XML document <?xml version="1.0" encoding="UTF-8"?> <company> <employee> <id>101</id> <name>Ram</name> <salary>10000</salary> <email>ram@gmail.com</email> </employee> <employee> <id>102</id> <name>Dinesh</name> <salary>20000</salary> <email>dinesh@gmail.com</email> </employee> <employee> <id>103</id> <name>sathish</name> <salary>20000</salary> <email>sathish@gmail.com</email> </employee> <employee> <id>104</id> <name>Praveen</name> <salary>20000</salary> <email>praveen@gmail.com</email> </employee> </company> <? xml  version = "1.0"  encoding = "UTF-8" ?> < xs:schema   xmlns:xs = "http://www.w3.org/2001/XMLSchema"   elementF...

Programming using Java Hands On - Control Structures | Highest Placement

  Highest Placement SRV college wants to recognize the department which has succeeded in getting the maximum number of placements for this academic year. The departments that have participated in the recruitment drive are CSE,ECE, MECH. Help the college find the department getting maximum placements. Check for all the possible output given in the sample snapshot Note : If any input is negative, the output should be "Input is invalid".  If all department has equal number of placements, the output should be "None of the department has got the highest placement". Sample Input 1: Enter the no of students placed in CSE:90 Enter the no of students placed in ECE:45 Enter the no of students placed in MECH:70 Sample  Output 1: Highest placement CSE Sample Input 2: Enter the no of students placed in CSE:55 Enter the no of students placed in ECE:85 Enter the no of students placed in MECH:85 Sample  Output 2: Highest placement ECE MECH Sample Input 3: Enter the no of students p...

Subscribe to Get's Answer by Email