Prerequisite: CSC111, CSC211, CSC313.
Course Content: concept of algorithms. Efficient algorithm/complexity. NP
– Complete problem. Practical analysis of sorting
algorithm (Sequential searching, Binary search, Selection
of Sorting algorithm, etc). Recursive algorithms.
Practical Section: Pascal, Basic, Visual Basic, Java, C# Programming
Course Duration/Regulation: this course shall be covered within 15 weeks of 3 hours in
a semester. The overall assessment shall be on the basis of
continuous assessment (CA) and theoretical exam.