Scribd
Upload
144 views

CS 310 Algorithms - Fall 2022 (12746)

This document provides information about the CS 310 - Algorithms course offered at Lahore University of Management Sciences in Fall 2022. It outlines the instructor, teaching assistants, course structure including credit hours and meeting times, prerequisites, grading breakdown, and an overview of topics to be covered each week. The course will cover fundamental algorithm design techniques like greedy approaches, divide and conquer, dynamic programming, network flow, and randomized algorithms.

Uploaded by

YUH 2020
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
144 views

CS 310 Algorithms - Fall 2022 (12746)

This document provides information about the CS 310 - Algorithms course offered at Lahore University of Management Sciences in Fall 2022. It outlines the instructor, teaching assistants, course structure including credit hours and meeting times, prerequisites, grading breakdown, and an overview of topics to be covered each week. The course will cover fundamental algorithm design techniques like greedy approaches, divide and conquer, dynamic programming, network flow, and randomized algorithms.

Uploaded by

YUH 2020
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Lahore University of Management Sciences

CS 310 – Algorithms
Fall 2022

Instructor Junaid Haroon Siddiqui


Office Hours TBD
Email [email protected]
TA Raffay Atiq <[email protected]>; Ahsan Amin <[email protected]>
TA Office Hours TBD

Course Basics
Credit Hours 3
Lecture(s) Nbr of Lec(s) Per Week 2 Duration 75m
Recitation/Lab (per week) Nbr of Lec(s) Per Week Duration
Tutorial (per week) Nbr of Lec(s) Per Week Duration

COURSE DESCRIPTION
In this course, we will study the design and analysis of efficient algorithms. The focus will be on fundamental design techniques such as greedy
approaches, divide and conquer, dynamic programming, network flow, and randomized algorithms. We will study measuring program
performance using asymptotic notation.

COURSE PREREQUISITE(S)

• Discrete Math

Grading Breakup and Policy

Assignment(s): 20%
Exam 1: 20%
Exam 2: 20%
Final: 40%

Textbook(s)/Supplementary Readings

Algorithm Design by Kleinberg, Jon and Tardos, Eva


Lahore University of Management Sciences
COURSE OVERVIEW
Recommended
Week Topics
Readings

1/2 Introduction
Asymptotic growth
3
Graphs
4/5
Greedy Algorithms
6/7
Divide and Conquer
8/9/10
Dynamic Programming
11/12
Network Flow
13/14
NP Completeness

You might also like