CS2700 Programming and Data Structures | Lec 1 | Introduction

(1:3:6)

CS2700 Programming and Data Structures | Lec 54 | Exam solutions

(30:45)

CS2700 Programming and Data Structures | Lec 9 | Proof rules: summary and examples

(21:33)

CS2700 Programming and Data Structures | Lec 4 | Proof rules for different types of statements

(17:17)

CS2700 Programming and Data Structures | Lec 10 | Analysis of algorithms – Introduction

(23:32)

CS2700 Programming and Data Structures | Lec 7 | Proof rules for repeat–until, program termination

(34:53)

CS2700 Programming and Data Structures | Lec 59 | Graphs: Applications and terminology

(19:46)

CS2700 Programming and Data Structures | Lec 17 | Abstract data type

(22:14)

CS2700 Programming and Data Structures | Lec 5 | Proof rules for alternative statements

(24:)

CS2700 Programming and Data Structures | Lec 61 | Road networks as graphs, graph coloring– part 1

(15:58)

CS2700 Programming and Data Structures | Lec 3 | Proofs of correctness of programs, summary

(1:48)

CS2700 Programming and Data Structures | Lec 47 | Implementation of heap

(5:35)

CS2700 Programming and Data Structures | Lec 13 | Analysis of recusive algorithms

(14:27)

CS2700 Programming and Data Structures | Lec 8 | Proof rules for program termination

(11:35)

CS2700 Programming and Data Structures | Lec 11 | Time complexity: asymptotic notations – part 1

(19:17)

CS2700 Programming and Data Structures | Lec 48 | Binary Search tree

(33:7)

CS2700 Programming and Data Structures | Lec 15 | Space complexity of algorithms – part 1

(30:35)