Scribd
Upload
58 views

Question Bank

The document contains 15 questions related to algorithms and problem solving. The questions cover topics such as characteristics of good algorithms, defining algorithms, algorithm complexities, the evolution and importance of algorithms, improving algorithm efficiency, ensuring algorithm correctness, measuring algorithm efficiency, solving problems using computers, comparing iterative and recursive processes, loop invariant methods, algorithm design techniques and issues related to iterative algorithm design. The questions range from 5-6 marks and are part of the Design and Analysis of Algorithms course at Sinhgad Institute of Technology, Lonavala.

Uploaded by

djalok190109
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
58 views

Question Bank

The document contains 15 questions related to algorithms and problem solving. The questions cover topics such as characteristics of good algorithms, defining algorithms, algorithm complexities, the evolution and importance of algorithms, improving algorithm efficiency, ensuring algorithm correctness, measuring algorithm efficiency, solving problems using computers, comparing iterative and recursive processes, loop invariant methods, algorithm design techniques and issues related to iterative algorithm design. The questions range from 5-6 marks and are part of the Design and Analysis of Algorithms course at Sinhgad Institute of Technology, Lonavala.

Uploaded by

djalok190109
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Sinhgad Technical Education Society’s

SINHGAD INSTITUTE OF TECHNOLOGY, LONAVALA


(Affiliated to Savitribai Phule Pune University and Approved by AICTE, New Delhi)
Accredited by NAAC with Grade “A”
Department of Computer Engineering

Design and Analysis of Algorithms

UNIT - I: Algorithms and Problem Solving

Theory Questions

Sr. No. Questions Marks


1. Explain characteristics of good algorithm? List out the problems solved by 5
the Algorithm.
2. How will you define an Algorithm? Write a short note on algorithm 5
complexities?
3. Write a short note on algorithm as a technology with example? 5
4. Write a short note on the evolution of Algorithm. 5
5. Explain role of algorithm in computing with example or Explain the 5
importance of algorithm in computing with example?
6. Explain different means of improving efficiency of Algorithm. 5
7. Why correctness of Algorithm is important or essential. Explain with
example?
8. How to confirm the correctness of Algorithm? Explain with example 5

9. How can you measure and increase the efficiency of an Algorithm? 5


10. What are the steps to solve a problem using a computer? 6
11. Contrast and compare between iterative and recursive process with an 6
example
12. Explain Loop Invariant method with example. 5
13. Discuss different ways of algorithm design with suitable example? 5
14. Discuss different algorithm design techniques with suitable example? 5
15. Explain issues related to iterative algorithm design. 5

Course In charge:
Ms. Rupali S. Shishupal

Dept Tel. : +91 2114-673490, 491 Office : 02114-673355, 356 Email : [email protected] Website : sit.sinhgad.edu

You might also like