10:30

INTRODUCTION TO BRANCH AND BOUND || CHARACTERISTICS & APPLICATIONS OF BnB || DAA

18:07

GRAPH COLOURING PROBLEM USING BACKTRACKING WITH EXAMPLE || BACKTRACKING || DAA

19:21

HAMILTONIAN CYCLE PROBLEM USING BACKTRACKING WITH EXAMPLE || PROCEDURE || DAA

12:11

Downloading and Installation of Ubuntu Linux in Windows Environment || Installation of UBUNTU Linux

21:08

SUM OF SUBSET PROBLEM USING BACKTRACKING WITH EXAMPLE || DESIGN AND ANALYSIS OF ALGORITHMS || DAA

02:10:17

SCHEDULING ALGORITHMS IN OPERATING SYSTEM || FCFS || SJF || PRIORITY SCHEDULING || ROUND ROBIN || OS

07:34

How to Download and Install GIT - DevOps Tool || Global Information Tacker || DevOps Tools

27:14

N-Queens Problem using Backtracking || 4-Queens Problem || BACKTRACKING || DAA

17:03

INTRODUCTION TO BACKTRACKING || APPLICATIONS || STATE SPACE TREE || DAA

11:58

BFS - BREADTH FIRST SEARCH || GRAPH TRAVERSALS || DAA

13:40

DFS - DEPTH FIRST SEARCH || GRAPH TRAVERSALS || DAA

18:56

INTRODUCTION TO GRAPHS IN DAA || GRAPH TERMINOLOGY || TYPES OF GRAPHS || DAA

16:35

Multistage Graph || Backward approach in Multistage Graph with Example || Dynamic Programming || DAA

19:07

Example on Multistage Graph || Forward approach in Multistage Graph || Dynamic Programming || DAA

24:49

Multistage Graph || Forward approach in Multistage Graph with Example || Dynamic Programming || DAA

19:49

Longest Common Subsequence (LCS) using Dynamic Programming with Example (Multiple Solutions) || DAA

26:43

Longest Common Subsequence (LCS) using Dynamic Programming with Example (Single Solution) || DAA

26:05

Traveling Salesman Problem using Dynamic Programming with Example (Directed Graph) || DAA

41:11

Traveling Salesman Problem using Dynamic Programming with Example (Undirected Graph) || DAA

11:17

EXAMPLE FOR 0/1 KNAPSACK PROBLEM || 0/1 KANPSACK || DAA

33:00

0/1 KNAPSACK PROBLEM USING DYNAMIC PROGRAMMING || KNAPSACK PROBLEM || DAA

16:26

INTRODUCTION TO DYNAMIC PROGRAMMING WITH EXAMPLE|| APPLICATIONS ||DYNAMIC PROGRAMMING STRATEGY ||DAA

21:37

EXAMPLE FOR DIJKSTRA ALGORITHM || FINDING SINGLE SOURCE SHORTEST PATH || GREEDY METHOD || DAA

24:12

DIJKSTRA ALGORITHM || FINDING SINGLE SOURCE SHORTEST PATH || GREEDY METHOD || DAA

11:06

KRUSKAL'S ALGORITHM || FINDING MINIMUM COST SPANNING TREE || GREEDY METHOD || DAA

39:21

PRIM'S ALGORITHM || FINDING MINIMUM COST SPANNING TREE || GREEDY METHOD || DAA

20:18

JOB SEQUENCING WITH DEADLINES USING GREEDY METHOD || EXAMPLE, ALGORITHM & TIME COMPLEXITY || DAA

16:17

INTRODUCTION TO GREEDY METHOD WITH EXAMPLES || APPLICATIONS || GREEDY STRATEGY || DAA

40:30

QUICK SORT USING DIVIDE AND CONQUER WITH EXAMPLE AND TIME COMPLEXITY || DAA

29:05

MERGE SORT USING DIVIDE AND CONQUER WITH EXAMPLE AND TIME COMPLEXITY || DAA

23:28

BINARY SEARCH USING DIVIDE AND CONQUER WITH EXAMPLE AND TIME COMPLEXITY || DAA

39:54

