DAA-Quiz1

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

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

• barchart

• Graph

• Pie chart

• Flowchart

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

• Space complexity

• Time complexity

• Performance Analysis

• Algorithm

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

• Time complexity

• Space Complexity

• Number of inputs

• Time and space complexity

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

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

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

• Time complexity

• Space complexty

• Memory complexity

• None of these

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

• Best case time complexty

• Worst case time complexity

• Average case time complexity

• None of these

............................Notation is used to represent strict upper bound running time complexity of an algotihm

• Big-oh

• Big-Omega

• Theta

• None of these

............................Notation is used to represent strict lower bound running time complexity of an algorithm.

• Big-Oh

• Big-Omega

• Theta

• None of these