Quest Eduventuures Internship Test

Why do you want to do internship? 

A memory location that holds a single letter or number.  

• Double

• Int

• Char

• Word

A do while and a while loop are the same

• True

• False

A short sections of code written to complete a task. 

• Buffer

• Array

• Function

Int hold decemals numbers

• True

• False

What is FIFO?

• First in Few Out

• Few In Few out

• First In First Out

• Few In First Out

What dose this equation mean ? a != t

• A is assinged t

• A and t are equal

• A is not equal to t

• T is add to a

One loop inside the body of another loop is called 

• Loop in loop

• Nested

• Double loops

Which data structure uses LIFO?

• Array

• Int

• Stacks

• Queues

Entering Comments is a useless task, it will  not help in anyway.

• True

• False

A Syntax Error is ? 

• An error you will never find

• An error you find at the end when the program gives out a wrong value due to logic error

• An error caused by language rules being broken.

• An error due to user error

What command do you use to output data to the screen?

• Cin

• Cout>>

• Cout

• Output>>

Two main measures for the efficiency of an algorithm are

• Processor and memory

• Complexity and capacity

• Time and space

• Data and space

The time factor when determining the efficiency of algorithm is measured by

• Counting microseconds

• Counting the number of key operations

• Counting the number of statements

• Counting the kilobytes of algorithm

The space factor when determining the efficiency of algorithm is measured by

• Counting the maximum memory needed by the algorithm

• Counting the minimum memory needed by the algorithm

• Counting the average memory needed by the algorithm

• Counting the maximum disk space needed by the algorithm

Which of the following case does not exist in complexity theory

• Best case

• Worst case

• Average case

• Null case

The Worst case occur in linear search algorithm when

• Item is somewhere in the middle of the array

• Item is not in the array at all

• Item is the last element in the array

• Item is the last element in the array or is not there at all

The Average case occur in linear search algorithm

• When Item is somewhere in the middle of the array

• When Item is not in the array at all

• When Item is the last element in the array

• When Item is the last element in the array or is not there at all

The complexity of the average case of an algorithm is

• Much more complicated to analyze than that of worst case

• Much more simpler to analyze than that of worst case

• Sometimes more complicated and some other times simpler than that of worst case

• None or above

The complexity of linear search algorithm is

• O(n)

• O(log n)

• O(n2)

• O(n log n)

The complexity of Binary search algorithm is

• O(n)

• O(log )

• O(n2)

• O(n log n)

The complexity of Bubble sort algorithm is

• O(n)

• O(log n)

• O(n2)

• O(n log n)

The complexity of merge sort algorithm is

• O(n)

• O(log n)

• O(n2)

• O(n log n)

The indirect change of the values of a variable in one module by another module is called

• Internal change

• Inter-module change

• Side effect

• Side-module update

Which of the following data structure is not linear data structure?

• Arrays

• Linked lists

• Both of above

• None of above

Which of the following data structure is linear data structure?

• Trees

• Graphs

• Arrays

• None of above

The operation of processing each element in the list is known as

• Sorting

• Merging

• Inserting

• Traversal

Finding the location of the element with a given value is:

• Traversal

• Search

• Sort

• None of above

Arrays are best data structures

• For relatively permanent collections of data

• For the size of the structure and the data in the structure are constantly changing

• For both of above situation

• For none of above situation

Linked lists are best suited

• For relatively permanent collections of data

• for the size of the structure and the data in the structure are constantly changing

• For both of above situation

• For none of above situation

Each array declaration need not give, implicitly or explicitly, the information about

• The name of array

• the data type of array

• The first data from the set to be stored

• The index set of the array

The elements of an array are stored successively in memory cells because

• By this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

• the architecture of computer memory does not allow arrays to store other than serially

• Both of above

• None of above

Which four options describe the correct default values for array elements of the types indicated?

1. int -> 0
2. String -> "null"
3. Dog -> null
4. char -> '\u0000'
5. float -> 0.0f
6. boolean -> true