FINDING MINIMUM AND MAXIMUM ELEMENT USING DIVIDE AND CONQUER WITH EXAMPLE AND TIME COMPLEXITY || DAA

13:21

DIVIDE AND CONQUER ALGORITHM || DIVIDE & CONQUER STRATEGY || INTRODUCTION TO DIVIDE & CONQUER || DAA

19:10

AMORTIZED ANALYSIS WITH EXAMPLE || AMORTIZED TIME COMPLEXITY || DAA

18:56

HOW TO CALCULATE TIME COMPLEXITY WITH EXAMPLES (Part-2) || FINDING TIME COMPLEXITY || DAA

24:30

HOW TO CALCULATE TIME COMPLEXITY WITH EXAMPLES (Part-1) || FINDING TIME COMPLEXITY || DAA

08:19

ORDER OF GROWTH RATE IN ALGORITHM ANALYSIS (Smallest to Largest) || PERFORMANCE ANALYSIS || DAA

09:32

ASYMPTOTIC NOTATIONS IN ALGORITHM ANALYSIS || BIG-O, OMEGA & THETA NOTATIONS ||BEST, WORST & AVERAGE

21:09

TYPES OF TIME COMPLEXITIES || DAA

11:24

INTRODUCTION TO ALGORITHMS || DESIGN AND ANALYSIS OF ALGORITHMS || DAA

06:25

NOVEMBER 2023 COMMENTS OF OUR CHANNEL || sundeepsaradhi

18:49

27 - HIERARCHICAL ROUTING ALGORITHM - COMPUTER NETWORKS

19:13

26 - LINK STATE ROUTING ALGORITHM - COMPUTER NETWORKS

28:32

25 - DISTANCE VECTOR ROUTING ALGORITHM - COMPUTER NETWORKS

08:25

October 2023 Comments of Our YouTube Channel

13:58

DATA FRAME OPERATIONS (rbind( ),cbind( ),length( ), etc.) IN R-PROGRAMMING || DATA STRUCTURES IN R

12:37

DATA FRAME (Creation & Accessing Elements) IN R - PROGRAMMING || DATA STRUCTURES IN R

11:17

ARRAY OPERATIONS (apply( ), dim( ) length( ), etc.) IN R-PROGRAMMING || DATA STRUCTURES IN R

14:58

ARRAY (Creation & Accessing Elements) IN R - PROGRAMMING || - SINGLE & MULTI-DIMENSIONAL ARRAY IN R

19:55

MATRIX OPERATIONS (Manipulations, Combining, Length, etc.) IN R-PROGRAMMING|| DATA STRUCTURES IN R

14:14

MATRIX (Creation & Accessing Elements) IN R - PROGRAMMING || DATA STRUCTURES IN R

09:22

LIST OPERATIONS (Manipulations, Merging etc.) IN R-PROGRAMMING|| DATA STRUCTURES IN R-PROGRAMMING

14:13

LIST & NESTED LIST (Creation & Accessing Elements) IN R - PROGRAMMING || DATA STRUCTURES IN R

13:40

VECTOR OPERATIONS (Arithmetic, sort etc. ) IN R - PROGRAMMING|| DATA STRUCTURES IN R - PROGRAMMING

16:20

ATOMIC VECTORS (Types, Creation & Accessing) IN R - PROGRAMMING|| DATA STRUCTURES IN R - PROGRAMMING

09:30

STATISTICAL FUNCTIONS(BUILT-IN FUNCTIONS) IN R - PROGRAMMING|| BUILT-IN FUNCTIONS IN R - PROGRAMMING

20:40

STRING FUNCTIONS (BUILT-IN FUNCTIONS) IN R - PROGRAMMING || BUILT-IN FUNCTIONS IN R - PROGRAMMING

15:37

MATH FUNCTIONS (BUILT-IN FUNCTIONS) IN R - PROGRAMMING || BUILT-IN FUNCTIONS IN R - PROGRAMMING

15:52

ARGUMENTS IN FUNCTIONS IN R - PROGRAMMING || R - PROGRAMMING || DEFAULT VALUES || R - LANGUAGE

10:44

WORKING OF USER DEFINED FUNCTIONS IN R - PROGRAMMING || FUNCTION DEFINITION & FUNCTION CALL IN R