Computer Application and Data Processing-Basics of Programming [ISS (Statistical Services) Statistics Paper I (New 2016 MCQ Pattern)]: Questions 1 - 6 of 108

Access detailed explanations (illustrated with images and videos) to 472 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. Unlimited Access, Unlimited Time, on Unlimited Devices!

View Sample Explanation or View Features.

Rs. 300.00 -OR-

How to register? Already Subscribed?

Question 1

Question

MCQ▾

The part of algorithm which is repeated any number of times is called

Choices

Choice (4)Response

a.

Infinite Loop

b.

Iteration

c.

Recursion

d.

Question does not provide sufficient data or is vague

Question 2

Basics of Programming
Algorithm

Question

MCQ▾

Worst case time complexity of Quicksort algorithm is

Choices

Choice (4)Response

a.

O (nlgn)

b.

Θ (n2)

c.

Θ (nlgn)

d.

o (nlgn)

Question 3

Basics of Programming
Functions

Question

MCQ▾

Determine the output of the following program:

  1. main () {
  2.     inti =abc(10);
  3.     printf(" %d", --i);
  4. }
  5. intabcinti
  6. {
  7.     return (i++);
  8. }

Choices

Choice (4)Response

a.

9

b.

10

c.

11

d.

None of the above

Question 4

Basics of Programming
Flowchart

Question

MCQ▾

Consider the following flowchart. What value will it display?

Understanding the Loop in this Flowchart

Choices

Choice (4)Response

a.

2

b.

No value is displayed

c.

0

d.

1

Question 5

Basics of Programming
Flowchart

Question

MCQ▾

QuickSort algorithm have following as a pivot:

Choices

Choice (4)Response

a.

Always pick first element as pivot.

b.

Pick a random element as pivot.

c.

Always pick last element as pivot (implemented below) .

d.

All a., b. and c. are correct

Question 6

Basics of Programming
Algorithm

Question

MCQ▾

Find the order of following algorithm where N is a natural number and z, y, x are variables:

  1. for(z=0;z<NN;z++) {
  2.     for(y=0;y<N+2;y++) {
  3.         for(x=0;x<N/2;x++) {
  4.             do_work( x,y,z );
  5.         }
  6.     }
  7. }

Choices

Choice (4)Response

a.

o ()

b.

O ()

c.

o ()

d.

O ()

Developed by: