A Level Design and Analysis of Algorithm Quiz 1

15 Questions

Quiz Description

In this quiz, we will be looking at designing and analyzing algorithms. As the name says, this quiz helps to design the algorithms for solving different types of problems in Computer Science. Also, before developing the code for a program, design, and analysis of the logic on how the program will work is very much important. This quiz will therefore ensure that you are thorough before actually designing an algorithm for a particular purpose.

An algorithm, to begin with, is a set of well-structured instructions that are aimed at carrying out a particular task, and the Design and Analysis of an Algorithm is very important for designing an algorithm capable of solving different types of problems in the branch of computer science and information technology as a whole. There are also Maths problems that can only be solved through this means.

Analysis has to do with the determination of time and amount of space needed for an algorithm to be executed while design deals with the structuring of the algorithm.

This quiz is therefore a to-do quiz that will prepare you for an exam and also teach you that before writing an algorithm, design and analysis are very important steps, to begin with. More quizzes on Computer Science are available on our website
Best luck!. 

1:

 Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4?

 f1(n) = 2^n

 f2(n) = n^(3/2)

 f3(n) = nLogn

 f4(n) = n^(Logn) 

Select one:


Correct
  • 1:
    f3, f2, f1, f4
  • 2:
    f2, f3, f1, f4
  • 3:
    f2, f3, f4, f1
  • 4:
    f3, f2, f4, f1 Correct
2:

 What is the Steps of Divide and Conquer approach


Correct
  • 1:
    Divide, Conquer and Combine
  • 2:
    Combine, Conquer and Divide
  • 3:
    Combine, Divide and Conquer
  • 4:
    Divide, Combine and Conquer
3:

 The complexity of searching an element from a set of n elements using Binary search algorithm is


Correct
  • 1:
    O(n log n)
  • 2:
    O(log n)
  • 3:
    O(n2)
  • 4:
    O(n)
4:

There are ______steps to solve the problem


Correct
  • 1:
    Seven.
  • 2:
    Four
  • 3:
    Six
  • 4:
    Two
5:

 ______is the first step in solving the problem


Correct
  • 1:
    Understanding the Problem
  • 2:
    Identify the Problem
  • 3:
    Evaluate the Solution
  • 4:
    None of these
6:

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


Correct
  • 1:
    describing the problem
  • 2:
    finding out the cost of the software
  • 3:
    writing the computer instructions
  • 4:
    testing the solution
7:

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


Correct
  • 1:
    system software #
  • 2:
    artificial intelligence
  • 3:
    real time software
  • 4:
    none of these
8:

 The true and false values represent __________


Correct
  • 1:
    logical data
  • 2:
    alphanumeric data
  • 3:
    character data
  • 4:
    numeric data
9:

 The following operator distinguishes equation from expression 


Correct
  • 1:
    +, -, *, / B.
  • 2:
    < or >
  • 3:
    Logical operator
  • 4:
    Assignment Operator
10:

Which of the following are called logical operators


Correct
  • 1:
    +, -, *, /
  • 2:
  • 3:
    AND, OR, NOT
  • 4:
    . \, MOD
11:

The hierarchy of operations is denoted as _____________.

I. +, -

II. Power

III. *, /

IV. \, MOD


Correct
  • 1:
    I, II, III, IV
  • 2:
    II, IV, III, I
  • 3:
    IV, I, III, II
  • 4:
    II, III, IV, I
12:

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


Correct
  • 1:
    1
  • 2:
    5
  • 3:
    10
  • 4:
    24
13:

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


Correct
  • 1:
    False
  • 2:
    True
  • 3:
    6
  • 4:
    7
14:

An employee came in to work and clocked in at Morning In, 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.


Correct
  • 1:
    WorkingHrs = (12 - (MorningIn+NoonOut1) + (NoonOut2-NoonIn))
  • 2:
    WorkingHrs = (12 – MorningIn + (NoonOut1-12.00) + (NoonOut2-NoonIn))
  • 3:
    WorkingHrs = (12 – MorningIn) + (NoonOut1-12.00)-(NoonOut2-NoonIn))
  • 4:
    WorkingHrs = (MorningIn+NoonIn) + (12.00-NoonOut2) Answer:- B
15:

The IPO stands for


Correct
  • 1:
    Input Programming Option
  • 2:
    Input Programming Output
  • 3:
    Input Processing Output
  • 4:
    Input Operating Operation

Feature Image

A Level Design and Analysis of Algorithm Quiz 1