DAA-Quiz1

DAA-Quiz1

University

20 Qs

quiz-placeholder

Similar activities

Chapter 8. Securing Network Media and Devices

Chapter 8. Securing Network Media and Devices

University

20 Qs

basisdata1

basisdata1

University

20 Qs

After Effect Intoduction

After Effect Intoduction

10th Grade - University

15 Qs

Closing entries

Closing entries

University

20 Qs

SQL Quiz

SQL Quiz

University

18 Qs

Jira

Jira

University

15 Qs

switch case

switch case

University

17 Qs

business 1.4 revision

business 1.4 revision

KG - Professional Development

20 Qs

DAA-Quiz1

DAA-Quiz1

Assessment

Quiz

Computers

University

Practice Problem

Medium

Created by

Satyavathi N

Used 39+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

20 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

........................... , ........................ and ...........................are the different ways in which an algorithm can be specified.

Asymptotic Notations, Flowchart, Pseudocode

English like statements, Flowchart, Pseudocode

English like statements,Sets, Pseudsocode

None of the above

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Algorithm can be represented graphically using...........................

barchart

Graph

Pie chart

Flowchart

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

...............................is defined as step by step procedure for solving a particular problem

Space complexity

Time complexity

Performance Analysis

Algorithm

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

An Algorithm's performance an be analysed by using............................

Time complexity

Space Complexity

Number of inputs

Time and space complexity

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

..............................is defined as the amount of Computer time required to complete the execution of a program/problem

Space Complexity

Time complexity

CPU Time

None of these

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Upper bound running time complexity of an algorithm is also called as.....................

Best case time complexity

Worst case time complexity

Average case time complexity

None of these

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

.......................is the amount of computer memory required to the execute the program /problem.

Time complexity

Space complexty

Memory complexity

None of these

Create a free account and access millions of resources

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?