Home / Courses / Engineering

Data Structure And Algorithm @ 45 Days

Data Structure And Algorithm(DSA) Bachelor of Engineering(BE) videos According to syllabus of Institute of Engineering(IoE), Tribhuvan University (TU)

Intermediate
5.0 (1 reviews)
250+ Students Enrolled Nepali Updated Oct 2024

What you'll learn

After the completion this course, students will get the complete knowledge of Data Structure and Algorithm.
Course Curriculum 13 Sections • 143 Lectures
Free Preview Available: Watch "0. How to Purchase Course from MeroSchool.mp4" before enrolling.
0. How to Purchase Course from MeroSchool.mp4 Free Preview
00:03:30
1. Marks Distribution.mp4 Free Preview
00:04:44
1. Introduction.mp4 Free Preview
00:11:49
2. Data Structure Operations.mp4 Free Preview
00:04:56
3. Algorithm and Application of DSA.mp4
00:06:38
4. Abstract Data Type (ADT).mp4
00:14:50
1. Introduction to Stack.mp4
00:06:55
2. Static Implementation of Stack.mp4
00:10:59
3. Conversion of Marhematical Expression Using Stack.mp4
00:10:23
4. Infix to Postfix Conversion Part - 1.mp4
00:07:51
5. Infix to Postfix Conversion - Part 2.mp4
00:07:49
6. Infix to Postfix Conversion - Part 3.mp4
00:05:35
7. Infix to Prefix Conversion.mp4
00:09:26
8. Evaluation of Postfix Expression.mp4
00:12:30
9. Intro to Queue.mp4
00:07:02
10. Linear Queue.mp4
00:13:32
11. Circular Queue.mp4
00:12:34
12. Priority Queue.mp4
00:05:54
1. Introduction.mp4
00:05:59
2. Static Implementation of List.mp4
00:12:03
3. Insertion on a List.mp4
00:07:28
4. Deletion from array list.mp4
00:09:31
5. Concatenation of two List.mp4
00:03:52
6. Queue as a List.mp4
00:15:34
1. Introduction to Linked List.mp4
00:08:35
2. Types of Linked List.mp4
00:07:35
3. Singly Linked List - Intro.mp4
00:10:17
4. Insertion in Singly Linked List.mp4
00:12:17
5. Deletion in Singly Linked List.mp4
00:09:15
6. Singly Circular Linked List.mp4
00:13:30
7. Doubly Linked List.mp4
00:05:41
8. Insertion in DLL.mp4
00:07:51
9. Deletion in DLL.mp4
00:09:11
10. Doubly Circular Linked List.mp4
00:14:36
11. Linked Stack.mp4
00:09:50
12. Linked Queue.mp4
00:08:57
13. Addition of Polynomial - Part 1.mp4
00:04:06
14. Addition of Polynomial - Part 2.mp4
00:10:37
1. Introduction to Recursion.mp4
00:12:56
2. Types of Recursion.mp4
00:07:52
3. Fibonacci Sequence.mp4
00:05:18
4. Box Trace and Use of Stack in Recursion.mp4
00:10:11
5. Tower of Hanoi.mp4
00:14:09
1. Introduction to Tree.mp4
00:10:52
2. Binary Tree.mp4
00:10:26
3. Array and Linked List Implementation.mp4
00:08:56
4. Tree Traversal - Part 1.mp4
00:11:04
5. Binary Tree from Preorder and Inorder Traversal.mp4
00:07:42
6. Expression Tree.mp4
00:08:49
7. Expression tree from Postfix Expression.mp4
00:06:33
8. BInary Search Tree (BST).mp4
00:07:52
9. Insertion and Deletion in BST.mp4
00:10:55
10. AVL Tree.mp4
00:13:30
11. Construction of AVL Tree- Example 1.mp4
00:14:46
12. Construction of AVL Tree- Example 2.mp4
00:12:30
13. HUffman Tree.mp4
00:10:44
14. B-tree.mp4
00:13:57
15. Construction of B-tree.mp4
00:09:08
16. Red-Black Tree.mp4
00:08:02
1. Introduction to Sorting.mp4
00:07:26
2. Bubble Sort.mp4
00:11:05
3. Selection Sort.mp4
00:08:10
4. Insertion Sort.mp4
00:09:15
5. Quick Sort.mp4
00:15:32
6. Shell Sort.mp4
00:11:12
7. Merge Sort.mp4
00:12:06
8. Radix Sort.mp4
00:11:12
9. Heap Sort - Part 1.mp4
00:09:25
10. Heap Sort - Part 2.mp4
00:25:38
11. Efficiency of Sorting Algorithm.mp4
00:05:02
1. Searching.mp4
00:10:43
2. Binary Search and Tree Search.mp4
00:18:48
3. Hashing.mp4
00:10:42
4. Collision and Collision Resolving.mp4
00:09:53
5. Collision and Open Addressing.mp4
00:13:18
6. Quadratic Probing.mp4
00:10:22
7. Double Hashing.mp4
00:11:05
1. Intro to Growth Function.mp4
00:06:56
2. Big Oh Notation (O).mp4
00:11:57
3. Omega and Theta Notation.mp4
00:13:59
1. Introduction to Graph.mp4
00:14:06
2. Graph Representation.mp4
00:11:52
3. Graph Traversal.mp4
00:22:10
4. Minimum Spanning Tree.mp4
00:09:08
5. Prim's Algorithm.mp4
00:09:48
6. Kruskal's Algorithm.mp4
00:08:36
7. Round Robin Algorithm.mp4
00:08:54
8. Warashall's Algorithm-Part 1.mp4
00:23:23
9. Dijkstra's Algorithm.mp4
00:16:14
2075 Baisakh|Q.no.1.mp4
00:10:41
2075 Baisakh|Q.no.2.mp4
00:05:40
2075 Baisakh|Q.no.3.mp4
00:05:47
2075 Baisakh|Q.no.4.mp4
00:08:00
2075 Baisakh|Q.no.5.mp4
00:00:50
2075 Baisakh|Q.no.6.mp4
00:09:06
2075 Baisakh|Q.no.7.mp4
00:10:01
2075 Baisakh|Q.no.8.mp4
00:07:34
2075 Baisakh|Q.no.9.mp4
00:00:54
2075 Baisakh|Q.no.10.mp4
00:14:15
2076 Bhadra|Q.no.1.mp4
00:04:30
2076 Bhadra|Q.no.2.mp4
00:08:15
2076 Bhadra|Q.no.3.mp4
00:03:37
2076 Bhadra|Q.no.4.mp4
00:15:59
2076 Bhadra|Q.no.5.mp4
00:01:13
2076 Bhadra|Q.no.6.mp4
00:08:52
2076 Bhadra|Q.no.7.mp4
00:10:19
2076 Bhadra|Q.no.8.mp4
00:06:55
2076 Bhadra|Q.no.9.mp4
00:06:29
2076 Bhadra|Q.no.10.mp4
00:16:05
2076 Bhadra|Q.no.11.mp4
00:12:41
2077 Chaitra|Q.no.1.mp4
00:09:15
2077 Chaitra|Q.no.2.mp4
00:07:13
2077 Chaitra|Q.no.3.mp4
00:12:56
2077 Chaitra|Q.no.4.mp4
00:00:40
2077 Chaitra|Q.no.5.mp4
00:03:18
2077 Chaitra|Q.no.6.mp4
00:08:51
2077 Chaitra|Q.no.7.mp4
00:07:27
2077 Chaitra|Q.no.8.mp4
00:12:53
2077 Chaitra|Q.no.9.mp4
00:04:35
2077 Chaitra|Q.no.10.mp4
00:12:19
2077 Chaitra|Q.no.11.mp4
00:06:16
2078 Chaitra|Q.no.1.mp4
00:06:47
2078 Chaitra|Q.no.2.mp4
00:08:23
2078 Chaitra|Q.no.3.mp4
00:07:28
2078 Chaitra|Q.no.4.mp4
00:15:00
2078 Chaitra|Q.no.5.mp4
00:07:49
2078 Chaitra|Q.no.6.mp4
00:20:34
2078 Chaitra|Q.no.7.mp4
00:04:46
2078 Chaitra|Q.no.8.mp4
00:06:56
2078 Chaitra|Q.no.9.mp4
00:08:03
2078 Chaitra|Q.no.10.mp4
00:05:05
2078 Chaitra|Q.no.11.mp4
00:06:48
2079 Jestha|Q.no.1.mp4
00:09:44
2079 Jestha|Q.no.2.mp4
00:12:59
2079 Jestha|Q.no.3.mp4
00:07:25
2079 Jestha|Q.no.4.mp4
00:06:37
2079 Jestha|Q.no.5.mp4
00:10:43
2079 Jestha|Q.no.6.mp4
00:10:36
2079 Jestha|Q.no.7.mp4
00:06:21
2079 Jestha|Q.no.8.mp4
00:09:22
2079 Jestha|Q.no.9.mp4
00:09:46
2079 Jestha|Q.no.10.mp4
00:04:40
2079 Jestha|Q.no.11.mp4
00:13:06

Requirements

  • Students are required to have a basic knowledge of Programming Language like C, C++, basics of Mathematics (Discrete Mathematics), organizing and problem solving ability.

Course Description

The videos herein are strictly based on syllabus of Institute of Engineering Tribhuvan University, Nepal promoting "e-Learning in Nepal" and are made with intention to provide guidance to the "Bachelor in Engineering(BE) appearing students", for securing good results. The course tries to cover all the lessons along with most frequently asked questions with solutions. We strongly believe that, viewers will be benefited from these videos and the thirst of curiosity of viewers will be quenched! Feedbacks and suggestion to improve are always welcome and highly appreciated!

Instructor

M
Mero School Academic Team

Senior Academic Instructor • Mero School E-Learning