A Level Design and Analysis of Algorithm Quiz 1

15 QuestionsMultiple ChoiceFree Practice

About this quiz

This A Level Design and Analysis of Algorithm Quiz 1 quiz contains 15 multiple choice questions designed to help you revise and test your A Level Design and Analysis of Algorithms Quizzes knowledge. Select an answer for each question and click “Submit Answer” to see instant feedback. Take your time and try to score as high as possible!

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

Progress0 / 15 answered
1

Question 1 of 15

 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:

2

Question 2 of 15

 What is the Steps of Divide and Conquer approach

3

Question 3 of 15

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

4

Question 4 of 15

There are ______steps to solve the problem

5

Question 5 of 15

 ______is the first step in solving the problem

6

Question 6 of 15

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

7

Question 7 of 15

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

8

Question 8 of 15

 The true and false values represent __________

9

Question 9 of 15

 The following operator distinguishes equation from expression 

10

Question 10 of 15

Which of the following are called logical operators

11

Question 11 of 15

The hierarchy of operations is denoted as _____________.

I. +, -

II. Power

III. *, /

IV. \, MOD

12

Question 12 of 15

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

13

Question 13 of 15

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

14

Question 14 of 15

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.

15

Question 15 of 15

The IPO stands for