Skip to content
Hyper Learning Tech Official Logo
Hyper Learning

AI-Powered Learning Platform

Subject Syllabus

CY-502 - Design & Analysis of Algorithms

CSCY · Semester 5

Course Modules

Learn topic-wise with Hyper AI and revise using mapped PYQs.

Definitions of algorithms and complexityTime and Space ComplexityTime space tradeoffvarious bounds on complexityAsymptotic notationRecurrences and Recurrences solving techniquesIntroduction to divide and conquer techniqueexample: binary search, merge sort, quick sort, heap sort, strassen's matrix multiplication etcCode tuning techniques: Loop Optimization, Data Transfer Optimization, Logic Optimization, etc
Greedy Algorithms: strategyexamples of greedy method like optimal merge patternsHuffman codingminimum spanning treesknapsack problemjob sequencing with deadlinessingle source shortest path algorithm etcCorrectness proof of Greedy algorithms
Dynamic programming: characteristicsproblems based on dynamic programming such as 0/1 knapsackmultistage graphreliability designFloyd-Warshall algorithm etc
Backtracking: concept and its examples like 8 queen's problemHamiltonian cycleGraph colouring problem etcIntroduction to branch & bound methodexamples of branch and bound method like travelling salesman problem etcMeaning of lower bound theory and its use in solving algebraic problemintroduction to parallel algorithms
Advanced tree and graph algorithmsNP-hard and NP-complete problemsApproximations AlgorithmsData Stream AlgorithmsIntroduction to design and complexity of Parallel Algorithms