EID Greetings 2025

EID Greetings 2024

EID Greetings 2023

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

Database Management System | Promo | DBMS | @tutorzeeshanonline

Database Management System (DBMS) Course | @tutorzeeshanonline

Static Variable in C | Programming Fundamental |

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

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

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

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

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

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

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

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

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

Heap Data Structure | DS&A LECTURE – 53 |

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

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

AVL Tree | DS&A LECTURE – 50 |

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

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

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

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

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

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

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

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

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

Constructing Binary Tree | DS&A LECTURE – 40 |

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

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

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

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

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

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

EID 2022 Greetings | EID Mubarak | @tutorzeeshanonline

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

Indexing and Hashing | DS&A LECTURE – 32 |

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

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

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

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

Channel PROMO @tutorzeeshanonline

Rechecking Papers in Universities | Marks Verifying | Semester Rules |

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

Teacher Evaluation by Students at End Semester | QEC |

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

Special Final Exam in University | Semester Rules |@tutorzeeshanonline

Attendance Policy in Universities | Attendance Rules |@tutorzeeshanonline

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

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

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

Summer Semester in Universities | Summer Semester Rules |

Cheating Cases during Exam | Unfair Mean Cases |

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

University Migration Rules | Credits Transfer | @tutorzeeshanonline

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

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

Doubly Linked List | DS&A LECTURE – 21 |