COL757: Difference between revisions
| [checked revision] | [checked revision] |
Prashantt492 (talk | contribs) Creating course page via bot |
Bot: wrap bare course codes in wikilinks |
||
| Line 4: | Line 4: | ||
| credits = 4 | | credits = 4 | ||
| credit_structure = 3-0-2 | | credit_structure = 3-0-2 | ||
| pre_requisites = COL351 OR Equivalent | | pre_requisites = [[COL351]] OR Equivalent | ||
| overlaps = | | overlaps = | ||
}} | }} | ||
Latest revision as of 16:26, 14 April 2026
| COL757 | |
|---|---|
| Model Centric Algorithm Design | |
| Credits | 4 |
| Structure | 3-0-2 |
| Pre-requisites | COL351 OR Equivalent |
| Overlaps | |
COL757 : Model Centric Algorithm Design
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.