compuTERMero

compuTERMero is a candlelights entertainment associate educational platform particularly fruitful for the students of Computer Science.
For the free notes, do visit the blog: computermero.blogspot.com

Asymptotic Notation || DAA || Easily explained with example || Nepali
Asymptotic Notation || DAA || Easily explained with example || Nepali
Lecture 7 || Octal to Hexadecimal || Hexadecimal to Octal || Nepali
Lecture 7 || Octal to Hexadecimal || Hexadecimal to Octal || Nepali
Lecture 6 || Decimal to Hexadecimal || Hexadecimal to Decimal || Nepali
Lecture 6 || Decimal to Hexadecimal || Hexadecimal to Decimal || Nepali
Lecture 5 || Decimal to Octal || Octal to Decimal || Nepali
Lecture 5 || Decimal to Octal || Octal to Decimal || Nepali
Lecture 4 || Binary to Hexadecimal || Hexadecimal to Binary || Nepali
Lecture 4 || Binary to Hexadecimal || Hexadecimal to Binary || Nepali
Lecture 3 || Binary Number System to Octal Number System || Nepali
Lecture 3 || Binary Number System to Octal Number System || Nepali
Lecture 2 || Decimal Number System to Binary Number System Conversion || Nepali
Lecture 2 || Decimal Number System to Binary Number System Conversion || Nepali
Lecture 1 || Introduction to Number System || Nepali || computermero
Lecture 1 || Introduction to Number System || Nepali || computermero
Substitution Method for solving Recurrences || Easily explained with example || Nepali
Substitution Method for solving Recurrences || Easily explained with example || Nepali
Recursive Tree Method to solve Recurrence Relations || Easily Explained || Nepali
Recursive Tree Method to solve Recurrence Relations || Easily Explained || Nepali
Master Method for solving Recurrences || Explained easily with Examples || Nepali
Master Method for solving Recurrences || Explained easily with Examples || Nepali
Binary Search Algorithm || Explained easily with example || Nepali
Binary Search Algorithm || Explained easily with example || Nepali
Min Max Algorithm || Easily Explained with example || Nepali
Min Max Algorithm || Easily Explained with example || Nepali
Quick Sort Algorithm || Explained easily with example || Nepali
Quick Sort Algorithm || Explained easily with example || Nepali
Strassen's Matrix Multiplication || Easily Explained with example || Nepali
Strassen's Matrix Multiplication || Easily Explained with example || Nepali
Selection Sort || Explained with example || Nepali
Selection Sort || Explained with example || Nepali
Bubble Sort Algorithm || Easily explained with example || Nepali
Bubble Sort Algorithm || Easily explained with example || Nepali
Merge Sort || Explained with example in Nepali || Divide and Conquer Algorithm
Merge Sort || Explained with example in Nepali || Divide and Conquer Algorithm
Fractional Knapsack Problem || Greedy Algorithm || Explained with example in Nepali
Fractional Knapsack Problem || Greedy Algorithm || Explained with example in Nepali
Activity Selection Problem || Greedy Algorithm || Explained with example in Nepali
Activity Selection Problem || Greedy Algorithm || Explained with example in Nepali
Huffman Code || Prefix Code || Explained with example || Nepali
Huffman Code || Prefix Code || Explained with example || Nepali
Job Sequencing Problem Algorithm || Explained in Nepali || compuTERMero
Job Sequencing Problem Algorithm || Explained in Nepali || compuTERMero
0/1 Knapsack Problem using Dynamic Programming || Explained in Nepali
0/1 Knapsack Problem using Dynamic Programming || Explained in Nepali
Fibonacci Series || Dynamic Programming || Introduction || Explained in Nepali
Fibonacci Series || Dynamic Programming || Introduction || Explained in Nepali
Matrix Chain Multiplication - Dynamic Programming || Explained in Nepali
Matrix Chain Multiplication - Dynamic Programming || Explained in Nepali
N Queens Problem using Backtracking || Explained with Example || Nepali
N Queens Problem using Backtracking || Explained with Example || Nepali
0/1 Knapsack Problem using Backtracking Approach || Explained with example || Nepali
0/1 Knapsack Problem using Backtracking Approach || Explained with example || Nepali
Subset Sum Algorithm || Sum of Subset Problem | Backtracking Method | Design & Algorithms |
Subset Sum Algorithm || Sum of Subset Problem | Backtracking Method | Design & Algorithms |
Vertex Cover Problem- Approximation Algorithm || Solved with Example || Nepali || compuTERMero
Vertex Cover Problem- Approximation Algorithm || Solved with Example || Nepali || compuTERMero
Chinese Remainder Theorem || Solved with Example || Easy Explanation || Nepali
Chinese Remainder Theorem || Solved with Example || Easy Explanation || Nepali