Jump to content

COL757

From IITD Wiki
Revision as of 10:00, 4 March 2026 by Prashantt492 (talk | contribs) (Creating course page via bot)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
COL757
Model Centric Algorithm Design
Credits 4
Structure 3-0-2
Pre-requisites COL351 OR Equivalent
Overlaps

COL757 : Model Centric Algorithm Design

[edit]

The RAM model and its limitations, Introduction to alternate algorithmic models Parallel models like PRAM and Interconnection networks; Basic problems like Sorting, Merging, Routing, Parallel Prefix and applications, graph algorithms like BFS, Matching Memory hierarchy models; Caching, Sorting, Merging, FFT, Permutation, Lower bounds Data Structures - searching, Priority queues Streaming Data models: Distinct items, frequent items, frequency moments, estimating norms, clustering On line algorithms: competitive ratio, list accessing, paging, k-server, load-balancing, lower-bounds.