- Design and Analysis of Algorithms Syllabus
Design and Analysis of Algorithms introduces basic elements of the design and analysis of computer algorithms. Topics include asymptotic notations and analysis, divide and conquer strategy, greedy methods, dynamic programming, basic graph algorithms, NP-completeness, and approximation algorithms. For each topic, beside in-depth coverage, one or more representative problems and their algorithms shall be discussed.
The major objectives of this course are:
The notes have been prepared by our talented and qualified contributors.
It was very difficult to find proper notes and updated website of B.Sc. CSIT while I was studying. Hence, I decided to build a modern and responsive website with upto-date contents. I planned to team up with lecturers, CSIT students and graduates to provide best and updated notes for B.Sc. CSIT students.
Being a lecturer at different CSIT and Engineering colleges, I prepare reference materials for the lecture. I noticed one of my students developed CSIT Tutor to enable free and easy access to the reference materials of B.Sc. CSIT. I regularly provide the references and contents that I prepare for the lectures of B.Sc CSIT.
I felt shortage of better and exam oriented notes based on the revised syllabus. Therefore, I prepared the notes for all CSIT students. Almost all students from private and government CSIT colleges of Nepal study my notes each year. I am getting best reviews for my notes. I have worked hard while preparing these notes.