ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

75 results

EASYPREP SEMESTER
šŸ”„Programming for Problem Solving | B.Tech 1st Semester | Introduction | Lecture 02 | BEU PATNA #beu

EASYPREP App Link: https://clpmark.page.link/Yysp Welcome to the YouTube Channel of EASYPREP Join Our Telegram GroupĀ ...

Upcoming
šŸ”„Programming for Problem Solving | B.Tech 1st Semester | Introduction | Lecture 02 | BEU PATNA #beu

0 views

0

EASYPREP SEMESTER
šŸ”„Programming for Problem Solving | B.Tech 1st Semester | Introduction | Lecture 01 | BEU PATNA #beu

EASYPREP App Link: https://clpmark.page.link/Yysp Welcome to the YouTube Channel of EASYPREP Join Our Telegram GroupĀ ...

39:30
šŸ”„Programming for Problem Solving | B.Tech 1st Semester | Introduction | Lecture 01 | BEU PATNA #beu

71 views

Streamed 21 hours ago

Root User
(Part-1)C Programming Practice Set | Level 1 (Beginner Friendly)

Welcome to RootUser Theory aur coding practice complete ho chuki hai. Ab time hai apni learning ko test karne ka!

6:23
(Part-1)C Programming Practice Set | Level 1 (Beginner Friendly)

13 views

6 days ago

Root User
(Part-2)C Programming Practice Set | Level 1 (Beginner Friendly)

Welcome to RootUser Theory aur coding practice complete ho chuki hai. Ab time hai apni learning ko test karne ka!

6:36
(Part-2)C Programming Practice Set | Level 1 (Beginner Friendly)

5 views

6 days ago

AKGEC Digital School
CONDITION BRANCHING | PROGRAMMING FOR PROBLEM SOLVING | LECTURE 01 BY MR. MAYANK TRIVEDI | AKGEC

AKGEC #AKGECGhaziabad #BestEngineeringCollege #BTech #MTech #MBA. Dear All, Please find the links to all five units forĀ ...

15:12
CONDITION BRANCHING | PROGRAMMING FOR PROBLEM SOLVING | LECTURE 01 BY MR. MAYANK TRIVEDI | AKGEC

1 view

1 day ago

Set time - Bound goal
Every B.Tech Student Must Learn This Skill! | C Programming Bootcamp for 1st Year Students

C Programming Bootcamp for B.Tech 1st Year Students | Learn Coding from Scratch Are you joining engineering this year?

35:23
Every B.Tech Student Must Learn This Skill! | C Programming Bootcamp for 1st Year Students

5,354 views

6 days ago

ETM Academy
Find the maximum between two numbers | If Else Part 1 | Javascript | Abhishekh Dubey

JavaScript If Else Practice Questions – Part 1 | Beginner to Advanced Logic Building Welcome to Part 1 of the JavaScript If ElseĀ ...

9:21
Find the maximum between two numbers | If Else Part 1 | Javascript | Abhishekh Dubey

39 views

3 days ago

Hemtosh
2.7 Fractional vs 0/1 Knapsack | Why Greedy Fails for 0/1 Knapsack with Examples | DAA Unit 2

DESIGN AND ANALYSIS OF ALGORITHMS (DAA) – UNIT 2 | Greedy Algorithms & Backtracking | Complete CS8451 CourseĀ ...

6:19
2.7 Fractional vs 0/1 Knapsack | Why Greedy Fails for 0/1 Knapsack with Examples | DAA Unit 2

0 views

6 days ago

Hemtosh
2.4 Knapsack Problem Introduction | Fractional vs 0/1 Knapsack Concepts Explained | DAA Unit 2

DESIGN AND ANALYSIS OF ALGORITHMS (DAA) – UNIT 2 | Greedy Algorithms & Backtracking | Complete CS8451 CourseĀ ...

3:23
2.4 Knapsack Problem Introduction | Fractional vs 0/1 Knapsack Concepts Explained | DAA Unit 2

0 views

6 days ago

ClaSynq
Foundation batch | DSA Demo Class 1| Powered By Clasynq

šŸš€ DSA Foundation Batch | FREE Demo Class | Start Your Coding Journey with ClaSynq Are you ready to build a strong foundation ...

55:52
Foundation batch | DSA Demo Class 1| Powered By Clasynq

62 views

Streamed 5 days ago

Mirai School of Technology
From Beginner to Building Full-Stack Projects | First Year Engineering Journey

