MYWOT
Child safety
Confidence
Trustworthiness
Confidence
MALICIOUS CONTENT INDICATORS
Marufnotes.com most likely does not offer any malicious content.
Secure connection support
HTTPS
Marufnotes.com provides SSL-encrypted connection.
ADULT CONTENT INDICATORS
Marufnotes.com most likely does not offer any adult content.
Popular pages
-
Maruf Notes
Maruf Notes We have to find a sub-sequence R1,R2...Rn R1<R2<...<Rn The solution First we create a table by scanning the number from start to end. For each number we find number with largest seque...
-
Maruf Notes: 2014
Quick sort is a divide and conquer inplace sorting algorithm. This is a preferable sorting algorithm for many practical applications because of its average case performnace is very good- O(n log n). Q...
-
Maruf Notes: CS131: Quicksort and quickselect
Quick sort is a divide and conquer inplace sorting algorithm. This is a preferable sorting algorithm for many practical applications b...
-
Maruf Notes: CS131: Tree
A tree is a collection of nodes and edges. Edges connects the edges together. In a tree there is one and only one path between any tw...
-
Maruf Notes: CS131: Binary Search Tree
A binary search tree is a binary tree such that for any node n, if a node x is in n's left subtree, x's key is smaller than n's key n...
-
Maruf Notes: CS131: Queue
Que is a linear list data structure. The insert and remove operations are performed at the opposite ends of the list which are called...