00:32

EID Greetings 2024

00:38

EID Greetings 2023

08:22

Course Outline of Database Management System | DBMS LECTURE – 1.0 |

03:08

Database Management System | Promo | DBMS | @tutorzeeshanonline

00:11

Database Management System (DBMS) Course | @tutorzeeshanonline

11:56

Static Variable in C | Programming Fundamental |

15:46

Bellman Ford Algorithm | Find Shortest Path | DS&A LECTURE – 62 |

18:25

Dijkstra Algorithm | Find Shortest Path | DS&A LECTURE – 61 |

14:59

Kruskal Algorithm | MST | DS&A LECTURE – 60 |

15:01

Prim Algorithm | MST | DS&A LECTURE – 59 |

16:11

Minimum Spanning Tree | Greedy Approach | DS&A LECTURE – 58 |

14:04

Breadth First Search on Graph | DS&A LECTURE – 57 |

13:45

Depth First Search on Graph | DS&A LECTURE – 56 |

22:33

Introduction to Graph Data Structure | DS&A LECTURE – 55 |

22:50

Heap Sort Algorithm with Code | DS&A LECTURE – 54 |

22:31

Heap Data Structure | DS&A LECTURE – 53 |

18:01

B and B+ Trees | m-way trees | DS&A LECTURE – 52 |

12:12

Red-Black Tree | DS&A LECTURE – 51 |

08:21

AVL Tree | DS&A LECTURE – 50 |

16:36

Balanced Binary Tree and How to make Balanced Tree | DS&A LECTURE – 49 |

18:47

Binary Search Tree and Operations on BST | DS&A LECTURE – 48 |

10:30

How to Construct Binary Tree from In-Order and Post-Order Traversals | DS&A LECTURE – 47 |

08:59

How to Construct Binary Tree from In-Order and Pre-Order Traversals | DS&A LECTURE – 46 |

17:56

Post Order Tree Traversing with Algorithm | DS&A LECTURE – 45 |

17:24

Pre Order Tree Traversing with Algorithm | DS&A LECTURE – 44 |

17:44

In Order Tree Traversing with Algorithm | DS&A LECTURE – 43 |

19:28

Level Order Tree Traversing with Algorithm | Types of Traversing | DS&A LECTURE – 42 |

17:46

How to Construct Complete Binary Tree from Given Array | DS&A LECTURE – 41 |

14:19

Constructing Binary Tree | DS&A LECTURE – 40 |

20:17

Binary Tree and Types of Binary Tree | DS&A LECTURE – 39 |

17:55

Tree Data Structure | Types of Tree | Non-Linear | DS&A LECTURE – 38 |

27:44

Chaining and Open Addressing Techniques | DS&A LECTURE – 36 |

20:02

Shell Sort Algorithm with Code | DS&A LECTURE – 37 |

26:37

Bucket Sort Algorithm with Code | Linear Sort | DS&A LECTURE – 35 |

31:28

Radix Sort Algorithm with Code | Linear Sort | DS&A LECTURE – 34 |

00:42

EID 2022 Greetings | EID Mubarak | @tutorzeeshanonline

23:06

Counting Sort Algorithm with Code | Linear Sort | DS&A LECTURE – 33 |

14:34

Indexing and Hashing | DS&A LECTURE – 32 |

17:36

Quick Sort Algorithm with Code | DS&A LECTURE – 31 |

21:59

Merge Sort Algorithm with Code | DS&A LECTURE – 30 |

14:19

Binary Search Algorithm through Recursion | DS&A LECTURE – 29 |

11:18

Recursive Approach | Factorial Algorithm through Recursion | DS&A LECTURE – 28 |

00:13

Channel PROMO @tutorzeeshanonline

06:41

Rechecking Papers in Universities | Marks Verifying | Semester Rules |

14:59

Insertion Sort Algorithm | Sorting Array | DS&A LECTURE – 27 |

04:56

Teacher Evaluation by Students at End Semester | QEC |

14:24

Operations on Circular Doubly Linked List | Algorithms and Implementation | DS&A LECTURE – 26 |

04:54

Special Final Exam in University | Semester Rules |@tutorzeeshanonline

06:46

Attendance Policy in Universities | Attendance Rules |@tutorzeeshanonline

17:12

Circular Doubly Linked List Implementation in C++ | @tutorzeeshanonline

15:16

Circular Singly Linked List | Algorithm and Implementation | DS&A LECTURE – 25 |

19:55

Circular Singly Linked List Implementation in C Language | @Tutor Zeeshan Online

04:45

Summer Semester in Universities | Summer Semester Rules |

06:27

Cheating Cases during Exam | Unfair Mean Cases |

12:02

Remove Last Node from Doubly Linked List | DS&A LECTURE – 24 |

06:13

University Migration Rules | Credits Transfer | @tutorzeeshanonline

12:32

Traversing on Doubly Linked List | DS&A LECTURE – 23 |

18:48

Add new Node in Doubly Linked List at End | without loop | DS&A LECTURE – 22 |

11:17

Doubly Linked List | DS&A LECTURE – 21 |

20:59

Sort Operation on Singly Linked List | Selection Sort | DS&A LECTURE – 20 |