• 1,2,3,4

• 1,3,4,5

• 2,4,5,6

• 3,4,5,6

Which three are valid declarations of a char?

1. char c1 = 064770;
2. char c2 = 'face';
3. char c3 = 0xbeef;
4. char c4 = \u0022;
5. char c5 = '\iface';
6. char c6 = '\uface';

• 1,2,4

• 1,3,6

• 3,5

• 5 only

Public class Outer {     public void someOuterMethod()     {         //Line 5     }     public class Inner { }         public static void main(String[] argv)     {         Outer ot = new Outer();         //Line 10     } } Which of the following code fragments inserted, will allow to compile?

• New Inner(); //At line 5

• New Inner(); //At line 10

• New ot.Inner(); //At line 10

• New Outer.Inner(); //At line 10

Which cause a compiler error? (choose all that apply)

• Float[ ] f = new float(3);

• Float f2[ ] = new float[ ];

• Float[ ]f1 = new float[3];

• Float f3[ ] = new float[3];

Public class Runner {                 public static void main(String args[])                 {                     System.out.println(“This is a correct program”);                     continue;                 } } State True or False: The above program prints a output

• True

• False

What will be the output of the program? class Test {     public static void main(String [] args)     {         int x=20;         String sup = (x < 15) ? "small" : (x < 22)? "tiny" : "huge";         System.out.println(sup);     } }

• Small

• Tiny

• Huge

• Compilation fails

What will be the output of the program? class Bitwise {     public static void main(String [] args)     {         int x = 11 & 9;         int y = x ^ 3;         System.out.println( y | 12 );     } }

• 0

• 7

• 8

• 14

What will be the output of the program? public class X {     public static void main(String [] args)     {         try         {             badMethod();              System.out.print("A");         }          catch (Exception ex)         {             System.out.print("B");         }          finally         {             System.out.print("C");         }          System.out.print("D");     }      public static void badMethod() {} }

• AC

• BC

• ACD

• ABCD

Public void test(int x) {     int odd = 1;     if(odd) /* Line 4 */     {         System.out.println("odd");     }     else     {         System.out.println("even");     } } Which statement is true?

• Compilation fails

• "odd" will always be output.

• "even" will always be output.

• "odd" will be output for odd values of x, and "even" for even values.

try {     int x = 0;     int y = 5 / x; } catch (Exception e) {     System.out.println("Exception"); } catch (ArithmeticException ae) {     System.out.println(" Arithmetic Exception"); } System.out.println("finished");   State True or False: The output of the above code is the below Exception finished

• True

• False

Which collection class allows you to associate its elements with key values, and allows you to retrieve objects in FIFO (first-in, first-out) sequence?

• Java.util.ArrayList

• Java.util.LinkedHashMap

• Java.util.HashMap

• Java.util.TreeMap

/* Missing Statement ? */ public class foo {     public static void main(String[]args)throws Exception     {         java.io.PrintWriter out = new java.io.PrintWriter();         new java.io.OutputStreamWriter(System.out,true);         out.println("Hello");     } } What line of code should replace the missing statement to make this program compile?

• No statement required.

• Import java.io.*;

• Import java.io.PrintWriter;

• #include java.io.*;

Which of the following are Java reserved words?

• Constant

• Null

• Default

• Implement

State the below statement is not false about static nested class:  It’s variables and methods must be static

• True

• False

Class X implements Runnable {     public static void main(String args[])     {         /* Missing code? */     }     public void run() {} } Which of the following line of code is suitable to start a thread ?

• Thread t = new Thread(X);

• Thread t = new Thread(X); t.start();

• X run = new X(); Thread t = new Thread(run); t.start();

• Thread t = new Thread(); x.run();

Which three guarantee that a thread will leave the running state?

1. yield()
2. wait()
3. notify()
4. notifyAll()
5. sleep(1000)
6. aLiveThread.join()
7. Thread.killThread()

• 1,2 and 4

• 2,5 and 6

• 3,4 and 7

• 4,5 and 7