Click here to apply for Mirai MAINS 2026- https://bit.ly/3LoIV37 About The Video From building clone websites to solving codingĀ ...

4:33
From Beginner to Building Full-Stack Projects | First Year Engineering Journey

453 views

5 days ago

Hemtosh
2.28 Backtracking Summary | Greedy vs Backtracking, DAA Unit 2 Revision & Important Exam Questions |

DESIGN AND ANALYSIS OF ALGORITHMS (DAA) – UNIT 2 | Greedy Algorithms & Backtracking | Complete CS8451 CourseĀ ...

7:11
2.28 Backtracking Summary | Greedy vs Backtracking, DAA Unit 2 Revision & Important Exam Questions |

2 views

6 days ago

Hemtosh
2.16 Prim's Algorithm | Minimum Spanning Tree Construction, Greedy Approach & Example | DAA Unit 2

DESIGN AND ANALYSIS OF ALGORITHMS (DAA) – UNIT 2 | Greedy Algorithms & Backtracking | Complete CS8451 CourseĀ ...

8:33
2.16 Prim's Algorithm | Minimum Spanning Tree Construction, Greedy Approach & Example | DAA Unit 2

0 views

6 days ago

Hemtosh
2.9 Huffman Coding Algorithm | Priority Queue, Tree Construction & Encoding Process | DAA Unit 2

DESIGN AND ANALYSIS OF ALGORITHMS (DAA) – UNIT 2 | Greedy Algorithms & Backtracking | Complete CS8451 CourseĀ ...

4:53
2.9 Huffman Coding Algorithm | Priority Queue, Tree Construction & Encoding Process | DAA Unit 2

0 views

6 days ago

engineering4youguys
Basic Computer Engineering (BCE) | RGPV Most Important Questions| Back Paper | 2026 #BTech 1st year

Basic Computer Engineering (BCE) | RGPV B.Tech | Most Important Questions | Unit Wise | PYQs | Notes | Engineering For YouĀ ...

15:56
Basic Computer Engineering (BCE) | RGPV Most Important Questions| Back Paper | 2026 #BTech 1st year

11 views

4 days ago

Hemtosh
2.23 Backtracking Intro | General Method, State Space Tree & Greedy vs Backtracking | DAA Unit 2

DESIGN AND ANALYSIS OF ALGORITHMS (DAA) – UNIT 2 | Greedy Algorithms & Backtracking | Complete CS8451 CourseĀ ...

7:16
2.23 Backtracking Intro | General Method, State Space Tree & Greedy vs Backtracking | DAA Unit 2

0 views

6 days ago

Hemtosh
2.22 Dijkstra's Algorithm Analysis | Time Complexity, Limitations & Applications | DAA Unit 2

DESIGN AND ANALYSIS OF ALGORITHMS (DAA) – UNIT 2 | Greedy Algorithms & Backtracking | Complete CS8451 CourseĀ ...

7:07
2.22 Dijkstra's Algorithm Analysis | Time Complexity, Limitations & Applications | DAA Unit 2

0 views

6 days ago

Hemtosh
2.24 N-Queen (8 Queen) Problem | Problem Statement, Constraints & State Space Tree | DAA Unit 2

DESIGN AND ANALYSIS OF ALGORITHMS (DAA) – UNIT 2 | Greedy Algorithms & Backtracking | Complete CS8451 CourseĀ ...

7:20
2.24 N-Queen (8 Queen) Problem | Problem Statement, Constraints & State Space Tree | DAA Unit 2

0 views

6 days ago

Hemtosh
2.5 Fractional Knapsack Algorithm | Greedy Approach, Profit Ratio, Algorithm & Example | DAA Unit 2

DESIGN AND ANALYSIS OF ALGORITHMS (DAA) – UNIT 2 | Greedy Algorithms & Backtracking | Complete CS8451 CourseĀ ...

3:26
2.5 Fractional Knapsack Algorithm | Greedy Approach, Profit Ratio, Algorithm & Example | DAA Unit 2

0 views

6 days ago

Hemtosh
2.3 Greedy Algorithm Analysis | Time Complexity, Space Complexity & Knapsack Basics | DAA Unit 2

DESIGN AND ANALYSIS OF ALGORITHMS (DAA) – UNIT 2 | Greedy Algorithms & Backtracking | Complete CS8451 CourseĀ ...

5:44
2.3 Greedy Algorithm Analysis | Time Complexity, Space Complexity & Knapsack Basics | DAA Unit 2

2 views

6 days ago