Scribd
Upload
67 views1 page

CS8451 - Daa-Ct-1

This document contains a class test for a Design and Analysis of Algorithms course. The test has two parts: Part A contains 20 multiple choice questions worth 2 marks each about key concepts related to algorithm analysis. Part B is longer form questions worth 5 marks each. Key concepts assessed include algorithm efficiencies, order of growth, O, Ω, and θ notations, classical geometric problems, important problem types, and definitions of algorithm, pseudocode, worst-case efficiency, algorithm visualization, best-case efficiency, and amortized efficiency. The test is 50 minutes long and worth a total of 40 marks.

Uploaded by

vivek
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
67 views1 page

CS8451 - Daa-Ct-1

This document contains a class test for a Design and Analysis of Algorithms course. The test has two parts: Part A contains 20 multiple choice questions worth 2 marks each about key concepts related to algorithm analysis. Part B is longer form questions worth 5 marks each. Key concepts assessed include algorithm efficiencies, order of growth, O, Ω, and θ notations, classical geometric problems, important problem types, and definitions of algorithm, pseudocode, worst-case efficiency, algorithm visualization, best-case efficiency, and amortized efficiency. The test is 50 minutes long and worth a total of 40 marks.

Uploaded by

vivek
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING


CLASS TEST - 1
CS8451- DESIGN AND ANALYSIS OF ALGORITHMS
Year : II Date :
Semester : IV Duration: 50 minutes
Max. Marks : 40 marks
Answer ALL questions
PART A − ( 10 x 2 = 20 marks )
1. What are the types of algorithm efficiencies?
(CO 1)
2. What is meant by order of growth? (CO 1)

3. Define  O-notation (CO 1)

4. Define  Ω-notation (CO 1)

5. What are the classical geometric problems? (CO 1)

6. Mention the important problem types. (CO 1)

7. What is an algorithm? (CO 1)


8. Give the diagram representation of Notion of algorithm. (CO 1)
9. What is meant by algorithmic? (CO 1)
10. What is meant by amortized efficiency? (CO 1)
11. What is the running time of a program implementing the algorithm? (CO 1)
12. What is the formula used in Euclid’s algorithm for finding the Greatest Common Divisor of two numbers? (CO 1)
13. What is meant by pseudocode? (CO 1)
14. What is meant by worst-case efficiency? (CO 1)
15. What is meant by algorithm visualization? (CO 1)
16. What are the two variations of algorithm visualization? (CO 1)
17. What are the fundamental steps involved in algorithmic problem solving? (CO 1)
18. What is the basic operation of an algorithm and how is it identified? (CO 1)
19. What is meant by best-case efficiency? (CO 1)
20. Define  θ-notation (CO 1)

Prepared By Approved By
Principal

You might also like