Design and Analysis of Algorithms

An Algorithm is a sequence of steps to solve a problem. Design and Analysis of Algorithm is very important for designing algorithm to solve different types of problems in the branch of computer science and information technology. This tutorial introduces the fundamental concepts of Designing Strategies, Complexity analysis of Algorithms, followed by problems on Graph Theory and Sorting methods. This tutorial also includes the basic concepts on Complexity theory.

NOC:Design and pedagogy of the introduct..

College level computer programming is difficult to teach. Failure rates in programming courses are high worldwide, and in India it is noted that students are not able to write simple programs despite completing degrees in computer science. This course will consider the following questions. • How do you design the syllabus for an introductory programming course? • How do you teach it so that it captures the attention of students? • How do you design examinations, and programming assignments which are fair and encourage students to learn in the desired manner? We will sketch out a course design, and strategies for teaching the course. It will use the C++ languages, but most ideas will be independent of the language.