01:06:59

COMPUTER KEYBOARD SHORTCUTS || CTRL, SHIFT, RUN COMMAND SHORTCUTS || SHORTKEYS || WINDOWS OS

12:10

How to Build JAVA Application from GITHUB in JENKINS || DevOps Tools ||Run Java Program from Jenkins

16:45

PROGRAM CONTROL INSTRUCTIONS IN COMPUTER ORGANIZATION || COMPARE, BRANCHING, INTERRUPT, SUBROUTINE

18:20

DATA MANIPULATION INSTRUCTIONS IN COMPUTER ORGANIZATION || ARITHMETIC, LOGICAL & SHIFT INSTRUCTIONS

14:46

CISC vs RISC || Differences Between CISC & RISC || Computer Organization || COA

27:29

ADDRESSING MODES IN COMPUTER ORGANIZATION || ADDRESSING MODES || COA || COMPUTER ARCHITECTURE

11:37

Data Science Course | 360DigiTMG Leading Training Institute with Placement Assistance |Scholarships

16:47

ADDRESS SEQUENCING || MICRO PROGRAMMED SEQUENCER || MICRO PROGRAMMED CONTROL UNIT || COA

09:10

MICRO-PROGRAMMED CONTROL UNIT || CONTROL UNIT || COMPUTER ORGANIZATION || COA

11:57

WHAT IS ACCUMULATOR ? || DESIGN LOGIC OF ACCUMULATOR || ACCUMULATOR REGISTER ||COMPUTER ORGANIZATION

16:10

INTERRUPT CYCLE IN COMPUTER ORGANIZATION || COMPUTER ARCHITECTURE || COA

18:56

INSTRUCTION CYCLE IN COMPUTER ORGANIZATION || COMPUTER ARCHITECTURE || COA

11:06

How to download and install JENKINS in Linux Environment || Jenkins in Ubuntu || DevOps Tools

07:33:42

Learn R Programming in 7 Hours || R Programming || Statistical Programming using R

28:38

0/1 KNAPSACK PROBLEM USING FIFO BRANCH AND BOUND WITH EXAMPLE || BRANCH AND BOUND || DAA

22:58

0/1 KNAPSACK PROBLEM USING LEAST COST BRANCH AND BOUND WITH EXAMPLE || BRANCH AND BOUND || DAA

24:31

How to configure GIT & GitHub || Understanding of Git Commands

06:16

How to install JAVA (jdk & jre) in Linux Environment || Java in Ubuntu || JDK & JRE in Linux

14:11

Top 10 Best TEXT EDITORS in Linux Environment || Ubuntu Environment ||

07:34

Is GIT & GITHUB both are same? || GIT vs GITHUB || Differences between Git and GitHub

27:38

TRAVELING SALESMAN PROBLEM USING BRANCH AND BOUND || LEAST COST BRANCH AND BOUND || DAA

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