computer architecture

NOC Design and Analysis of Algorithms

Course Description

This course covers topics on motivation,Asymptotic complexity,binary search,Sorting,Graphs,Dijkstra algorithm,Priority queues, heaps,Search Trees,Dynamic Programming & Intractability.

Course Objective

This course covers topics on motivation-Asymptotic complexity-binary search-Sorting-Graphs-Dijkstra algorithm-Priority queues- heaps-Search Trees-Dynamic Programming and Intractability.

Ask a Question

My Questions

Comment