Design and Analysis of Algorithms MCQ Set-1

1. There are ______steps to solve the problem

A. Seven

B. Four

C. Six

D. Two

2. ______is the first step in solving the problem

A. Understanding the Problem

B. Identify the Problem

C. Evaluate the Solution

D. None of these

3. ______is the last step in solving the problem

A. Understanding the Problem

B. Identify the Problem

C. Evaluate the Solution

D. None of these

4. Following is true for understanding of a problem

A. Knowing the knowledgebase

B. Understanding the subject on which the problem is based

C. Communication with the client

D. All of the above

5. The six-step solution for the problem can be applied to

I. Problems with Algorithmic Solution

II. Problems with Heuristic Solution

A. Only I

B. Only II

C. Both I and II

D. Neither I nor II

6. ______ solution requires reasoning built on knowledge and experience

A. Algorithmic Solution

B. Heuristic Solution

C. Random Solution

D. None of these

7. While solving the problem with computer the most difficult step is __________.

A. describing the problem

B. finding out the cost of the software

C. writing the computer instructions

D. testing the solution

8. The correctness and appropriateness of ___________solution can be checked very easily.

A. algorithmic solution

B. heuristic solution

C. random solution

D. none of these

9. The branch of computer that deals with heuristic types of problem is called _________________.

A. system software

B. real time software

C. artificial intelligence

D. none of these

10. Artificial Intelligence makes use of following prominently

A. Database

B. Data Warehouse

C. Knowledge base

D. None of these

11. Naming convention for variable is followed in company because ____________.

A. it enhances readability

B. it allows to work without conflicts

C. it enhances the efficiency

D. all of the above

12. The true and false values represent __________.

A. logical data

B. numeric data

C. character data

D. alphanumeric data

13. Following operator distinguishes equation from expression

A. +, -, *, /

B. < or >

C. Logical operators

D. Assignment Operator

14. Following are called logical operators

A. +, -, *, /

B. <, >, <=, >=

C. AND, OR, NOT

D. \, MOD

15. The hierarchy of operations is denoted as _____________.

I. +, -

II. Power

III. *, /

IV. \, MOD

A. I, II, III, IV

B. II, IV, III, I

C. IV, I, III, II

D. II, III, IV, I

16. The hierarchy of operations is denoted as _____________.

I. +, -

II. Power

III. *, /

IV. \, MOD

A. I, II, III, IV

B. II, IV, III, I

C. IV, I, III, II

D. II, III, IV, I

17. Evaluate 5*(x+y)-4*y/(z+6) where x = 2, y = 3, and z = 6

A. 1

B. 24

C. 5

D. 10

18. Evaluate a-2>b where a=6, b = 8

A. False

B. True

C. 6

D. 7

19. Evaluate for a = 5, b = 4, c = 3, d = 12 for the equation E = a*b+d/c

A. 40

B. 24

C. 10

D. 10.66

20. Evaluate for the equation e = 5*a\d*(b+1) where a = 5, b = 4, c = 3, d = 12

A. 10

B. 24

C. 0

D. 10

21. Evaluate for the following A = TRUE, B = FALSE, C = FALSE

i. R = NOT ( A OR B ) AND NOT (B OR C)

ii. R = B AND NOT ( A OR C ) OR NOT (B AND C)

A. i is true and ii is true

B. i is true and ii is false

C. i is false and ii is true

D. i is false and ii is false

22. An employee came in to work and clocked in at MorningIn, clocked out at NoonOut1 for lunch, clocked back in at NoonIn, and clocked out to home at NoonOut2. Set up equation to calculate the number of hours worked for the day.

A. WorkingHrs = (12 - (MorningIn+NoonOut1) + (NoonOut2-NoonIn))

B. WorkingHrs = (12 – MorningIn + (NoonOut1-12.00) + (NoonOut2-NoonIn))

C. WorkingHrs = (12 – MorningIn) + (NoonOut1-12.00)-(NoonOut2-NoonIn))

D. WorkingHrs = (MorningIn+NoonIn) + (12.00-NoonOut2)

23. A large department store has its own charge card. The policy for a customer to charge an item is that the customer must have a valid charge card and either a balance of less than Rs.500 or a charge of less than Rs.50.

A. ChargeCard AND (Balance < 500 OR Amount < 50)

B. ChargeCard OR (Balance < 500 AND Amount < 50)

C. ChargeCard OR (Balance < 500 OR Amount < 50)

D. ChargeCard AND (Balance < 500 AND Amount < 50)

24. Consider the use of PAC for obtaining the solution for converting distance in Miles to Kilometers. The use of formula “Kilometers = 1.609* Miles” will be in 

A. given data section

B. required result section

C. processing required section

D. solution alternative section

25. The PAC stands for

A. Program Analysis Chart

B. Problem Algorithm Code

C. Problem Access Code

D. Problem Analysis Chart

26. In interactivity chart the darkened circle indicates _______________.

A. duplicate module

B. loop

C. decision

D. no special meaning

27. In interactivity chart the diamond indicates _______________.

A. duplicate module

B. loop

C. decision

D. no special meaning

28. The interactivity chart is also known as __________________.

A. IPO Chart

B. Problem Analysis Chart

C. flow chart

D. structure chart

29. The IPO stands for

A. Input Programming Option

B. Input Programming Output

C. Input Processing Output

D. Input Operating Operation

30. The difference between /, \ and MOD operator is

A. \ Integer Division, / Division and MOD Modulo Division

B. / Division, \ escape sequence, MOD remainder

C. / Division, \ not an operator, MOD is module

D. \ Division /Integer Division, MOD is Modulo Division

31. The help menus or user manuals are the part of ______________.

A. Program

B. Algorithm

C. Internal Documentation

D. External Documentation

32. The main measure for efficiency algorithm are-

A. Processor and Memory

B. Complexity and Capacity

C. Data and Space

D. Time and space

33. What does the algorithmic analysis count?

A. The number of arithmetic and the operations that are required to run the program

B. The number of lines required by the program

C. The number of seconds required by the program to execute

D. None of these

34. Examples of O(1) algorithms are______________.

A. Multiplying two numbers.

B. assigning some value to a variable

C. displaying some integer on console

D. All of the above

35. Examples of O(n2) algorithms are______________.

A. Adding of two Matrices

B. Initializing all elements of matrix by zero

C. Both A and B

D. Neither A nor B

36. The complexity of three algorithms is given as: O(n), O(n2) and O(n3). Which should execute slowest for large value of n?

A. O(n)

B. O(n2)

C. O(n3)

D. All will execute in same time.

37. There are four algorithms A1, A2, A3, A4 to solve the given problem with the order log(n), nlog(n), log(log(n))n/log(n), Which is the best algorithm.

A. A1

B. A2

C. A3

D. A4

38. Express the formula (n-1)*(n-5) in terms of big Oh notation

A. O(1)

B. O(log n)

C. O(n)

D. O(n2)

39. The time complexity of binary search is________.

A. O(1)

B. O(log n)

C. O(n)

D. O(n logn)

40. The time complexity of linear search is________.

A. O(1)

B. O(log n)

C. O(n)

D. O(n logn)

41. In quick sort, the number of partitions into which the file of size n is divided by a selected record is

a. n

b. n - 1

c. 2

d. n/2

42. A sort technique is said to be stable when the original relative order of records with equal keys are retained after sorting.

A. True

B. False

43. The three factors contributing to the sort efficiency considerations are the efficiency in coding, machine run time and the space requirement for running the procedure.

A. True

B. False

44. How many passes are required to sort a file of size n by bubble sort method?

A. N2

B. N

C. N-1

D. N/2