PTU Syllabus | CS – 307 DESIGN AND ANALYSIS OF ALGORITHMS
CS – 307 DESIGN AND ANALYSIS OF ALGORITHMS
PREREQUISITES: Discrete Structures and Data Structures.
OBJECTIVES:
Date Structures are an integral part of algorithm design and Discrete Structures covers topics like graph theory.
COURSE CONTENTS:
Models of computation. Algorithm analysis, order arithmetic, time and space complexities and average and worst case analysis, lower bounds. [L-8]
Algorithm design techniques: divide and conquer, search and traversals. Dynamic programming. Backtracking. Branch and bound. [L-16]