40:56

Gini Impurity Index and Naive Bayes Classifier for Numerical Data - explained with examples

01:28:00

Naive Bayes Classifier for Categorical Data - explained with illustrative examples

02:34:51

Logistic Regression explained with examples - very illustrative

01:17:00

Linear Discriminant Analysis (LDA) explained with examples - very illustrative

02:21:03

Support Vector Machines Part 1 (explained with examples) - very illustrative

01:13:38

Support Vector Machines Part 3 (explained with examples) - very illustrative

01:38:49

Support Vector Machines Part 2 (explained with examples) - very illustrative

12:30

Explanation of the creation and working of two-dimensional arrays using pointers in C++

01:17:50

Longest Common Subsequence Problem - Dynamic Programming Algorithm

16:15

CSC 323 Sp'22 - Asg-2 - Desc - Improved Search Algorithm to Find 3-Element Tuples adding to a target

27:50

CSC 515 JSU Sp2022 Sequential Block Search Assignment

07:55

Diya 2-3 years

09:46

CSC228, Spring 2021 Assignment 1 Solution: Creating an array of list objects

52:51

CSC 228, Fall 2020 Intersession: 6.8 Binary Tree Traversals

45:12

Group Testing using Binary Search Approach

05:30

CSC 228, Fall 2020: Assignment 7 explanation

05:01

CSC 228, Fall 2020: Assignment 6 explanation

35:16

2.8 Eigenvectors based Community Detection

13:36

3.2 Eigenvector Centrality EVC Video 1

10:12

3.3 Eigenvector Centrality Video 2

08:04

3.4 Closeness Centrality

10:41

3.1 Centrality Metrics Introduction

54:30

CSC 228 Review Session #1, Friday Sep 18, for Exam 1

18:01

CSC 323, Fall 2020: 4.1 Introduction to Greedy Strategy of Algorithm Design

27:40

CSC 323, Fall 2020: 3.8 Local Minimum in a 2 D Array

13:57

CSC 323, Fall 2020: 4.3 Greedy Strategy: Activity Selection Problem

09:45

CSC 323, Fall 2020: 4.2 Greedy Strategy - Fractional Knapsack Problem

17:11

CSC 228, Fall 2020: 3.11 Prefix Expression Evaluation

31:11

CSC 228, Fall 2020: 3.9 Expression Evaluation Infix, Prefix and Postfix

12:21

CSC 228, Fall 2020: 3.10 Code for Post Fix Expression Evaluation

11:52

CSC 228, Fall 2020: 3.8 String Tokenization Code Example

29:34

CSC 323, Fall 2020: 3.7 Binary Search Local Min in a One-Dimensional array

26:39

CSC 323, Fall 2020: 3.6 Application of Binary Search for Unimodal Array

17:24

CSC 323, Fall 2020: 3.4 Monotonically decreasing function binary search Video 2

15:58

CSC 228, Fall 2020: 3.7 Parenthesis Balancing

04:14

CSC 323, Fall 2020: 3.5 Monotonically Increasing function binary search Practice Problem

15:17

CSC 228, Fall 2020: 3.6 String Process Video 2 Tokenization

15:59

CSC 228, Fall 2020: 3.4 Implementing Stack ADT Doubly Linked List Pop and Peek Operations

09:18

CSC 228, Fall 2020: 3.5 String Processing Video 1

32:51

CSC 641, Fall 2020: 2.7 Modularity Score Computation

21:45

CSC 641, Fall 2020: 2.3 Bipartivity Index

19:29

CSC 641, Fall 2020: 2.5 Algebraic Connectivity Video 1

22:22

CSC 641, Fall 2020: 2.4 Protein Folding Effectiveness using Estrada Index

14:14

CSC 641, Fall 2020: 2.6 Algebraic Connectivity Video 2

17:33

CSC 641, Fall 2020: 2.2 Spectral Radius Ratio for Node Degree

19:26

CSC 323, Fall 2020: 3.2 Binary search searching for a key

26:31

CSC 323, Fall 2020: 2.7 findMaxIndex Recursive Divide and Conquer Strategy

17:54

CSC 323, Fall 2020: 3.3 Searching for Threshold Value Monotonically Decreasing Function (Video 1)

25:04

CSC 228, Fall 2020: 3.3 Implementation of Stack ADT using Doubly Linked List Push operation

11:48

CSC 323, Fall 2020: 3.1 Introduction to Binary Search

20:35

CSC 228, Fall 2020: 3.2 Implementation of Stack ADT using a Singly Linked List

18:30

CSC 228, Fall 2020: 3.1 Implementation of Stack ADT using Dynamic Arrays

26:29

CSC 323, Fall 2020: 2.5 Merge Sort Algorithm Video 2

15:52

CSC 323, Fall 2020: 2.6 Counting the Number of Inversions and Finding the Inverted Pairs in an Array

37:05

CSC 228, Fall 2020: 2.13 Selection Sort and Finding the address of the node with the minimum data

27:30

CSC 228, Fall 2020: 2.14 Intro to Doubly Linked List

16:29

CSC 228, Fall 2020: 2.12 Inserting to a List at an Appropriate Location decided at run time

16:23

CSC 641, Fall 2020: 1.13 Average Path Length

40:22

CSC 641, Fall 2020: 1.12 Breadth First Search and its applications

38:52

CSC 641, Fall 2020: 2.1 Introduction to Eigenvalues and Eigenvectors