CIS212&L: Algorithm

This course will discuss about various algorithms and delve into time complexity
Category:

Computing and Information System

Price:
free
Total Duration:
216:16
Language:
English
Review : 0

Description

Learning Outcome:


- This course provides students with the ability to design and understand algorithms.

- We also delve into the time complexity of the algorithms.

- The students will also learn to code according to algorithms.

Show more
Time Complexity Slide |
Merge Sort |
Quick Sort
Quick Sort (Class Clipping) |
Lecture Video on BFS
BFS (Class Clipping) |
BFS Pseudocode Jam |
Lecture Video on DFS
DFS (Class Clipping) |
DFS Pseudocode |
Topological Sort |
Strongly Connected Component |
MST Introduction & Kruskal's Algorithm |
Prim's Algorithm |
Dijkstra's Algorithm |
Coin Change Algorithm |
Longest Common Subsequence |
0/1 KnapSack |
Homework -> KnapSack |
Hashing (Slide) |
Hashing Practice |
Lab Task 1: Bubble Sort Implementation |
Lab Task 2: Quick Sort Implementation |
Lab Task 3: BFS Implementation |
Lab Task 4: DFS Implementation |

_CIS_Nazmus Sakib Akash

Email : sakib.cis0021c@diu.edu.bd


CIS213: Algorithm

[Closed]
0
28 নভেম্বর 2020, by
Minhajur Rahman
 | 0 Answers | 153 Views
Ask a Question