knowsh.com – notes, knowledge, learn, teach, tutorial, request for notes, share, lessons, chapter, science, computer,tuition, online class

Welcome to http://www.knowsh.com

We’re so thankful for your interest in sharing your knowledge among others and are excited to tell you how much support we are getting through many other sources. By seeing the enthusiasm in people about knowsh.com, we are proud to say that people are very much excited to get a platform to share their knowledge among others who are actually in requirement of it.

We have tried initiating a noble way to share what we know and to request others to share what they know. It is a mutual way to let everyone learn and let everyone teach. Each and every knowsher is responsible to take care of other knowshers and provide the help what they required.

We’d love for you to become a member of the Knowledge Sharing team and become a knowsher: stay in touch and interact with us through our Facebook, spread the word about what we do and to know what your role as an individual knowsher is. If you’d like to learn more about how you can support us or if you have any query, please send us a message. We are so grateful to have you as a knowsher and we will seek for your support in near future.

We hope you will enjoy being an active knowsher and you will help other knowshers as well. To understand the details of how, when and what, please check FAQ.

Sincerely,
Knowsh Team.

Knowsh.com

Data Compression Algorithm

http://www.knowsh.com

Data Compression Algorithm, Type of Data Compression, Lossless data compression RLE, Lempel–Ziv (LZ) Coding, Lempel-Ziv-Welsh (LZW) Coding, Graphics Interchange Format, GIF Image Coding Standard, Macromedia Flash, Vector Vs Bitmap, Macromedia Flash Version, Tools.

http://www.knowsh.com/Notes/NotesSearch/NotesDetail/150230/Data-Compression-Algorithm-Lossy-And-Lossless-Run-Length-Encoding-Lempel%E2%80%93Ziv-Coding-Lempel-Ziv-Welsh-Coding-Graphics-Interchange-Format-GIF-Image-Coding-Standard-Macromedia-Flash-Vector-Vs-Bitmap

 

Knowsh.com

Different types of Sorting

http://www.knowsh.com

Categories of Sorting, Insertion Sorting, Selection Sort, Shell Sort, Divide and Conquer, Merge Sort, Quick Sort, Heap sort, Heapify, Radix Sort, Best Case, Worst Case, Average Case of each sort with example and algorithm, Comparison of different sorting.

http://knowsh.com/Notes/NotesSearch/NotesDetail/140224/Insertion-Sorting-Selection-Sort-Shell-Sort-Divide-And-Conquer-Merge-Sort-Quick-Sort-Heap-Sort-Heapify-Radix-Sort-Comparison-Of-Different-Sorting

Knowsh.com

Write a program to Sort a stack such that the smallest items are on the top

http://www.knowsh.com

Write a program to Sort a stack such that the smallest items are on the top. You can use additional temporary stack, but you may not copy the elements into any other data structure (such as an array). The stack supports the following operations: push, pop, peek, isEmpty.

We have used two additional Stacks for that. One is forward Stack to store the items in the sorted way such that greatest item is at the top, from the given stack. Another is backward Stack to store the sorted items in such a way that lowest item is at the top, from the forward stack.

http://knowsh.com/Notes/NotesSearch/NotesDetail/140222/Program-To-Sort-A-Stack-Using-Additional-Data-Structure

Knowsh.com

Connectivity, Connected Components, Sub Graph, Tree as a Graph, Directed Graph, Representations, Directed Acyclic Graph, Indegree and Outdegree, Topological Sort

http://www.knowsh.com

Connectivity, Connected Components, Sub Graph, Tree as a Graph, Directed Graph, Representations, Directed Acyclic Graph, Indegree and Outdegree, Topological Sort.

http://knowsh.com/Notes/NotesSearch/NotesDetail/140221/-Connectivity-Connected-Components-Tree-As-A-Graph-Directed-Graph-Representations-Directed-Acyclic-Graph-Indegree-And-Outdegree-Topological-Sort